/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder-VarAbsGlobalSyntactic.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.error.function.in.sv-comp.mode false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread/queue_ok_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-9868fc6-m [2022-11-15 02:45:55,972 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-15 02:45:55,974 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-15 02:45:56,008 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-15 02:45:56,009 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-15 02:45:56,009 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-15 02:45:56,010 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-15 02:45:56,012 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-15 02:45:56,013 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-15 02:45:56,014 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-15 02:45:56,015 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-15 02:45:56,016 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-15 02:45:56,016 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-15 02:45:56,017 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-15 02:45:56,018 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-15 02:45:56,019 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-15 02:45:56,019 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-15 02:45:56,020 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-15 02:45:56,022 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-15 02:45:56,030 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-15 02:45:56,036 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-15 02:45:56,038 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-15 02:45:56,039 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-15 02:45:56,039 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-15 02:45:56,042 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-15 02:45:56,042 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-15 02:45:56,042 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-15 02:45:56,043 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-15 02:45:56,044 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-15 02:45:56,044 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-15 02:45:56,044 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-15 02:45:56,045 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-15 02:45:56,045 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-15 02:45:56,046 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-15 02:45:56,046 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-15 02:45:56,046 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-15 02:45:56,047 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-15 02:45:56,047 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-15 02:45:56,047 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-15 02:45:56,048 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-15 02:45:56,048 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-15 02:45:56,050 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder-VarAbsGlobalSyntactic.epf [2022-11-15 02:45:56,073 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-15 02:45:56,074 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-15 02:45:56,074 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-15 02:45:56,074 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-15 02:45:56,075 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-15 02:45:56,075 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-15 02:45:56,076 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-15 02:45:56,076 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-15 02:45:56,076 INFO L138 SettingsManager]: * Use SBE=true [2022-11-15 02:45:56,076 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-15 02:45:56,077 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-15 02:45:56,077 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-15 02:45:56,077 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-15 02:45:56,077 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-15 02:45:56,077 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-15 02:45:56,078 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-15 02:45:56,078 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-15 02:45:56,078 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-15 02:45:56,078 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-15 02:45:56,078 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-15 02:45:56,078 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-15 02:45:56,078 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-15 02:45:56,078 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-15 02:45:56,080 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-15 02:45:56,080 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-15 02:45:56,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-15 02:45:56,080 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-15 02:45:56,080 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-15 02:45:56,081 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-15 02:45:56,081 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-15 02:45:56,081 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-15 02:45:56,081 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-15 02:45:56,081 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-11-15 02:45:56,081 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-15 02:45:56,081 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-15 02:45:56,082 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-15 02:45:56,082 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-15 02:45:56,082 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-15 02:45:56,082 INFO L138 SettingsManager]: * Independence relation used for POR in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2022-11-15 02:45:56,296 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-15 02:45:56,313 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-15 02:45:56,315 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-15 02:45:56,316 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-15 02:45:56,317 INFO L275 PluginConnector]: CDTParser initialized [2022-11-15 02:45:56,318 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longest.i [2022-11-15 02:45:56,382 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc4c7aad1/dd91b78978a84198a42e88a422ac18d9/FLAG9e0a8780e [2022-11-15 02:45:56,826 INFO L306 CDTParser]: Found 1 translation units. [2022-11-15 02:45:56,827 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i [2022-11-15 02:45:56,843 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc4c7aad1/dd91b78978a84198a42e88a422ac18d9/FLAG9e0a8780e [2022-11-15 02:45:57,146 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc4c7aad1/dd91b78978a84198a42e88a422ac18d9 [2022-11-15 02:45:57,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-15 02:45:57,150 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-11-15 02:45:57,151 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-15 02:45:57,151 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-15 02:45:57,153 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-15 02:45:57,154 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 02:45:57" (1/1) ... [2022-11-15 02:45:57,155 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5249cd03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 02:45:57, skipping insertion in model container [2022-11-15 02:45:57,155 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 02:45:57" (1/1) ... [2022-11-15 02:45:57,160 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-15 02:45:57,227 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-15 02:45:57,714 WARN L233 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_longest.i[43280,43293] [2022-11-15 02:45:57,719 WARN L233 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_longest.i[43553,43566] [2022-11-15 02:45:57,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-15 02:45:57,733 INFO L203 MainTranslator]: Completed pre-run [2022-11-15 02:45:57,785 WARN L233 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_longest.i[43280,43293] [2022-11-15 02:45:57,788 WARN L233 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_longest.i[43553,43566] [2022-11-15 02:45:57,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-15 02:45:57,843 INFO L208 MainTranslator]: Completed translation [2022-11-15 02:45:57,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 02:45:57 WrapperNode [2022-11-15 02:45:57,843 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-15 02:45:57,844 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-15 02:45:57,844 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-15 02:45:57,844 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-15 02:45:57,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 02:45:57" (1/1) ... [2022-11-15 02:45:57,870 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 02:45:57" (1/1) ... [2022-11-15 02:45:57,901 INFO L138 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 216 [2022-11-15 02:45:57,901 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-15 02:45:57,902 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-15 02:45:57,902 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-15 02:45:57,902 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-15 02:45:57,910 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 02:45:57" (1/1) ... [2022-11-15 02:45:57,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 02:45:57" (1/1) ... [2022-11-15 02:45:57,915 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 02:45:57" (1/1) ... [2022-11-15 02:45:57,915 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 02:45:57" (1/1) ... [2022-11-15 02:45:57,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 02:45:57" (1/1) ... [2022-11-15 02:45:57,928 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 02:45:57" (1/1) ... [2022-11-15 02:45:57,930 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 02:45:57" (1/1) ... [2022-11-15 02:45:57,931 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 02:45:57" (1/1) ... [2022-11-15 02:45:57,934 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-15 02:45:57,935 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-15 02:45:57,935 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-15 02:45:57,935 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-15 02:45:57,948 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 02:45:57" (1/1) ... [2022-11-15 02:45:57,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-15 02:45:57,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 02:45:57,976 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-15 02:45:57,983 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-15 02:45:58,009 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-15 02:45:58,010 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-15 02:45:58,010 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-15 02:45:58,010 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-15 02:45:58,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-15 02:45:58,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-15 02:45:58,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-15 02:45:58,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-15 02:45:58,011 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-15 02:45:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-15 02:45:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-15 02:45:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-15 02:45:58,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-15 02:45:58,014 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-15 02:45:58,167 INFO L235 CfgBuilder]: Building ICFG [2022-11-15 02:45:58,169 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-15 02:45:58,458 INFO L276 CfgBuilder]: Performing block encoding [2022-11-15 02:45:58,472 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-15 02:45:58,472 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-15 02:45:58,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 02:45:58 BoogieIcfgContainer [2022-11-15 02:45:58,475 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-15 02:45:58,476 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-15 02:45:58,476 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-15 02:45:58,482 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-15 02:45:58,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 02:45:57" (1/3) ... [2022-11-15 02:45:58,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c03cc63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 02:45:58, skipping insertion in model container [2022-11-15 02:45:58,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 02:45:57" (2/3) ... [2022-11-15 02:45:58,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c03cc63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 02:45:58, skipping insertion in model container [2022-11-15 02:45:58,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 02:45:58" (3/3) ... [2022-11-15 02:45:58,485 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2022-11-15 02:45:58,493 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-15 02:45:58,501 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-15 02:45:58,501 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-11-15 02:45:58,502 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-15 02:45:58,597 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-15 02:45:58,653 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-15 02:45:58,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-15 02:45:58,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 02:45:58,663 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-15 02:45:58,668 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-15 02:45:58,701 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-15 02:45:58,711 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-11-15 02:45:58,715 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;@63e7ffd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 02:45:58,716 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-15 02:45:58,797 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-11-15 02:45:58,805 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-15 02:45:58,807 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (1/26) [2022-11-15 02:45:58,826 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-15 02:45:58,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-15 02:45:58,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 02:45:58,834 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-15 02:45:58,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2022-11-15 02:45:58,870 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-15 02:45:58,871 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-11-15 02:45:58,872 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;@63e7ffd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 02:45:58,872 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-15 02:45:59,123 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-11-15 02:45:59,129 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-15 02:45:59,130 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/26) [2022-11-15 02:45:59,135 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-15 02:45:59,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-15 02:45:59,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 02:45:59,139 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-15 02:45:59,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2022-11-15 02:45:59,144 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-15 02:45:59,144 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW ======== [2022-11-15 02:45:59,145 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;@63e7ffd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 02:45:59,145 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-15 02:45:59,145 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-15 02:45:59,145 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 1 remaining) [2022-11-15 02:45:59,146 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-15 02:45:59,146 INFO L307 ceAbstractionStarter]: Result for error location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW was SAFE (3/26) [2022-11-15 02:45:59,150 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-15 02:45:59,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-15 02:45:59,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 02:45:59,156 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-15 02:45:59,164 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-15 02:45:59,165 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW ======== [2022-11-15 02:45:59,166 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;@63e7ffd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 02:45:59,166 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-15 02:45:59,166 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-15 02:45:59,166 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 1 remaining) [2022-11-15 02:45:59,167 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-15 02:45:59,167 INFO L307 ceAbstractionStarter]: Result for error location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW was SAFE (4/26) [2022-11-15 02:45:59,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2022-11-15 02:45:59,174 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-15 02:45:59,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-15 02:45:59,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 02:45:59,178 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-15 02:45:59,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2022-11-15 02:45:59,183 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-15 02:45:59,184 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW ======== [2022-11-15 02:45:59,184 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;@63e7ffd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 02:45:59,185 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-15 02:45:59,185 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-15 02:45:59,185 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 1 remaining) [2022-11-15 02:45:59,186 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-15 02:45:59,186 INFO L307 ceAbstractionStarter]: Result for error location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW was SAFE (5/26) [2022-11-15 02:45:59,189 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-15 02:45:59,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-15 02:45:59,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 02:45:59,195 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-15 02:45:59,231 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-15 02:45:59,231 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW ======== [2022-11-15 02:45:59,232 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;@63e7ffd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 02:45:59,232 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-15 02:45:59,232 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-15 02:45:59,232 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 1 remaining) [2022-11-15 02:45:59,233 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-15 02:45:59,233 INFO L307 ceAbstractionStarter]: Result for error location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW was SAFE (6/26) [2022-11-15 02:45:59,236 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-15 02:45:59,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-15 02:45:59,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 02:45:59,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Waiting until timeout for monitored process [2022-11-15 02:45:59,245 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-15 02:45:59,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Waiting until timeout for monitored process [2022-11-15 02:45:59,253 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-15 02:45:59,253 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW ======== [2022-11-15 02:45:59,254 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;@63e7ffd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 02:45:59,254 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-15 02:45:59,254 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-15 02:45:59,254 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 1 remaining) [2022-11-15 02:45:59,255 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-15 02:45:59,255 INFO L307 ceAbstractionStarter]: Result for error location t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW was SAFE (7/26) [2022-11-15 02:45:59,258 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-15 02:45:59,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-15 02:45:59,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 02:45:59,263 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-15 02:45:59,273 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-15 02:45:59,273 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW ======== [2022-11-15 02:45:59,274 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;@63e7ffd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 02:45:59,274 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-15 02:45:59,274 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-15 02:45:59,274 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 1 remaining) [2022-11-15 02:45:59,275 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-15 02:45:59,275 INFO L307 ceAbstractionStarter]: Result for error location t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW was SAFE (8/26) [2022-11-15 02:45:59,278 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-15 02:45:59,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-15 02:45:59,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 02:45:59,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Waiting until timeout for monitored process [2022-11-15 02:45:59,291 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-15 02:45:59,298 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-15 02:45:59,299 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW ======== [2022-11-15 02:45:59,299 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;@63e7ffd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 02:45:59,299 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-15 02:45:59,299 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-15 02:45:59,299 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 1 remaining) [2022-11-15 02:45:59,300 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-15 02:45:59,300 INFO L307 ceAbstractionStarter]: Result for error location t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW was SAFE (9/26) [2022-11-15 02:45:59,305 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-15 02:45:59,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-15 02:45:59,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 02:45:59,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Waiting until timeout for monitored process [2022-11-15 02:45:59,308 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-15 02:45:59,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Waiting until timeout for monitored process [2022-11-15 02:45:59,313 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-15 02:45:59,313 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW ======== [2022-11-15 02:45:59,313 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;@63e7ffd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 02:45:59,314 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-15 02:45:59,314 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-15 02:45:59,314 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 1 remaining) [2022-11-15 02:45:59,314 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-15 02:45:59,315 INFO L307 ceAbstractionStarter]: Result for error location t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW was SAFE (10/26) [2022-11-15 02:45:59,318 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-15 02:45:59,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-15 02:45:59,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 02:45:59,327 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-15 02:45:59,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (12)] Waiting until timeout for monitored process [2022-11-15 02:45:59,334 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-15 02:45:59,335 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW ======== [2022-11-15 02:45:59,335 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;@63e7ffd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 02:45:59,335 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-15 02:45:59,335 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-15 02:45:59,335 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 1 remaining) [2022-11-15 02:45:59,336 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-15 02:45:59,336 INFO L307 ceAbstractionStarter]: Result for error location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW was SAFE (11/26) [2022-11-15 02:45:59,340 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-15 02:45:59,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-15 02:45:59,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 02:45:59,347 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-15 02:45:59,354 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-15 02:45:59,355 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW ======== [2022-11-15 02:45:59,355 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;@63e7ffd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 02:45:59,355 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-15 02:45:59,356 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-15 02:45:59,356 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 1 remaining) [2022-11-15 02:45:59,356 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-15 02:45:59,357 INFO L307 ceAbstractionStarter]: Result for error location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW was SAFE (12/26) [2022-11-15 02:45:59,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (13)] Waiting until timeout for monitored process [2022-11-15 02:45:59,362 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-15 02:45:59,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-15 02:45:59,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 02:45:59,366 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-15 02:45:59,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (14)] Waiting until timeout for monitored process [2022-11-15 02:45:59,370 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-15 02:45:59,370 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW ======== [2022-11-15 02:45:59,370 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;@63e7ffd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 02:45:59,370 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-15 02:45:59,371 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-15 02:45:59,371 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 1 remaining) [2022-11-15 02:45:59,371 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-15 02:45:59,372 INFO L307 ceAbstractionStarter]: Result for error location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW was SAFE (13/26) [2022-11-15 02:45:59,375 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-15 02:45:59,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-15 02:45:59,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 02:45:59,382 INFO L229 MonitoredProcess]: Starting monitored process 15 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-15 02:45:59,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (15)] Waiting until timeout for monitored process [2022-11-15 02:45:59,389 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-15 02:45:59,389 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW ======== [2022-11-15 02:45:59,390 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;@63e7ffd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 02:45:59,390 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-15 02:45:59,390 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-15 02:45:59,390 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 1 remaining) [2022-11-15 02:45:59,391 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-15 02:45:59,391 INFO L307 ceAbstractionStarter]: Result for error location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW was SAFE (14/26) [2022-11-15 02:45:59,394 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-15 02:45:59,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-15 02:45:59,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 02:45:59,398 INFO L229 MonitoredProcess]: Starting monitored process 16 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-15 02:45:59,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (16)] Waiting until timeout for monitored process [2022-11-15 02:45:59,406 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-15 02:45:59,407 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW ======== [2022-11-15 02:45:59,407 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@63e7ffd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 02:45:59,407 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-15 02:45:59,606 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-11-15 02:45:59,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 02:45:59,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1093845670, now seen corresponding path program 1 times [2022-11-15 02:45:59,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 02:45:59,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875016510] [2022-11-15 02:45:59,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 02:45:59,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 02:45:59,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 02:45:59,865 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-15 02:45:59,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 02:45:59,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875016510] [2022-11-15 02:45:59,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875016510] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 02:45:59,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 02:45:59,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-15 02:45:59,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594141327] [2022-11-15 02:45:59,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 02:45:59,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-15 02:45:59,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 02:45:59,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-15 02:45:59,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-15 02:45:59,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:45:59,897 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 02:45:59,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 44.0) internal successors, (88), 2 states have internal predecessors, (88), 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-15 02:45:59,902 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:45:59,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:45:59,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-15 02:45:59,938 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-11-15 02:45:59,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 02:45:59,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1891215175, now seen corresponding path program 1 times [2022-11-15 02:45:59,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 02:45:59,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936880986] [2022-11-15 02:45:59,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 02:45:59,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 02:46:00,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 02:46:09,820 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-15 02:46:09,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 02:46:09,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936880986] [2022-11-15 02:46:09,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936880986] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 02:46:09,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 02:46:09,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-15 02:46:09,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782707228] [2022-11-15 02:46:09,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 02:46:09,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-15 02:46:09,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 02:46:09,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-15 02:46:09,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2022-11-15 02:46:09,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:46:09,824 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 02:46:09,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.526315789473684) internal successors, (86), 20 states have internal predecessors, (86), 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-15 02:46:09,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:46:09,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:46:14,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:46:14,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-15 02:46:14,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-15 02:46:14,284 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-11-15 02:46:14,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 02:46:14,285 INFO L85 PathProgramCache]: Analyzing trace with hash -858914285, now seen corresponding path program 1 times [2022-11-15 02:46:14,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 02:46:14,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252415038] [2022-11-15 02:46:14,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 02:46:14,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 02:46:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 02:46:15,451 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 02:46:15,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 02:46:15,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252415038] [2022-11-15 02:46:15,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252415038] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 02:46:15,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 02:46:15,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-15 02:46:15,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799253610] [2022-11-15 02:46:15,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 02:46:15,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-15 02:46:15,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 02:46:15,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-15 02:46:15,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-11-15 02:46:15,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:46:15,454 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 02:46:15,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.117647058823529) internal successors, (121), 17 states have internal predecessors, (121), 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-15 02:46:15,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:46:15,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-15 02:46:15,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:46:16,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:46:16,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-15 02:46:16,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-15 02:46:16,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-15 02:46:16,010 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-11-15 02:46:16,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 02:46:16,010 INFO L85 PathProgramCache]: Analyzing trace with hash 678632843, now seen corresponding path program 1 times [2022-11-15 02:46:16,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 02:46:16,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050803932] [2022-11-15 02:46:16,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 02:46:16,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 02:46:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 02:46:18,674 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 02:46:18,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 02:46:18,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050803932] [2022-11-15 02:46:18,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050803932] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 02:46:18,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004573629] [2022-11-15 02:46:18,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 02:46:18,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 02:46:18,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 02:46:18,682 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-15 02:46:18,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-15 02:46:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 02:46:18,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 71 conjunts are in the unsatisfiable core [2022-11-15 02:46:18,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 02:46:18,996 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-15 02:46:18,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-15 02:46:19,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-15 02:46:19,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-15 02:46:19,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-15 02:46:19,906 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 02:46:19,924 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-15 02:46:19,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-15 02:46:20,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 02:46:20,165 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 02:46:20,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-15 02:46:20,558 INFO L350 Elim1Store]: Elim1 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 43 treesize of output 30 [2022-11-15 02:46:20,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 02:46:20,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-15 02:46:20,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 02:46:20,923 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 02:46:20,937 INFO L321 Elim1Store]: treesize reduction 46, result has 27.0 percent of original size [2022-11-15 02:46:20,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 37 [2022-11-15 02:46:20,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-15 02:46:20,984 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 02:46:20,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 02:46:21,548 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_137 Int) (v_ArrVal_135 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| Int) (v_ArrVal_136 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_135)) |c_~#stored_elements~0.base| v_ArrVal_136) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12|)) v_ArrVal_137) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (not (<= v_ArrVal_135 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))))) is different from false [2022-11-15 02:46:21,726 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_137 Int) (v_ArrVal_135 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| Int) (v_ArrVal_136 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_135)) |c_~#stored_elements~0.base| v_ArrVal_136) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12|)) v_ArrVal_137) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_135))))) is different from false [2022-11-15 02:46:23,273 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_137 Int) (v_ArrVal_135 Int) (v_ArrVal_133 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| Int) (v_ArrVal_130 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int) (v_ArrVal_136 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse1 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_130)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse1 .cse2 v_ArrVal_133) .cse5 v_ArrVal_135)) |c_~#stored_elements~0.base| v_ArrVal_136) |c_~#queue~0.base|)) (.cse0 (select .cse1 .cse5))) (or (= .cse0 800) (< (+ (select .cse1 .cse2) 1) v_ArrVal_133) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| (select .cse3 (+ |c_~#queue~0.offset| 3204)))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse4 .cse5))) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12|)) v_ArrVal_137) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ .cse0 1) v_ArrVal_135)))))) is different from false [2022-11-15 02:46:30,837 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_137 Int) (v_ArrVal_135 Int) (v_ArrVal_129 (Array Int Int)) (v_ArrVal_133 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| Int) (v_ArrVal_130 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int) (v_ArrVal_128 Int) (v_ArrVal_136 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_128)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_129))) (let ((.cse3 (select .cse6 |c_~#queue~0.base|))) (let ((.cse5 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_~#queue~0.offset|) v_ArrVal_130)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_133) .cse4 v_ArrVal_135)) |c_~#stored_elements~0.base| v_ArrVal_136) |c_~#queue~0.base|)) (.cse2 (select .cse5 .cse4))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12|)) v_ArrVal_137) .cse1) 2147483647) (< (+ .cse2 1) v_ArrVal_135) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse3 .cse4))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| (select .cse0 .cse4))) (= 800 .cse2) (< (+ (select .cse5 .cse1) 1) v_ArrVal_133) (not (<= v_ArrVal_128 0)))))))) is different from false [2022-11-15 02:46:30,864 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 02:46:30,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 283 treesize of output 183 [2022-11-15 02:46:30,885 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 02:46:30,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 349 treesize of output 343 [2022-11-15 02:46:30,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 151 [2022-11-15 02:46:30,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 167 [2022-11-15 02:46:30,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-15 02:46:31,210 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 02:46:31,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 251 treesize of output 263 [2022-11-15 02:46:34,875 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-11-15 02:46:34,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 38 [2022-11-15 02:46:34,933 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-15 02:46:34,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004573629] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 02:46:34,934 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 02:46:34,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 29] total 80 [2022-11-15 02:46:34,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976095265] [2022-11-15 02:46:34,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 02:46:34,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-11-15 02:46:34,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 02:46:34,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-11-15 02:46:34,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=647, Invalid=5127, Unknown=94, NotChecked=612, Total=6480 [2022-11-15 02:46:34,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:46:34,939 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 02:46:34,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 80 states have (on average 4.2875) internal successors, (343), 81 states have internal predecessors, (343), 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-15 02:46:34,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:46:34,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-15 02:46:34,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-15 02:46:34,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:47:09,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:47:09,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-15 02:47:09,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-15 02:47:09,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-15 02:47:09,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-11-15 02:47:09,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 02:47:09,864 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-11-15 02:47:09,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 02:47:09,865 INFO L85 PathProgramCache]: Analyzing trace with hash 119995393, now seen corresponding path program 1 times [2022-11-15 02:47:09,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 02:47:09,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479970799] [2022-11-15 02:47:09,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 02:47:09,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 02:47:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 02:47:13,808 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 6 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 02:47:13,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 02:47:13,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479970799] [2022-11-15 02:47:13,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479970799] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 02:47:13,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37632621] [2022-11-15 02:47:13,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 02:47:13,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 02:47:13,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 02:47:13,811 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-15 02:47:13,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-15 02:47:13,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 02:47:13,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-15 02:47:13,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 02:47:14,102 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-15 02:47:14,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-15 02:47:14,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-15 02:47:14,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-15 02:47:14,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-15 02:47:15,003 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 02:47:15,013 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-15 02:47:15,014 INFO L350 Elim1Store]: Elim1 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-15 02:47:15,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 02:47:15,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-15 02:47:15,304 INFO L350 Elim1Store]: Elim1 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-15 02:47:15,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 02:47:15,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-15 02:47:15,608 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 02:47:15,616 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-15 02:47:15,616 INFO L350 Elim1Store]: Elim1 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 32 treesize of output 27 [2022-11-15 02:47:15,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 02:47:15,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-15 02:47:15,688 INFO L350 Elim1Store]: Elim1 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-15 02:47:15,717 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 43 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 02:47:15,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 02:47:16,076 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_223 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| Int) (v_ArrVal_222 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_222) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22|) |c_~#queue~0.offset|) v_ArrVal_223) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| (select .cse0 .cse1)))))) is different from false [2022-11-15 02:47:16,135 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_223 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| Int) (v_ArrVal_222 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_222) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22|) |c_~#queue~0.offset|) v_ArrVal_223) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| (select .cse0 .cse1)))))) is different from false [2022-11-15 02:47:16,176 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_223 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| Int) (v_ArrVal_222 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_222) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22|) |c_~#queue~0.offset|) v_ArrVal_223) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| (select .cse0 .cse1)))))) is different from false [2022-11-15 02:47:16,189 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_223 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| Int) (v_ArrVal_222 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_222) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22|) |c_~#queue~0.offset|) v_ArrVal_223) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| (select .cse0 .cse1)))))) is different from false [2022-11-15 02:47:16,244 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_223 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| Int) (v_ArrVal_218 Int) (v_ArrVal_222 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_218) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_222) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22|) |c_~#queue~0.offset|) v_ArrVal_223) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| (select .cse0 .cse1)))))) is different from false [2022-11-15 02:47:16,315 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_223 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| Int) (v_ArrVal_218 Int) (v_ArrVal_217 Int) (v_ArrVal_222 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_217)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_218) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_222) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| (select .cse0 .cse1))) (not (= 800 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22|) |c_~#queue~0.offset|) v_ArrVal_223) .cse1)))))) is different from false [2022-11-15 02:47:16,340 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25| Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25| (select .cse0 .cse1))) (forall ((v_ArrVal_223 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| Int) (v_ArrVal_218 Int) (v_ArrVal_217 Int) (v_ArrVal_222 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_217))) (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_218) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_222) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22|) |c_~#queue~0.offset|) v_ArrVal_223) .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| (select .cse2 .cse3))))))))) is different from false [2022-11-15 02:47:16,382 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_223 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25| Int) (v_ArrVal_218 Int) (v_ArrVal_217 Int) (v_ArrVal_222 (Array Int Int))) (let ((.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse4 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_217))) (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_218) .cse3 (+ (select .cse4 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_222) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22|) |c_~#queue~0.offset|) v_ArrVal_223) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25| (select .cse2 .cse3))))))) is different from false [2022-11-15 02:47:17,079 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_213 Int) (v_ArrVal_215 (Array Int Int)) (v_ArrVal_223 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25| Int) (v_ArrVal_218 Int) (v_ArrVal_217 Int) (v_ArrVal_222 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_213)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_215))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|) |c_~#queue~0.offset|) v_ArrVal_217))) (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_218) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_222) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25| (select .cse0 .cse1))) (not (= (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22|) |c_~#queue~0.offset|) v_ArrVal_223) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| (select .cse2 .cse1)))))))) is different from false [2022-11-15 02:47:17,092 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 02:47:17,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 244 treesize of output 159 [2022-11-15 02:47:17,102 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 02:47:17,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 275 treesize of output 273 [2022-11-15 02:47:17,113 INFO L350 Elim1Store]: Elim1 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 287 treesize of output 275 [2022-11-15 02:47:17,121 INFO L350 Elim1Store]: Elim1 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 275 treesize of output 259 [2022-11-15 02:47:17,138 INFO L350 Elim1Store]: Elim1 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-15 02:47:17,318 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 02:47:17,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 93 [2022-11-15 02:47:17,712 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-11-15 02:47:17,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 38 [2022-11-15 02:47:17,749 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 43 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-11-15 02:47:17,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37632621] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 02:47:17,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 02:47:17,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 23, 25] total 80 [2022-11-15 02:47:17,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20744540] [2022-11-15 02:47:17,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 02:47:17,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-11-15 02:47:17,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 02:47:17,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-11-15 02:47:17,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=462, Invalid=4532, Unknown=12, NotChecked=1314, Total=6320 [2022-11-15 02:47:17,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:47:17,754 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 02:47:17,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 5.2625) internal successors, (421), 80 states have internal predecessors, (421), 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-15 02:47:17,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:47:17,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-15 02:47:17,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-15 02:47:17,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-11-15 02:47:17,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:48:07,187 WARN L233 SmtUtils]: Spent 28.54s on a formula simplification. DAG size of input: 76 DAG size of output: 70 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-15 02:48:53,245 WARN L233 SmtUtils]: Spent 29.28s on a formula simplification. DAG size of input: 74 DAG size of output: 70 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-15 02:49:30,340 WARN L233 SmtUtils]: Spent 30.37s on a formula simplification. DAG size of input: 77 DAG size of output: 71 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-15 02:49:54,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:49:54,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-15 02:49:54,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-15 02:49:54,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-11-15 02:49:54,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-15 02:49:54,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-15 02:49:54,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 02:49:54,789 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-11-15 02:49:54,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 02:49:54,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1525993803, now seen corresponding path program 2 times [2022-11-15 02:49:54,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 02:49:54,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746257130] [2022-11-15 02:49:54,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 02:49:54,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 02:49:54,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 02:50:02,784 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 02:50:02,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 02:50:02,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746257130] [2022-11-15 02:50:02,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746257130] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 02:50:02,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410267568] [2022-11-15 02:50:02,785 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-15 02:50:02,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 02:50:02,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 02:50:02,787 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-15 02:50:02,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-15 02:50:02,935 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-15 02:50:02,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-15 02:50:02,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 118 conjunts are in the unsatisfiable core [2022-11-15 02:50:02,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 02:50:03,113 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-15 02:50:03,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-15 02:50:03,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-15 02:50:03,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-15 02:50:03,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-15 02:50:04,116 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 02:50:04,134 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-15 02:50:04,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-15 02:50:04,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 02:50:04,368 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 02:50:04,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-15 02:50:04,728 INFO L350 Elim1Store]: Elim1 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 43 treesize of output 30 [2022-11-15 02:50:04,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 02:50:04,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-15 02:50:05,180 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 02:50:05,195 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-15 02:50:05,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-15 02:50:05,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 02:50:05,415 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 02:50:05,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-15 02:50:05,797 INFO L350 Elim1Store]: Elim1 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 43 treesize of output 30 [2022-11-15 02:50:05,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 02:50:05,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-15 02:50:06,302 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 02:50:06,318 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-15 02:50:06,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-15 02:50:06,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 02:50:06,558 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 02:50:06,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-15 02:50:06,906 INFO L350 Elim1Store]: Elim1 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 43 treesize of output 30 [2022-11-15 02:50:07,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 02:50:07,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-15 02:50:07,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 02:50:07,300 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 02:50:07,313 INFO L321 Elim1Store]: treesize reduction 46, result has 27.0 percent of original size [2022-11-15 02:50:07,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 37 [2022-11-15 02:50:07,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-15 02:50:07,361 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 02:50:07,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 02:50:07,806 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_341 Int) (v_ArrVal_340 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_338 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_338 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 (+ |c_~#queue~0.offset| 3204))))))) is different from false [2022-11-15 02:50:08,016 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_341 Int) (v_ArrVal_340 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_338 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_338))))) is different from false [2022-11-15 02:50:09,433 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_341 Int) (v_ArrVal_340 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_337) .cse2 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem37#1| 1) v_ArrVal_337) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_338))))) is different from false [2022-11-15 02:50:10,354 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_335 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_341 Int) (v_ArrVal_340 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_335)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse4 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse0 .cse3 v_ArrVal_337) .cse1 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_338) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse2 .cse1))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_337) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse4 (+ |c_~#queue~0.offset| 3204))))))))) is different from false [2022-11-15 02:50:24,437 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_335 Int) (v_ArrVal_331 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_341 Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_333 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_331)) |c_~#stored_elements~0.base| v_ArrVal_333))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_~#queue~0.offset|) v_ArrVal_335)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse4 v_ArrVal_337) .cse1 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_338) (not (<= v_ArrVal_331 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse2 .cse1))) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse3 .cse1))) (< (+ (select .cse0 .cse4) 1) v_ArrVal_337))))))) is different from false [2022-11-15 02:50:24,527 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_335 Int) (v_ArrVal_331 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_341 Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_333 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_331)) |c_~#stored_elements~0.base| v_ArrVal_333))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_~#queue~0.offset|) v_ArrVal_335)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse4 v_ArrVal_337) .cse1 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_338) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse2 .cse1))) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_331) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse3 .cse1))) (< (+ (select .cse0 .cse4) 1) v_ArrVal_337))))))) is different from false [2022-11-15 02:50:26,946 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_335 Int) (v_ArrVal_331 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_341 Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_333 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_331)) |c_~#stored_elements~0.base| v_ArrVal_333))) (let ((.cse4 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_~#queue~0.offset|) v_ArrVal_335)) (.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse5 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse2 .cse6 v_ArrVal_337) .cse3 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_331) (< (+ (select .cse2 .cse3) 1) v_ArrVal_338) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse4 .cse3))) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) .cse6) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse5 .cse3))) (< (+ (select .cse2 .cse6) 1) v_ArrVal_337)))))))) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 800)) is different from false [2022-11-15 02:50:29,490 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse7 .cse8))) (or (= 800 .cse0) (forall ((v_ArrVal_335 Int) (v_ArrVal_331 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_341 Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_329) .cse8 v_ArrVal_331)) |c_~#stored_elements~0.base| v_ArrVal_333))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse1 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_~#queue~0.offset|) v_ArrVal_335)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse1 .cse4 v_ArrVal_337) .cse2 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_331) (< (+ (select .cse1 .cse2) 1) v_ArrVal_338) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) .cse4) 2147483647) (< (+ (select .cse1 .cse4) 1) v_ArrVal_337) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse5 .cse2))) (not (<= v_ArrVal_329 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse3 .cse2)))))))))))) is different from false [2022-11-15 02:50:29,812 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse5 .cse9))) (or (forall ((v_ArrVal_335 Int) (v_ArrVal_331 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_341 Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int)) (let ((.cse6 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_329) .cse9 v_ArrVal_331)) |c_~#stored_elements~0.base| v_ArrVal_333))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse1 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_~#queue~0.offset|) v_ArrVal_335)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse1 .cse4 v_ArrVal_337) .cse2 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_331) (< (+ (select .cse1 .cse2) 1) v_ArrVal_338) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) .cse4) 2147483647) (< (+ (select .cse1 .cse4) 1) v_ArrVal_337) (< (+ (select .cse5 .cse6) 1) v_ArrVal_329) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse7 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse3 .cse2)))))))))) (= 800 .cse0)))) is different from false [2022-11-15 02:50:29,904 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_335 Int) (v_ArrVal_331 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_341 Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_327 Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_327)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse9 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_329) .cse9 v_ArrVal_331)) |c_~#stored_elements~0.base| v_ArrVal_333))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_~#queue~0.offset|) v_ArrVal_335)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse6 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (select .cse2 .cse9)) (.cse0 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_337) .cse6 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_329) (= .cse4 800) (< (+ .cse4 1) v_ArrVal_331) (< (+ (select .cse5 .cse1) 1) v_ArrVal_337) (< (+ (select .cse5 .cse6) 1) v_ArrVal_338) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse7 .cse6))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse6)))))))))) is different from false [2022-11-15 02:50:29,973 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| (select .cse0 .cse1))) (forall ((v_ArrVal_335 Int) (v_ArrVal_331 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_341 Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_327 Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int)) (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_327)) (.cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 .cse5 v_ArrVal_329) .cse1 v_ArrVal_331)) |c_~#stored_elements~0.base| v_ArrVal_333))) (let ((.cse9 (select .cse10 |c_~#queue~0.base|))) (let ((.cse6 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_~#queue~0.offset|) v_ArrVal_335)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse7 (+ |c_~#queue~0.offset| 3204))) (let ((.cse8 (select .cse4 .cse1)) (.cse2 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse6 .cse3 v_ArrVal_337) .cse7 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|))) (or (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) .cse3) 2147483647) (< (+ (select .cse4 .cse5) 1) v_ArrVal_329) (< (+ (select .cse6 .cse7) 1) v_ArrVal_338) (< (+ (select .cse6 .cse3) 1) v_ArrVal_337) (< (+ .cse8 1) v_ArrVal_331) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse9 .cse7))) (= 800 .cse8) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse2 .cse7))))))))))))) is different from false [2022-11-15 02:50:30,099 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_327 Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int) (v_ArrVal_335 Int) (v_ArrVal_331 Int) (v_ArrVal_341 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse8 (store .cse6 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_327)) (.cse9 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse8 .cse9 v_ArrVal_329) .cse7 v_ArrVal_331)) |c_~#stored_elements~0.base| v_ArrVal_333))) (let ((.cse2 (select .cse10 |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_~#queue~0.offset|) v_ArrVal_335)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (select .cse8 .cse7)) (.cse5 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse0 .cse4 v_ArrVal_337) .cse1 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_338) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse2 .cse1))) (= 800 .cse3) (< (+ (select .cse0 .cse4) 1) v_ArrVal_337) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) .cse4) 2147483647) (< (+ .cse3 1) v_ArrVal_331) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| (select .cse6 .cse7))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse5 .cse1))) (< (+ (select .cse8 .cse9) 1) v_ArrVal_329))))))))) is different from false [2022-11-15 02:50:41,235 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_327 Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int) (v_ArrVal_326 (Array Int Int)) (v_ArrVal_335 Int) (v_ArrVal_331 Int) (v_ArrVal_341 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int)) (let ((.cse9 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_326))) (let ((.cse2 (select .cse9 |c_~#queue~0.base|))) (let ((.cse7 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_327)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| (store (store .cse7 .cse1 v_ArrVal_329) .cse3 v_ArrVal_331)) |c_~#stored_elements~0.base| v_ArrVal_333))) (let ((.cse6 (select .cse8 |c_~#queue~0.base|))) (let ((.cse4 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_~#queue~0.offset|) v_ArrVal_335))) (let ((.cse0 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_337) .cse3 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|)) (.cse5 (select .cse7 .cse3))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| (select .cse2 .cse3))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_337) (< (+ .cse5 1) v_ArrVal_331) (< (+ (select .cse4 .cse3) 1) v_ArrVal_338) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse6 .cse3))) (< (+ (select .cse7 .cse1) 1) v_ArrVal_329) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse3))) (= .cse5 800)))))))))) is different from false [2022-11-15 02:50:41,686 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_327 Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int) (v_ArrVal_325 Int) (v_ArrVal_326 (Array Int Int)) (v_ArrVal_335 Int) (v_ArrVal_331 Int) (v_ArrVal_341 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int)) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_325)) |c_~#stored_elements~0.base| v_ArrVal_326))) (let ((.cse3 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_327)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_329) .cse1 v_ArrVal_331)) |c_~#stored_elements~0.base| v_ArrVal_333))) (let ((.cse4 (select .cse8 |c_~#queue~0.base|))) (let ((.cse7 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_~#queue~0.offset|) v_ArrVal_335))) (let ((.cse0 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse7 .cse5 v_ArrVal_337) .cse1 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|)) (.cse2 (select .cse6 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse1))) (= .cse2 800) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse4 .cse1))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) .cse5) 2147483647) (< (+ (select .cse6 .cse5) 1) v_ArrVal_329) (< (+ (select .cse7 .cse1) 1) v_ArrVal_338) (not (<= v_ArrVal_325 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (< (+ .cse2 1) v_ArrVal_331) (< (+ (select .cse7 .cse5) 1) v_ArrVal_337)))))))))) is different from false [2022-11-15 02:50:43,116 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_327 Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int) (v_ArrVal_325 Int) (v_ArrVal_326 (Array Int Int)) (v_ArrVal_335 Int) (v_ArrVal_331 Int) (v_ArrVal_341 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_325)) |c_~#stored_elements~0.base| v_ArrVal_326))) (let ((.cse5 (select .cse11 |c_~#queue~0.base|))) (let ((.cse8 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_327)) (.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store (store .cse8 .cse7 v_ArrVal_329) .cse1 v_ArrVal_331)) |c_~#stored_elements~0.base| v_ArrVal_333))) (let ((.cse6 (select .cse10 |c_~#queue~0.base|))) (let ((.cse9 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_~#queue~0.offset|) v_ArrVal_335))) (let ((.cse0 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse9 .cse7 v_ArrVal_337) .cse1 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|)) (.cse2 (select .cse8 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse1))) (= .cse2 800) (< (+ (select .cse3 .cse4) 1) v_ArrVal_325) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| (select .cse5 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse6 .cse1))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) .cse7) 2147483647) (< (+ (select .cse8 .cse7) 1) v_ArrVal_329) (< (+ (select .cse9 .cse1) 1) v_ArrVal_338) (< (+ .cse2 1) v_ArrVal_331) (< (+ (select .cse9 .cse7) 1) v_ArrVal_337))))))))))) is different from false [2022-11-15 02:50:43,250 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 800) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_327 Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int) (v_ArrVal_325 Int) (v_ArrVal_326 (Array Int Int)) (v_ArrVal_335 Int) (v_ArrVal_331 Int) (v_ArrVal_341 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_325)) |c_~#stored_elements~0.base| v_ArrVal_326))) (let ((.cse5 (select .cse11 |c_~#queue~0.base|))) (let ((.cse8 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_327)) (.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store (store .cse8 .cse7 v_ArrVal_329) .cse1 v_ArrVal_331)) |c_~#stored_elements~0.base| v_ArrVal_333))) (let ((.cse6 (select .cse10 |c_~#queue~0.base|))) (let ((.cse9 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_~#queue~0.offset|) v_ArrVal_335))) (let ((.cse0 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse9 .cse7 v_ArrVal_337) .cse1 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|)) (.cse2 (select .cse8 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse1))) (= .cse2 800) (< (+ (select .cse3 .cse4) 1) v_ArrVal_325) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| (select .cse5 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse6 .cse1))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) .cse7) 2147483647) (< (+ (select .cse8 .cse7) 1) v_ArrVal_329) (< (+ (select .cse9 .cse1) 1) v_ArrVal_338) (< (+ .cse2 1) v_ArrVal_331) (< (+ (select .cse9 .cse7) 1) v_ArrVal_337)))))))))))) is different from false [2022-11-15 02:50:43,343 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse11 .cse12))) (or (= 800 .cse0) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_327 Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int) (v_ArrVal_325 Int) (v_ArrVal_326 (Array Int Int)) (v_ArrVal_335 Int) (v_ArrVal_331 Int) (v_ArrVal_341 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int)) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse11 .cse12 v_ArrVal_325)) |c_~#stored_elements~0.base| v_ArrVal_326))) (let ((.cse4 (select .cse10 |c_~#queue~0.base|))) (let ((.cse7 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_327)) (.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store (store .cse7 .cse6 v_ArrVal_329) .cse2 v_ArrVal_331)) |c_~#stored_elements~0.base| v_ArrVal_333))) (let ((.cse5 (select .cse9 |c_~#queue~0.base|))) (let ((.cse8 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_~#queue~0.offset|) v_ArrVal_335))) (let ((.cse1 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse8 .cse6 v_ArrVal_337) .cse2 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|)) (.cse3 (select .cse7 .cse2))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse1 .cse2))) (= .cse3 800) (< (+ .cse0 1) v_ArrVal_325) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| (select .cse4 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse5 .cse2))) (< (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) .cse6) 2147483647) (< (+ (select .cse7 .cse6) 1) v_ArrVal_329) (< (+ (select .cse8 .cse2) 1) v_ArrVal_338) (< (+ .cse3 1) v_ArrVal_331) (< (+ (select .cse8 .cse6) 1) v_ArrVal_337))))))))))))) is different from false [2022-11-15 02:50:43,623 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (select .cse11 .cse12))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_327 Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int) (v_ArrVal_325 Int) (v_ArrVal_326 (Array Int Int)) (v_ArrVal_335 Int) (v_ArrVal_323 Int) (v_ArrVal_331 Int) (v_ArrVal_341 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int)) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse11 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_323) .cse12 v_ArrVal_325)) |c_~#stored_elements~0.base| v_ArrVal_326))) (let ((.cse0 (select .cse10 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_327)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_329) .cse1 v_ArrVal_331)) |c_~#stored_elements~0.base| v_ArrVal_333))) (let ((.cse7 (select .cse9 |c_~#queue~0.base|))) (let ((.cse4 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_~#queue~0.offset|) v_ArrVal_335))) (let ((.cse5 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_337) .cse1 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|)) (.cse6 (select .cse2 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_329) (< (+ (select .cse4 .cse1) 1) v_ArrVal_338) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse5 .cse1))) (= .cse6 800) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse7 .cse1))) (< (+ .cse8 1) v_ArrVal_325) (not (<= v_ArrVal_323 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) .cse3) 2147483647) (< (+ (select .cse4 .cse3) 1) v_ArrVal_337) (< (+ .cse6 1) v_ArrVal_331)))))))))) (= 800 .cse8)))) is different from false [2022-11-15 02:50:44,198 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse13 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (select .cse9 .cse13))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_327 Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int) (v_ArrVal_325 Int) (v_ArrVal_326 (Array Int Int)) (v_ArrVal_335 Int) (v_ArrVal_323 Int) (v_ArrVal_331 Int) (v_ArrVal_341 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int)) (let ((.cse10 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse9 .cse10 v_ArrVal_323) .cse13 v_ArrVal_325)) |c_~#stored_elements~0.base| v_ArrVal_326))) (let ((.cse0 (select .cse12 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_327)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_329) .cse1 v_ArrVal_331)) |c_~#stored_elements~0.base| v_ArrVal_333))) (let ((.cse7 (select .cse11 |c_~#queue~0.base|))) (let ((.cse4 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_~#queue~0.offset|) v_ArrVal_335))) (let ((.cse5 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_337) .cse1 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|)) (.cse6 (select .cse2 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_329) (< (+ (select .cse4 .cse1) 1) v_ArrVal_338) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse5 .cse1))) (= .cse6 800) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse7 .cse1))) (< (+ .cse8 1) v_ArrVal_325) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) .cse3) 2147483647) (< (+ (select .cse4 .cse3) 1) v_ArrVal_337) (< (+ .cse6 1) v_ArrVal_331) (< (+ (select .cse9 .cse10) 1) v_ArrVal_323))))))))))) (= 800 .cse8)))) is different from false [2022-11-15 02:50:44,374 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_327 Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int) (v_ArrVal_325 Int) (v_ArrVal_326 (Array Int Int)) (v_ArrVal_335 Int) (v_ArrVal_323 Int) (v_ArrVal_320 Int) (v_ArrVal_331 Int) (v_ArrVal_341 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int)) (let ((.cse7 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_320)) (.cse8 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse12 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 .cse8 v_ArrVal_323) .cse12 v_ArrVal_325)) |c_~#stored_elements~0.base| v_ArrVal_326))) (let ((.cse1 (select .cse13 |c_~#queue~0.base|))) (let ((.cse6 (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_327)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse11 (store (store .cse13 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_329) .cse2 v_ArrVal_331)) |c_~#stored_elements~0.base| v_ArrVal_333))) (let ((.cse10 (select .cse11 |c_~#queue~0.base|))) (let ((.cse9 (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_~#queue~0.offset|) v_ArrVal_335))) (let ((.cse3 (select .cse7 .cse12)) (.cse0 (select .cse6 .cse2)) (.cse4 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse9 .cse5 v_ArrVal_337) .cse2 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_331) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| (select .cse1 .cse2))) (< (+ .cse3 1) v_ArrVal_325) (= 800 .cse3) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) .cse5) 2147483647) (= 800 .cse0) (< (+ (select .cse6 .cse5) 1) v_ArrVal_329) (< (+ (select .cse7 .cse8) 1) v_ArrVal_323) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse4 .cse2))) (< (+ (select .cse9 .cse5) 1) v_ArrVal_337) (< (+ (select .cse9 .cse2) 1) v_ArrVal_338) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse10 .cse2))))))))))))) is different from false [2022-11-15 02:50:44,491 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int)) (let ((.cse14 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_327 Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int) (v_ArrVal_325 Int) (v_ArrVal_326 (Array Int Int)) (v_ArrVal_335 Int) (v_ArrVal_323 Int) (v_ArrVal_320 Int) (v_ArrVal_331 Int) (v_ArrVal_341 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int)) (let ((.cse2 (store .cse14 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_320)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_323) .cse11 v_ArrVal_325)) |c_~#stored_elements~0.base| v_ArrVal_326))) (let ((.cse0 (select .cse13 |c_~#queue~0.base|))) (let ((.cse10 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_327)) (.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse12 (store (store .cse13 |c_~#queue~0.base| (store (store .cse10 .cse6 v_ArrVal_329) .cse1 v_ArrVal_331)) |c_~#stored_elements~0.base| v_ArrVal_333))) (let ((.cse5 (select .cse12 |c_~#queue~0.base|))) (let ((.cse9 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_~#queue~0.offset|) v_ArrVal_335))) (let ((.cse4 (select (store (store .cse12 |c_~#queue~0.base| (store (store .cse9 .cse6 v_ArrVal_337) .cse1 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|)) (.cse8 (select .cse10 .cse1)) (.cse7 (select .cse2 .cse11))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_323) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse4 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse5 .cse1))) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) .cse6) 2147483647) (< (+ .cse7 1) v_ArrVal_325) (< (+ .cse8 1) v_ArrVal_331) (= .cse8 800) (< (+ (select .cse9 .cse1) 1) v_ArrVal_338) (< (+ (select .cse10 .cse6) 1) v_ArrVal_329) (< (+ (select .cse9 .cse6) 1) v_ArrVal_337) (= 800 .cse7))))))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| (select .cse14 .cse11)))))) is different from false [2022-11-15 02:50:44,719 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_327 Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int) (v_ArrVal_325 Int) (v_ArrVal_326 (Array Int Int)) (v_ArrVal_335 Int) (v_ArrVal_323 Int) (v_ArrVal_320 Int) (v_ArrVal_331 Int) (v_ArrVal_341 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int)) (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_320)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse14 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 .cse3 v_ArrVal_323) .cse10 v_ArrVal_325)) |c_~#stored_elements~0.base| v_ArrVal_326))) (let ((.cse5 (select .cse14 |c_~#queue~0.base|))) (let ((.cse12 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_327)) (.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse13 (store (store .cse14 |c_~#queue~0.base| (store (store .cse12 .cse7 v_ArrVal_329) .cse1 v_ArrVal_331)) |c_~#stored_elements~0.base| v_ArrVal_333))) (let ((.cse8 (select .cse13 |c_~#queue~0.base|))) (let ((.cse0 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_~#queue~0.offset|) v_ArrVal_335))) (let ((.cse4 (select .cse12 .cse1)) (.cse11 (select (store (store .cse13 |c_~#queue~0.base| (store (store .cse0 .cse7 v_ArrVal_337) .cse1 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|)) (.cse6 (select .cse2 .cse10))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_338) (< (+ (select .cse2 .cse3) 1) v_ArrVal_323) (< (+ .cse4 1) v_ArrVal_331) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| (select .cse5 .cse1))) (= 800 .cse4) (< (+ .cse6 1) v_ArrVal_325) (< (+ (select .cse0 .cse7) 1) v_ArrVal_337) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse8 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| (select .cse9 .cse10))) (< (select (store .cse11 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) .cse7) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse11 .cse1))) (= 800 .cse6) (< (+ (select .cse12 .cse7) 1) v_ArrVal_329)))))))))))) is different from false [2022-11-15 02:50:45,049 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_327 Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int) (v_ArrVal_325 Int) (v_ArrVal_326 (Array Int Int)) (v_ArrVal_335 Int) (v_ArrVal_323 Int) (v_ArrVal_320 Int) (v_ArrVal_331 Int) (v_ArrVal_341 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int)) (let ((.cse10 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse6 (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) v_ArrVal_320)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse12 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse1 v_ArrVal_323) .cse5 v_ArrVal_325)) |c_~#stored_elements~0.base| v_ArrVal_326))) (let ((.cse9 (select .cse12 |c_~#queue~0.base|))) (let ((.cse0 (store .cse9 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_327))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_329) .cse5 v_ArrVal_331)) |c_~#stored_elements~0.base| v_ArrVal_333))) (let ((.cse8 (select .cse11 |c_~#queue~0.base|))) (let ((.cse4 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_~#queue~0.offset|) v_ArrVal_335))) (let ((.cse2 (select .cse6 .cse5)) (.cse3 (select .cse0 .cse5)) (.cse7 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_337) .cse5 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_329) (= 800 .cse2) (= .cse3 800) (< (+ (select .cse4 .cse5) 1) v_ArrVal_338) (< (+ (select .cse4 .cse1) 1) v_ArrVal_337) (< (+ (select .cse6 .cse1) 1) v_ArrVal_323) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse7 .cse5))) (< (+ .cse2 1) v_ArrVal_325) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse8 .cse5))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| (select .cse9 .cse5))) (< (+ .cse3 1) v_ArrVal_331) (< (select (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| (select .cse10 .cse5)))))))))))))) is different from false [2022-11-15 02:50:46,259 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_327 Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int) (v_ArrVal_325 Int) (v_ArrVal_326 (Array Int Int)) (v_ArrVal_335 Int) (v_ArrVal_323 Int) (v_ArrVal_319 (Array Int Int)) (v_ArrVal_320 Int) (v_ArrVal_331 Int) (v_ArrVal_341 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_319))) (let ((.cse6 (select .cse13 |c_~#queue~0.base|))) (let ((.cse8 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) v_ArrVal_320)) (.cse9 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse12 (store (store .cse13 |c_~#queue~0.base| (store (store .cse8 .cse9 v_ArrVal_323) .cse1 v_ArrVal_325)) |c_~#stored_elements~0.base| v_ArrVal_326))) (let ((.cse4 (select .cse12 |c_~#queue~0.base|))) (let ((.cse10 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_327))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse10 .cse9 v_ArrVal_329) .cse1 v_ArrVal_331)) |c_~#stored_elements~0.base| v_ArrVal_333))) (let ((.cse3 (select .cse11 |c_~#queue~0.base|))) (let ((.cse5 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_~#queue~0.offset|) v_ArrVal_335))) (let ((.cse7 (select .cse8 .cse1)) (.cse0 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse5 .cse9 v_ArrVal_337) .cse1 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|)) (.cse2 (select .cse10 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse1))) (< (+ .cse2 1) v_ArrVal_331) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| (select .cse4 .cse1))) (< (+ (select .cse5 .cse1) 1) v_ArrVal_338) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| (select .cse6 .cse1))) (= 800 .cse7) (< (+ (select .cse8 .cse9) 1) v_ArrVal_323) (< (+ .cse7 1) v_ArrVal_325) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) .cse9) 2147483647) (< (+ (select .cse5 .cse9) 1) v_ArrVal_337) (< (+ (select .cse10 .cse9) 1) v_ArrVal_329) (= 800 .cse2))))))))))))) is different from false [2022-11-15 02:50:48,182 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_318 Int) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_327 Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int) (v_ArrVal_325 Int) (v_ArrVal_326 (Array Int Int)) (v_ArrVal_335 Int) (v_ArrVal_323 Int) (v_ArrVal_319 (Array Int Int)) (v_ArrVal_320 Int) (v_ArrVal_331 Int) (v_ArrVal_341 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int)) (let ((.cse13 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_318)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_319))) (let ((.cse6 (select .cse13 |c_~#queue~0.base|))) (let ((.cse0 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) v_ArrVal_320)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse12 (store (store .cse13 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_323) .cse3 v_ArrVal_325)) |c_~#stored_elements~0.base| v_ArrVal_326))) (let ((.cse4 (select .cse12 |c_~#queue~0.base|))) (let ((.cse8 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_327))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse8 .cse1 v_ArrVal_329) .cse3 v_ArrVal_331)) |c_~#stored_elements~0.base| v_ArrVal_333))) (let ((.cse2 (select .cse11 |c_~#queue~0.base|))) (let ((.cse9 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_~#queue~0.offset|) v_ArrVal_335))) (let ((.cse5 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse9 .cse1 v_ArrVal_337) .cse3 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|)) (.cse7 (select .cse8 .cse3)) (.cse10 (select .cse0 .cse3))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_323) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| (select .cse4 .cse3))) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| (select .cse6 .cse3))) (= .cse7 800) (< (+ (select .cse8 .cse1) 1) v_ArrVal_329) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse5 .cse3))) (not (<= v_ArrVal_318 0)) (< (+ (select .cse9 .cse1) 1) v_ArrVal_337) (< (+ (select .cse9 .cse3) 1) v_ArrVal_338) (< (+ .cse10 1) v_ArrVal_325) (< (+ .cse7 1) v_ArrVal_331) (= 800 .cse10))))))))))))) is different from false [2022-11-15 02:50:48,235 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 02:50:48,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1592 treesize of output 1012 [2022-11-15 02:50:48,279 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 02:50:48,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2186 treesize of output 2170 [2022-11-15 02:50:48,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 938 treesize of output 874 [2022-11-15 02:50:48,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 805 treesize of output 789 [2022-11-15 02:50:48,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1331 treesize of output 1283 [2022-11-15 02:50:48,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1555 treesize of output 1523 [2022-11-15 02:50:48,514 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 02:50:48,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 9 [2022-11-15 02:50:50,314 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 02:50:50,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 382 treesize of output 394 [2022-11-15 02:50:54,706 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-11-15 02:50:54,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 38 [2022-11-15 02:50:54,756 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 49 refuted. 2 times theorem prover too weak. 0 trivial. 120 not checked. [2022-11-15 02:50:54,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410267568] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 02:50:54,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 02:50:54,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 53] total 141 [2022-11-15 02:50:54,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906823352] [2022-11-15 02:50:54,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 02:50:54,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 142 states [2022-11-15 02:50:54,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 02:50:54,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2022-11-15 02:50:54,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1769, Invalid=11713, Unknown=190, NotChecked=6350, Total=20022 [2022-11-15 02:50:54,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:50:54,763 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 02:50:54,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 142 states, 141 states have (on average 4.177304964539007) internal successors, (589), 142 states have internal predecessors, (589), 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-15 02:50:54,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:50:54,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-15 02:50:54,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-15 02:50:54,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2022-11-15 02:50:54,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-11-15 02:50:54,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:51:46,098 WARN L233 SmtUtils]: Spent 15.26s on a formula simplification. DAG size of input: 160 DAG size of output: 157 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-15 02:52:20,441 WARN L233 SmtUtils]: Spent 10.24s on a formula simplification. DAG size of input: 158 DAG size of output: 155 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-15 02:52:50,617 WARN L233 SmtUtils]: Spent 12.59s on a formula simplification. DAG size of input: 155 DAG size of output: 152 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-15 02:53:21,844 WARN L233 SmtUtils]: Spent 14.26s on a formula simplification. DAG size of input: 155 DAG size of output: 152 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-15 02:54:12,968 WARN L233 SmtUtils]: Spent 16.46s on a formula simplification. DAG size of input: 151 DAG size of output: 146 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-15 02:54:13,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:54:13,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-15 02:54:13,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-15 02:54:13,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-11-15 02:54:13,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-15 02:54:13,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-11-15 02:54:13,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-15 02:54:13,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 02:54:13,220 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-11-15 02:54:13,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 02:54:13,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1624944705, now seen corresponding path program 2 times [2022-11-15 02:54:13,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 02:54:13,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951783306] [2022-11-15 02:54:13,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 02:54:13,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 02:54:13,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 02:54:21,332 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 18 proven. 268 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 02:54:21,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 02:54:21,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951783306] [2022-11-15 02:54:21,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951783306] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 02:54:21,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279108915] [2022-11-15 02:54:21,333 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-15 02:54:21,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 02:54:21,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 02:54:21,334 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-15 02:54:21,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-15 02:54:21,487 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-15 02:54:21,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-15 02:54:21,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 119 conjunts are in the unsatisfiable core [2022-11-15 02:54:21,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 02:54:21,657 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-15 02:54:21,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-15 02:54:21,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-15 02:54:21,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-15 02:54:22,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-15 02:54:22,637 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 02:54:22,647 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-15 02:54:22,648 INFO L350 Elim1Store]: Elim1 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-15 02:54:22,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 02:54:22,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-15 02:54:23,039 INFO L350 Elim1Store]: Elim1 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-15 02:54:23,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 02:54:23,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-15 02:54:23,475 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 02:54:23,482 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-15 02:54:23,483 INFO L350 Elim1Store]: Elim1 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-15 02:54:23,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 02:54:23,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-15 02:54:23,765 INFO L350 Elim1Store]: Elim1 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-15 02:54:23,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 02:54:23,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-15 02:54:24,183 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 02:54:24,194 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-15 02:54:24,195 INFO L350 Elim1Store]: Elim1 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-15 02:54:24,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 02:54:24,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-15 02:54:24,532 INFO L350 Elim1Store]: Elim1 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-15 02:54:24,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 02:54:24,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-15 02:54:24,896 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 02:54:24,903 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-15 02:54:24,904 INFO L350 Elim1Store]: Elim1 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-15 02:54:24,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 02:54:24,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-15 02:54:25,001 INFO L350 Elim1Store]: Elim1 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-15 02:54:25,040 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 97 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 02:54:25,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 02:54:25,769 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_474 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse0 .cse1))) (not (= 800 (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse1)))))) is different from false [2022-11-15 02:54:25,821 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_474 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int)) (v_ArrVal_468 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_468) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse0 .cse1))) (not (= 800 (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse1)))))) is different from false [2022-11-15 02:54:25,876 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_466 Int) (v_ArrVal_474 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int)) (v_ArrVal_468 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_466)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_468) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse0 .cse1))) (not (= 800 (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse1)))))) is different from false [2022-11-15 02:54:25,895 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| (select .cse0 .cse1))) (forall ((v_ArrVal_466 Int) (v_ArrVal_474 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int)) (v_ArrVal_468 Int)) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_466))) (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_468) .cse1 (+ 1 (select .cse4 .cse1))))) |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse2 .cse3))))))))) is different from false [2022-11-15 02:54:27,459 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_466 Int) (v_ArrVal_474 Int) (v_ArrVal_461 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int) (v_ArrVal_465 (Array Int Int)) (v_ArrVal_468 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_461) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_465))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) v_ArrVal_466))) (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_468) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| (select .cse0 .cse1))) (not (= (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse2 .cse1)))))))) is different from false [2022-11-15 02:54:27,606 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_466 Int) (v_ArrVal_474 Int) (v_ArrVal_461 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int) (v_ArrVal_465 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_468 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_459)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_461) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_465))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) v_ArrVal_466))) (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_468) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse2 .cse1))) (not (= (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse1) 800))))))) is different from false [2022-11-15 02:54:27,650 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| (select .cse0 .cse1))) (forall ((v_ArrVal_466 Int) (v_ArrVal_474 Int) (v_ArrVal_461 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int) (v_ArrVal_465 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_468 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse7 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_459))) (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_461) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_465))) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) v_ArrVal_466))) (store (store .cse6 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_468) .cse3 (+ (select .cse6 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse2 .cse3))) (not (= 800 (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| (select .cse4 .cse3))))))))))) is different from false [2022-11-15 02:54:27,728 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_466 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int) (v_ArrVal_474 Int) (v_ArrVal_461 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int) (v_ArrVal_465 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_468 Int)) (let ((.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse7 (store .cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_459))) (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_461) .cse4 (+ (select .cse7 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_465))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) v_ArrVal_466))) (store (store .cse6 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_468) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|))) (or (not (= 800 (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| (select .cse3 .cse4))))))))) is different from false [2022-11-15 02:54:28,601 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_458 (Array Int Int)) (v_ArrVal_466 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int) (v_ArrVal_474 Int) (v_ArrVal_461 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int) (v_ArrVal_465 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_468 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_458))) (let ((.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse0 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_459))) (store (store .cse8 .cse6 v_ArrVal_461) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_465))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) v_ArrVal_466))) (store (store .cse5 .cse6 v_ArrVal_468) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| (select .cse2 .cse1))) (not (= 800 (select (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse3 .cse1)))))))))) is different from false [2022-11-15 02:54:29,272 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int)) (v_ArrVal_465 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_468 Int) (v_ArrVal_458 (Array Int Int)) (v_ArrVal_455 Int) (v_ArrVal_466 Int) (v_ArrVal_474 Int) (v_ArrVal_461 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse9 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_455) .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_458))) (let ((.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse3 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_459))) (store (store .cse8 .cse6 v_ArrVal_461) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_465))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) v_ArrVal_466))) (store (store .cse5 .cse6 v_ArrVal_468) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| (select .cse3 .cse1))) (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse1) 800))))))))) is different from false [2022-11-15 02:54:29,442 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int)) (v_ArrVal_465 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_468 Int) (v_ArrVal_458 (Array Int Int)) (v_ArrVal_455 Int) (v_ArrVal_466 Int) (v_ArrVal_453 Int) (v_ArrVal_474 Int) (v_ArrVal_461 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_453)) (.cse10 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse9 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_455) .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_458))) (let ((.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse0 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_459))) (store (store .cse8 .cse6 v_ArrVal_461) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_465))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) v_ArrVal_466))) (store (store .cse5 .cse6 v_ArrVal_468) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse3 .cse1))) (not (= 800 (select (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse1)))))))))) is different from false [2022-11-15 02:54:29,499 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse0 .cse1))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int)) (v_ArrVal_465 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_468 Int) (v_ArrVal_458 (Array Int Int)) (v_ArrVal_455 Int) (v_ArrVal_466 Int) (v_ArrVal_453 Int) (v_ArrVal_474 Int) (v_ArrVal_461 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse11 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_453))) (store (store .cse11 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_455) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_458))) (let ((.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse2 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_459))) (store (store .cse10 .cse8 v_ArrVal_461) .cse3 (+ (select .cse10 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_465))) (let ((.cse4 (select .cse6 |c_~#queue~0.base|))) (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) v_ArrVal_466))) (store (store .cse7 .cse8 v_ArrVal_468) .cse3 (+ (select .cse7 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| (select .cse4 .cse3))) (not (= (select (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse3) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse5 .cse3))))))))))))) is different from false [2022-11-15 02:54:29,579 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int)) (v_ArrVal_465 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_468 Int) (v_ArrVal_458 (Array Int Int)) (v_ArrVal_455 Int) (v_ArrVal_466 Int) (v_ArrVal_453 Int) (v_ArrVal_474 Int) (v_ArrVal_461 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (let ((.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204)) (.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse11 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_453))) (store (store .cse11 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_455) .cse5 (+ (select .cse11 .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_458))) (let ((.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_459))) (store (store .cse10 .cse8 v_ArrVal_461) .cse1 (+ (select .cse10 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_465))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|))) (let ((.cse3 (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) v_ArrVal_466))) (store (store .cse7 .cse8 v_ArrVal_468) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse3 .cse1))) (not (= (select (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse4 .cse5))))))))))) is different from false [2022-11-15 02:54:30,425 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int)) (v_ArrVal_451 (Array Int Int)) (v_ArrVal_465 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_468 Int) (v_ArrVal_458 (Array Int Int)) (v_ArrVal_455 Int) (v_ArrVal_466 Int) (v_ArrVal_453 Int) (v_ArrVal_474 Int) (v_ArrVal_461 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_451))) (let ((.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (select .cse10 |c_~#queue~0.base|))) (let ((.cse8 (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_453))) (store (store .cse11 .cse7 v_ArrVal_455) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_458))) (let ((.cse4 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_459))) (store (store .cse9 .cse7 v_ArrVal_461) .cse1 (+ (select .cse9 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_465))) (let ((.cse3 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) v_ArrVal_466))) (store (store .cse6 .cse7 v_ArrVal_468) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| (select .cse4 .cse1)))))))))))) is different from false [2022-11-15 02:54:31,089 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int)) (v_ArrVal_451 (Array Int Int)) (v_ArrVal_465 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_468 Int) (v_ArrVal_458 (Array Int Int)) (v_ArrVal_455 Int) (v_ArrVal_466 Int) (v_ArrVal_453 Int) (v_ArrVal_474 Int) (v_ArrVal_450 Int) (v_ArrVal_461 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_450)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_451))) (let ((.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (select .cse10 |c_~#queue~0.base|))) (let ((.cse8 (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_453))) (store (store .cse11 .cse7 v_ArrVal_455) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_458))) (let ((.cse4 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_459))) (store (store .cse9 .cse7 v_ArrVal_461) .cse1 (+ (select .cse9 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_465))) (let ((.cse3 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) v_ArrVal_466))) (store (store .cse6 .cse7 v_ArrVal_468) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| (select .cse4 .cse1)))))))))))) is different from false [2022-11-15 02:54:31,110 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 02:54:31,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 2504 treesize of output 1519 [2022-11-15 02:54:31,138 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 02:54:31,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2079 treesize of output 2053 [2022-11-15 02:54:31,165 INFO L350 Elim1Store]: Elim1 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 2133 treesize of output 2113 [2022-11-15 02:54:31,190 INFO L350 Elim1Store]: Elim1 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 1841 treesize of output 1777 [2022-11-15 02:54:31,214 INFO L350 Elim1Store]: Elim1 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 2074 treesize of output 2026 [2022-11-15 02:54:31,241 INFO L350 Elim1Store]: Elim1 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 2205 treesize of output 2173 [2022-11-15 02:54:31,280 INFO L350 Elim1Store]: Elim1 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-15 02:54:32,436 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 02:54:32,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 248 treesize of output 232 [2022-11-15 02:54:33,053 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-11-15 02:54:33,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 38 [2022-11-15 02:54:33,103 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 97 proven. 96 refuted. 2 times theorem prover too weak. 0 trivial. 91 not checked. [2022-11-15 02:54:33,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279108915] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 02:54:33,103 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 02:54:33,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 35, 43] total 122 [2022-11-15 02:54:33,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102411034] [2022-11-15 02:54:33,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 02:54:33,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 122 states [2022-11-15 02:54:33,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 02:54:33,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2022-11-15 02:54:33,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1240, Invalid=10052, Unknown=110, NotChecked=3360, Total=14762 [2022-11-15 02:54:33,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:54:33,109 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 02:54:33,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 122 states, 122 states have (on average 5.467213114754099) internal successors, (667), 122 states have internal predecessors, (667), 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-15 02:54:33,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:54:33,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-15 02:54:33,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-15 02:54:33,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2022-11-15 02:54:33,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-11-15 02:54:33,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2022-11-15 02:54:33,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:56:10,950 WARN L233 SmtUtils]: Spent 27.47s on a formula simplification. DAG size of input: 156 DAG size of output: 151 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-15 02:56:56,474 WARN L233 SmtUtils]: Spent 17.93s on a formula simplification. DAG size of input: 153 DAG size of output: 148 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-15 02:58:12,212 WARN L233 SmtUtils]: Spent 40.99s on a formula simplification. DAG size of input: 167 DAG size of output: 162 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-15 02:58:12,232 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse40 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse41 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse40 .cse41 (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse16 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse40 .cse41 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) (.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse21 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse40 .cse41 (+ (select .cse40 .cse41) 1))))) (and (forall ((v_ArrVal_474 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int))) (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|))) (or (not (= 800 (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse0 .cse1)))))) (forall ((v_ArrVal_466 Int) (v_ArrVal_474 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int) (v_ArrVal_465 (Array Int Int)) (v_ArrVal_468 Int)) (let ((.cse5 (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_465))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) v_ArrVal_466))) (store (store .cse6 .cse7 v_ArrVal_468) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|))) (or (not (= (select (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| (select .cse4 .cse1)))))))) (forall ((v_ArrVal_458 (Array Int Int)) (v_ArrVal_466 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int) (v_ArrVal_474 Int) (v_ArrVal_461 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int) (v_ArrVal_465 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_468 Int)) (let ((.cse13 (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_458))) (let ((.cse10 (select .cse13 |c_~#queue~0.base|))) (let ((.cse11 (store (store .cse13 |c_~#queue~0.base| (let ((.cse14 (store .cse10 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_459))) (store (store .cse14 .cse7 v_ArrVal_461) .cse1 (+ (select .cse14 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_465))) (let ((.cse8 (select .cse11 |c_~#queue~0.base|))) (let ((.cse9 (select (store (store .cse11 |c_~#queue~0.base| (let ((.cse12 (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) v_ArrVal_466))) (store (store .cse12 .cse7 v_ArrVal_468) .cse1 (+ (select .cse12 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| (select .cse8 .cse1))) (not (= 800 (select (store .cse9 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse9 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| (select .cse10 .cse1)))))))))) (forall ((v_ArrVal_474 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int))) (let ((.cse15 (select (store .cse16 |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|))) (or (not (= (select (store .cse15 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse15 .cse1)))))) (forall ((v_ArrVal_466 Int) (v_ArrVal_474 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int) (v_ArrVal_465 (Array Int Int)) (v_ArrVal_468 Int)) (let ((.cse19 (store .cse21 |c_~#stored_elements~0.base| v_ArrVal_465))) (let ((.cse18 (select .cse19 |c_~#queue~0.base|))) (let ((.cse17 (select (store (store .cse19 |c_~#queue~0.base| (let ((.cse20 (store .cse18 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) v_ArrVal_466))) (store (store .cse20 .cse7 v_ArrVal_468) .cse1 (+ (select .cse20 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse17 .cse1))) (not (= 800 (select (store .cse17 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| (select .cse18 .cse1)))))))) (forall ((v_ArrVal_466 Int) (v_ArrVal_474 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int) (v_ArrVal_465 (Array Int Int)) (v_ArrVal_468 Int)) (let ((.cse24 (store .cse16 |c_~#stored_elements~0.base| v_ArrVal_465))) (let ((.cse23 (select .cse24 |c_~#queue~0.base|))) (let ((.cse22 (select (store (store .cse24 |c_~#queue~0.base| (let ((.cse25 (store .cse23 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) v_ArrVal_466))) (store (store .cse25 .cse7 v_ArrVal_468) .cse1 (+ (select .cse25 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|))) (or (not (= 800 (select (store .cse22 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse22 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| (select .cse23 .cse1)))))))) (forall ((v_ArrVal_458 (Array Int Int)) (v_ArrVal_466 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int) (v_ArrVal_474 Int) (v_ArrVal_461 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int) (v_ArrVal_465 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_468 Int)) (let ((.cse31 (store .cse16 |c_~#stored_elements~0.base| v_ArrVal_458))) (let ((.cse26 (select .cse31 |c_~#queue~0.base|))) (let ((.cse29 (store (store .cse31 |c_~#queue~0.base| (let ((.cse32 (store .cse26 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_459))) (store (store .cse32 .cse7 v_ArrVal_461) .cse1 (+ (select .cse32 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_465))) (let ((.cse27 (select .cse29 |c_~#queue~0.base|))) (let ((.cse28 (select (store (store .cse29 |c_~#queue~0.base| (let ((.cse30 (store .cse27 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) v_ArrVal_466))) (store (store .cse30 .cse7 v_ArrVal_468) .cse1 (+ (select .cse30 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| (select .cse26 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| (select .cse27 .cse1))) (not (= 800 (select (store .cse28 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse28 .cse1)))))))))) (forall ((v_ArrVal_458 (Array Int Int)) (v_ArrVal_466 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int) (v_ArrVal_474 Int) (v_ArrVal_461 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int) (v_ArrVal_465 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_468 Int)) (let ((.cse38 (store .cse21 |c_~#stored_elements~0.base| v_ArrVal_458))) (let ((.cse33 (select .cse38 |c_~#queue~0.base|))) (let ((.cse36 (store (store .cse38 |c_~#queue~0.base| (let ((.cse39 (store .cse33 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_459))) (store (store .cse39 .cse7 v_ArrVal_461) .cse1 (+ (select .cse39 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_465))) (let ((.cse35 (select .cse36 |c_~#queue~0.base|))) (let ((.cse34 (select (store (store .cse36 |c_~#queue~0.base| (let ((.cse37 (store .cse35 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) v_ArrVal_466))) (store (store .cse37 .cse7 v_ArrVal_468) .cse1 (+ 1 (select .cse37 .cse1))))) |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| (select .cse33 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse34 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| (select .cse35 .cse1))) (not (= 800 (select (store .cse34 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse1))))))))))))) is different from false [2022-11-15 02:59:12,105 WARN L233 SmtUtils]: Spent 30.19s on a formula simplification. DAG size of input: 176 DAG size of output: 171 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-15 02:59:12,113 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (and (forall ((v_ArrVal_474 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int))) (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse0 .cse1)))))) (forall ((v_ArrVal_466 Int) (v_ArrVal_474 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int) (v_ArrVal_465 (Array Int Int)) (v_ArrVal_468 Int)) (let ((.cse5 (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_465))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) v_ArrVal_466))) (store (store .cse6 .cse7 v_ArrVal_468) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|))) (or (not (= 800 (select (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| (select .cse4 .cse1)))))))) (forall ((v_ArrVal_458 (Array Int Int)) (v_ArrVal_466 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int) (v_ArrVal_474 Int) (v_ArrVal_461 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int) (v_ArrVal_465 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_468 Int)) (let ((.cse13 (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_458))) (let ((.cse8 (select .cse13 |c_~#queue~0.base|))) (let ((.cse11 (store (store .cse13 |c_~#queue~0.base| (let ((.cse14 (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_459))) (store (store .cse14 .cse7 v_ArrVal_461) .cse1 (+ (select .cse14 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_465))) (let ((.cse9 (select .cse11 |c_~#queue~0.base|))) (let ((.cse10 (select (store (store .cse11 |c_~#queue~0.base| (let ((.cse12 (store .cse9 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) v_ArrVal_466))) (store (store .cse12 .cse7 v_ArrVal_468) .cse1 (+ (select .cse12 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| (select .cse8 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| (select .cse9 .cse1))) (not (= 800 (select (store .cse10 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse10 .cse1)))))))))))) is different from false Received shutdown request... [2022-11-15 02:59:48,908 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-15 02:59:48,908 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (16)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-15 02:59:48,908 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-15 02:59:48,908 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-15 02:59:48,908 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (15)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-15 02:59:48,908 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-15 02:59:48,908 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-15 02:59:48,908 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-15 02:59:48,908 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-15 02:59:48,908 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-15 02:59:48,933 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-15 02:59:48,934 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-15 02:59:48,934 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-15 02:59:48,934 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (14)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-15 02:59:48,934 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-15 02:59:48,934 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-15 02:59:48,934 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-15 02:59:49,269 WARN L249 SmtUtils]: Removed 3 from assertion stack [2022-11-15 02:59:49,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-15 02:59:49,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 02:59:49,471 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 162 for 3ms.. [2022-11-15 02:59:49,471 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 1 remaining) [2022-11-15 02:59:49,473 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2022-11-15 02:59:49,473 INFO L307 ceAbstractionStarter]: Result for error location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW was TIMEOUT (15/26) [2022-11-15 02:59:49,476 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-15 02:59:49,476 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-15 02:59:49,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 02:59:49 BasicIcfg [2022-11-15 02:59:49,481 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-15 02:59:49,482 INFO L158 Benchmark]: Toolchain (without parser) took 832332.34ms. Allocated memory was 183.5MB in the beginning and 861.9MB in the end (delta: 678.4MB). Free memory was 153.6MB in the beginning and 587.8MB in the end (delta: -434.2MB). Peak memory consumption was 243.2MB. Max. memory is 8.0GB. [2022-11-15 02:59:49,482 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 183.5MB. Free memory is still 137.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-11-15 02:59:49,482 INFO L158 Benchmark]: CACSL2BoogieTranslator took 692.98ms. Allocated memory was 183.5MB in the beginning and 240.1MB in the end (delta: 56.6MB). Free memory was 153.4MB in the beginning and 188.9MB in the end (delta: -35.6MB). Peak memory consumption was 25.5MB. Max. memory is 8.0GB. [2022-11-15 02:59:49,482 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.32ms. Allocated memory is still 240.1MB. Free memory was 188.9MB in the beginning and 186.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-11-15 02:59:49,483 INFO L158 Benchmark]: Boogie Preprocessor took 32.27ms. Allocated memory is still 240.1MB. Free memory was 186.3MB in the beginning and 184.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-11-15 02:59:49,483 INFO L158 Benchmark]: RCFGBuilder took 539.90ms. Allocated memory is still 240.1MB. Free memory was 184.2MB in the beginning and 161.7MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-11-15 02:59:49,483 INFO L158 Benchmark]: TraceAbstraction took 831005.10ms. Allocated memory was 240.1MB in the beginning and 861.9MB in the end (delta: 621.8MB). Free memory was 161.2MB in the beginning and 587.8MB in the end (delta: -426.6MB). Peak memory consumption was 195.7MB. Max. memory is 8.0GB. [2022-11-15 02:59:49,492 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.12ms. Allocated memory is still 183.5MB. Free memory is still 137.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 692.98ms. Allocated memory was 183.5MB in the beginning and 240.1MB in the end (delta: 56.6MB). Free memory was 153.4MB in the beginning and 188.9MB in the end (delta: -35.6MB). Peak memory consumption was 25.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.32ms. Allocated memory is still 240.1MB. Free memory was 188.9MB in the beginning and 186.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.27ms. Allocated memory is still 240.1MB. Free memory was 186.3MB in the beginning and 184.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 539.90ms. Allocated memory is still 240.1MB. Free memory was 184.2MB in the beginning and 161.7MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 831005.10ms. Allocated memory was 240.1MB in the beginning and 861.9MB in the end (delta: 621.8MB). Free memory was 161.2MB in the beginning and 587.8MB in the end (delta: -426.6MB). Peak memory consumption was 195.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 2, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 69, Number of trivial persistent sets: 69, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 2, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1223, independent: 1220, independent conditional: 6, independent unconditional: 1214, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1223, independent: 1220, independent conditional: 6, independent unconditional: 1214, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1221, independent: 1220, independent conditional: 0, independent unconditional: 1220, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1198, independent: 1197, independent conditional: 0, independent unconditional: 1197, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1221, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1198, unknown conditional: 0, unknown unconditional: 1198] , Statistics on independence cache: Total cache size (in pairs): 1198, Positive cache size: 1197, Positive conditional cache size: 0, Positive unconditional cache size: 1197, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 2, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 75, Number of trivial persistent sets: 69, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 1223, independent: 1220, independent conditional: 6, independent unconditional: 1214, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1223, independent: 1220, independent conditional: 6, independent unconditional: 1214, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1221, independent: 1220, independent conditional: 0, independent unconditional: 1220, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1198, independent: 1197, independent conditional: 0, independent unconditional: 1197, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1221, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1198, unknown conditional: 0, unknown unconditional: 1198] , Statistics on independence cache: Total cache size (in pairs): 1198, Positive cache size: 1197, Positive conditional cache size: 0, Positive unconditional cache size: 1197, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 2, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 3230, independent: 3226, independent conditional: 27, independent unconditional: 3199, dependent: 4, dependent conditional: 3, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43719, independent: 43561, independent conditional: 792, independent unconditional: 42769, dependent: 158, dependent conditional: 56, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43663, independent: 43561, independent conditional: 0, independent unconditional: 43561, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9010, independent: 8989, independent conditional: 0, independent unconditional: 8989, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 43663, independent: 34572, independent conditional: 0, independent unconditional: 34572, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 9010, unknown conditional: 0, unknown unconditional: 9010] , Statistics on independence cache: Total cache size (in pairs): 3047, Positive cache size: 3046, Positive conditional cache size: 0, Positive unconditional cache size: 3046, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 3, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 3227, independent: 3223, independent conditional: 24, independent unconditional: 3199, dependent: 4, dependent conditional: 3, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43719, independent: 43561, independent conditional: 792, independent unconditional: 42769, dependent: 158, dependent conditional: 56, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43663, independent: 43561, independent conditional: 0, independent unconditional: 43561, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9010, independent: 8989, independent conditional: 0, independent unconditional: 8989, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 43663, independent: 34572, independent conditional: 0, independent unconditional: 34572, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 9010, unknown conditional: 0, unknown unconditional: 9010] , Statistics on independence cache: Total cache size (in pairs): 3047, Positive cache size: 3046, Positive conditional cache size: 0, Positive unconditional cache size: 3046, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 6, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 5450, independent: 5430, independent conditional: 63, independent unconditional: 5367, dependent: 20, dependent conditional: 7, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43719, independent: 43561, independent conditional: 792, independent unconditional: 42769, dependent: 158, dependent conditional: 56, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43663, independent: 43561, independent conditional: 0, independent unconditional: 43561, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9010, independent: 8989, independent conditional: 0, independent unconditional: 8989, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 43663, independent: 34572, independent conditional: 0, independent unconditional: 34572, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 9010, unknown conditional: 0, unknown unconditional: 9010] , Statistics on independence cache: Total cache size (in pairs): 6550, Positive cache size: 6537, Positive conditional cache size: 0, Positive unconditional cache size: 6537, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 13, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 6259, independent: 6238, independent conditional: 68, independent unconditional: 6170, dependent: 21, dependent conditional: 6, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43719, independent: 43561, independent conditional: 792, independent unconditional: 42769, dependent: 158, dependent conditional: 56, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43663, independent: 43561, independent conditional: 0, independent unconditional: 43561, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9010, independent: 8989, independent conditional: 0, independent unconditional: 8989, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 43663, independent: 34572, independent conditional: 0, independent unconditional: 34572, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 9010, unknown conditional: 0, unknown unconditional: 9010] , Statistics on independence cache: Total cache size (in pairs): 7932, Positive cache size: 7915, Positive conditional cache size: 0, Positive unconditional cache size: 7915, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 19, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 6422, independent: 6396, independent conditional: 104, independent unconditional: 6292, dependent: 26, dependent conditional: 7, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43719, independent: 43561, independent conditional: 792, independent unconditional: 42769, dependent: 158, dependent conditional: 56, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43663, independent: 43561, independent conditional: 0, independent unconditional: 43561, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9010, independent: 8989, independent conditional: 0, independent unconditional: 8989, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 43663, independent: 34572, independent conditional: 0, independent unconditional: 34572, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 9010, unknown conditional: 0, unknown unconditional: 9010] , Statistics on independence cache: Total cache size (in pairs): 9010, Positive cache size: 8989, Positive conditional cache size: 0, Positive unconditional cache size: 8989, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 26, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 6304, independent: 6278, independent conditional: 153, independent unconditional: 6125, dependent: 26, dependent conditional: 9, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43719, independent: 43561, independent conditional: 792, independent unconditional: 42769, dependent: 158, dependent conditional: 56, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43663, independent: 43561, independent conditional: 0, independent unconditional: 43561, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9010, independent: 8989, independent conditional: 0, independent unconditional: 8989, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 43663, independent: 34572, independent conditional: 0, independent unconditional: 34572, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 9010, unknown conditional: 0, unknown unconditional: 9010] , Statistics on independence cache: Total cache size (in pairs): 9010, Positive cache size: 8989, Positive conditional cache size: 0, Positive unconditional cache size: 8989, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 35, Statistics for Abstraction: - StatisticsResult: Independence relation #7 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 6512, independent: 6482, independent conditional: 190, independent unconditional: 6292, dependent: 30, dependent conditional: 11, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43719, independent: 43561, independent conditional: 792, independent unconditional: 42769, dependent: 158, dependent conditional: 56, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43663, independent: 43561, independent conditional: 0, independent unconditional: 43561, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9010, independent: 8989, independent conditional: 0, independent unconditional: 8989, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 43663, independent: 34572, independent conditional: 0, independent unconditional: 34572, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 9010, unknown conditional: 0, unknown unconditional: 9010] , Statistics on independence cache: Total cache size (in pairs): 9010, Positive cache size: 8989, Positive conditional cache size: 0, Positive unconditional cache size: 8989, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 46, Statistics for Abstraction: - StatisticsResult: Independence relation #8 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 6315, independent: 6288, independent conditional: 163, independent unconditional: 6125, dependent: 27, dependent conditional: 10, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43719, independent: 43561, independent conditional: 792, independent unconditional: 42769, dependent: 158, dependent conditional: 56, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43663, independent: 43561, independent conditional: 0, independent unconditional: 43561, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9010, independent: 8989, independent conditional: 0, independent unconditional: 8989, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 43663, independent: 34572, independent conditional: 0, independent unconditional: 34572, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 9010, unknown conditional: 0, unknown unconditional: 9010] , Statistics on independence cache: Total cache size (in pairs): 9010, Positive cache size: 8989, Positive conditional cache size: 0, Positive unconditional cache size: 8989, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 56, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 88, Number of trivial persistent sets: 66, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 3230, independent: 3226, independent conditional: 27, independent unconditional: 3199, dependent: 4, dependent conditional: 3, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43719, independent: 43561, independent conditional: 792, independent unconditional: 42769, dependent: 158, dependent conditional: 56, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43663, independent: 43561, independent conditional: 0, independent unconditional: 43561, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9010, independent: 8989, independent conditional: 0, independent unconditional: 8989, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 43663, independent: 34572, independent conditional: 0, independent unconditional: 34572, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 9010, unknown conditional: 0, unknown unconditional: 9010] , Statistics on independence cache: Total cache size (in pairs): 3047, Positive cache size: 3046, Positive conditional cache size: 0, Positive unconditional cache size: 3046, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 3, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 86, Number of trivial persistent sets: 64, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 3227, independent: 3223, independent conditional: 24, independent unconditional: 3199, dependent: 4, dependent conditional: 3, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43719, independent: 43561, independent conditional: 792, independent unconditional: 42769, dependent: 158, dependent conditional: 56, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43663, independent: 43561, independent conditional: 0, independent unconditional: 43561, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9010, independent: 8989, independent conditional: 0, independent unconditional: 8989, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 43663, independent: 34572, independent conditional: 0, independent unconditional: 34572, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 9010, unknown conditional: 0, unknown unconditional: 9010] , Statistics on independence cache: Total cache size (in pairs): 3047, Positive cache size: 3046, Positive conditional cache size: 0, Positive unconditional cache size: 3046, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 6, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 105, Number of trivial persistent sets: 70, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 5450, independent: 5430, independent conditional: 63, independent unconditional: 5367, dependent: 20, dependent conditional: 7, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43719, independent: 43561, independent conditional: 792, independent unconditional: 42769, dependent: 158, dependent conditional: 56, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43663, independent: 43561, independent conditional: 0, independent unconditional: 43561, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9010, independent: 8989, independent conditional: 0, independent unconditional: 8989, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 43663, independent: 34572, independent conditional: 0, independent unconditional: 34572, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 9010, unknown conditional: 0, unknown unconditional: 9010] , Statistics on independence cache: Total cache size (in pairs): 6550, Positive cache size: 6537, Positive conditional cache size: 0, Positive unconditional cache size: 6537, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 13, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 111, Number of trivial persistent sets: 71, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 6259, independent: 6238, independent conditional: 68, independent unconditional: 6170, dependent: 21, dependent conditional: 6, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43719, independent: 43561, independent conditional: 792, independent unconditional: 42769, dependent: 158, dependent conditional: 56, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43663, independent: 43561, independent conditional: 0, independent unconditional: 43561, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9010, independent: 8989, independent conditional: 0, independent unconditional: 8989, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 43663, independent: 34572, independent conditional: 0, independent unconditional: 34572, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 9010, unknown conditional: 0, unknown unconditional: 9010] , Statistics on independence cache: Total cache size (in pairs): 7932, Positive cache size: 7915, Positive conditional cache size: 0, Positive unconditional cache size: 7915, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 19, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 113, Number of trivial persistent sets: 73, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 6422, independent: 6396, independent conditional: 104, independent unconditional: 6292, dependent: 26, dependent conditional: 7, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43719, independent: 43561, independent conditional: 792, independent unconditional: 42769, dependent: 158, dependent conditional: 56, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43663, independent: 43561, independent conditional: 0, independent unconditional: 43561, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9010, independent: 8989, independent conditional: 0, independent unconditional: 8989, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 43663, independent: 34572, independent conditional: 0, independent unconditional: 34572, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 9010, unknown conditional: 0, unknown unconditional: 9010] , Statistics on independence cache: Total cache size (in pairs): 9010, Positive cache size: 8989, Positive conditional cache size: 0, Positive unconditional cache size: 8989, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 26, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 111, Number of trivial persistent sets: 72, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 6304, independent: 6278, independent conditional: 153, independent unconditional: 6125, dependent: 26, dependent conditional: 9, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43719, independent: 43561, independent conditional: 792, independent unconditional: 42769, dependent: 158, dependent conditional: 56, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43663, independent: 43561, independent conditional: 0, independent unconditional: 43561, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9010, independent: 8989, independent conditional: 0, independent unconditional: 8989, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 43663, independent: 34572, independent conditional: 0, independent unconditional: 34572, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 9010, unknown conditional: 0, unknown unconditional: 9010] , Statistics on independence cache: Total cache size (in pairs): 9010, Positive cache size: 8989, Positive conditional cache size: 0, Positive unconditional cache size: 8989, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 35, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 113, Number of trivial persistent sets: 73, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 6512, independent: 6482, independent conditional: 190, independent unconditional: 6292, dependent: 30, dependent conditional: 11, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43719, independent: 43561, independent conditional: 792, independent unconditional: 42769, dependent: 158, dependent conditional: 56, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43663, independent: 43561, independent conditional: 0, independent unconditional: 43561, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9010, independent: 8989, independent conditional: 0, independent unconditional: 8989, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 43663, independent: 34572, independent conditional: 0, independent unconditional: 34572, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 9010, unknown conditional: 0, unknown unconditional: 9010] , Statistics on independence cache: Total cache size (in pairs): 9010, Positive cache size: 8989, Positive conditional cache size: 0, Positive unconditional cache size: 8989, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 46, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 111, Number of trivial persistent sets: 72, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 6315, independent: 6288, independent conditional: 163, independent unconditional: 6125, dependent: 27, dependent conditional: 10, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43719, independent: 43561, independent conditional: 792, independent unconditional: 42769, dependent: 158, dependent conditional: 56, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43663, independent: 43561, independent conditional: 0, independent unconditional: 43561, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9010, independent: 8989, independent conditional: 0, independent unconditional: 8989, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 43663, independent: 34572, independent conditional: 0, independent unconditional: 34572, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 9010, unknown conditional: 0, unknown unconditional: 9010] , Statistics on independence cache: Total cache size (in pairs): 9010, Positive cache size: 8989, Positive conditional cache size: 0, Positive unconditional cache size: 8989, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 56, Statistics for Abstraction: - TimeoutResultAtElement [Line: 981]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 162 for 3ms.. - PositiveResult [Line: 981]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 988]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 988]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1011]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1011]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1029]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1029]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 996]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 996]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1002]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1002]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 5 procedures, 392 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 0.1s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.1s, 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: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 5 procedures, 392 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.3s, 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: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW with 1 thread instances CFG has 5 procedures, 392 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, 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: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW with 2 thread instances CFG has 5 procedures, 392 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 830.1s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 711.2s, 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: 266, 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: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 116.9s InterpolantComputationTime, 1779 NumberOfCodeBlocks, 1779 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2506 ConstructedInterpolants, 540 QuantifiedInterpolants, 230203 SizeOfPredicates, 149 NumberOfNonLiveVariables, 1644 ConjunctsInSsa, 381 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 320/1630 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW with 1 thread instances CFG has 5 procedures, 392 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, 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: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW with 1 thread instances CFG has 5 procedures, 392 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, 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: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW with 1 thread instances CFG has 5 procedures, 392 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, 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: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW with 1 thread instances CFG has 5 procedures, 392 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, 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: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW with 1 thread instances CFG has 5 procedures, 392 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, 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: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW with 1 thread instances CFG has 5 procedures, 392 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, 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: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW with 1 thread instances CFG has 5 procedures, 392 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, 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: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW with 1 thread instances CFG has 5 procedures, 392 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, 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: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW with 1 thread instances CFG has 5 procedures, 392 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, 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: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW with 1 thread instances CFG has 5 procedures, 392 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, 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: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW with 1 thread instances CFG has 5 procedures, 392 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, 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: 0, 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: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown