/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder-VarAbsGlobalSyntactic.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.error.function.in.sv-comp.mode false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread/queue_ok_longer.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-9868fc6-m [2022-11-15 13:34:57,846 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-15 13:34:57,848 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-15 13:34:57,871 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-15 13:34:57,872 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-15 13:34:57,873 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-15 13:34:57,874 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-15 13:34:57,876 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-15 13:34:57,877 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-15 13:34:57,878 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-15 13:34:57,879 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-15 13:34:57,879 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-15 13:34:57,880 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-15 13:34:57,881 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-15 13:34:57,882 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-15 13:34:57,882 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-15 13:34:57,883 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-15 13:34:57,884 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-15 13:34:57,885 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-15 13:34:57,887 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-15 13:34:57,888 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-15 13:34:57,889 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-15 13:34:57,889 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-15 13:34:57,890 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-15 13:34:57,893 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-15 13:34:57,893 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-15 13:34:57,893 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-15 13:34:57,894 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-15 13:34:57,894 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-15 13:34:57,895 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-15 13:34:57,896 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-15 13:34:57,896 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-15 13:34:57,897 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-15 13:34:57,897 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-15 13:34:57,898 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-15 13:34:57,899 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-15 13:34:57,899 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-15 13:34:57,899 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-15 13:34:57,900 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-15 13:34:57,900 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-15 13:34:57,901 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-15 13:34:57,902 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder-VarAbsGlobalSyntactic.epf [2022-11-15 13:34:57,918 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-15 13:34:57,919 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-15 13:34:57,922 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-15 13:34:57,922 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-15 13:34:57,923 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-15 13:34:57,923 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-15 13:34:57,924 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-15 13:34:57,924 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-15 13:34:57,924 INFO L138 SettingsManager]: * Use SBE=true [2022-11-15 13:34:57,924 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-15 13:34:57,925 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-15 13:34:57,925 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-15 13:34:57,925 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-15 13:34:57,925 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-15 13:34:57,925 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-15 13:34:57,926 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-15 13:34:57,926 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-15 13:34:57,926 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-15 13:34:57,926 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-15 13:34:57,926 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-15 13:34:57,927 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-15 13:34:57,927 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-15 13:34:57,927 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-15 13:34:57,927 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-15 13:34:57,927 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-15 13:34:57,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-15 13:34:57,928 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-15 13:34:57,928 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-15 13:34:57,928 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-15 13:34:57,928 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-15 13:34:57,929 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-15 13:34:57,929 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-15 13:34:57,929 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-11-15 13:34:57,929 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-15 13:34:57,929 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-15 13:34:57,930 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-15 13:34:57,930 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-15 13:34:57,930 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-15 13:34:57,930 INFO L138 SettingsManager]: * Independence relation used for POR in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_THREAD_INSTANCE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check 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 13:34:58,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-15 13:34:58,129 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-15 13:34:58,131 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-15 13:34:58,132 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-15 13:34:58,132 INFO L275 PluginConnector]: CDTParser initialized [2022-11-15 13:34:58,133 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longer.i [2022-11-15 13:34:58,186 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b64683223/1e7c54a704c345549ae51378b8e08eb1/FLAGdc22bfb3c [2022-11-15 13:34:58,622 INFO L306 CDTParser]: Found 1 translation units. [2022-11-15 13:34:58,623 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i [2022-11-15 13:34:58,639 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b64683223/1e7c54a704c345549ae51378b8e08eb1/FLAGdc22bfb3c [2022-11-15 13:34:58,662 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b64683223/1e7c54a704c345549ae51378b8e08eb1 [2022-11-15 13:34:58,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-15 13:34:58,665 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-11-15 13:34:58,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-15 13:34:58,666 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-15 13:34:58,670 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-15 13:34:58,671 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 01:34:58" (1/1) ... [2022-11-15 13:34:58,671 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cffccfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 01:34:58, skipping insertion in model container [2022-11-15 13:34:58,672 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 01:34:58" (1/1) ... [2022-11-15 13:34:58,677 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-15 13:34:58,709 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-15 13:34:59,113 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_longer.i[43272,43285] [2022-11-15 13:34:59,118 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_longer.i[43545,43558] [2022-11-15 13:34:59,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-15 13:34:59,132 INFO L203 MainTranslator]: Completed pre-run [2022-11-15 13:34:59,189 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_longer.i[43272,43285] [2022-11-15 13:34:59,192 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_longer.i[43545,43558] [2022-11-15 13:34:59,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-15 13:34:59,240 INFO L208 MainTranslator]: Completed translation [2022-11-15 13:34:59,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 01:34:59 WrapperNode [2022-11-15 13:34:59,241 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-15 13:34:59,242 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-15 13:34:59,242 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-15 13:34:59,242 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-15 13:34:59,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 01:34:59" (1/1) ... [2022-11-15 13:34:59,264 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 01:34:59" (1/1) ... [2022-11-15 13:34:59,288 INFO L138 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 216 [2022-11-15 13:34:59,288 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-15 13:34:59,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-15 13:34:59,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-15 13:34:59,289 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-15 13:34:59,296 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 01:34:59" (1/1) ... [2022-11-15 13:34:59,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 01:34:59" (1/1) ... [2022-11-15 13:34:59,300 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 01:34:59" (1/1) ... [2022-11-15 13:34:59,301 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 01:34:59" (1/1) ... [2022-11-15 13:34:59,308 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 01:34:59" (1/1) ... [2022-11-15 13:34:59,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 01:34:59" (1/1) ... [2022-11-15 13:34:59,313 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 01:34:59" (1/1) ... [2022-11-15 13:34:59,314 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 01:34:59" (1/1) ... [2022-11-15 13:34:59,317 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-15 13:34:59,318 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-15 13:34:59,318 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-15 13:34:59,318 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-15 13:34:59,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 01:34:59" (1/1) ... [2022-11-15 13:34:59,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-15 13:34:59,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 13:34:59,348 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 13:34:59,397 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 13:34:59,412 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-15 13:34:59,413 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-15 13:34:59,413 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-15 13:34:59,413 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-15 13:34:59,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-15 13:34:59,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-15 13:34:59,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-15 13:34:59,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-15 13:34:59,413 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-15 13:34:59,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-15 13:34:59,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-15 13:34:59,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-15 13:34:59,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-15 13:34:59,415 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 13:34:59,603 INFO L235 CfgBuilder]: Building ICFG [2022-11-15 13:34:59,605 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-15 13:34:59,855 INFO L276 CfgBuilder]: Performing block encoding [2022-11-15 13:34:59,864 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-15 13:34:59,864 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-15 13:34:59,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 01:34:59 BoogieIcfgContainer [2022-11-15 13:34:59,866 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-15 13:34:59,868 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-15 13:34:59,868 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-15 13:34:59,871 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-15 13:34:59,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 01:34:58" (1/3) ... [2022-11-15 13:34:59,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ec7df27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 01:34:59, skipping insertion in model container [2022-11-15 13:34:59,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 01:34:59" (2/3) ... [2022-11-15 13:34:59,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ec7df27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 01:34:59, skipping insertion in model container [2022-11-15 13:34:59,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 01:34:59" (3/3) ... [2022-11-15 13:34:59,873 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2022-11-15 13:34:59,880 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-15 13:34:59,887 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-15 13:34:59,888 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-11-15 13:34:59,888 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-15 13:35:00,072 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-15 13:35:00,121 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-15 13:35:00,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-15 13:35:00,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 13:35:00,124 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 13:35:00,128 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 13:35:00,155 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-15 13:35:00,165 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2022-11-15 13:35:00,170 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;@7ee63680, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 13:35:00,171 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-15 13:35:00,501 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-15 13:35:00,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 13:35:00,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1093845670, now seen corresponding path program 1 times [2022-11-15 13:35:00,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 13:35:00,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39484801] [2022-11-15 13:35:00,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 13:35:00,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 13:35:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 13:35:00,807 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 13:35:00,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 13:35:00,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39484801] [2022-11-15 13:35:00,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39484801] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 13:35:00,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 13:35:00,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-15 13:35:00,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406748540] [2022-11-15 13:35:00,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 13:35:00,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-15 13:35:00,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 13:35:00,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-15 13:35:00,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-15 13:35:00,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:35:00,841 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 13:35:00,842 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 13:35:00,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:35:00,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:35:00,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-15 13:35:00,900 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-15 13:35:00,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 13:35:00,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1891215175, now seen corresponding path program 1 times [2022-11-15 13:35:00,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 13:35:00,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919570375] [2022-11-15 13:35:00,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 13:35:00,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 13:35:01,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 13:35:10,782 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 13:35:10,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 13:35:10,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919570375] [2022-11-15 13:35:10,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919570375] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 13:35:10,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 13:35:10,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-15 13:35:10,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696190735] [2022-11-15 13:35:10,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 13:35:10,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-15 13:35:10,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 13:35:10,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-15 13:35:10,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2022-11-15 13:35:10,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:35:10,787 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 13:35:10,787 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 13:35:10,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:35:10,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:35:12,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:35:12,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-15 13:35:12,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-15 13:35:12,747 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-15 13:35:12,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 13:35:12,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1705076601, now seen corresponding path program 1 times [2022-11-15 13:35:12,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 13:35:12,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689016055] [2022-11-15 13:35:12,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 13:35:12,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 13:35:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 13:35:12,869 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 13:35:12,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 13:35:12,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689016055] [2022-11-15 13:35:12,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689016055] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 13:35:12,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 13:35:12,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-15 13:35:12,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642900554] [2022-11-15 13:35:12,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 13:35:12,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-15 13:35:12,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 13:35:12,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-15 13:35:12,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-15 13:35:12,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:35:12,882 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 13:35:12,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 34.0) internal successors, (102), 4 states have internal predecessors, (102), 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 13:35:12,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:35:12,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-15 13:35:12,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:35:12,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:35:12,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-15 13:35:12,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-15 13:35:12,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-15 13:35:12,981 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-15 13:35:12,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 13:35:12,982 INFO L85 PathProgramCache]: Analyzing trace with hash -858914285, now seen corresponding path program 1 times [2022-11-15 13:35:12,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 13:35:12,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063082647] [2022-11-15 13:35:12,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 13:35:12,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 13:35:13,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 13:35:14,204 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 13:35:14,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 13:35:14,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063082647] [2022-11-15 13:35:14,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063082647] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 13:35:14,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 13:35:14,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-15 13:35:14,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516667305] [2022-11-15 13:35:14,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 13:35:14,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-15 13:35:14,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 13:35:14,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-15 13:35:14,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-11-15 13:35:14,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:35:14,207 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 13:35:14,207 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 13:35:14,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:35:14,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-15 13:35:14,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-15 13:35:14,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:35:14,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:35:14,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-15 13:35:14,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-15 13:35:14,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-15 13:35:14,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-15 13:35:14,713 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-15 13:35:14,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 13:35:14,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1672081442, now seen corresponding path program 1 times [2022-11-15 13:35:14,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 13:35:14,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455074856] [2022-11-15 13:35:14,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 13:35:14,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 13:35:14,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 13:35:17,090 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 13:35:17,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 13:35:17,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455074856] [2022-11-15 13:35:17,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455074856] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 13:35:17,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 13:35:17,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-15 13:35:17,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033927999] [2022-11-15 13:35:17,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 13:35:17,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-15 13:35:17,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 13:35:17,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-15 13:35:17,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2022-11-15 13:35:17,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:35:17,094 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 13:35:17,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 5.052631578947368) internal successors, (96), 20 states have internal predecessors, (96), 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 13:35:17,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:35:17,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-15 13:35:17,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-15 13:35:17,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-15 13:35:17,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:35:18,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:35:18,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-15 13:35:18,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-15 13:35:18,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-15 13:35:18,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-15 13:35:18,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-15 13:35:18,575 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-15 13:35:18,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 13:35:18,576 INFO L85 PathProgramCache]: Analyzing trace with hash 678632843, now seen corresponding path program 1 times [2022-11-15 13:35:18,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 13:35:18,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580254319] [2022-11-15 13:35:18,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 13:35:18,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 13:35:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 13:35:21,085 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 13:35:21,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 13:35:21,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580254319] [2022-11-15 13:35:21,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580254319] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 13:35:21,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4605095] [2022-11-15 13:35:21,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 13:35:21,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 13:35:21,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 13:35:21,094 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-15 13:35:21,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-15 13:35:21,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 13:35:21,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 71 conjunts are in the unsatisfiable core [2022-11-15 13:35:21,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 13:35:21,494 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-15 13:35:21,495 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 13:35:21,657 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 13:35:21,717 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 13:35:22,033 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 13:35:22,383 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 13:35:22,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 13:35:22,399 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-15 13:35:22,400 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 13:35:22,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 13:35:22,635 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 13:35:22,636 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 13:35:23,028 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 13:35:23,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 13:35:23,144 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 13:35:23,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 13:35:23,383 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 13:35:23,398 INFO L321 Elim1Store]: treesize reduction 46, result has 27.0 percent of original size [2022-11-15 13:35:23,398 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 13:35:23,437 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 13:35:23,444 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 13:35:23,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 13:35:24,003 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_184 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| Int) (v_ArrVal_186 Int) (v_ArrVal_182 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|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_182)) |c_~#stored_elements~0.base| v_ArrVal_184) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_182 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12|)) v_ArrVal_186) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-15 13:35:24,045 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_184 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| Int) (v_ArrVal_186 Int) (v_ArrVal_182 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|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_182)) |c_~#stored_elements~0.base| v_ArrVal_184) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12|)) v_ArrVal_186) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_182)))) is different from false [2022-11-15 13:35:24,061 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_184 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| Int) (v_ArrVal_186 Int) (v_ArrVal_182 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_182)) |c_~#stored_elements~0.base| v_ArrVal_184) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_182) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12|)) v_ArrVal_186) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-15 13:35:24,090 WARN L833 $PredicateComparison]: unable to prove that (or (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|) (forall ((v_ArrVal_184 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| Int) (v_ArrVal_186 Int) (v_ArrVal_182 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_182)) |c_~#stored_elements~0.base| v_ArrVal_184) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_182) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12|)) v_ArrVal_186) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-11-15 13:35:24,115 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse2 .cse3))) (or (= 400 .cse0) (forall ((v_ArrVal_184 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| Int) (v_ArrVal_186 Int) (v_ArrVal_182 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_182)) |c_~#stored_elements~0.base| v_ArrVal_184) |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_182) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| (select .cse1 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12|)) v_ArrVal_186) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))))) is different from false [2022-11-15 13:35:24,174 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse2 .cse3))) (or (forall ((v_ArrVal_184 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| Int) (v_ArrVal_186 Int) (v_ArrVal_182 Int) (v_ArrVal_180 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_180) .cse3 v_ArrVal_182)) |c_~#stored_elements~0.base| v_ArrVal_184) |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_182) (< (select (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12|)) v_ArrVal_186) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| (select .cse1 (+ |c_~#queue~0.offset| 1604)))) (not (<= v_ArrVal_180 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)))))) (= 400 .cse0)))) is different from false [2022-11-15 13:35:24,502 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_178 Int) (v_ArrVal_184 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| Int) (v_ArrVal_186 Int) (v_ArrVal_182 Int) (v_ArrVal_180 Int)) (let ((.cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.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_178)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse2 .cse4)) (.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_180) .cse4 v_ArrVal_182)) |c_~#stored_elements~0.base| v_ArrVal_184) |c_~#queue~0.base|))) (or (= 400 .cse0) (< (+ .cse0 1) v_ArrVal_182) (< (select (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12|)) v_ArrVal_186) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| (select .cse1 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_180))))) is different from false [2022-11-15 13:35:24,567 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse0 .cse1))) (forall ((v_ArrVal_178 Int) (v_ArrVal_184 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| Int) (v_ArrVal_186 Int) (v_ArrVal_182 Int) (v_ArrVal_180 Int)) (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_178)) (.cse5 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 .cse5 v_ArrVal_180) .cse1 v_ArrVal_182)) |c_~#stored_elements~0.base| v_ArrVal_184) |c_~#queue~0.base|)) (.cse2 (select .cse4 .cse1))) (or (< (+ .cse2 1) v_ArrVal_182) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| (select .cse3 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12|)) v_ArrVal_186) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse4 .cse5) 1) v_ArrVal_180) (= 400 .cse2)))))))) is different from false [2022-11-15 13:35:24,652 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_178 Int) (v_ArrVal_184 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| Int) (v_ArrVal_186 Int) (v_ArrVal_182 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int) (v_ArrVal_180 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse0 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_178)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse5 (select .cse0 .cse3)) (.cse4 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse0 .cse1 v_ArrVal_180) .cse3 v_ArrVal_182)) |c_~#stored_elements~0.base| v_ArrVal_184) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_180) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| (select .cse4 (+ |c_~#queue~0.offset| 1604)))) (= .cse5 400) (< (+ .cse5 1) v_ArrVal_182) (< (select (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12|)) v_ArrVal_186) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-11-15 13:35:26,533 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_178 Int) (v_ArrVal_175 Int) (v_ArrVal_184 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| Int) (v_ArrVal_186 Int) (v_ArrVal_177 (Array Int Int)) (v_ArrVal_182 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int) (v_ArrVal_180 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|) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_175)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_177))) (let ((.cse1 (select .cse6 |c_~#queue~0.base|))) (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_~#queue~0.offset|) v_ArrVal_178)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2)) (.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_180) .cse2 v_ArrVal_182)) |c_~#stored_elements~0.base| v_ArrVal_184) |c_~#queue~0.base|))) (or (= 400 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse1 .cse2))) (not (<= v_ArrVal_175 0)) (< (+ .cse0 1) v_ArrVal_182) (< (+ (select .cse3 .cse4) 1) v_ArrVal_180) (< (select (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12|)) v_ArrVal_186) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| (select .cse5 .cse2))))))))) is different from false [2022-11-15 13:35:26,559 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 13:35:26,559 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 13:35:26,587 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 13:35:26,588 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 13:35:26,611 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 13:35:26,622 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 13:35:26,679 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 13:35:27,086 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 13:35:27,087 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 209 treesize of output 197 [2022-11-15 13:35:29,645 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-11-15 13:35:29,645 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 13:35:29,695 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-15 13:35:29,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4605095] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 13:35:29,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 13:35:29,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 29] total 80 [2022-11-15 13:35:29,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306642734] [2022-11-15 13:35:29,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 13:35:29,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-11-15 13:35:29,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 13:35:29,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-11-15 13:35:29,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=584, Invalid=4370, Unknown=56, NotChecked=1470, Total=6480 [2022-11-15 13:35:29,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:35:29,701 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 13:35:29,701 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 13:35:29,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:35:29,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-15 13:35:29,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-15 13:35:29,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-15 13:35:29,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-15 13:35:29,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:36:00,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:36:00,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-15 13:36:00,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-15 13:36:00,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-15 13:36:00,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-15 13:36:00,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-15 13:36:00,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-15 13:36:01,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-15 13:36:01,092 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-15 13:36:01,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 13:36:01,092 INFO L85 PathProgramCache]: Analyzing trace with hash -437217722, now seen corresponding path program 1 times [2022-11-15 13:36:01,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 13:36:01,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389894012] [2022-11-15 13:36:01,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 13:36:01,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 13:36:01,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 13:36:02,132 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 13:36:02,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 13:36:02,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389894012] [2022-11-15 13:36:02,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389894012] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 13:36:02,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234854431] [2022-11-15 13:36:02,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 13:36:02,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 13:36:02,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 13:36:02,134 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-15 13:36:02,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-15 13:36:02,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 13:36:02,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-15 13:36:02,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 13:36:02,706 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 13:36:02,853 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 24 [2022-11-15 13:36:02,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 13:36:02,943 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 18 treesize of output 20 [2022-11-15 13:36:03,230 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-15 13:36:03,230 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 1 case distinctions, treesize of input 25 treesize of output 32 [2022-11-15 13:36:03,309 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 17 treesize of output 9 [2022-11-15 13:36:03,314 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 13:36:03,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 13:36:03,970 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 13:36:03,970 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 36 treesize of output 42 [2022-11-15 13:36:03,979 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 13:36:03,980 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 56 treesize of output 60 [2022-11-15 13:36:03,986 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 32 treesize of output 28 [2022-11-15 13:36:03,999 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 10 treesize of output 6 [2022-11-15 13:36:04,008 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 13:36:04,009 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 48 treesize of output 48 [2022-11-15 13:36:04,321 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 13:36:04,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234854431] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 13:36:04,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 13:36:04,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 50 [2022-11-15 13:36:04,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643194579] [2022-11-15 13:36:04,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 13:36:04,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-15 13:36:04,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 13:36:04,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-15 13:36:04,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=2275, Unknown=12, NotChecked=0, Total=2550 [2022-11-15 13:36:04,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:36:04,324 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 13:36:04,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 6.9) internal successors, (345), 51 states have internal predecessors, (345), 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 13:36:04,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:36:04,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-15 13:36:04,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-15 13:36:04,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-15 13:36:04,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-15 13:36:04,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-11-15 13:36:04,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:36:24,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:36:24,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-15 13:36:24,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-15 13:36:24,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-15 13:36:24,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-15 13:36:24,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-15 13:36:24,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-15 13:36:24,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-15 13:36:24,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 13:36:24,516 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-15 13:36:24,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 13:36:24,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1797555879, now seen corresponding path program 1 times [2022-11-15 13:36:24,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 13:36:24,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414828810] [2022-11-15 13:36:24,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 13:36:24,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 13:36:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 13:36:24,603 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-15 13:36:24,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 13:36:24,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414828810] [2022-11-15 13:36:24,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414828810] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 13:36:24,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 13:36:24,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-15 13:36:24,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364959241] [2022-11-15 13:36:24,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 13:36:24,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-15 13:36:24,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 13:36:24,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-15 13:36:24,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-15 13:36:24,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:36:24,606 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 13:36:24,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 4 states have internal predecessors, (143), 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 13:36:24,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:36:24,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-15 13:36:24,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-15 13:36:24,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-15 13:36:24,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-15 13:36:24,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-11-15 13:36:24,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-11-15 13:36:24,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:36:24,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:36:24,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-15 13:36:24,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-15 13:36:24,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-15 13:36:24,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-15 13:36:24,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-15 13:36:24,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-15 13:36:24,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-15 13:36:24,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-15 13:36:24,652 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-15 13:36:24,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 13:36:24,652 INFO L85 PathProgramCache]: Analyzing trace with hash 110343253, now seen corresponding path program 1 times [2022-11-15 13:36:24,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 13:36:24,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828683854] [2022-11-15 13:36:24,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 13:36:24,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 13:36:24,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 13:36:24,759 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 13:36:24,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 13:36:24,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828683854] [2022-11-15 13:36:24,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828683854] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 13:36:24,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443730320] [2022-11-15 13:36:24,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 13:36:24,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 13:36:24,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 13:36:24,761 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-15 13:36:24,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-15 13:36:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 13:36:24,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-15 13:36:24,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 13:36:24,968 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 13:36:24,969 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-15 13:36:24,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443730320] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 13:36:24,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-15 13:36:24,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-15 13:36:24,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127991943] [2022-11-15 13:36:24,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 13:36:24,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-15 13:36:24,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 13:36:24,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-15 13:36:24,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-15 13:36:24,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:36:24,972 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 13:36:24,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 36.0) internal successors, (144), 5 states have internal predecessors, (144), 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 13:36:24,972 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:36:24,972 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-15 13:36:24,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-15 13:36:24,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-15 13:36:24,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-15 13:36:24,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-11-15 13:36:24,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-11-15 13:36:24,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-15 13:36:24,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:36:25,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:36:25,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-15 13:36:25,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-15 13:36:25,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-15 13:36:25,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-15 13:36:25,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-15 13:36:25,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-15 13:36:25,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-15 13:36:25,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-15 13:36:25,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-15 13:36:25,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 13:36:25,337 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-15 13:36:25,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 13:36:25,337 INFO L85 PathProgramCache]: Analyzing trace with hash 119995393, now seen corresponding path program 1 times [2022-11-15 13:36:25,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 13:36:25,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245551857] [2022-11-15 13:36:25,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 13:36:25,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 13:36:25,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 13:36:29,068 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 13:36:29,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 13:36:29,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245551857] [2022-11-15 13:36:29,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245551857] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 13:36:29,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396377721] [2022-11-15 13:36:29,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 13:36:29,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 13:36:29,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 13:36:29,072 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-15 13:36:29,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-15 13:36:29,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 13:36:29,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-15 13:36:29,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 13:36:29,360 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-15 13:36:29,360 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 13:36:29,518 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 13:36:29,577 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 13:36:29,845 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 13:36:30,173 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 13:36:30,180 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-15 13:36:30,180 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 13:36:30,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 13:36:30,244 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 13:36:30,439 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 13:36:30,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 13:36:30,549 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 13:36:30,740 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 13:36:30,748 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-15 13:36:30,748 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 13:36:30,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 13:36:30,822 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 13:36:30,839 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 13:36:30,869 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 13:36:30,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 13:36:31,239 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_437 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_435) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_437) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse1)))))) is different from false [2022-11-15 13:36:31,294 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_437 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|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_435) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_437) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse1)))))) is different from false [2022-11-15 13:36:31,323 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_437 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|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_435) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse1))) (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_437) .cse1)))))) is different from false [2022-11-15 13:36:31,336 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_437 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 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_435) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_437) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse1)))))) is different from false [2022-11-15 13:36:31,400 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int)) (v_ArrVal_432 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_437 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 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_432) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_435) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse1))) (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_437) .cse1)))))) is different from false [2022-11-15 13:36:31,469 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int)) (v_ArrVal_432 Int) (v_ArrVal_430 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_437 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_430)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_432) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_435) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse1))) (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_437) .cse1)))))) is different from false [2022-11-15 13:36:31,492 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (forall ((v_ArrVal_435 (Array Int Int)) (v_ArrVal_432 Int) (v_ArrVal_430 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_437 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_430))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_432) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_435) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse1))) (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_437) .cse1)))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse4 .cse3)))))) is different from false [2022-11-15 13:36:32,363 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int)) (v_ArrVal_432 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_430 Int) (v_ArrVal_428 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_426 Int) (v_ArrVal_437 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|) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_426)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_428))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_~#queue~0.offset|) v_ArrVal_430))) (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_432) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_435) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse1))) (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_437) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse2 .cse1)))))))) is different from false [2022-11-15 13:36:32,383 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 13:36:32,384 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 13:36:32,395 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 13:36:32,396 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 13:36:32,406 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 253 treesize of output 237 [2022-11-15 13:36:32,413 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 293 treesize of output 281 [2022-11-15 13:36:32,436 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 13:36:32,569 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 13:36:32,569 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 13:36:32,979 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-11-15 13:36:32,979 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 13:36:33,021 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 43 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2022-11-15 13:36:33,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396377721] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 13:36:33,022 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 13:36:33,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 23, 25] total 80 [2022-11-15 13:36:33,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833047940] [2022-11-15 13:36:33,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 13:36:33,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-11-15 13:36:33,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 13:36:33,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-11-15 13:36:33,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=4652, Unknown=28, NotChecked=1176, Total=6320 [2022-11-15 13:36:33,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:36:33,027 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 13:36:33,028 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 13:36:33,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:36:33,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-15 13:36:33,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-15 13:36:33,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-15 13:36:33,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-15 13:36:33,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2022-11-15 13:36:33,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-15 13:36:33,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-15 13:36:33,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-15 13:36:33,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:36:46,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:36:46,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-15 13:36:46,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-15 13:36:46,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-15 13:36:46,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-15 13:36:46,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-15 13:36:46,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-15 13:36:46,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-15 13:36:46,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-15 13:36:46,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-15 13:36:46,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-15 13:36:46,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-15 13:36:46,652 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-15 13:36:46,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 13:36:46,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1303619980, now seen corresponding path program 1 times [2022-11-15 13:36:46,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 13:36:46,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916791354] [2022-11-15 13:36:46,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 13:36:46,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 13:36:46,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 13:36:48,358 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 13:36:48,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 13:36:48,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916791354] [2022-11-15 13:36:48,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916791354] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 13:36:48,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231651658] [2022-11-15 13:36:48,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 13:36:48,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 13:36:48,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 13:36:48,360 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-15 13:36:48,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-15 13:36:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 13:36:48,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-15 13:36:48,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 13:36:48,572 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-15 13:36:48,573 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 13:36:48,710 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 13:36:48,758 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 13:36:48,988 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 13:36:49,246 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 13:36:49,255 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-15 13:36:49,255 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 13:36:49,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 13:36:49,314 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 13:36:49,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 13:36:49,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 13:36:49,614 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 13:36:49,786 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 13:36:49,794 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-15 13:36:49,794 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 27 [2022-11-15 13:36:49,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 13:36:49,836 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 13:36:49,861 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 13:36:49,865 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 13:36:49,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 13:36:50,102 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_511 (Array Int Int)) (v_ArrVal_512 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_511) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_512)) .cse1)) 2147483647)) is different from false [2022-11-15 13:36:50,122 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_511 (Array Int Int)) (v_ArrVal_512 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (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|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_511) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_512)) .cse1)) 2147483647)) is different from false [2022-11-15 13:36:50,457 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (forall ((v_ArrVal_508 Int) (v_ArrVal_511 (Array Int Int)) (v_ArrVal_512 Int)) (< (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_508) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_511) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_512)) .cse2)) 2147483647))))) is different from false [2022-11-15 13:36:50,505 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_508 Int) (v_ArrVal_505 Int) (v_ArrVal_511 (Array Int Int)) (v_ArrVal_512 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_505)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_508) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_511) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_512)) .cse1)) 2147483647) (= 400 .cse4))))) is different from false [2022-11-15 13:36:50,525 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (forall ((v_ArrVal_508 Int) (v_ArrVal_505 Int) (v_ArrVal_511 (Array Int Int)) (v_ArrVal_512 Int)) (let ((.cse2 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_505))) (let ((.cse4 (select .cse2 .cse3))) (or (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_508) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_511) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_512)) .cse1)) 2147483647) (= 400 .cse4))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| (select .cse5 .cse3)))))) is different from false [2022-11-15 13:36:50,559 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_508 Int) (v_ArrVal_505 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_511 (Array Int Int)) (v_ArrVal_512 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_505)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= 400 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| (select .cse1 .cse2))) (< (let ((.cse4 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse5 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_508) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_511) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse4) 4)) v_ArrVal_512)) .cse4)) 2147483647)))))) is different from false [2022-11-15 13:36:51,280 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_508 Int) (v_ArrVal_505 Int) (v_ArrVal_503 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_511 (Array Int Int)) (v_ArrVal_512 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|) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_503)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_504))) (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_505)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 400) (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_508) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_511) |c_~#queue~0.base|))) (store .cse1 (+ (* 4 (select .cse1 .cse2)) |c_~#queue~0.offset|) v_ArrVal_512)) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| (select .cse5 .cse2))))))))) is different from false [2022-11-15 13:36:51,296 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 13:36:51,296 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 273 treesize of output 173 [2022-11-15 13:36:51,308 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 13:36:51,308 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 261 treesize of output 257 [2022-11-15 13:36:51,317 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 206 treesize of output 182 [2022-11-15 13:36:51,327 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 155 treesize of output 135 [2022-11-15 13:36:51,344 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 13:36:51,502 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 13:36:51,502 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 149 treesize of output 125 [2022-11-15 13:36:51,870 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-11-15 13:36:51,871 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 13:36:51,901 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2022-11-15 13:36:51,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231651658] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 13:36:51,901 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 13:36:51,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 27] total 71 [2022-11-15 13:36:51,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892968628] [2022-11-15 13:36:51,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 13:36:51,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-11-15 13:36:51,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 13:36:51,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-11-15 13:36:51,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=524, Invalid=3628, Unknown=36, NotChecked=924, Total=5112 [2022-11-15 13:36:51,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:36:51,905 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 13:36:51,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 71 states have (on average 5.253521126760563) internal successors, (373), 72 states have internal predecessors, (373), 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 13:36:51,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:36:51,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-15 13:36:51,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-15 13:36:51,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-15 13:36:51,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-15 13:36:51,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2022-11-15 13:36:51,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-15 13:36:51,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-15 13:36:51,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-15 13:36:51,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-11-15 13:36:51,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:36:54,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:36:54,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-15 13:36:54,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-15 13:36:54,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-15 13:36:54,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-15 13:36:54,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-15 13:36:54,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-15 13:36:54,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-15 13:36:54,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-15 13:36:54,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-15 13:36:54,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-15 13:36:54,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-15 13:36:54,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 13:36:54,885 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-15 13:36:54,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 13:36:54,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1757513073, now seen corresponding path program 1 times [2022-11-15 13:36:54,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 13:36:54,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500165262] [2022-11-15 13:36:54,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 13:36:54,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 13:36:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 13:36:55,883 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 13:36:55,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 13:36:55,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500165262] [2022-11-15 13:36:55,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500165262] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 13:36:55,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503267687] [2022-11-15 13:36:55,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 13:36:55,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 13:36:55,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 13:36:55,886 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-15 13:36:55,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-15 13:36:56,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 13:36:56,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-15 13:36:56,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 13:36:56,668 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 43 treesize of output 21 [2022-11-15 13:36:56,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 13:36:56,767 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 28 treesize of output 28 [2022-11-15 13:36:56,993 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 13:36:57,000 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-15 13:36:57,000 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 33 [2022-11-15 13:36:57,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 13:36:57,078 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 31 treesize of output 26 [2022-11-15 13:36:57,115 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 25 treesize of output 13 [2022-11-15 13:36:57,122 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 13:36:57,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 13:36:57,388 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_579 Int)) (< 0 (+ 2147483650 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_579)) .cse1))))) is different from false [2022-11-15 13:36:57,709 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 13:36:57,709 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 52 [2022-11-15 13:36:57,717 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 13:36:57,717 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 75 treesize of output 75 [2022-11-15 13:36:57,722 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 40 treesize of output 28 [2022-11-15 13:36:57,731 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 18 treesize of output 10 [2022-11-15 13:36:57,748 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 13:36:57,749 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 64 treesize of output 52 [2022-11-15 13:36:58,002 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 13:36:58,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503267687] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 13:36:58,002 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 13:36:58,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 18] total 50 [2022-11-15 13:36:58,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654564729] [2022-11-15 13:36:58,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 13:36:58,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-15 13:36:58,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 13:36:58,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-15 13:36:58,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=2190, Unknown=15, NotChecked=96, Total=2550 [2022-11-15 13:36:58,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:36:58,005 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 13:36:58,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 7.5) internal successors, (375), 51 states have internal predecessors, (375), 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 13:36:58,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:36:58,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-15 13:36:58,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-15 13:36:58,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-15 13:36:58,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-15 13:36:58,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2022-11-15 13:36:58,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-15 13:36:58,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-15 13:36:58,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-15 13:36:58,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-11-15 13:36:58,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-15 13:36:58,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:37:11,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:37:11,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-15 13:37:11,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-15 13:37:11,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-15 13:37:11,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-15 13:37:11,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-15 13:37:11,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-15 13:37:11,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-15 13:37:11,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-15 13:37:11,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-15 13:37:11,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-15 13:37:11,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-15 13:37:11,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-15 13:37:11,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 13:37:11,452 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-15 13:37:11,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 13:37:11,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1525993803, now seen corresponding path program 2 times [2022-11-15 13:37:11,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 13:37:11,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604965410] [2022-11-15 13:37:11,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 13:37:11,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 13:37:11,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 13:37:17,850 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 13:37:17,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 13:37:17,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604965410] [2022-11-15 13:37:17,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604965410] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 13:37:17,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112210915] [2022-11-15 13:37:17,851 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-15 13:37:17,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 13:37:17,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 13:37:17,852 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-15 13:37:17,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-15 13:37:17,997 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-15 13:37:17,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-15 13:37:18,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 114 conjunts are in the unsatisfiable core [2022-11-15 13:37:18,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 13:37:18,131 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-15 13:37:18,131 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 13:37:18,302 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 13:37:18,369 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 13:37:18,658 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 13:37:19,041 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 13:37:19,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 13:37:19,056 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-15 13:37:19,056 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 13:37:19,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 13:37:19,266 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 13:37:19,267 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 13:37:19,561 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 13:37:19,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 13:37:19,670 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 13:37:19,998 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 13:37:19,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 13:37:20,013 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-15 13:37:20,013 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 13:37:20,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 13:37:20,208 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 13:37:20,209 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 13:37:20,500 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 13:37:20,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 13:37:20,604 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 13:37:20,948 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 13:37:20,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 13:37:20,964 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-15 13:37:20,964 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 13:37:21,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 13:37:21,180 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 13:37:21,182 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 13:37:21,483 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 13:37:21,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 13:37:21,593 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 13:37:21,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 13:37:21,814 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 13:37:21,827 INFO L321 Elim1Store]: treesize reduction 46, result has 27.0 percent of original size [2022-11-15 13:37:21,827 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 13:37:21,863 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 13:37:21,867 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 13:37:21,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 13:37:22,202 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_696 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-15 13:37:22,241 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_694 Int) (v_ArrVal_696 (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|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_694 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))))) is different from false [2022-11-15 13:37:22,519 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_694 Int) (v_ArrVal_692 Int) (v_ArrVal_696 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_692) .cse1 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_694) (not (<= v_ArrVal_692 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-15 13:37:22,672 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_694 Int) (v_ArrVal_692 Int) (v_ArrVal_696 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse2 v_ArrVal_692) .cse1 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_694) (< (+ (select .cse0 .cse2) 1) v_ArrVal_692) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse3 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-15 13:37:25,313 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_694 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (v_ArrVal_692 Int) (v_ArrVal_690 Int) (v_ArrVal_696 (Array Int 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_53|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_690)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse0 .cse4 v_ArrVal_692) .cse1 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_694) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse3 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse0 .cse4) 1) v_ArrVal_692) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-11-15 13:37:35,716 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_689 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_694 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (v_ArrVal_692 Int) (v_ArrVal_690 Int) (v_ArrVal_696 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_692) .cse3 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse1) 2147483647) (< (+ (select .cse2 .cse1) 1) v_ArrVal_692) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse0 .cse3))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_694) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse4 .cse3))))))))) is different from false [2022-11-15 13:37:36,082 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_689 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_694 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (v_ArrVal_692 Int) (v_ArrVal_690 Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_688 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|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse4 v_ArrVal_692) .cse1 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_694) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_688) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse2 .cse1))) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse4) 2147483647) (< (+ (select .cse0 .cse4) 1) v_ArrVal_692) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse3 .cse1))))))))) is different from false [2022-11-15 13:37:40,446 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_689 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_694 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (v_ArrVal_692 Int) (v_ArrVal_690 Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_688 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_686) .cse1 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse6 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_692) .cse3 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_688) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse2 .cse3))) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse5) 2147483647) (< (+ (select .cse6 .cse5) 1) v_ArrVal_692) (< (+ (select .cse6 .cse3) 1) v_ArrVal_694) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse4 .cse3))) (not (<= v_ArrVal_686 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)))))))))) is different from false [2022-11-15 13:37:40,732 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_689 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_694 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (v_ArrVal_692 Int) (v_ArrVal_690 Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_688 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse7 v_ArrVal_686) .cse1 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse2 (select .cse8 |c_~#queue~0.base|))) (let ((.cse6 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_692) .cse3 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_688) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse2 .cse3))) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse5) 2147483647) (< (+ (select .cse6 .cse5) 1) v_ArrVal_692) (< (+ (select .cse0 .cse7) 1) v_ArrVal_686) (< (+ (select .cse6 .cse3) 1) v_ArrVal_694) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse4 .cse3)))))))))) is different from false [2022-11-15 13:37:40,811 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_689 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_683 Int) (v_ArrVal_694 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (v_ArrVal_692 Int) (v_ArrVal_690 Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_688 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_683)) (.cse5 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse5 v_ArrVal_686) .cse3 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse6 (select .cse8 |c_~#queue~0.base|))) (let ((.cse4 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690)) (.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse4 .cse7 v_ArrVal_692) .cse1 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_688) (< (+ (select .cse4 .cse1) 1) v_ArrVal_694) (< (+ 1 (select .cse2 .cse5)) v_ArrVal_686) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse6 .cse1))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse7) 2147483647) (< (+ (select .cse4 .cse7) 1) v_ArrVal_692)))))))) is different from false [2022-11-15 13:37:40,874 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int)) (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (forall ((v_ArrVal_689 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_683 Int) (v_ArrVal_694 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (v_ArrVal_692 Int) (v_ArrVal_690 Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_688 Int)) (let ((.cse5 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_683)) (.cse6 (+ 1608 |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_686) .cse7 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse4 (select .cse8 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_692) .cse1 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_694) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse2 .cse1))) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse4 .cse1))) (< (+ (select .cse5 .cse6) 1) v_ArrVal_686) (< (+ (select .cse0 .cse3) 1) v_ArrVal_692) (< (+ (select .cse5 .cse7) 1) v_ArrVal_688)))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse9 .cse7)))))) is different from false [2022-11-15 13:37:40,991 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_688 Int) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_683 Int) (v_ArrVal_694 Int) (v_ArrVal_692 Int) (v_ArrVal_690 Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_683)) (.cse7 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse0 .cse7 v_ArrVal_686) .cse1 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse6 (select .cse9 |c_~#queue~0.base|))) (let ((.cse5 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690)) (.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse5 .cse8 v_ArrVal_692) .cse3 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_688) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse4 .cse1))) (< (+ (select .cse5 .cse3) 1) v_ArrVal_694) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse6 .cse3))) (< (+ (select .cse0 .cse7) 1) v_ArrVal_686) (< (+ (select .cse5 .cse8) 1) v_ArrVal_692) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse8) 2147483647))))))))) is different from false [2022-11-15 13:37:56,165 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_688 Int) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_683 Int) (v_ArrVal_694 Int) (v_ArrVal_692 Int) (v_ArrVal_690 Int)) (let ((.cse8 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_682))) (let ((.cse5 (select .cse8 |c_~#queue~0.base|))) (let ((.cse6 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_683)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse7 (store (store .cse8 |c_~#queue~0.base| (store (store .cse6 .cse4 v_ArrVal_686) .cse1 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse3 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_692) .cse1 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse2 .cse1))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_692) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse5 .cse1))) (< (+ (select .cse6 .cse4) 1) v_ArrVal_686) (< (+ (select .cse6 .cse1) 1) v_ArrVal_688) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse4) 2147483647) (< (+ (select .cse3 .cse1) 1) v_ArrVal_694)))))))))) is different from false [2022-11-15 13:37:56,491 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_688 Int) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_683 Int) (v_ArrVal_694 Int) (v_ArrVal_692 Int) (v_ArrVal_680 Int) (v_ArrVal_690 Int)) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_680)) |c_~#stored_elements~0.base| v_ArrVal_682))) (let ((.cse5 (select .cse8 |c_~#queue~0.base|))) (let ((.cse2 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_683)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse7 (store (store .cse8 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_686) .cse3 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690))) (let ((.cse4 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_692) .cse3 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_692) (< (+ (select .cse2 .cse3) 1) v_ArrVal_688) (< (+ (select .cse0 .cse3) 1) v_ArrVal_694) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse4 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse5 .cse3))) (not (<= v_ArrVal_680 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_686) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse6 .cse3)))))))))))) is different from false [2022-11-15 13:37:56,637 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_688 Int) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_683 Int) (v_ArrVal_694 Int) (v_ArrVal_692 Int) (v_ArrVal_680 Int) (v_ArrVal_690 Int)) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_680)) |c_~#stored_elements~0.base| v_ArrVal_682))) (let ((.cse5 (select .cse8 |c_~#queue~0.base|))) (let ((.cse2 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_683)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse7 (store (store .cse8 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_686) .cse3 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690))) (let ((.cse4 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_692) .cse3 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_692) (< (+ (select .cse2 .cse3) 1) v_ArrVal_688) (< (+ (select .cse0 .cse3) 1) v_ArrVal_694) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse4 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse5 .cse3))) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_680) (< (+ (select .cse2 .cse1) 1) v_ArrVal_686) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse6 .cse3)))))))))))) is different from false [2022-11-15 13:38:01,361 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_679 Int) (v_ArrVal_688 Int) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_683 Int) (v_ArrVal_694 Int) (v_ArrVal_692 Int) (v_ArrVal_680 Int) (v_ArrVal_690 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_679) .cse3 v_ArrVal_680)) |c_~#stored_elements~0.base| v_ArrVal_682))) (let ((.cse8 (select .cse10 |c_~#queue~0.base|))) (let ((.cse4 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_683)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_686) .cse1 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse7 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690))) (let ((.cse0 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_692) .cse1 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_680) (< (+ (select .cse4 .cse1) 1) v_ArrVal_688) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse5) 2147483647) (< (+ (select .cse6 .cse5) 1) v_ArrVal_692) (< (+ (select .cse4 .cse5) 1) v_ArrVal_686) (not (<= v_ArrVal_679 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))) (< (+ (select .cse6 .cse1) 1) v_ArrVal_694) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse7 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse8 .cse1))))))))))))) is different from false [2022-11-15 13:38:02,220 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_679 Int) (v_ArrVal_688 Int) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_683 Int) (v_ArrVal_694 Int) (v_ArrVal_692 Int) (v_ArrVal_680 Int) (v_ArrVal_690 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse7 v_ArrVal_679) .cse3 v_ArrVal_680)) |c_~#stored_elements~0.base| v_ArrVal_682))) (let ((.cse9 (select .cse11 |c_~#queue~0.base|))) (let ((.cse4 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_683)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_686) .cse1 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse8 (select .cse10 |c_~#queue~0.base|))) (let ((.cse6 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690))) (let ((.cse0 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_692) .cse1 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_680) (< (+ (select .cse4 .cse1) 1) v_ArrVal_688) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse5) 2147483647) (< (+ (select .cse6 .cse5) 1) v_ArrVal_692) (< (+ (select .cse2 .cse7) 1) v_ArrVal_679) (< (+ (select .cse4 .cse5) 1) v_ArrVal_686) (< (+ (select .cse6 .cse1) 1) v_ArrVal_694) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse8 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse9 .cse1))))))))))))) is different from false [2022-11-15 13:38:02,353 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_679 Int) (v_ArrVal_677 Int) (v_ArrVal_688 Int) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_683 Int) (v_ArrVal_694 Int) (v_ArrVal_692 Int) (v_ArrVal_680 Int) (v_ArrVal_690 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_677)) (.cse9 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 .cse9 v_ArrVal_679) .cse8 v_ArrVal_680)) |c_~#stored_elements~0.base| v_ArrVal_682))) (let ((.cse5 (select .cse11 |c_~#queue~0.base|))) (let ((.cse0 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_683)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_686) .cse2 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse6 (select .cse10 |c_~#queue~0.base|))) (let ((.cse4 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690))) (let ((.cse3 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_692) .cse2 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_686) (< (+ (select .cse0 .cse2) 1) v_ArrVal_688) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse3 .cse2))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_692) (< (+ (select .cse4 .cse2) 1) v_ArrVal_694) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse5 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse6 .cse2))) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse1) 2147483647) (< (+ (select .cse7 .cse8) 1) v_ArrVal_680) (< (+ (select .cse7 .cse9) 1) v_ArrVal_679))))))))))) is different from false [2022-11-15 13:38:02,460 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (let ((.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_679 Int) (v_ArrVal_677 Int) (v_ArrVal_688 Int) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_683 Int) (v_ArrVal_694 Int) (v_ArrVal_692 Int) (v_ArrVal_680 Int) (v_ArrVal_690 Int)) (let ((.cse3 (store .cse12 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_677)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_679) .cse7 v_ArrVal_680)) |c_~#stored_elements~0.base| v_ArrVal_682))) (let ((.cse8 (select .cse11 |c_~#queue~0.base|))) (let ((.cse5 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_683)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (+ |c_~#queue~0.offset| 1604))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_686) .cse6 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse9 (select .cse10 |c_~#queue~0.base|))) (let ((.cse0 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690))) (let ((.cse2 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_692) .cse6 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_692) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse1) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_679) (< (+ (select .cse5 .cse6) 1) v_ArrVal_688) (< (+ (select .cse0 .cse6) 1) v_ArrVal_694) (< (+ (select .cse5 .cse1) 1) v_ArrVal_686) (< (+ (select .cse3 .cse7) 1) v_ArrVal_680) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse8 .cse6))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse2 .cse6))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse9 .cse6))))))))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| (select .cse12 .cse7)))))) is different from false [2022-11-15 13:38:02,640 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_679 Int) (v_ArrVal_677 Int) (v_ArrVal_688 Int) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_683 Int) (v_ArrVal_694 Int) (v_ArrVal_692 Int) (v_ArrVal_680 Int) (v_ArrVal_690 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse7 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_677)) (.cse8 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse7 .cse8 v_ArrVal_679) .cse10 v_ArrVal_680)) |c_~#stored_elements~0.base| v_ArrVal_682))) (let ((.cse2 (select .cse12 |c_~#queue~0.base|))) (let ((.cse5 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_683)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_686) .cse3 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse4 (select .cse11 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690))) (let ((.cse6 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_692) .cse3 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_692) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse4 .cse3))) (< (+ (select .cse5 .cse1) 1) v_ArrVal_686) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse6 .cse3))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_694) (< (+ (select .cse7 .cse8) 1) v_ArrVal_679) (< (select (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| (select .cse9 .cse10))) (< (+ (select .cse5 .cse3) 1) v_ArrVal_688) (< (+ (select .cse7 .cse10) 1) v_ArrVal_680)))))))))))) is different from false [2022-11-15 13:38:14,168 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_679 Int) (v_ArrVal_675 (Array Int Int)) (v_ArrVal_677 Int) (v_ArrVal_688 Int) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_683 Int) (v_ArrVal_694 Int) (v_ArrVal_692 Int) (v_ArrVal_680 Int) (v_ArrVal_690 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_675))) (let ((.cse7 (select .cse11 |c_~#queue~0.base|))) (let ((.cse4 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) v_ArrVal_677)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_679) .cse1 v_ArrVal_680)) |c_~#stored_elements~0.base| v_ArrVal_682))) (let ((.cse8 (select .cse10 |c_~#queue~0.base|))) (let ((.cse6 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_683))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_686) .cse1 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse0 (select .cse9 |c_~#queue~0.base|))) (let ((.cse3 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690))) (let ((.cse2 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse3 .cse5 v_ArrVal_692) .cse1 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse2 .cse1))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_694) (< (+ (select .cse4 .cse5) 1) v_ArrVal_679) (< (+ (select .cse6 .cse5) 1) v_ArrVal_686) (< (+ 1 (select .cse6 .cse1)) v_ArrVal_688) (< (+ (select .cse4 .cse1) 1) v_ArrVal_680) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| (select .cse7 .cse1))) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse5) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse8 .cse1))) (< (+ (select .cse3 .cse5) 1) v_ArrVal_692))))))))))))) is different from false [2022-11-15 13:38:15,603 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_679 Int) (v_ArrVal_675 (Array Int Int)) (v_ArrVal_677 Int) (v_ArrVal_688 Int) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_674 Int) (v_ArrVal_683 Int) (v_ArrVal_694 Int) (v_ArrVal_692 Int) (v_ArrVal_680 Int) (v_ArrVal_690 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (let ((.cse11 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_674)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_675))) (let ((.cse3 (select .cse11 |c_~#queue~0.base|))) (let ((.cse2 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) v_ArrVal_677)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_679) .cse4 v_ArrVal_680)) |c_~#stored_elements~0.base| v_ArrVal_682))) (let ((.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse0 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_683))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_686) .cse4 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690))) (let ((.cse5 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse6 .cse1 v_ArrVal_692) .cse4 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_674 0)) (< (+ (select .cse0 .cse1) 1) v_ArrVal_686) (< (+ 1 (select .cse2 .cse1)) v_ArrVal_679) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| (select .cse3 .cse4))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse5 .cse4))) (< (+ (select .cse6 .cse4) 1) v_ArrVal_694) (< (+ (select .cse0 .cse4) 1) v_ArrVal_688) (< (+ (select .cse6 .cse1) 1) v_ArrVal_692) (< (+ (select .cse2 .cse4) 1) v_ArrVal_680) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse7 .cse4))) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse8 .cse4))))))))))))))) is different from false [2022-11-15 13:38:15,644 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 13:38:15,644 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 1481 treesize of output 946 [2022-11-15 13:38:15,682 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 13:38:15,682 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 2026 treesize of output 2014 [2022-11-15 13:38:15,705 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 13:38:15,729 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 1428 treesize of output 1380 [2022-11-15 13:38:15,754 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 1542 treesize of output 1518 [2022-11-15 13:38:15,787 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 709 treesize of output 697 [2022-11-15 13:38:15,885 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 13:38:15,885 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 13:38:17,125 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 13:38:17,125 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 500 treesize of output 516 [2022-11-15 13:38:21,622 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-11-15 13:38:21,622 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 13:38:21,670 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 52 refuted. 26 times theorem prover too weak. 0 trivial. 93 not checked. [2022-11-15 13:38:21,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112210915] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 13:38:21,670 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 13:38:21,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 44, 49] total 135 [2022-11-15 13:38:21,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035128346] [2022-11-15 13:38:21,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 13:38:21,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 136 states [2022-11-15 13:38:21,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 13:38:21,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2022-11-15 13:38:21,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1641, Invalid=11137, Unknown=192, NotChecked=5390, Total=18360 [2022-11-15 13:38:21,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:38:21,676 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 13:38:21,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 136 states, 135 states have (on average 4.362962962962963) internal successors, (589), 136 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 13:38:21,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:38:21,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-15 13:38:21,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-15 13:38:21,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-15 13:38:21,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-15 13:38:21,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2022-11-15 13:38:21,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-15 13:38:21,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-15 13:38:21,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-15 13:38:21,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-11-15 13:38:21,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-11-15 13:38:21,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-11-15 13:38:21,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:39:05,585 WARN L233 SmtUtils]: Spent 6.09s on a formula simplification that was a NOOP. DAG size: 136 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-15 13:39:49,385 WARN L233 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 131 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-15 13:39:49,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:39:49,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-15 13:39:49,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-15 13:39:49,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-15 13:39:49,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-15 13:39:49,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-11-15 13:39:49,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-15 13:39:49,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-15 13:39:49,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-15 13:39:49,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-15 13:39:49,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-15 13:39:49,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-15 13:39:49,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-11-15 13:39:49,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-15 13:39:49,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-15 13:39:49,864 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-15 13:39:49,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 13:39:49,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1624944705, now seen corresponding path program 2 times [2022-11-15 13:39:49,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 13:39:49,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626950594] [2022-11-15 13:39:49,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 13:39:49,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 13:39:49,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 13:39:57,021 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 13:39:57,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 13:39:57,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626950594] [2022-11-15 13:39:57,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626950594] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 13:39:57,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492946937] [2022-11-15 13:39:57,022 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-15 13:39:57,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 13:39:57,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 13:39:57,023 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-15 13:39:57,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-15 13:39:57,205 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-15 13:39:57,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-15 13:39:57,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 119 conjunts are in the unsatisfiable core [2022-11-15 13:39:57,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 13:39:57,381 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-15 13:39:57,382 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 13:39:57,572 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 13:39:57,655 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 13:39:57,955 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 13:39:58,310 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 13:39:58,319 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-15 13:39:58,319 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 13:39:58,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 13:39:58,395 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 13:39:58,675 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 13:39:58,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 13:39:58,783 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 13:39:59,159 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 13:39:59,170 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-15 13:39:59,170 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 13:39:59,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 13:39:59,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 23 treesize of output 22 [2022-11-15 13:39:59,521 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 13:39:59,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 13:39:59,648 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 13:40:00,007 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 13:40:00,017 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-15 13:40:00,018 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 13:40:00,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 13:40:00,112 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 13:40:00,384 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 13:40:00,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 13:40:00,486 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 13:40:00,734 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 13:40:00,741 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-15 13:40:00,742 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 13:40:00,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 13:40:00,817 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 13:40:00,843 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 13:40:00,885 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 13:40:00,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 13:40:01,266 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_828 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1) 400))))) is different from false [2022-11-15 13:40:01,308 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_828 (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|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse0 .cse1))) (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1)))))) is different from false [2022-11-15 13:40:01,328 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_828 (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|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse0 .cse1))) (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1)))))) is different from false [2022-11-15 13:40:01,446 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 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 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_825) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse0 .cse1))) (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1)))))) is different from false [2022-11-15 13:40:01,509 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 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_822)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_825) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse0 .cse1)))))) is different from false [2022-11-15 13:40:01,529 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse0 .cse1))) (forall ((v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 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_69|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_822))) (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_825) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse2 .cse3))))))))) is different from false [2022-11-15 13:40:02,124 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_821 (Array Int Int)) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_825) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse0 .cse1))) (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse2 .cse1)))))))) is different from false [2022-11-15 13:40:02,540 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_821 (Array Int Int)) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 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 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse5 .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.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_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_825) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse2 .cse1))) (not (= 400 (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1)))))))) is different from false [2022-11-15 13:40:02,643 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_821 (Array Int Int)) (v_ArrVal_818 Int) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 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 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse5 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_818) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_825) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse2 .cse1)))))))) is different from false [2022-11-15 13:40:02,766 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_821 (Array Int Int)) (v_ArrVal_818 Int) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 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_816)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse5 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_818) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_825) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse0 .cse1)))))))) is different from false [2022-11-15 13:40:02,802 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| (select .cse0 .cse1))) (forall ((v_ArrVal_821 (Array Int Int)) (v_ArrVal_818 Int) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 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_72|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_816))) (store (store .cse7 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_818) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse6 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_825) .cse3 (+ (select .cse6 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (= 400 (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse4 .cse3))))))))))) is different from false [2022-11-15 13:40:02,856 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int) (v_ArrVal_821 (Array Int Int)) (v_ArrVal_818 Int) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 Int)) (let ((.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604)) (.cse2 (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 .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_816))) (store (store .cse7 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_818) .cse3 (+ (select .cse7 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse6 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_825) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| (select .cse2 .cse3))) (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse4 .cse1))))))))) is different from false [2022-11-15 13:40:03,259 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int) (v_ArrVal_821 (Array Int Int)) (v_ArrVal_814 (Array Int Int)) (v_ArrVal_818 Int) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_814))) (let ((.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_~#queue~0.offset|) v_ArrVal_816))) (store (store .cse8 .cse6 v_ArrVal_818) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse5 .cse6 v_ArrVal_825) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse0 .cse1))) (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse3 .cse1)))))))))) is different from false [2022-11-15 13:40:04,145 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int) (v_ArrVal_818 Int) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_816 Int) (v_ArrVal_825 Int) (v_ArrVal_822 Int) (v_ArrVal_810 Int) (v_ArrVal_821 (Array Int Int)) (v_ArrVal_814 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int 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 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse9 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_810) .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_814))) (let ((.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_~#queue~0.offset|) v_ArrVal_816))) (store (store .cse8 .cse6 v_ArrVal_818) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse5 .cse6 v_ArrVal_825) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse0 .cse1))) (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse3 .cse1)))))))))) is different from false [2022-11-15 13:40:04,325 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int) (v_ArrVal_808 Int) (v_ArrVal_818 Int) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_816 Int) (v_ArrVal_825 Int) (v_ArrVal_822 Int) (v_ArrVal_810 Int) (v_ArrVal_821 (Array Int Int)) (v_ArrVal_814 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int 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_808)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse9 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_810) .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_814))) (let ((.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse3 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_~#queue~0.offset|) v_ArrVal_816))) (store (store .cse8 .cse6 v_ArrVal_818) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse5 .cse6 v_ArrVal_825) .cse1 (+ 1 (select .cse5 .cse1))))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| (select .cse3 .cse1))) (not (= 400 (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1)))))))))) is different from false [2022-11-15 13:40:04,367 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| (select .cse0 .cse1))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int) (v_ArrVal_808 Int) (v_ArrVal_818 Int) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_816 Int) (v_ArrVal_825 Int) (v_ArrVal_822 Int) (v_ArrVal_810 Int) (v_ArrVal_821 (Array Int Int)) (v_ArrVal_814 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse11 (store .cse0 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_808))) (store (store .cse11 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_810) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_814))) (let ((.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse4 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_~#queue~0.offset|) v_ArrVal_816))) (store (store .cse10 .cse8 v_ArrVal_818) .cse3 (+ (select .cse10 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse7 .cse8 v_ArrVal_825) .cse3 (+ (select .cse7 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (= 400 (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| (select .cse4 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse5 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse2 .cse3))))))))))))) is different from false [2022-11-15 13:40:04,456 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (v_ArrVal_808 Int) (v_ArrVal_818 Int) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_816 Int) (v_ArrVal_825 Int) (v_ArrVal_822 Int) (v_ArrVal_810 Int) (v_ArrVal_821 (Array Int Int)) (v_ArrVal_814 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int))) (let ((.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604)) (.cse3 (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 .cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_808))) (store (store .cse11 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_810) .cse4 (+ (select .cse11 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_814))) (let ((.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse0 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_~#queue~0.offset|) v_ArrVal_816))) (store (store .cse10 .cse8 v_ArrVal_818) .cse1 (+ (select .cse10 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse7 .cse8 v_ArrVal_825) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| (select .cse0 .cse1))) (not (= 400 (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| (select .cse3 .cse4))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse5 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse2 .cse1))))))))))) is different from false [2022-11-15 13:40:06,077 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (v_ArrVal_808 Int) (v_ArrVal_818 Int) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_805 Int) (v_ArrVal_816 Int) (v_ArrVal_825 Int) (v_ArrVal_822 Int) (v_ArrVal_810 Int) (v_ArrVal_821 (Array Int Int)) (v_ArrVal_814 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int 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|) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_805)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_807))) (let ((.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse4 (select .cse10 |c_~#queue~0.base|))) (let ((.cse8 (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_808))) (store (store .cse11 .cse7 v_ArrVal_810) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_814))) (let ((.cse0 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_~#queue~0.offset|) v_ArrVal_816))) (store (store .cse9 .cse7 v_ArrVal_818) .cse1 (+ (select .cse9 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse3 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse6 .cse7 v_ArrVal_825) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse2 .cse1))) (not (= 400 (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| (select .cse4 .cse1)))))))))))) is different from false [2022-11-15 13:40:06,099 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 13:40:06,099 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 13:40:06,129 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 13:40:06,130 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 13:40:06,146 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 1789 treesize of output 1725 [2022-11-15 13:40:06,166 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 2155 treesize of output 2135 [2022-11-15 13:40:06,183 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 2072 treesize of output 2024 [2022-11-15 13:40:06,209 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 2059 treesize of output 2027 [2022-11-15 13:40:06,255 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 13:40:07,275 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 13:40:07,276 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 359 treesize of output 343 [2022-11-15 13:40:08,252 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-11-15 13:40:08,252 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 13:40:08,303 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 97 proven. 68 refuted. 4 times theorem prover too weak. 0 trivial. 117 not checked. [2022-11-15 13:40:08,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492946937] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 13:40:08,303 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 13:40:08,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 35, 43] total 122 [2022-11-15 13:40:08,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103259829] [2022-11-15 13:40:08,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 13:40:08,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 122 states [2022-11-15 13:40:08,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 13:40:08,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2022-11-15 13:40:08,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1105, Invalid=9591, Unknown=88, NotChecked=3978, Total=14762 [2022-11-15 13:40:08,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:40:08,310 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 13:40:08,310 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 13:40:08,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:40:08,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-15 13:40:08,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-15 13:40:08,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-15 13:40:08,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-15 13:40:08,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2022-11-15 13:40:08,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-15 13:40:08,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-15 13:40:08,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-15 13:40:08,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-11-15 13:40:08,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-11-15 13:40:08,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-15 13:40:08,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2022-11-15 13:40:08,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:40:58,107 WARN L233 SmtUtils]: Spent 12.27s on a formula simplification that was a NOOP. DAG size: 142 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-15 13:41:22,177 WARN L233 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 136 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-15 13:41:53,737 WARN L233 SmtUtils]: Spent 12.22s on a formula simplification that was a NOOP. DAG size: 145 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-15 13:42:16,761 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int) (v_ArrVal_821 (Array Int Int)) (v_ArrVal_814 (Array Int Int)) (v_ArrVal_818 Int) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 Int)) (let ((.cse7 (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_814))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_~#queue~0.offset|) v_ArrVal_816))) (store (store .cse8 .cse6 v_ArrVal_818) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse5 .cse6 v_ArrVal_825) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse0 .cse1))) (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| (select .cse3 .cse1)))))))))) (forall ((v_ArrVal_821 (Array Int Int)) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 Int)) (let ((.cse12 (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse11 (select .cse12 |c_~#queue~0.base|))) (let ((.cse10 (select (store (store .cse12 |c_~#queue~0.base| (let ((.cse13 (store .cse11 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse13 .cse6 v_ArrVal_825) .cse1 (+ (select .cse13 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse10 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse11 .cse1))) (not (= 400 (select (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1)))))))))) is different from false [2022-11-15 13:42:16,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:42:16,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-15 13:42:16,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-15 13:42:16,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-15 13:42:16,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-15 13:42:16,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-11-15 13:42:16,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-15 13:42:16,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-15 13:42:16,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-15 13:42:16,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-15 13:42:16,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-15 13:42:16,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-15 13:42:16,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-11-15 13:42:16,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-11-15 13:42:16,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-15 13:42:16,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-15 13:42:16,965 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-15 13:42:16,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 13:42:16,966 INFO L85 PathProgramCache]: Analyzing trace with hash 202398260, now seen corresponding path program 2 times [2022-11-15 13:42:16,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 13:42:16,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090564613] [2022-11-15 13:42:16,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 13:42:16,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 13:42:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 13:42:20,738 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 13:42:20,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 13:42:20,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090564613] [2022-11-15 13:42:20,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090564613] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 13:42:20,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433800388] [2022-11-15 13:42:20,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-15 13:42:20,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 13:42:20,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 13:42:20,740 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-15 13:42:20,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-15 13:42:20,900 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-15 13:42:20,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-15 13:42:20,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 106 conjunts are in the unsatisfiable core [2022-11-15 13:42:20,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 13:42:21,028 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-15 13:42:21,028 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 13:42:21,213 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 13:42:21,270 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 13:42:21,526 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 13:42:21,843 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 13:42:21,854 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-15 13:42:21,854 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 13:42:21,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 13:42:21,948 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 13:42:22,170 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 34 treesize of output 18 [2022-11-15 13:42:22,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 13:42:22,258 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 13:42:22,530 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 13:42:22,538 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-15 13:42:22,539 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 13:42:22,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 13:42:22,614 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 13:42:22,900 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 34 treesize of output 18 [2022-11-15 13:42:23,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 13:42:23,004 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 13:42:23,283 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 13:42:23,291 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-15 13:42:23,292 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 13:42:23,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 13:42:23,364 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 13:42:23,611 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 34 treesize of output 18 [2022-11-15 13:42:23,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 13:42:23,707 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 13:42:23,902 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 13:42:23,912 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-15 13:42:23,913 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 13:42:23,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 13:42:23,968 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 13:42:23,994 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 13:42:23,999 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 13:42:23,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 13:42:24,433 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_948 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 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|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse0 .cse1))) (not (<= v_ArrVal_948 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))))) is different from false [2022-11-15 13:42:24,462 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_948 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 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|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse0 .cse1))) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_948)))) is different from false [2022-11-15 13:42:24,479 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_948 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_948) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse0 .cse1))))))) is different from false [2022-11-15 13:42:24,936 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_948 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_946 Int) (v_ArrVal_945 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 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_945)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_946) .cse3 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse0 .cse1))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_948))))) is different from false [2022-11-15 13:42:25,180 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (v_ArrVal_948 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_946 Int) (v_ArrVal_945 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_945)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_946) .cse1 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse0 .cse1))) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse2 .cse3))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_948)))))) is different from false [2022-11-15 13:42:34,958 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (v_ArrVal_943 (Array Int Int)) (v_ArrVal_939 Int) (v_ArrVal_937 Int) (v_ArrVal_948 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_946 Int) (v_ArrVal_945 Int) (v_ArrVal_941 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int)) (let ((.cse2 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_937))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_939) .cse3 v_ArrVal_941)) |c_~#stored_elements~0.base| v_ArrVal_943))) (let ((.cse4 (select .cse6 |c_~#queue~0.base|))) (let ((.cse5 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_945)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_946) .cse1 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_941) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse4 .cse1))) (< (+ (select .cse5 .cse1) 1) v_ArrVal_948)))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| (select .cse7 .cse3)))))) is different from false [2022-11-15 13:42:35,046 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_939 Int) (v_ArrVal_937 Int) (v_ArrVal_948 Int) (v_ArrVal_946 Int) (v_ArrVal_945 Int) (v_ArrVal_941 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int) (v_ArrVal_943 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse4 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_937)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_939) .cse3 v_ArrVal_941)) |c_~#stored_elements~0.base| v_ArrVal_943))) (let ((.cse5 (select .cse7 |c_~#queue~0.base|))) (let ((.cse6 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_945)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse6 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_946) .cse1 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| (select .cse2 .cse3))) (< (+ (select .cse4 .cse3) 1) v_ArrVal_941) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse5 .cse1))) (< (+ (select .cse6 .cse1) 1) v_ArrVal_948) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647))))))))) is different from false [2022-11-15 13:42:45,453 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_939 Int) (v_ArrVal_937 Int) (v_ArrVal_948 Int) (v_ArrVal_935 Int) (v_ArrVal_946 Int) (v_ArrVal_945 Int) (v_ArrVal_941 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int) (v_ArrVal_943 (Array Int Int)) (v_ArrVal_936 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int)) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_935)) |c_~#stored_elements~0.base| v_ArrVal_936))) (let ((.cse2 (select .cse8 |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_937)) (.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse6 (store (store .cse8 |c_~#queue~0.base| (store (store .cse0 .cse7 v_ArrVal_939) .cse1 v_ArrVal_941)) |c_~#stored_elements~0.base| v_ArrVal_943))) (let ((.cse3 (select .cse6 |c_~#queue~0.base|))) (let ((.cse4 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_945))) (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse4 .cse7 v_ArrVal_946) .cse1 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_941) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| (select .cse2 .cse1))) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_935) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse3 .cse1))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_948) (< (select (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse5 .cse1)))))))))))) is different from false [2022-11-15 13:42:45,492 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_939 Int) (v_ArrVal_937 Int) (v_ArrVal_948 Int) (v_ArrVal_935 Int) (v_ArrVal_946 Int) (v_ArrVal_945 Int) (v_ArrVal_941 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int) (v_ArrVal_943 (Array Int Int)) (v_ArrVal_936 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_935)) |c_~#stored_elements~0.base| v_ArrVal_936))) (let ((.cse4 (select .cse10 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_937)) (.cse9 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse8 (store (store .cse10 |c_~#queue~0.base| (store (store .cse0 .cse9 v_ArrVal_939) .cse1 v_ArrVal_941)) |c_~#stored_elements~0.base| v_ArrVal_943))) (let ((.cse5 (select .cse8 |c_~#queue~0.base|))) (let ((.cse6 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_945))) (let ((.cse7 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse6 .cse9 v_ArrVal_946) .cse1 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_941) (< (+ (select .cse2 .cse3) 1) v_ArrVal_935) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| (select .cse4 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse5 .cse1))) (< (+ (select .cse6 .cse1) 1) v_ArrVal_948) (< (select (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse7 .cse1))))))))))))) is different from false [2022-11-15 13:42:45,714 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_939 Int) (v_ArrVal_937 Int) (v_ArrVal_948 Int) (v_ArrVal_935 Int) (v_ArrVal_946 Int) (v_ArrVal_945 Int) (v_ArrVal_933 Int) (v_ArrVal_941 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int) (v_ArrVal_943 (Array Int Int)) (v_ArrVal_936 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_933) .cse4 v_ArrVal_935)) |c_~#stored_elements~0.base| v_ArrVal_936))) (let ((.cse5 (select .cse10 |c_~#queue~0.base|))) (let ((.cse7 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_937)) (.cse9 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse8 (store (store .cse10 |c_~#queue~0.base| (store (store .cse7 .cse9 v_ArrVal_939) .cse1 v_ArrVal_941)) |c_~#stored_elements~0.base| v_ArrVal_943))) (let ((.cse6 (select .cse8 |c_~#queue~0.base|))) (let ((.cse2 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_945))) (let ((.cse0 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse2 .cse9 v_ArrVal_946) .cse1 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647) (< (+ (select .cse2 .cse1) 1) v_ArrVal_948) (< (+ (select .cse3 .cse4) 1) v_ArrVal_935) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| (select .cse5 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse6 .cse1))) (< (+ (select .cse7 .cse1) 1) v_ArrVal_941))))))))))) is different from false [2022-11-15 13:42:46,004 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_939 Int) (v_ArrVal_937 Int) (v_ArrVal_948 Int) (v_ArrVal_935 Int) (v_ArrVal_946 Int) (v_ArrVal_945 Int) (v_ArrVal_933 Int) (v_ArrVal_931 Int) (v_ArrVal_941 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int) (v_ArrVal_943 (Array Int Int)) (v_ArrVal_936 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int)) (let ((.cse4 (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_931)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_933) .cse5 v_ArrVal_935)) |c_~#stored_elements~0.base| v_ArrVal_936))) (let ((.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse3 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_937)) (.cse9 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse8 (store (store .cse10 |c_~#queue~0.base| (store (store .cse3 .cse9 v_ArrVal_939) .cse1 v_ArrVal_941)) |c_~#stored_elements~0.base| v_ArrVal_943))) (let ((.cse6 (select .cse8 |c_~#queue~0.base|))) (let ((.cse2 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_945))) (let ((.cse0 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse2 .cse9 v_ArrVal_946) .cse1 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_948) (< (+ (select .cse3 .cse1) 1) v_ArrVal_941) (< (+ (select .cse4 .cse5) 1) v_ArrVal_935) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse6 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| (select .cse7 .cse1))))))))))))) is different from false [2022-11-15 13:42:46,071 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88| (select .cse0 .cse1))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_939 Int) (v_ArrVal_937 Int) (v_ArrVal_948 Int) (v_ArrVal_935 Int) (v_ArrVal_946 Int) (v_ArrVal_945 Int) (v_ArrVal_933 Int) (v_ArrVal_931 Int) (v_ArrVal_941 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int) (v_ArrVal_943 (Array Int Int)) (v_ArrVal_936 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int)) (let ((.cse7 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_931))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_933) .cse1 v_ArrVal_935)) |c_~#stored_elements~0.base| v_ArrVal_936))) (let ((.cse8 (select .cse11 |c_~#queue~0.base|))) (let ((.cse2 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_937)) (.cse10 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse9 (store (store .cse11 |c_~#queue~0.base| (store (store .cse2 .cse10 v_ArrVal_939) .cse3 v_ArrVal_941)) |c_~#stored_elements~0.base| v_ArrVal_943))) (let ((.cse5 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_945))) (let ((.cse4 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse6 .cse10 v_ArrVal_946) .cse3 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|))) (or (< (+ (select .cse2 .cse3) 1) v_ArrVal_941) (< (select (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse5 .cse3))) (< (+ (select .cse6 .cse3) 1) v_ArrVal_948) (< (+ (select .cse7 .cse1) 1) v_ArrVal_935) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| (select .cse8 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse4 .cse3)))))))))))))))) is different from false [2022-11-15 13:42:46,188 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_939 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88| Int) (v_ArrVal_937 Int) (v_ArrVal_948 Int) (v_ArrVal_935 Int) (v_ArrVal_946 Int) (v_ArrVal_945 Int) (v_ArrVal_933 Int) (v_ArrVal_931 Int) (v_ArrVal_941 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int) (v_ArrVal_943 (Array Int Int)) (v_ArrVal_936 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse8 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_931)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse8 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_933) .cse3 v_ArrVal_935)) |c_~#stored_elements~0.base| v_ArrVal_936))) (let ((.cse5 (select .cse11 |c_~#queue~0.base|))) (let ((.cse7 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_937)) (.cse10 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse9 (store (store .cse11 |c_~#queue~0.base| (store (store .cse7 .cse10 v_ArrVal_939) .cse1 v_ArrVal_941)) |c_~#stored_elements~0.base| v_ArrVal_943))) (let ((.cse4 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_945))) (let ((.cse0 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse6 .cse10 v_ArrVal_946) .cse1 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse4 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| (select .cse5 .cse1))) (< (+ (select .cse6 .cse1) 1) v_ArrVal_948) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647) (< (+ (select .cse7 .cse1) 1) v_ArrVal_941) (< (+ (select .cse8 .cse3) 1) v_ArrVal_935)))))))))))) is different from false [2022-11-15 13:42:55,878 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_939 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88| Int) (v_ArrVal_937 Int) (v_ArrVal_948 Int) (v_ArrVal_935 Int) (v_ArrVal_946 Int) (v_ArrVal_945 Int) (v_ArrVal_933 Int) (v_ArrVal_931 Int) (v_ArrVal_941 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int) (v_ArrVal_943 (Array Int Int)) (v_ArrVal_936 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_929 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_929))) (let ((.cse7 (select .cse11 |c_~#queue~0.base|))) (let ((.cse2 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88|) |c_~#queue~0.offset|) v_ArrVal_931)) (.cse9 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store (store .cse2 .cse9 v_ArrVal_933) .cse1 v_ArrVal_935)) |c_~#stored_elements~0.base| v_ArrVal_936))) (let ((.cse6 (select .cse10 |c_~#queue~0.base|))) (let ((.cse0 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_937))) (let ((.cse8 (store (store .cse10 |c_~#queue~0.base| (store (store .cse0 .cse9 v_ArrVal_939) .cse1 v_ArrVal_941)) |c_~#stored_elements~0.base| v_ArrVal_943))) (let ((.cse4 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_945))) (let ((.cse3 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse5 .cse9 v_ArrVal_946) .cse1 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_941) (< (+ (select .cse2 .cse1) 1) v_ArrVal_935) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse4 .cse1))) (< (+ (select .cse5 .cse1) 1) v_ArrVal_948) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| (select .cse6 .cse1))) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88| (select .cse7 .cse1))))))))))))))) is different from false [2022-11-15 13:43:02,067 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 13:43:02,068 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 1201 treesize of output 771 [2022-11-15 13:43:02,102 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 13:43:02,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 1543 treesize of output 1539 [2022-11-15 13:43:02,120 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 938 treesize of output 874 [2022-11-15 13:43:02,139 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 1081 treesize of output 1049 [2022-11-15 13:43:02,162 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 514 treesize of output 506 [2022-11-15 13:43:02,188 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 998 treesize of output 982 [2022-11-15 13:43:02,221 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 13:43:02,528 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 13:43:02,528 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 560 treesize of output 556 [2022-11-15 13:43:04,083 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-11-15 13:43:04,083 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 13:43:04,139 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 78 refuted. 30 times theorem prover too weak. 0 trivial. 93 not checked. [2022-11-15 13:43:04,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433800388] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 13:43:04,140 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 13:43:04,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 43] total 110 [2022-11-15 13:43:04,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95822573] [2022-11-15 13:43:04,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 13:43:04,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 111 states [2022-11-15 13:43:04,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 13:43:04,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2022-11-15 13:43:04,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1265, Invalid=7918, Unknown=185, NotChecked=2842, Total=12210 [2022-11-15 13:43:04,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:43:04,145 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 13:43:04,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 111 states, 110 states have (on average 5.627272727272727) internal successors, (619), 111 states have internal predecessors, (619), 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 13:43:04,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:43:04,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-15 13:43:04,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-15 13:43:04,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-15 13:43:04,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-15 13:43:04,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2022-11-15 13:43:04,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-15 13:43:04,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-15 13:43:04,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-15 13:43:04,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-11-15 13:43:04,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-15 13:43:04,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-15 13:43:04,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2022-11-15 13:43:04,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2022-11-15 13:43:04,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 13:47:57,458 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_821 (Array Int Int)) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse4 .cse5 v_ArrVal_825) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse0 .cse1))) (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse2 .cse1)))))))) (forall ((v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_828 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse6 .cse1))) (not (= (select (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1) 400))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int) (v_ArrVal_821 (Array Int Int)) (v_ArrVal_814 (Array Int Int)) (v_ArrVal_818 Int) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 Int)) (let ((.cse12 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_814))) (let ((.cse8 (select .cse12 |c_~#queue~0.base|))) (let ((.cse10 (store (store .cse12 |c_~#queue~0.base| (let ((.cse13 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_~#queue~0.offset|) v_ArrVal_816))) (store (store .cse13 .cse5 v_ArrVal_818) .cse1 (+ (select .cse13 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse9 (select .cse10 |c_~#queue~0.base|))) (let ((.cse7 (select (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse11 .cse5 v_ArrVal_825) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse7 .cse1))) (not (= 400 (select (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| (select .cse8 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse9 .cse1)))))))))))) is different from false Received shutdown request... [2022-11-15 13:48:47,350 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 13:48:47,350 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 13:48:47,350 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-15 13:48:47,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-11-15 13:48:47,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-15 13:48:47,625 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 175 known predicates. [2022-11-15 13:48:47,626 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2022-11-15 13:48:47,627 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2022-11-15 13:48:47,627 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2022-11-15 13:48:47,627 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2022-11-15 13:48:47,627 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2022-11-15 13:48:47,627 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2022-11-15 13:48:47,636 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-15 13:48:47,638 INFO L307 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork0 was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/3) [2022-11-15 13:48:47,639 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-15 13:48:47,640 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-15 13:48:47,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 01:48:47 BasicIcfg [2022-11-15 13:48:47,642 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-15 13:48:47,642 INFO L158 Benchmark]: Toolchain (without parser) took 828976.98ms. Allocated memory was 194.0MB in the beginning and 795.9MB in the end (delta: 601.9MB). Free memory was 163.9MB in the beginning and 370.7MB in the end (delta: -206.8MB). Peak memory consumption was 395.1MB. Max. memory is 8.0GB. [2022-11-15 13:48:47,642 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 194.0MB. Free memory was 151.3MB in the beginning and 151.2MB in the end (delta: 122.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-11-15 13:48:47,642 INFO L158 Benchmark]: CACSL2BoogieTranslator took 575.39ms. Allocated memory was 194.0MB in the beginning and 293.6MB in the end (delta: 99.6MB). Free memory was 163.9MB in the beginning and 242.8MB in the end (delta: -78.9MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-11-15 13:48:47,643 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.48ms. Allocated memory is still 293.6MB. Free memory was 242.8MB in the beginning and 239.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-11-15 13:48:47,643 INFO L158 Benchmark]: Boogie Preprocessor took 28.50ms. Allocated memory is still 293.6MB. Free memory was 239.6MB in the beginning and 237.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-11-15 13:48:47,643 INFO L158 Benchmark]: RCFGBuilder took 548.47ms. Allocated memory is still 293.6MB. Free memory was 237.5MB in the beginning and 215.0MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-11-15 13:48:47,643 INFO L158 Benchmark]: TraceAbstraction took 827773.35ms. Allocated memory was 293.6MB in the beginning and 795.9MB in the end (delta: 502.3MB). Free memory was 214.5MB in the beginning and 370.7MB in the end (delta: -156.2MB). Peak memory consumption was 347.1MB. Max. memory is 8.0GB. [2022-11-15 13:48:47,644 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 194.0MB. Free memory was 151.3MB in the beginning and 151.2MB in the end (delta: 122.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 575.39ms. Allocated memory was 194.0MB in the beginning and 293.6MB in the end (delta: 99.6MB). Free memory was 163.9MB in the beginning and 242.8MB in the end (delta: -78.9MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.48ms. Allocated memory is still 293.6MB. Free memory was 242.8MB in the beginning and 239.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.50ms. Allocated memory is still 293.6MB. Free memory was 239.6MB in the beginning and 237.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 548.47ms. Allocated memory is still 293.6MB. Free memory was 237.5MB in the beginning and 215.0MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 827773.35ms. Allocated memory was 293.6MB in the beginning and 795.9MB in the end (delta: 502.3MB). Free memory was 214.5MB in the beginning and 370.7MB in the end (delta: -156.2MB). Peak memory consumption was 347.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 91113, independent: 90655, independent conditional: 1552, independent unconditional: 89103, dependent: 458, dependent conditional: 224, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90889, independent: 90655, independent conditional: 0, independent unconditional: 90655, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 10214, independent: 10189, independent conditional: 0, independent unconditional: 10189, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 90889, independent: 80466, independent conditional: 0, independent unconditional: 80466, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 10214, unknown conditional: 0, unknown unconditional: 10214] , 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: 91113, independent: 90655, independent conditional: 1552, independent unconditional: 89103, dependent: 458, dependent conditional: 224, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90889, independent: 90655, independent conditional: 0, independent unconditional: 90655, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 10214, independent: 10189, independent conditional: 0, independent unconditional: 10189, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 90889, independent: 80466, independent conditional: 0, independent unconditional: 80466, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 10214, unknown conditional: 0, unknown unconditional: 10214] , 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: 5005, independent: 4986, independent conditional: 43, independent unconditional: 4943, dependent: 19, dependent conditional: 6, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 91113, independent: 90655, independent conditional: 1552, independent unconditional: 89103, dependent: 458, dependent conditional: 224, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90889, independent: 90655, independent conditional: 0, independent unconditional: 90655, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 10214, independent: 10189, independent conditional: 0, independent unconditional: 10189, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 90889, independent: 80466, independent conditional: 0, independent unconditional: 80466, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 10214, unknown conditional: 0, unknown unconditional: 10214] , Statistics on independence cache: Total cache size (in pairs): 6134, Positive cache size: 6121, Positive conditional cache size: 0, Positive unconditional cache size: 6121, 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: 12, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 5452, independent: 5431, independent conditional: 64, independent unconditional: 5367, dependent: 21, dependent conditional: 8, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 91113, independent: 90655, independent conditional: 1552, independent unconditional: 89103, dependent: 458, dependent conditional: 224, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90889, independent: 90655, independent conditional: 0, independent unconditional: 90655, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 10214, independent: 10189, independent conditional: 0, independent unconditional: 10189, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 90889, independent: 80466, independent conditional: 0, independent unconditional: 80466, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 10214, unknown conditional: 0, unknown unconditional: 10214] , Statistics on independence cache: Total cache size (in pairs): 7363, Positive cache size: 7348, Positive conditional cache size: 0, Positive unconditional cache size: 7348, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 20, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 4406, independent: 4389, independent conditional: 37, independent unconditional: 4352, dependent: 17, dependent conditional: 6, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 91113, independent: 90655, independent conditional: 1552, independent unconditional: 89103, dependent: 458, dependent conditional: 224, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90889, independent: 90655, independent conditional: 0, independent unconditional: 90655, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 10214, independent: 10189, independent conditional: 0, independent unconditional: 10189, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 90889, independent: 80466, independent conditional: 0, independent unconditional: 80466, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 10214, unknown conditional: 0, unknown unconditional: 10214] , Statistics on independence cache: Total cache size (in pairs): 8268, Positive cache size: 8251, Positive conditional cache size: 0, Positive unconditional cache size: 8251, 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: 26, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 6224, independent: 6197, independent conditional: 72, 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: 91113, independent: 90655, independent conditional: 1552, independent unconditional: 89103, dependent: 458, dependent conditional: 224, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90889, independent: 90655, independent conditional: 0, independent unconditional: 90655, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 10214, independent: 10189, independent conditional: 0, independent unconditional: 10189, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 90889, independent: 80466, independent conditional: 0, independent unconditional: 80466, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 10214, unknown conditional: 0, unknown unconditional: 10214] , Statistics on independence cache: Total cache size (in pairs): 9242, Positive cache size: 9221, Positive conditional cache size: 0, Positive unconditional cache size: 9221, 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: 36, Statistics for Abstraction: - StatisticsResult: Independence relation #7 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 6227, independent: 6199, independent conditional: 74, independent unconditional: 6125, dependent: 28, dependent conditional: 11, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 91113, independent: 90655, independent conditional: 1552, independent unconditional: 89103, dependent: 458, dependent conditional: 224, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90889, independent: 90655, independent conditional: 0, independent unconditional: 90655, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 10214, independent: 10189, independent conditional: 0, independent unconditional: 10189, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 90889, independent: 80466, independent conditional: 0, independent unconditional: 80466, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 10214, unknown conditional: 0, unknown unconditional: 10214] , Statistics on independence cache: Total cache size (in pairs): 9242, Positive cache size: 9221, Positive conditional cache size: 0, Positive unconditional cache size: 9221, 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: 47, Statistics for Abstraction: - StatisticsResult: Independence relation #8 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 6415, independent: 6383, independent conditional: 91, independent unconditional: 6292, dependent: 32, dependent conditional: 13, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 91113, independent: 90655, independent conditional: 1552, independent unconditional: 89103, dependent: 458, dependent conditional: 224, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90889, independent: 90655, independent conditional: 0, independent unconditional: 90655, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 10214, independent: 10189, independent conditional: 0, independent unconditional: 10189, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 90889, independent: 80466, independent conditional: 0, independent unconditional: 80466, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 10214, unknown conditional: 0, unknown unconditional: 10214] , Statistics on independence cache: Total cache size (in pairs): 10214, Positive cache size: 10189, Positive conditional cache size: 0, Positive unconditional cache size: 10189, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 60, Statistics for Abstraction: - StatisticsResult: Independence relation #9 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 6418, independent: 6385, independent conditional: 93, independent unconditional: 6292, dependent: 33, dependent conditional: 14, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 91113, independent: 90655, independent conditional: 1552, independent unconditional: 89103, dependent: 458, dependent conditional: 224, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90889, independent: 90655, independent conditional: 0, independent unconditional: 90655, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 10214, independent: 10189, independent conditional: 0, independent unconditional: 10189, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 90889, independent: 80466, independent conditional: 0, independent unconditional: 80466, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 10214, unknown conditional: 0, unknown unconditional: 10214] , Statistics on independence cache: Total cache size (in pairs): 10214, Positive cache size: 10189, Positive conditional cache size: 0, Positive unconditional cache size: 10189, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 74, Statistics for Abstraction: - StatisticsResult: Independence relation #10 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 6438, independent: 6404, independent conditional: 112, independent unconditional: 6292, dependent: 34, dependent conditional: 15, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 91113, independent: 90655, independent conditional: 1552, independent unconditional: 89103, dependent: 458, dependent conditional: 224, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90889, independent: 90655, independent conditional: 0, independent unconditional: 90655, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 10214, independent: 10189, independent conditional: 0, independent unconditional: 10189, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 90889, independent: 80466, independent conditional: 0, independent unconditional: 80466, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 10214, unknown conditional: 0, unknown unconditional: 10214] , Statistics on independence cache: Total cache size (in pairs): 10214, Positive cache size: 10189, Positive conditional cache size: 0, Positive unconditional cache size: 10189, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 89, Statistics for Abstraction: - StatisticsResult: Independence relation #11 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 6240, independent: 6210, independent conditional: 85, independent unconditional: 6125, dependent: 30, dependent conditional: 13, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 91113, independent: 90655, independent conditional: 1552, independent unconditional: 89103, dependent: 458, dependent conditional: 224, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90889, independent: 90655, independent conditional: 0, independent unconditional: 90655, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 10214, independent: 10189, independent conditional: 0, independent unconditional: 10189, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 90889, independent: 80466, independent conditional: 0, independent unconditional: 80466, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 10214, unknown conditional: 0, unknown unconditional: 10214] , Statistics on independence cache: Total cache size (in pairs): 10214, Positive cache size: 10189, Positive conditional cache size: 0, Positive unconditional cache size: 10189, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 102, Statistics for Abstraction: - StatisticsResult: Independence relation #12 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 6243, independent: 6212, independent conditional: 87, independent unconditional: 6125, dependent: 31, dependent conditional: 14, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 91113, independent: 90655, independent conditional: 1552, independent unconditional: 89103, dependent: 458, dependent conditional: 224, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90889, independent: 90655, independent conditional: 0, independent unconditional: 90655, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 10214, independent: 10189, independent conditional: 0, independent unconditional: 10189, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 90889, independent: 80466, independent conditional: 0, independent unconditional: 80466, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 10214, unknown conditional: 0, unknown unconditional: 10214] , Statistics on independence cache: Total cache size (in pairs): 10214, Positive cache size: 10189, Positive conditional cache size: 0, Positive unconditional cache size: 10189, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 116, Statistics for Abstraction: - StatisticsResult: Independence relation #13 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 6334, independent: 6293, independent conditional: 168, independent unconditional: 6125, dependent: 41, dependent conditional: 24, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 91113, independent: 90655, independent conditional: 1552, independent unconditional: 89103, dependent: 458, dependent conditional: 224, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90889, independent: 90655, independent conditional: 0, independent unconditional: 90655, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 10214, independent: 10189, independent conditional: 0, independent unconditional: 10189, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 90889, independent: 80466, independent conditional: 0, independent unconditional: 80466, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 10214, unknown conditional: 0, unknown unconditional: 10214] , Statistics on independence cache: Total cache size (in pairs): 10214, Positive cache size: 10189, Positive conditional cache size: 0, Positive unconditional cache size: 10189, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 140, Statistics for Abstraction: - StatisticsResult: Independence relation #14 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 6548, independent: 6500, independent conditional: 208, independent unconditional: 6292, dependent: 48, dependent conditional: 29, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 91113, independent: 90655, independent conditional: 1552, independent unconditional: 89103, dependent: 458, dependent conditional: 224, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90889, independent: 90655, independent conditional: 0, independent unconditional: 90655, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 10214, independent: 10189, independent conditional: 0, independent unconditional: 10189, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 90889, independent: 80466, independent conditional: 0, independent unconditional: 80466, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 10214, unknown conditional: 0, unknown unconditional: 10214] , Statistics on independence cache: Total cache size (in pairs): 10214, Positive cache size: 10189, Positive conditional cache size: 0, Positive unconditional cache size: 10189, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 169, Statistics for Abstraction: - StatisticsResult: Independence relation #15 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 6350, independent: 6306, independent conditional: 181, independent unconditional: 6125, dependent: 44, dependent conditional: 27, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 91113, independent: 90655, independent conditional: 1552, independent unconditional: 89103, dependent: 458, dependent conditional: 224, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90889, independent: 90655, independent conditional: 0, independent unconditional: 90655, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 10214, independent: 10189, independent conditional: 0, independent unconditional: 10189, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 90889, independent: 80466, independent conditional: 0, independent unconditional: 80466, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 10214, unknown conditional: 0, unknown unconditional: 10214] , Statistics on independence cache: Total cache size (in pairs): 10214, Positive cache size: 10189, Positive conditional cache size: 0, Positive unconditional cache size: 10189, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 196, Statistics for Abstraction: - StatisticsResult: Independence relation #16 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 6356, independent: 6311, independent conditional: 186, independent unconditional: 6125, dependent: 45, dependent conditional: 28, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 91113, independent: 90655, independent conditional: 1552, independent unconditional: 89103, dependent: 458, dependent conditional: 224, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90889, independent: 90655, independent conditional: 0, independent unconditional: 90655, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 10214, independent: 10189, independent conditional: 0, independent unconditional: 10189, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 90889, independent: 80466, independent conditional: 0, independent unconditional: 80466, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 10214, unknown conditional: 0, unknown unconditional: 10214] , Statistics on independence cache: Total cache size (in pairs): 10214, Positive cache size: 10189, Positive conditional cache size: 0, Positive unconditional cache size: 10189, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 224, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.3s, 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: 91113, independent: 90655, independent conditional: 1552, independent unconditional: 89103, dependent: 458, dependent conditional: 224, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90889, independent: 90655, independent conditional: 0, independent unconditional: 90655, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 10214, independent: 10189, independent conditional: 0, independent unconditional: 10189, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 90889, independent: 80466, independent conditional: 0, independent unconditional: 80466, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 10214, unknown conditional: 0, unknown unconditional: 10214] , 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: 91113, independent: 90655, independent conditional: 1552, independent unconditional: 89103, dependent: 458, dependent conditional: 224, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90889, independent: 90655, independent conditional: 0, independent unconditional: 90655, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 10214, independent: 10189, independent conditional: 0, independent unconditional: 10189, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 90889, independent: 80466, independent conditional: 0, independent unconditional: 80466, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 10214, unknown conditional: 0, unknown unconditional: 10214] , 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: 102, Number of trivial persistent sets: 70, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 5005, independent: 4986, independent conditional: 43, independent unconditional: 4943, dependent: 19, dependent conditional: 6, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 91113, independent: 90655, independent conditional: 1552, independent unconditional: 89103, dependent: 458, dependent conditional: 224, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90889, independent: 90655, independent conditional: 0, independent unconditional: 90655, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 10214, independent: 10189, independent conditional: 0, independent unconditional: 10189, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 90889, independent: 80466, independent conditional: 0, independent unconditional: 80466, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 10214, unknown conditional: 0, unknown unconditional: 10214] , Statistics on independence cache: Total cache size (in pairs): 6134, Positive cache size: 6121, Positive conditional cache size: 0, Positive unconditional cache size: 6121, 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: 12, 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: 5452, independent: 5431, independent conditional: 64, independent unconditional: 5367, dependent: 21, dependent conditional: 8, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 91113, independent: 90655, independent conditional: 1552, independent unconditional: 89103, dependent: 458, dependent conditional: 224, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90889, independent: 90655, independent conditional: 0, independent unconditional: 90655, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 10214, independent: 10189, independent conditional: 0, independent unconditional: 10189, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 90889, independent: 80466, independent conditional: 0, independent unconditional: 80466, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 10214, unknown conditional: 0, unknown unconditional: 10214] , Statistics on independence cache: Total cache size (in pairs): 7363, Positive cache size: 7348, Positive conditional cache size: 0, Positive unconditional cache size: 7348, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 20, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 96, Number of trivial persistent sets: 69, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 4406, independent: 4389, independent conditional: 37, independent unconditional: 4352, dependent: 17, dependent conditional: 6, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 91113, independent: 90655, independent conditional: 1552, independent unconditional: 89103, dependent: 458, dependent conditional: 224, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90889, independent: 90655, independent conditional: 0, independent unconditional: 90655, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 10214, independent: 10189, independent conditional: 0, independent unconditional: 10189, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 90889, independent: 80466, independent conditional: 0, independent unconditional: 80466, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 10214, unknown conditional: 0, unknown unconditional: 10214] , Statistics on independence cache: Total cache size (in pairs): 8268, Positive cache size: 8251, Positive conditional cache size: 0, Positive unconditional cache size: 8251, 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: 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: 6224, independent: 6197, independent conditional: 72, 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: 91113, independent: 90655, independent conditional: 1552, independent unconditional: 89103, dependent: 458, dependent conditional: 224, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90889, independent: 90655, independent conditional: 0, independent unconditional: 90655, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 10214, independent: 10189, independent conditional: 0, independent unconditional: 10189, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 90889, independent: 80466, independent conditional: 0, independent unconditional: 80466, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 10214, unknown conditional: 0, unknown unconditional: 10214] , Statistics on independence cache: Total cache size (in pairs): 9242, Positive cache size: 9221, Positive conditional cache size: 0, Positive unconditional cache size: 9221, 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: 36, 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: 6227, independent: 6199, independent conditional: 74, independent unconditional: 6125, dependent: 28, dependent conditional: 11, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 91113, independent: 90655, independent conditional: 1552, independent unconditional: 89103, dependent: 458, dependent conditional: 224, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90889, independent: 90655, independent conditional: 0, independent unconditional: 90655, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 10214, independent: 10189, independent conditional: 0, independent unconditional: 10189, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 90889, independent: 80466, independent conditional: 0, independent unconditional: 80466, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 10214, unknown conditional: 0, unknown unconditional: 10214] , Statistics on independence cache: Total cache size (in pairs): 9242, Positive cache size: 9221, Positive conditional cache size: 0, Positive unconditional cache size: 9221, 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: 47, 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: 6415, independent: 6383, independent conditional: 91, independent unconditional: 6292, dependent: 32, dependent conditional: 13, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 91113, independent: 90655, independent conditional: 1552, independent unconditional: 89103, dependent: 458, dependent conditional: 224, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90889, independent: 90655, independent conditional: 0, independent unconditional: 90655, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 10214, independent: 10189, independent conditional: 0, independent unconditional: 10189, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 90889, independent: 80466, independent conditional: 0, independent unconditional: 80466, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 10214, unknown conditional: 0, unknown unconditional: 10214] , Statistics on independence cache: Total cache size (in pairs): 10214, Positive cache size: 10189, Positive conditional cache size: 0, Positive unconditional cache size: 10189, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 60, 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: 6418, independent: 6385, independent conditional: 93, independent unconditional: 6292, dependent: 33, dependent conditional: 14, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 91113, independent: 90655, independent conditional: 1552, independent unconditional: 89103, dependent: 458, dependent conditional: 224, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90889, independent: 90655, independent conditional: 0, independent unconditional: 90655, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 10214, independent: 10189, independent conditional: 0, independent unconditional: 10189, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 90889, independent: 80466, independent conditional: 0, independent unconditional: 80466, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 10214, unknown conditional: 0, unknown unconditional: 10214] , Statistics on independence cache: Total cache size (in pairs): 10214, Positive cache size: 10189, Positive conditional cache size: 0, Positive unconditional cache size: 10189, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 74, 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: 6438, independent: 6404, independent conditional: 112, independent unconditional: 6292, dependent: 34, dependent conditional: 15, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 91113, independent: 90655, independent conditional: 1552, independent unconditional: 89103, dependent: 458, dependent conditional: 224, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90889, independent: 90655, independent conditional: 0, independent unconditional: 90655, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 10214, independent: 10189, independent conditional: 0, independent unconditional: 10189, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 90889, independent: 80466, independent conditional: 0, independent unconditional: 80466, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 10214, unknown conditional: 0, unknown unconditional: 10214] , Statistics on independence cache: Total cache size (in pairs): 10214, Positive cache size: 10189, Positive conditional cache size: 0, Positive unconditional cache size: 10189, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 89, 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: 6240, independent: 6210, independent conditional: 85, independent unconditional: 6125, dependent: 30, dependent conditional: 13, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 91113, independent: 90655, independent conditional: 1552, independent unconditional: 89103, dependent: 458, dependent conditional: 224, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90889, independent: 90655, independent conditional: 0, independent unconditional: 90655, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 10214, independent: 10189, independent conditional: 0, independent unconditional: 10189, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 90889, independent: 80466, independent conditional: 0, independent unconditional: 80466, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 10214, unknown conditional: 0, unknown unconditional: 10214] , Statistics on independence cache: Total cache size (in pairs): 10214, Positive cache size: 10189, Positive conditional cache size: 0, Positive unconditional cache size: 10189, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 102, 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: 6243, independent: 6212, independent conditional: 87, independent unconditional: 6125, dependent: 31, dependent conditional: 14, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 91113, independent: 90655, independent conditional: 1552, independent unconditional: 89103, dependent: 458, dependent conditional: 224, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90889, independent: 90655, independent conditional: 0, independent unconditional: 90655, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 10214, independent: 10189, independent conditional: 0, independent unconditional: 10189, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 90889, independent: 80466, independent conditional: 0, independent unconditional: 80466, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 10214, unknown conditional: 0, unknown unconditional: 10214] , Statistics on independence cache: Total cache size (in pairs): 10214, Positive cache size: 10189, Positive conditional cache size: 0, Positive unconditional cache size: 10189, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 116, 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: 6334, independent: 6293, independent conditional: 168, independent unconditional: 6125, dependent: 41, dependent conditional: 24, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 91113, independent: 90655, independent conditional: 1552, independent unconditional: 89103, dependent: 458, dependent conditional: 224, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90889, independent: 90655, independent conditional: 0, independent unconditional: 90655, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 10214, independent: 10189, independent conditional: 0, independent unconditional: 10189, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 90889, independent: 80466, independent conditional: 0, independent unconditional: 80466, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 10214, unknown conditional: 0, unknown unconditional: 10214] , Statistics on independence cache: Total cache size (in pairs): 10214, Positive cache size: 10189, Positive conditional cache size: 0, Positive unconditional cache size: 10189, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 140, 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: 6548, independent: 6500, independent conditional: 208, independent unconditional: 6292, dependent: 48, dependent conditional: 29, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 91113, independent: 90655, independent conditional: 1552, independent unconditional: 89103, dependent: 458, dependent conditional: 224, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90889, independent: 90655, independent conditional: 0, independent unconditional: 90655, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 10214, independent: 10189, independent conditional: 0, independent unconditional: 10189, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 90889, independent: 80466, independent conditional: 0, independent unconditional: 80466, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 10214, unknown conditional: 0, unknown unconditional: 10214] , Statistics on independence cache: Total cache size (in pairs): 10214, Positive cache size: 10189, Positive conditional cache size: 0, Positive unconditional cache size: 10189, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 169, 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: 6350, independent: 6306, independent conditional: 181, independent unconditional: 6125, dependent: 44, dependent conditional: 27, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 91113, independent: 90655, independent conditional: 1552, independent unconditional: 89103, dependent: 458, dependent conditional: 224, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90889, independent: 90655, independent conditional: 0, independent unconditional: 90655, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 10214, independent: 10189, independent conditional: 0, independent unconditional: 10189, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 90889, independent: 80466, independent conditional: 0, independent unconditional: 80466, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 10214, unknown conditional: 0, unknown unconditional: 10214] , Statistics on independence cache: Total cache size (in pairs): 10214, Positive cache size: 10189, Positive conditional cache size: 0, Positive unconditional cache size: 10189, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 196, 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: 6356, independent: 6311, independent conditional: 186, independent unconditional: 6125, dependent: 45, dependent conditional: 28, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 91113, independent: 90655, independent conditional: 1552, independent unconditional: 89103, dependent: 458, dependent conditional: 224, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90889, independent: 90655, independent conditional: 0, independent unconditional: 90655, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 10214, independent: 10189, independent conditional: 0, independent unconditional: 10189, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 90889, independent: 80466, independent conditional: 0, independent unconditional: 80466, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 10214, unknown conditional: 0, unknown unconditional: 10214] , Statistics on independence cache: Total cache size (in pairs): 10214, Positive cache size: 10189, Positive conditional cache size: 0, Positive unconditional cache size: 10189, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 224, Statistics for Abstraction: - TimeoutResultAtElement [Line: 981]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 175 known predicates. - TimeoutResultAtElement [Line: 981]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 175 known predicates. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 175 known predicates. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 175 known predicates. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 175 known predicates. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 175 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t1Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 392 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 827.5s, OverallIterations: 15, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 645.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: 456, 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.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 178.6s InterpolantComputationTime, 3652 NumberOfCodeBlocks, 3652 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 4984 ConstructedInterpolants, 877 QuantifiedInterpolants, 315590 SizeOfPredicates, 263 NumberOfNonLiveVariables, 3386 ConjunctsInSsa, 641 ConjunctsInUnsatCore, 32 InterpolantComputations, 7 PerfectInterpolantSequences, 381/2535 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown