/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_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_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-9868fc6-m [2022-11-14 19:04:26,315 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-14 19:04:26,317 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-14 19:04:26,355 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-14 19:04:26,355 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-14 19:04:26,360 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-14 19:04:26,363 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-14 19:04:26,365 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-14 19:04:26,367 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-14 19:04:26,371 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-14 19:04:26,372 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-14 19:04:26,374 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-14 19:04:26,374 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-14 19:04:26,376 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-14 19:04:26,377 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-14 19:04:26,378 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-14 19:04:26,379 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-14 19:04:26,379 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-14 19:04:26,381 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-14 19:04:26,388 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-14 19:04:26,389 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-14 19:04:26,390 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-14 19:04:26,392 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-14 19:04:26,393 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-14 19:04:26,399 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-14 19:04:26,399 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-14 19:04:26,400 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-14 19:04:26,400 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-14 19:04:26,401 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-14 19:04:26,401 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-14 19:04:26,402 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-14 19:04:26,402 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-14 19:04:26,403 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-14 19:04:26,403 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-14 19:04:26,404 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-14 19:04:26,404 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-14 19:04:26,404 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-14 19:04:26,405 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-14 19:04:26,405 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-14 19:04:26,405 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-14 19:04:26,406 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-14 19:04:26,407 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2022-11-14 19:04:26,444 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-14 19:04:26,445 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-14 19:04:26,445 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-14 19:04:26,445 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-14 19:04:26,446 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-14 19:04:26,446 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-14 19:04:26,447 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-14 19:04:26,447 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-14 19:04:26,447 INFO L138 SettingsManager]: * Use SBE=true [2022-11-14 19:04:26,447 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-14 19:04:26,448 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-14 19:04:26,448 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-14 19:04:26,448 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-14 19:04:26,448 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-14 19:04:26,448 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-14 19:04:26,448 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-14 19:04:26,449 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-14 19:04:26,449 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-14 19:04:26,449 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-14 19:04:26,449 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-14 19:04:26,449 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-14 19:04:26,449 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-14 19:04:26,449 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-14 19:04:26,449 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-14 19:04:26,449 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-14 19:04:26,450 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-14 19:04:26,450 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-14 19:04:26,451 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-14 19:04:26,451 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-14 19:04:26,451 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-14 19:04:26,451 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-14 19:04:26,451 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-14 19:04:26,452 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-14 19:04:26,452 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-14 19:04:26,452 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-14 19:04:26,452 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-14 19:04:26,452 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_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-14 19:04:26,688 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-14 19:04:26,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-14 19:04:26,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-14 19:04:26,717 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-14 19:04:26,718 INFO L275 PluginConnector]: CDTParser initialized [2022-11-14 19:04:26,719 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longest.i [2022-11-14 19:04:26,771 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dde3901c5/524467d30add474c89b01c60d987a6ad/FLAG82353c176 [2022-11-14 19:04:27,216 INFO L306 CDTParser]: Found 1 translation units. [2022-11-14 19:04:27,217 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i [2022-11-14 19:04:27,236 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dde3901c5/524467d30add474c89b01c60d987a6ad/FLAG82353c176 [2022-11-14 19:04:27,552 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dde3901c5/524467d30add474c89b01c60d987a6ad [2022-11-14 19:04:27,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-14 19:04:27,555 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-11-14 19:04:27,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-14 19:04:27,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-14 19:04:27,560 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-14 19:04:27,560 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:04:27" (1/1) ... [2022-11-14 19:04:27,561 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b72988b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:27, skipping insertion in model container [2022-11-14 19:04:27,562 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:04:27" (1/1) ... [2022-11-14 19:04:27,581 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-14 19:04:27,624 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-14 19:04:28,010 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i[43280,43293] [2022-11-14 19:04:28,012 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i[43553,43566] [2022-11-14 19:04:28,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-14 19:04:28,025 INFO L203 MainTranslator]: Completed pre-run [2022-11-14 19:04:28,081 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i[43280,43293] [2022-11-14 19:04:28,083 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i[43553,43566] [2022-11-14 19:04:28,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-14 19:04:28,134 INFO L208 MainTranslator]: Completed translation [2022-11-14 19:04:28,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:28 WrapperNode [2022-11-14 19:04:28,135 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-14 19:04:28,136 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-14 19:04:28,136 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-14 19:04:28,136 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-14 19:04:28,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:28" (1/1) ... [2022-11-14 19:04:28,170 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:28" (1/1) ... [2022-11-14 19:04:28,200 INFO L138 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 216 [2022-11-14 19:04:28,200 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-14 19:04:28,201 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-14 19:04:28,201 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-14 19:04:28,201 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-14 19:04:28,211 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:28" (1/1) ... [2022-11-14 19:04:28,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:28" (1/1) ... [2022-11-14 19:04:28,216 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:28" (1/1) ... [2022-11-14 19:04:28,216 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:28" (1/1) ... [2022-11-14 19:04:28,223 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:28" (1/1) ... [2022-11-14 19:04:28,227 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:28" (1/1) ... [2022-11-14 19:04:28,236 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:28" (1/1) ... [2022-11-14 19:04:28,238 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:28" (1/1) ... [2022-11-14 19:04:28,243 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-14 19:04:28,244 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-14 19:04:28,244 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-14 19:04:28,244 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-14 19:04:28,249 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:28" (1/1) ... [2022-11-14 19:04:28,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-14 19:04:28,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:04:28,283 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-14 19:04:28,287 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-14 19:04:28,324 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-14 19:04:28,324 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-14 19:04:28,325 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-14 19:04:28,325 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-14 19:04:28,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-14 19:04:28,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-14 19:04:28,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-14 19:04:28,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-14 19:04:28,327 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-14 19:04:28,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-14 19:04:28,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-14 19:04:28,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-14 19:04:28,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-14 19:04:28,328 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-14 19:04:28,535 INFO L235 CfgBuilder]: Building ICFG [2022-11-14 19:04:28,537 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-14 19:04:28,927 INFO L276 CfgBuilder]: Performing block encoding [2022-11-14 19:04:28,937 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-14 19:04:28,937 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-14 19:04:28,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:04:28 BoogieIcfgContainer [2022-11-14 19:04:28,939 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-14 19:04:28,941 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-14 19:04:28,941 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-14 19:04:28,954 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-14 19:04:28,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 07:04:27" (1/3) ... [2022-11-14 19:04:28,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8ebabd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:04:28, skipping insertion in model container [2022-11-14 19:04:28,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:28" (2/3) ... [2022-11-14 19:04:28,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8ebabd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:04:28, skipping insertion in model container [2022-11-14 19:04:28,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:04:28" (3/3) ... [2022-11-14 19:04:28,957 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2022-11-14 19:04:28,965 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-14 19:04:28,974 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-14 19:04:28,974 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-11-14 19:04:28,974 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-14 19:04:29,106 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-14 19:04:29,167 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-14 19:04:29,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-14 19:04:29,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:04:29,171 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-14 19:04:29,173 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-14 19:04:29,208 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-14 19:04:29,226 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2022-11-14 19:04:29,232 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@24879b71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-14 19:04:29,233 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-14 19:04:29,441 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-14 19:04:29,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:04:29,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1093845670, now seen corresponding path program 1 times [2022-11-14 19:04:29,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:04:29,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349664344] [2022-11-14 19:04:29,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:04:29,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:04:29,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:04:29,737 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-14 19:04:29,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:04:29,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349664344] [2022-11-14 19:04:29,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349664344] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:04:29,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-14 19:04:29,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-14 19:04:29,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673579495] [2022-11-14 19:04:29,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:04:29,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-14 19:04:29,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:04:29,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-14 19:04:29,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-14 19:04:29,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:29,771 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:04:29,772 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-14 19:04:29,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:29,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:29,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-14 19:04:29,791 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-14 19:04:29,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:04:29,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1891215175, now seen corresponding path program 1 times [2022-11-14 19:04:29,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:04:29,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400285902] [2022-11-14 19:04:29,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:04:29,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:04:29,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:04:40,613 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-14 19:04:40,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:04:40,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400285902] [2022-11-14 19:04:40,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400285902] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:04:40,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-14 19:04:40,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-14 19:04:40,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275942965] [2022-11-14 19:04:40,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:04:40,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-14 19:04:40,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:04:40,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-14 19:04:40,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2022-11-14 19:04:40,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:40,619 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:04:40,619 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-14 19:04:40,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:40,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:45,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:45,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:45,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-14 19:04:45,184 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-14 19:04:45,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:04:45,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1705076601, now seen corresponding path program 1 times [2022-11-14 19:04:45,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:04:45,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684238763] [2022-11-14 19:04:45,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:04:45,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:04:45,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:04:45,281 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-14 19:04:45,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:04:45,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684238763] [2022-11-14 19:04:45,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684238763] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:04:45,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-14 19:04:45,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-14 19:04:45,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169304778] [2022-11-14 19:04:45,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:04:45,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-14 19:04:45,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:04:45,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-14 19:04:45,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-14 19:04:45,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:45,284 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:04:45,284 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-14 19:04:45,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:45,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:45,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:45,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:45,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:45,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:04:45,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-14 19:04:45,347 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-14 19:04:45,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:04:45,347 INFO L85 PathProgramCache]: Analyzing trace with hash -858914285, now seen corresponding path program 1 times [2022-11-14 19:04:45,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:04:45,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817105203] [2022-11-14 19:04:45,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:04:45,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:04:45,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:04:46,568 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-14 19:04:46,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:04:46,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817105203] [2022-11-14 19:04:46,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817105203] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:04:46,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-14 19:04:46,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-14 19:04:46,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971290792] [2022-11-14 19:04:46,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:04:46,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-14 19:04:46,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:04:46,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-14 19:04:46,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-11-14 19:04:46,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:46,571 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:04:46,572 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-14 19:04:46,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:46,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:46,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:04:46,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:47,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:47,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:47,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:04:47,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-14 19:04:47,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-14 19:04:47,084 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-14 19:04:47,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:04:47,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1672081442, now seen corresponding path program 1 times [2022-11-14 19:04:47,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:04:47,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123437127] [2022-11-14 19:04:47,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:04:47,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:04:47,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:04:49,678 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-14 19:04:49,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:04:49,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123437127] [2022-11-14 19:04:49,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123437127] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:04:49,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-14 19:04:49,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-14 19:04:49,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287518627] [2022-11-14 19:04:49,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:04:49,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-14 19:04:49,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:04:49,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-14 19:04:49,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2022-11-14 19:04:49,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:49,681 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:04:49,682 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-14 19:04:49,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:49,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:49,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:04:49,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-14 19:04:49,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:51,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:51,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:51,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:04:51,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:04:51,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:51,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-14 19:04:51,145 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-14 19:04:51,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:04:51,146 INFO L85 PathProgramCache]: Analyzing trace with hash 678632843, now seen corresponding path program 1 times [2022-11-14 19:04:51,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:04:51,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816034287] [2022-11-14 19:04:51,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:04:51,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:04:51,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:04:53,586 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-14 19:04:53,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:04:53,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816034287] [2022-11-14 19:04:53,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816034287] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-14 19:04:53,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155435080] [2022-11-14 19:04:53,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:04:53,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:04:53,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:04:53,591 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-14 19:04:53,592 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-14 19:04:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:04:53,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 71 conjunts are in the unsatisfiable core [2022-11-14 19:04:53,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-14 19:04:53,936 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-14 19:04:53,940 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-14 19:04:54,154 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-14 19:04:54,217 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-14 19:04:54,585 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-14 19:04:55,014 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:04:55,030 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-14 19:04:55,030 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-14 19:04:55,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:04:55,271 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:04:55,272 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-14 19:04:55,685 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-14 19:04:55,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:04:55,798 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-14 19:04:56,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:04:56,038 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:04:56,053 INFO L321 Elim1Store]: treesize reduction 46, result has 27.0 percent of original size [2022-11-14 19:04:56,053 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-14 19:04:56,094 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-14 19:04:56,100 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-14 19:04:56,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-14 19:04:57,692 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|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) 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| 3204)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12|)) v_ArrVal_186) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_182)))) is different from false [2022-11-14 19:04:57,870 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 800) (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 |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_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| 3204)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12|)) v_ArrVal_186) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_182)))))) is different from false [2022-11-14 19:04:57,897 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse2 .cse3))) (or (= 800 .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 (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| (select .cse1 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12|)) v_ArrVal_186) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ .cse0 1) v_ArrVal_182))))))) is different from false [2022-11-14 19:04:58,156 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (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 ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |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 (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12|)) v_ArrVal_186) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem37#1| 1) v_ArrVal_180) (< (+ .cse1 1) v_ArrVal_182) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| (select .cse0 (+ |c_~#queue~0.offset| 3204))))))) (= 800 .cse1)))) is different from false [2022-11-14 19:04:58,345 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 (+ 3208 |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 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (select .cse2 .cse4)) (.cse0 (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 (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (= .cse1 800) (< (+ .cse1 1) v_ArrVal_182) (< (+ (select .cse2 .cse3) 1) v_ArrVal_180) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12|)) v_ArrVal_186) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-14 19:04:59,395 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 ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_178)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse0 .cse1 v_ArrVal_180) .cse4 v_ArrVal_182)) |c_~#stored_elements~0.base| v_ArrVal_184) |c_~#queue~0.base|)) (.cse5 (select .cse0 .cse4))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_180) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12|)) v_ArrVal_186) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse3 .cse4))) (= .cse5 800) (< (+ .cse5 1) v_ArrVal_182)))))) is different from false [2022-11-14 19:05:06,187 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|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_175)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_177))) (let ((.cse4 (select .cse6 |c_~#queue~0.base|))) (let ((.cse5 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_~#queue~0.offset|) v_ArrVal_178)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse1 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse3 v_ArrVal_180) .cse2 v_ArrVal_182)) |c_~#stored_elements~0.base| v_ArrVal_184) |c_~#queue~0.base|)) (.cse0 (select .cse5 .cse2))) (or (< (+ .cse0 1) v_ArrVal_182) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| (select .cse1 .cse2))) (not (<= v_ArrVal_175 0)) (< (select (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12|)) v_ArrVal_186) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse4 .cse2))) (< (+ (select .cse5 .cse3) 1) v_ArrVal_180) (= .cse0 800))))))) is different from false [2022-11-14 19:05:06,215 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:05:06,218 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-14 19:05:06,243 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:05:06,244 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-14 19:05:06,263 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 194 treesize of output 178 [2022-11-14 19:05:06,285 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 173 treesize of output 157 [2022-11-14 19:05:06,342 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-14 19:05:06,554 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:05:06,555 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 221 treesize of output 233 [2022-11-14 19:05:08,935 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-11-14 19:05:08,936 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-14 19:05:08,990 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-14 19:05:08,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155435080] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-14 19:05:08,994 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-14 19:05:08,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 29] total 80 [2022-11-14 19:05:08,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380894301] [2022-11-14 19:05:08,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-14 19:05:08,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-11-14 19:05:08,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:05:08,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-11-14 19:05:09,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=620, Invalid=4735, Unknown=75, NotChecked=1050, Total=6480 [2022-11-14 19:05:09,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:09,003 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:05:09,004 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-14 19:05:09,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:09,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:09,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:09,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:05:09,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:09,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:14,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:14,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:14,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:14,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:05:14,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:14,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-14 19:05:14,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-14 19:05:14,463 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-14 19:05:14,464 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-14 19:05:14,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:05:14,464 INFO L85 PathProgramCache]: Analyzing trace with hash -437217722, now seen corresponding path program 1 times [2022-11-14 19:05:14,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:05:14,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981315012] [2022-11-14 19:05:14,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:05:14,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:05:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:05:15,535 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-14 19:05:15,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:05:15,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981315012] [2022-11-14 19:05:15,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981315012] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-14 19:05:15,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884019110] [2022-11-14 19:05:15,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:05:15,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:05:15,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:05:15,540 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-14 19:05:15,548 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-14 19:05:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:05:15,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-14 19:05:15,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-14 19:05:16,160 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-14 19:05:16,302 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-14 19:05:16,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:05:16,400 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-14 19:05:16,672 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-14 19:05:16,672 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-14 19:05:16,732 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-14 19:05:16,737 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-14 19:05:16,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-14 19:05:17,420 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:05:17,421 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-14 19:05:17,428 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:05:17,429 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-14 19:05:17,433 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-14 19:05:17,448 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-14 19:05:17,458 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:05:17,458 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-14 19:05:17,724 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-14 19:05:17,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884019110] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-14 19:05:17,724 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-14 19:05:17,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 50 [2022-11-14 19:05:17,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076386229] [2022-11-14 19:05:17,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-14 19:05:17,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-14 19:05:17,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:05:17,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-14 19:05:17,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=2269, Unknown=18, NotChecked=0, Total=2550 [2022-11-14 19:05:17,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:17,727 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:05:17,728 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-14 19:05:17,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:17,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:17,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:17,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:05:17,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:17,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-11-14 19:05:17,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:52,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:52,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:52,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:52,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:05:52,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:52,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-14 19:05:52,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-14 19:05:52,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-14 19:05:52,881 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-14 19:05:52,882 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-14 19:05:52,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:05:52,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1797555879, now seen corresponding path program 1 times [2022-11-14 19:05:52,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:05:52,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425355028] [2022-11-14 19:05:52,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:05:52,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:05:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:05:52,946 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-14 19:05:52,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:05:52,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425355028] [2022-11-14 19:05:52,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425355028] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:05:52,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-14 19:05:52,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-14 19:05:52,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196513862] [2022-11-14 19:05:52,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:05:52,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-14 19:05:52,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:05:52,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-14 19:05:52,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-14 19:05:52,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:52,951 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:05:52,951 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-14 19:05:52,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:52,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:52,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:52,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:05:52,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:52,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-11-14 19:05:52,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-14 19:05:52,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:52,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:52,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:52,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:52,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:05:52,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:52,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-14 19:05:52,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-14 19:05:52,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:52,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-14 19:05:52,984 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-14 19:05:52,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:05:52,985 INFO L85 PathProgramCache]: Analyzing trace with hash 110343253, now seen corresponding path program 1 times [2022-11-14 19:05:52,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:05:52,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934180235] [2022-11-14 19:05:52,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:05:52,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:05:53,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:05:53,087 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-14 19:05:53,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:05:53,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934180235] [2022-11-14 19:05:53,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934180235] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-14 19:05:53,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822357001] [2022-11-14 19:05:53,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:05:53,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:05:53,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:05:53,090 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-14 19:05:53,093 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-14 19:05:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:05:53,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-14 19:05:53,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-14 19:05:53,294 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-14 19:05:53,295 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-14 19:05:53,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822357001] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:05:53,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-14 19:05:53,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-14 19:05:53,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636397069] [2022-11-14 19:05:53,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:05:53,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-14 19:05:53,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:05:53,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-14 19:05:53,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-14 19:05:53,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:53,296 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:05:53,297 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-14 19:05:53,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:53,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:53,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:53,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:05:53,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:53,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-11-14 19:05:53,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-14 19:05:53,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:53,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:53,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:53,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:53,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:53,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:05:53,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:53,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-14 19:05:53,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-14 19:05:53,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:53,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:05:53,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-14 19:05:53,719 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-14 19:05:53,720 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-14 19:05:53,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:05:53,720 INFO L85 PathProgramCache]: Analyzing trace with hash 119995393, now seen corresponding path program 1 times [2022-11-14 19:05:53,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:05:53,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170157715] [2022-11-14 19:05:53,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:05:53,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:05:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:05:57,471 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-14 19:05:57,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:05:57,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170157715] [2022-11-14 19:05:57,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170157715] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-14 19:05:57,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023746563] [2022-11-14 19:05:57,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:05:57,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:05:57,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:05:57,476 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-14 19:05:57,503 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-14 19:05:57,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:05:57,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-14 19:05:57,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-14 19:05:57,788 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-14 19:05:57,789 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-14 19:05:58,011 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-14 19:05:58,071 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-14 19:05:58,355 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-14 19:05:58,682 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:05:58,689 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-14 19:05:58,690 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-14 19:05:58,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:05:58,746 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-14 19:05:58,942 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-14 19:05:59,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:05:59,055 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-14 19:05:59,253 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:05:59,262 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-14 19:05:59,263 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-14 19:05:59,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:05:59,319 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-14 19:05:59,334 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-14 19:05:59,366 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-14 19:05:59,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-14 19:05:59,755 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| 3204))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_437) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse1)))))) is different from false [2022-11-14 19:05:59,815 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|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_435) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (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-14 19:05:59,844 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|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_435) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_437) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse1)))))) is different from false [2022-11-14 19:05:59,857 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 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_435) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_437) .cse1) 800))))) is different from false [2022-11-14 19:05:59,917 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 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |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| 3204))) (or (not (= 800 (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-14 19:05:59,991 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 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |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| 3204))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_437) .cse1) 800))))) is different from false [2022-11-14 19:06:00,019 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 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (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 (+ 3208 |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| 3204))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_437) .cse1) 800))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse4 .cse3)))))) is different from false [2022-11-14 19:06:00,058 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_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_437 Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_430))) (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_432) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_435) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse2 .cse3))) (not (= (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_437) .cse3) 800)))))) is different from false [2022-11-14 19:06:00,825 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|) (+ 3208 |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| 3204)) (.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 (+ 3208 |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 (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_437) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse2 .cse1)))))))) is different from false [2022-11-14 19:06:00,840 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:06:00,840 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-14 19:06:00,853 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:06:00,856 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-14 19:06:00,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 287 treesize of output 275 [2022-11-14 19:06:00,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 275 treesize of output 259 [2022-11-14 19:06:00,895 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-14 19:06:01,061 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:06:01,062 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 119 treesize of output 111 [2022-11-14 19:06:01,466 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-11-14 19:06:01,467 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-14 19:06:01,516 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 43 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-11-14 19:06:01,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023746563] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-14 19:06:01,517 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-14 19:06:01,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 23, 25] total 80 [2022-11-14 19:06:01,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128271932] [2022-11-14 19:06:01,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-14 19:06:01,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-11-14 19:06:01,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:06:01,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-11-14 19:06:01,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=462, Invalid=4519, Unknown=25, NotChecked=1314, Total=6320 [2022-11-14 19:06:01,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:06:01,520 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:06:01,521 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-14 19:06:01,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:06:01,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:06:01,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:06:01,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:06:01,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:06:01,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2022-11-14 19:06:01,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-14 19:06:01,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:06:01,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:06:01,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:06:19,779 WARN L233 SmtUtils]: Spent 6.37s on a formula simplification. DAG size of input: 68 DAG size of output: 64 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-14 19:06:33,099 WARN L233 SmtUtils]: Spent 5.07s on a formula simplification. DAG size of input: 69 DAG size of output: 65 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-14 19:06:42,273 WARN L233 SmtUtils]: Spent 6.54s on a formula simplification. DAG size of input: 78 DAG size of output: 65 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-14 19:06:42,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:06:42,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:06:42,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:06:42,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:06:42,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:06:42,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-14 19:06:42,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-14 19:06:42,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:06:42,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:06:42,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-14 19:06:42,284 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-14 19:06:42,476 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-14 19:06:42,477 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-14 19:06:42,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:06:42,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1303619980, now seen corresponding path program 1 times [2022-11-14 19:06:42,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:06:42,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386285411] [2022-11-14 19:06:42,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:06:42,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:06:42,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:06:44,242 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-14 19:06:44,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:06:44,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386285411] [2022-11-14 19:06:44,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386285411] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-14 19:06:44,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318903003] [2022-11-14 19:06:44,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:06:44,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:06:44,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:06:44,244 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-14 19:06:44,247 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-14 19:06:44,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:06:44,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-14 19:06:44,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-14 19:06:44,511 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-14 19:06:44,511 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-14 19:06:44,683 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-14 19:06:44,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-14 19:06:44,983 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-14 19:06:45,252 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:06:45,261 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-14 19:06:45,262 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-14 19:06:45,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:06:45,335 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-14 19:06:45,565 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-14 19:06:45,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:06:45,642 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-14 19:06:45,808 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:06:45,816 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-14 19:06:45,817 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-14 19:06:45,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:06:45,862 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-14 19:06:45,886 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-14 19:06:45,890 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-14 19:06:45,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-14 19:06:46,137 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_511 (Array Int Int)) (v_ArrVal_512 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (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-14 19:06:46,160 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_511 (Array Int Int)) (v_ArrVal_512 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (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|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_511) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_512)) .cse1)) 2147483647)) is different from false [2022-11-14 19:06:46,177 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_511 (Array Int Int)) (v_ArrVal_512 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (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|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_511) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_512)) .cse1)) 2147483647)) is different from false [2022-11-14 19:06:46,184 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_511 (Array Int Int)) (v_ArrVal_512 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_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-14 19:06:46,264 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((v_ArrVal_511 (Array Int Int)) (v_ArrVal_512 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .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)) (= 800 .cse4)))) is different from false [2022-11-14 19:06:46,286 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((v_ArrVal_508 Int) (v_ArrVal_511 (Array Int Int)) (v_ArrVal_512 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |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)) (= 800 .cse4)))) is different from false [2022-11-14 19:06:46,329 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 ((.cse3 (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)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (or (= .cse0 800) (< (let ((.cse2 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 3208 |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 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_512)) .cse2)) 2147483647))))) is different from false [2022-11-14 19:06:46,348 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| (select .cse0 .cse1))) (forall ((v_ArrVal_508 Int) (v_ArrVal_505 Int) (v_ArrVal_511 (Array Int Int)) (v_ArrVal_512 Int)) (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_505))) (let ((.cse5 (select .cse4 .cse1))) (or (< (let ((.cse3 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_508) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_511) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_512)) .cse3)) 2147483647) (= 800 .cse5)))))))) is different from false [2022-11-14 19:06:46,378 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 ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse3 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_505)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse0 (select .cse3 .cse4))) (or (= 800 .cse0) (< (let ((.cse2 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~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| (* 4 (select .cse1 .cse2))) v_ArrVal_512)) .cse2)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| (select .cse5 .cse4)))))))) is different from false [2022-11-14 19:06:46,685 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_504 (Array Int Int)) (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 ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_504))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_505)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| (select .cse0 .cse1))) (= 800 .cse2) (< (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_508) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_511) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_512)) .cse1) 2147483647))))))) is different from false [2022-11-14 19:06:46,991 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|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_503)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_504))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_505)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse5 (select .cse4 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| (select .cse0 .cse1))) (< (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_508) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_511) |c_~#queue~0.base|))) (store .cse2 (+ (* 4 (select .cse2 .cse1)) |c_~#queue~0.offset|) v_ArrVal_512)) .cse1) 2147483647) (= .cse5 800))))))) is different from false [2022-11-14 19:06:47,008 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:06:47,009 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-14 19:06:47,021 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:06:47,024 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-14 19:06:47,034 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 153 treesize of output 133 [2022-11-14 19:06:47,042 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 204 treesize of output 180 [2022-11-14 19:06:47,058 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-14 19:06:47,736 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:06:47,736 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 282 treesize of output 234 [2022-11-14 19:06:48,040 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-11-14 19:06:48,040 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-14 19:06:48,073 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 19 not checked. [2022-11-14 19:06:48,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318903003] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-14 19:06:48,073 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-14 19:06:48,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 27] total 71 [2022-11-14 19:06:48,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218939014] [2022-11-14 19:06:48,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-14 19:06:48,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-11-14 19:06:48,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:06:48,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-11-14 19:06:48,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=474, Invalid=3216, Unknown=14, NotChecked=1408, Total=5112 [2022-11-14 19:06:48,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:06:48,076 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:06:48,077 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-14 19:06:48,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:06:48,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:06:48,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:06:48,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:06:48,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:06:48,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-11-14 19:06:48,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-14 19:06:48,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:06:48,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:06:48,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-11-14 19:06:48,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:07:06,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:07:06,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:07:06,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:07:06,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:07:06,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:07:06,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-14 19:07:06,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-14 19:07:06,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:07:06,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:07:06,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-14 19:07:06,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-14 19:07:06,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-14 19:07:06,704 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-14 19:07:06,705 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-14 19:07:06,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:07:06,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1757513073, now seen corresponding path program 1 times [2022-11-14 19:07:06,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:07:06,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512854854] [2022-11-14 19:07:06,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:07:06,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:07:06,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:07:07,707 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-14 19:07:07,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:07:07,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512854854] [2022-11-14 19:07:07,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512854854] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-14 19:07:07,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297253500] [2022-11-14 19:07:07,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:07:07,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:07:07,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:07:07,712 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-14 19:07:07,715 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-14 19:07:07,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:07:07,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-14 19:07:07,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-14 19:07:08,573 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-14 19:07:08,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:07:08,685 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-14 19:07:08,934 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:07:08,941 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-14 19:07:08,941 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-14 19:07:09,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:07:09,001 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-14 19:07:09,036 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-14 19:07:09,041 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-14 19:07:09,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-14 19:07:09,332 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| 3204))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_579)) .cse1))))) is different from false [2022-11-14 19:07:09,363 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| 3204))) (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|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_579)) .cse1))))) is different from false [2022-11-14 19:07:09,597 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:07:09,598 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-14 19:07:09,607 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:07:09,608 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-14 19:07:09,612 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-14 19:07:09,622 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-14 19:07:09,638 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:07:09,638 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-14 19:07:09,912 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-14 19:07:09,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297253500] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-14 19:07:09,912 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-14 19:07:09,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 18] total 50 [2022-11-14 19:07:09,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049935833] [2022-11-14 19:07:09,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-14 19:07:09,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-14 19:07:09,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:07:09,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-14 19:07:09,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=2111, Unknown=3, NotChecked=190, Total=2550 [2022-11-14 19:07:09,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:07:09,914 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:07:09,915 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-14 19:07:09,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:07:09,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:07:09,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:07:09,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:07:09,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:07:09,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-11-14 19:07:09,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-14 19:07:09,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:07:09,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:07:09,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-11-14 19:07:09,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-11-14 19:07:09,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:07:31,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:07:31,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:07:31,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:07:31,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:07:31,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:07:31,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-11-14 19:07:31,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-14 19:07:31,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:07:31,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:07:31,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-14 19:07:31,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-14 19:07:31,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-14 19:07:31,640 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-14 19:07:31,835 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-14 19:07:31,836 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-14 19:07:31,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:07:31,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1525993803, now seen corresponding path program 2 times [2022-11-14 19:07:31,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:07:31,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566952913] [2022-11-14 19:07:31,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:07:31,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:07:31,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:07:39,069 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-14 19:07:39,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:07:39,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566952913] [2022-11-14 19:07:39,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566952913] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-14 19:07:39,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677152466] [2022-11-14 19:07:39,070 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-14 19:07:39,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:07:39,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:07:39,071 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-14 19:07:39,073 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-14 19:07:39,232 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-14 19:07:39,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-14 19:07:39,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 114 conjunts are in the unsatisfiable core [2022-11-14 19:07:39,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-14 19:07:39,374 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-14 19:07:39,374 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-14 19:07:39,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-14 19:07:39,644 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-14 19:07:39,953 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-14 19:07:40,340 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:07:40,361 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-14 19:07:40,362 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-14 19:07:40,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:07:40,589 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:07:40,590 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-14 19:07:40,933 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-14 19:07:41,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:07:41,059 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-14 19:07:41,482 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:07:41,497 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-14 19:07:41,498 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-14 19:07:41,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:07:41,732 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:07:41,733 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-14 19:07:42,074 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-14 19:07:42,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:07:42,212 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-14 19:07:42,641 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:07:42,655 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-14 19:07:42,655 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-14 19:07:42,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:07:42,870 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:07:42,872 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-14 19:07:43,193 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-14 19:07:43,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:07:43,304 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-14 19:07:43,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:07:43,593 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:07:43,608 INFO L321 Elim1Store]: treesize reduction 46, result has 27.0 percent of original size [2022-11-14 19:07:43,609 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-14 19:07:43,653 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-14 19:07:43,658 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-14 19:07:43,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-14 19:07:44,051 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 (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse0 (+ |c_~#queue~0.offset| 3204))))))) is different from false [2022-11-14 19:07:44,372 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|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) 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) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_694) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse0 (+ |c_~#queue~0.offset| 3204))))))) is different from false [2022-11-14 19:07:44,717 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 ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_692) .cse2 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) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_694) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem37#1| 1) v_ArrVal_692))))) is different from false [2022-11-14 19:07:44,894 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_690 Int) (v_ArrVal_696 (Array Int Int))) (let ((.cse0 (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_690)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.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 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse0 .cse3) 1) v_ArrVal_694) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse2 (+ |c_~#queue~0.offset| 3204)))))))) is different from false [2022-11-14 19:07:44,927 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse0 .cse1))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_694 Int) (v_ArrVal_692 Int) (v_ArrVal_690 Int) (v_ArrVal_696 (Array Int Int))) (let ((.cse3 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_690)) (.cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.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 .cse2 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_694) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ 1 (select .cse3 .cse4)) v_ArrVal_692)))))))) is different from false [2022-11-14 19:07:45,012 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 ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_690)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse0 .cse1 v_ArrVal_692) .cse4 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_50| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse3 .cse4))) (< (+ (select .cse0 .cse4) 1) v_ArrVal_694) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-11-14 19:07:53,681 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 ((.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse3 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store .cse5 |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_53| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse2 .cse1))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_692) (< (select (store .cse2 (+ (* 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-14 19:07:54,322 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 ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 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)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (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) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse2 .cse3))) (< (+ (select .cse4 .cse5) 1) v_ArrVal_688) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse1) 2147483647) (< (+ (select .cse0 .cse3) 1) v_ArrVal_694) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse6 .cse3)))))))))) is different from false [2022-11-14 19:07:54,527 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 ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_686) .cse4 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse0 (select .cse7 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690)) (.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse5 .cse6 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 .cse4) 1) v_ArrVal_688) (< (+ (select .cse5 .cse6) 1) v_ArrVal_692) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse6) 2147483647) (< (+ (select .cse5 .cse1) 1) v_ArrVal_694) (not (<= v_ArrVal_686 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)))))))))) is different from false [2022-11-14 19:07:54,883 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 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_686) .cse5 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)) (.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse6 .cse7 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_686) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse4 .cse3))) (< (+ (select .cse0 .cse5) 1) v_ArrVal_688) (< (+ (select .cse6 .cse7) 1) v_ArrVal_692) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse7) 2147483647) (< (+ (select .cse6 .cse3) 1) v_ArrVal_694)))))))) is different from false [2022-11-14 19:07:54,979 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 ((.cse3 (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)) (.cse7 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse7 v_ArrVal_686) .cse4 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse5 (select .cse8 |c_~#queue~0.base|))) (let ((.cse6 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse6 .cse1 v_ArrVal_692) .cse2 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) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse0 .cse2))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_688) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse5 .cse2))) (< (+ (select .cse6 .cse2) 1) v_ArrVal_694) (< (+ (select .cse6 .cse1) 1) v_ArrVal_692) (< (+ (select .cse3 .cse7) 1) v_ArrVal_686)))))))) is different from false [2022-11-14 19:07:55,063 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|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (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 ((.cse0 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_683)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_686) .cse6 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse5 .cse3 v_ArrVal_692) .cse4 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_686) (< (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_50| (select .cse2 .cse4))) (< (+ (select .cse5 .cse3) 1) v_ArrVal_692) (< (+ (select .cse0 .cse6) 1) v_ArrVal_688) (< (+ (select .cse5 .cse4) 1) v_ArrVal_694) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse7 .cse4)))))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse9 .cse6)))))) is different from false [2022-11-14 19:07:55,242 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 ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_683)) (.cse6 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse5 .cse6 v_ArrVal_686) .cse7 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse0 (select .cse9 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse2 .cse3 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))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_692) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse4 .cse1))) (< (+ (select .cse5 .cse6) 1) v_ArrVal_686) (< (+ (select .cse2 .cse1) 1) v_ArrVal_694) (< (+ (select .cse5 .cse7) 1) v_ArrVal_688) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse8 .cse7))))))))))) is different from false [2022-11-14 19:08:11,977 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|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_680)) |c_~#stored_elements~0.base| v_ArrVal_682))) (let ((.cse2 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_683)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse7 (store (store .cse8 |c_~#queue~0.base| (store (store .cse5 .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 ((.cse4 (store .cse6 (+ (* 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 .cse4 .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) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse2 .cse3))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_692) (< (+ (select .cse5 .cse1) 1) v_ArrVal_686) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse6 .cse3))) (not (<= v_ArrVal_680 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (< (+ (select .cse4 .cse3) 1) v_ArrVal_694) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse0 .cse3))) (< (+ (select .cse5 .cse3) 1) v_ArrVal_688)))))))))) is different from false [2022-11-14 19:08:12,517 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 ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_680)) |c_~#stored_elements~0.base| v_ArrVal_682))) (let ((.cse2 (select .cse10 |c_~#queue~0.base|))) (let ((.cse7 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_683)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store (store .cse7 .cse1 v_ArrVal_686) .cse3 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 ((.cse0 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse6 .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) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse2 .cse3))) (< (+ (select .cse4 .cse5) 1) v_ArrVal_680) (< (+ (select .cse6 .cse1) 1) v_ArrVal_692) (< (+ (select .cse7 .cse1) 1) v_ArrVal_686) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse8 .cse3))) (< (+ (select .cse6 .cse3) 1) v_ArrVal_694) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse0 .cse3))) (< (+ (select .cse7 .cse3) 1) v_ArrVal_688))))))))))) is different from false [2022-11-14 19:08:12,887 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 ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_679) .cse4 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)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (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 ((.cse2 (select .cse9 |c_~#queue~0.base|))) (let ((.cse7 (store .cse2 (+ (* 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 .cse7 .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))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse2 .cse1))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_680) (< (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_686) (< (+ (select .cse7 .cse1) 1) v_ArrVal_694) (< (+ (select .cse7 .cse5) 1) v_ArrVal_692) (not (<= v_ArrVal_679 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))) (< (+ (select .cse6 .cse1) 1) v_ArrVal_688) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse8 .cse1))))))))))))) is different from false [2022-11-14 19:08:13,717 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 ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse8 v_ArrVal_679) .cse4 v_ArrVal_680)) |c_~#stored_elements~0.base| v_ArrVal_682))) (let ((.cse9 (select .cse11 |c_~#queue~0.base|))) (let ((.cse6 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_683)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_686) .cse1 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse2 (select .cse10 |c_~#queue~0.base|))) (let ((.cse7 (store .cse2 (+ (* 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 .cse7 .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))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse2 .cse1))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_680) (< (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_686) (< (+ (select .cse7 .cse1) 1) v_ArrVal_694) (< (+ (select .cse3 .cse8) 1) v_ArrVal_679) (< (+ (select .cse7 .cse5) 1) v_ArrVal_692) (< (+ (select .cse6 .cse1) 1) v_ArrVal_688) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse9 .cse1))))))))))))) is different from false [2022-11-14 19:08:13,865 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 ((.cse6 (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 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 .cse9 v_ArrVal_679) .cse7 v_ArrVal_680)) |c_~#stored_elements~0.base| v_ArrVal_682))) (let ((.cse0 (select .cse11 |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_683)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store (store .cse4 .cse8 v_ArrVal_686) .cse1 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse5 (select .cse10 |c_~#queue~0.base|))) (let ((.cse2 (store .cse5 (+ (* 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 .cse2 .cse8 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_56| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_694) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse3 .cse1))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_688) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse5 .cse1))) (< (+ (select .cse6 .cse7) 1) v_ArrVal_680) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse8) 2147483647) (< (+ (select .cse4 .cse8) 1) v_ArrVal_686) (< (+ (select .cse2 .cse8) 1) v_ArrVal_692) (< (+ (select .cse6 .cse9) 1) v_ArrVal_679))))))))))) is different from false [2022-11-14 19:08:13,969 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|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (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 ((.cse0 (store .cse12 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_677)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_679) .cse8 v_ArrVal_680)) |c_~#stored_elements~0.base| v_ArrVal_682))) (let ((.cse9 (select .cse11 |c_~#queue~0.base|))) (let ((.cse2 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_683)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse6 (+ |c_~#queue~0.offset| 3204))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_686) .cse6 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse5 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690))) (let ((.cse4 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse5 .cse3 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_679) (< (+ (select .cse2 .cse3) 1) v_ArrVal_686) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse3) 2147483647) (< (+ (select .cse5 .cse3) 1) v_ArrVal_692) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse4 .cse6))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse7 .cse6))) (< (+ (select .cse0 .cse8) 1) v_ArrVal_680) (< (+ (select .cse2 .cse6) 1) v_ArrVal_688) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse9 .cse6))) (< (+ (select .cse5 .cse6) 1) v_ArrVal_694))))))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| (select .cse12 .cse8)))))) is different from false [2022-11-14 19:08:14,152 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 ((.cse0 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_677)) (.cse8 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse0 .cse8 v_ArrVal_679) .cse1 v_ArrVal_680)) |c_~#stored_elements~0.base| v_ArrVal_682))) (let ((.cse6 (select .cse12 |c_~#queue~0.base|))) (let ((.cse4 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_683)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_686) .cse5 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse7 (select .cse11 |c_~#queue~0.base|))) (let ((.cse10 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690))) (let ((.cse2 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse10 .cse3 v_ArrVal_692) .cse5 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_680) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse3) 2147483647) (< (+ (select .cse4 .cse5) 1) v_ArrVal_688) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse2 .cse5))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse6 .cse5))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse7 .cse5))) (< (+ (select .cse0 .cse8) 1) v_ArrVal_679) (< (+ (select .cse4 .cse3) 1) v_ArrVal_686) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| (select .cse9 .cse1))) (< (+ (select .cse10 .cse5) 1) v_ArrVal_694) (< (+ (select .cse10 .cse3) 1) v_ArrVal_692)))))))))))) is different from false [2022-11-14 19:08:22,705 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 ((.cse8 (select .cse11 |c_~#queue~0.base|))) (let ((.cse7 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) v_ArrVal_677)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store (store .cse7 .cse1 v_ArrVal_679) .cse3 v_ArrVal_680)) |c_~#stored_elements~0.base| v_ArrVal_682))) (let ((.cse6 (select .cse10 |c_~#queue~0.base|))) (let ((.cse5 (store .cse6 (+ (* 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 .cse5 .cse1 v_ArrVal_686) .cse3 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse2 (select .cse9 |c_~#queue~0.base|))) (let ((.cse4 (store .cse2 (+ (* 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 .cse4 .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) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse2 .cse3))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_692) (< (+ (select .cse5 .cse1) 1) v_ArrVal_686) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse6 .cse3))) (< (+ 1 (select .cse7 .cse1)) v_ArrVal_679) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse0 .cse3))) (< (+ (select .cse7 .cse3) 1) v_ArrVal_680) (< (+ (select .cse4 .cse3) 1) v_ArrVal_694) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| (select .cse8 .cse3))) (< (+ (select .cse5 .cse3) 1) v_ArrVal_688))))))))))))) is different from false [2022-11-14 19:08:24,467 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|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_674)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_675))) (let ((.cse8 (select .cse11 |c_~#queue~0.base|))) (let ((.cse3 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) v_ArrVal_677)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_679) .cse1 v_ArrVal_680)) |c_~#stored_elements~0.base| v_ArrVal_682))) (let ((.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse2 (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 .cse2 .cse4 v_ArrVal_686) .cse1 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse6 (select .cse9 |c_~#queue~0.base|))) (let ((.cse0 (store .cse6 (+ (* 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 .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_ArrVal_674 0)) (< (+ (select .cse2 .cse1) 1) v_ArrVal_688) (< (+ (select .cse3 .cse1) 1) v_ArrVal_680) (< (+ (select .cse0 .cse4) 1) v_ArrVal_692) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse6 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse5 .cse1))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_679) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse7 .cse1))) (< (+ (select .cse2 .cse4) 1) v_ArrVal_686) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| (select .cse8 .cse1))))))))))))))) is different from false [2022-11-14 19:08:24,513 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:08:24,513 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-14 19:08:24,561 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:08:24,562 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-14 19:08:24,586 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-14 19:08:24,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 729 treesize of output 717 [2022-11-14 19:08:24,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1331 treesize of output 1283 [2022-11-14 19:08:24,682 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 1427 treesize of output 1403 [2022-11-14 19:08:24,784 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:08:24,785 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-14 19:08:25,903 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:08:25,904 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 561 treesize of output 577 [2022-11-14 19:08:31,208 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-11-14 19:08:31,208 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-14 19:08:31,258 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 56 refuted. 5 times theorem prover too weak. 0 trivial. 110 not checked. [2022-11-14 19:08:31,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677152466] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-14 19:08:31,258 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-14 19:08:31,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 44, 49] total 135 [2022-11-14 19:08:31,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695907282] [2022-11-14 19:08:31,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-14 19:08:31,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 136 states [2022-11-14 19:08:31,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:08:31,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2022-11-14 19:08:31,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1616, Invalid=11188, Unknown=166, NotChecked=5390, Total=18360 [2022-11-14 19:08:31,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:08:31,264 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:08:31,264 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-14 19:08:31,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:08:31,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:08:31,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:08:31,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:08:31,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:08:31,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2022-11-14 19:08:31,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-14 19:08:31,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:08:31,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:08:31,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2022-11-14 19:08:31,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2022-11-14 19:08:31,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-14 19:08:31,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:09:12,615 WARN L233 SmtUtils]: Spent 5.07s on a formula simplification. DAG size of input: 152 DAG size of output: 121 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-14 19:09:32,157 WARN L233 SmtUtils]: Spent 7.72s on a formula simplification. DAG size of input: 85 DAG size of output: 82 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-14 19:10:09,162 WARN L233 SmtUtils]: Spent 16.49s on a formula simplification. DAG size of input: 167 DAG size of output: 147 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-14 19:11:01,327 WARN L233 SmtUtils]: Spent 10.50s on a formula simplification. DAG size of input: 147 DAG size of output: 144 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-14 19:11:08,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:11:08,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:11:08,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:11:08,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:11:08,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:11:08,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-11-14 19:11:08,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-14 19:11:08,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:11:08,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:11:08,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-14 19:11:08,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-14 19:11:08,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-14 19:11:08,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-11-14 19:11:08,216 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-14 19:11:08,409 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-14 19:11:08,410 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-14 19:11:08,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:11:08,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1624944705, now seen corresponding path program 2 times [2022-11-14 19:11:08,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:11:08,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490454757] [2022-11-14 19:11:08,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:11:08,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:11:08,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:11:16,000 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-14 19:11:16,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:11:16,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490454757] [2022-11-14 19:11:16,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490454757] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-14 19:11:16,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468567111] [2022-11-14 19:11:16,000 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-14 19:11:16,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:11:16,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:11:16,002 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-14 19:11:16,004 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-14 19:11:16,164 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-14 19:11:16,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-14 19:11:16,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 119 conjunts are in the unsatisfiable core [2022-11-14 19:11:16,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-14 19:11:16,341 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-14 19:11:16,342 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-14 19:11:16,537 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-14 19:11:16,603 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-14 19:11:16,915 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-14 19:11:17,311 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:11:17,320 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-14 19:11:17,320 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-14 19:11:17,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:11:17,379 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-14 19:11:17,599 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-14 19:11:17,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:11:17,696 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-14 19:11:17,996 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:11:18,004 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-14 19:11:18,004 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-14 19:11:18,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:11:18,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 23 treesize of output 22 [2022-11-14 19:11:18,373 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-14 19:11:18,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:11:18,534 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-14 19:11:18,920 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:11:18,931 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-14 19:11:18,932 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-14 19:11:19,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:11:19,040 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-14 19:11:19,330 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-14 19:11:19,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:11:19,444 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-14 19:11:19,703 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:11:19,710 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-14 19:11:19,711 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-14 19:11:19,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:11:19,791 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-14 19:11:19,809 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-14 19:11:19,848 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-14 19:11:19,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-14 19:11:20,331 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|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (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-14 19:11:20,356 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|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (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-14 19:11:20,367 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| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (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) 800))))) is different from false [2022-11-14 19:11:20,417 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 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |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| 3204))) (or (not (= 800 (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-14 19:11:20,482 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 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |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| 3204))) (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) 800))))) is different from false [2022-11-14 19:11:20,504 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (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 .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_822))) (store (store .cse2 (+ 3208 |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| 3204))) (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) 800))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse4 .cse3)))))) is different from false [2022-11-14 19:11:20,546 WARN L833 $PredicateComparison]: unable to prove that (forall ((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 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse4 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_822))) (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_825) .cse3 (+ 1 (select .cse4 .cse3))))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse0 .cse1))))))) is different from false [2022-11-14 19:11:20,831 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| 3204)) (.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 (+ 3208 |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 (= 800 (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-14 19:11:21,571 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 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse5 (+ 3208 |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| 3204)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse4 (+ 3208 |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 (= 800 (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_66| (select .cse2 .cse1)))))))) is different from false [2022-11-14 19:11:21,671 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 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse5 (+ 3208 |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| 3204)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse4 (+ 3208 |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 (= (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse2 .cse1)))))))) is different from false [2022-11-14 19:11:21,703 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (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 .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_816))) (store (store .cse5 (+ 3208 |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| 3204)) (.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 (+ 3208 |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 (= 800 (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)))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| (select .cse7 .cse6)))))) is different from false [2022-11-14 19:11:21,756 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 ((.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse7 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_816))) (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_818) .cse4 (+ (select .cse7 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse6 (+ 3208 |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 (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| (select .cse3 .cse4))))))))) is different from false [2022-11-14 19:11:22,191 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 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.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 (+ 1 (select .cse5 .cse1))))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (= 800 (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))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse0 .cse1)))))))))) is different from false [2022-11-14 19:11:22,842 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 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_814))) (let ((.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse3 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse3 (+ (* 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 (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| (select .cse3 .cse1)))))))))) is different from false [2022-11-14 19:11:22,996 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 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse9 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_810) .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_814))) (let ((.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse3 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse3 (+ (* 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 (+ 1 (select .cse5 .cse1))))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (= 800 (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))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse0 .cse1)))))))))) is different from false [2022-11-14 19:11:23,199 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 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse9 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_810) .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_814))) (let ((.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.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 ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse3 (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_72| (select .cse2 .cse1))) (not (= (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse3 .cse1)))))))))) is different from false [2022-11-14 19:11:23,241 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_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 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_810) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_814))) (let ((.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse2 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_~#queue~0.offset|) v_ArrVal_816))) (store (store .cse10 .cse8 v_ArrVal_818) .cse3 (+ 1 (select .cse10 .cse3))))) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse4 (select .cse6 |c_~#queue~0.base|))) (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse4 (+ (* 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 (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse4 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse5 .cse3))) (not (= (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse3) 800)))))))))))) is different from false [2022-11-14 19:11:23,318 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| 3204)) (.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 (+ 3208 |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 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse5 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse5 (+ (* 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 ((.cse2 (select .cse6 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse2 (+ (* 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 (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| (select .cse3 .cse4))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| (select .cse5 .cse1))))))))))) is different from false [2022-11-14 19:11:24,253 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_ArrVal_807 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_807))) (let ((.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (select .cse10 |c_~#queue~0.base|))) (let ((.cse8 (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse2 (+ |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 ((.cse4 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store .cse4 (+ (* 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 ((.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse0 (+ (* 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_69| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| (select .cse2 .cse1))) (not (= (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| (select .cse4 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse3 .cse1)))))))))))) is different from false [2022-11-14 19:11:25,001 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|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_805)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_807))) (let ((.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (select .cse10 |c_~#queue~0.base|))) (let ((.cse8 (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse2 (+ |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 ((.cse3 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store .cse3 (+ (* 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 ((.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 .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_66| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| (select .cse2 .cse1))) (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse4 .cse1)))))))))))) is different from false [2022-11-14 19:11:25,024 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:11:25,025 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-14 19:11:25,054 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:11:25,055 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-14 19:11:25,072 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 2055 treesize of output 2035 [2022-11-14 19:11:25,091 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 1763 treesize of output 1699 [2022-11-14 19:11:25,109 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 2068 treesize of output 2020 [2022-11-14 19:11:25,132 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 2199 treesize of output 2167 [2022-11-14 19:11:25,175 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-14 19:11:26,401 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:11:26,402 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 485 treesize of output 469 [2022-11-14 19:11:27,319 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-11-14 19:11:27,320 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-14 19:11:27,364 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 97 proven. 55 refuted. 4 times theorem prover too weak. 0 trivial. 130 not checked. [2022-11-14 19:11:27,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468567111] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-14 19:11:27,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-14 19:11:27,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 35, 43] total 122 [2022-11-14 19:11:27,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716834243] [2022-11-14 19:11:27,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-14 19:11:27,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 122 states [2022-11-14 19:11:27,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:11:27,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2022-11-14 19:11:27,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1099, Invalid=9229, Unknown=54, NotChecked=4380, Total=14762 [2022-11-14 19:11:27,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:11:27,368 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:11:27,369 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-14 19:11:27,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:11:27,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:11:27,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:11:27,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:11:27,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:11:27,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2022-11-14 19:11:27,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-14 19:11:27,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:11:27,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:11:27,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2022-11-14 19:11:27,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2022-11-14 19:11:27,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-11-14 19:11:27,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-11-14 19:11:27,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:12:13,946 WARN L233 SmtUtils]: Spent 14.40s on a formula simplification. DAG size of input: 152 DAG size of output: 149 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-14 19:12:45,088 WARN L233 SmtUtils]: Spent 8.38s on a formula simplification. DAG size of input: 149 DAG size of output: 146 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-14 19:13:32,526 WARN L233 SmtUtils]: Spent 24.56s on a formula simplification. DAG size of input: 163 DAG size of output: 160 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-14 19:14:03,367 WARN L233 SmtUtils]: Spent 11.14s on a formula simplification. DAG size of input: 159 DAG size of output: 156 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-14 19:14:03,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:14:03,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:14:03,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:14:03,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:14:03,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:14:03,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-11-14 19:14:03,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-14 19:14:03,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:14:03,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:14:03,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-14 19:14:03,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-14 19:14:03,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-14 19:14:03,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-11-14 19:14:03,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-11-14 19:14:03,598 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-14 19:14:03,793 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-14 19:14:03,794 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-14 19:14:03,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:14:03,794 INFO L85 PathProgramCache]: Analyzing trace with hash 202398260, now seen corresponding path program 2 times [2022-11-14 19:14:03,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:14:03,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074786097] [2022-11-14 19:14:03,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:14:03,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:14:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:14:07,693 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-14 19:14:07,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:14:07,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074786097] [2022-11-14 19:14:07,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074786097] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-14 19:14:07,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170944802] [2022-11-14 19:14:07,693 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-14 19:14:07,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:14:07,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:14:07,694 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-14 19:14:07,696 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-14 19:14:07,851 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-14 19:14:07,851 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-14 19:14:07,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 106 conjunts are in the unsatisfiable core [2022-11-14 19:14:07,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-14 19:14:08,026 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-14 19:14:08,027 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-14 19:14:08,190 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-14 19:14:08,243 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-14 19:14:08,525 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-14 19:14:08,843 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:14:08,852 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-14 19:14:08,852 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-14 19:14:08,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:14:08,927 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-14 19:14:09,171 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-14 19:14:09,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:14:09,303 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-14 19:14:09,654 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:14:09,663 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-14 19:14:09,664 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-14 19:14:09,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:14:09,751 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-14 19:14:10,036 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-14 19:14:10,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:14:10,189 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-14 19:14:10,573 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:14:10,585 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-14 19:14:10,586 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-14 19:14:10,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:14:10,697 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-14 19:14:10,994 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-14 19:14:11,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:14:11,119 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-14 19:14:11,338 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:14:11,347 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-14 19:14:11,347 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-14 19:14:11,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:14:11,408 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-14 19:14:11,437 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-14 19:14:11,441 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-14 19:14:11,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-14 19:14:11,946 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|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse0 .cse1))) (not (<= v_ArrVal_948 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (< (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-14 19:14:11,994 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|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse0 .cse1))) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 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-14 19:14:14,205 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_950 (Array Int Int)) (v_ArrVal_952 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |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| 3204))) (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_948))))) is different from false [2022-11-14 19:14:14,823 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 ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_945)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~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| 3204))) (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_948) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse4 .cse3)))))))) is different from false [2022-11-14 19:14:19,421 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (v_ArrVal_943 (Array Int 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 ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_943))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_945)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 (+ 3208 |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 .cse0 .cse1) 1) v_ArrVal_948) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse2 .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_79| (select .cse3 .cse1))))))))) is different from false [2022-11-14 19:14:23,442 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (v_ArrVal_943 (Array Int Int)) (v_ArrVal_939 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 ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_939) .cse5 v_ArrVal_941)) |c_~#stored_elements~0.base| v_ArrVal_943))) (let ((.cse2 (select .cse6 |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_945)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 (+ 3208 |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 .cse0 .cse1) 1) v_ArrVal_948) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse2 .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_79| (select .cse3 .cse1))) (< (+ (select .cse4 .cse5) 1) v_ArrVal_941)))))))) is different from false [2022-11-14 19:14:23,926 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|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (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 ((.cse3 (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 .cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_939) .cse4 v_ArrVal_941)) |c_~#stored_elements~0.base| v_ArrVal_943))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse2 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_945)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse2 (+ 3208 |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) (< (+ (select .cse2 .cse1) 1) v_ArrVal_948) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse0 .cse1))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_941) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse5 .cse1)))))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| (select .cse7 .cse4)))))) is different from false [2022-11-14 19:14:24,010 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 ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_937)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_939) .cse1 v_ArrVal_941)) |c_~#stored_elements~0.base| v_ArrVal_943))) (let ((.cse4 (select .cse7 |c_~#queue~0.base|))) (let ((.cse6 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_945)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse6 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_946) .cse3 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse4 .cse3))) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse3) 2147483647) (< (+ (select .cse5 .cse1) 1) v_ArrVal_941) (< (+ (select .cse6 .cse3) 1) v_ArrVal_948))))))))) is different from false [2022-11-14 19:14:34,498 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|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_935)) |c_~#stored_elements~0.base| v_ArrVal_936))) (let ((.cse5 (select .cse8 |c_~#queue~0.base|))) (let ((.cse2 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_937)) (.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse6 (store (store .cse8 |c_~#queue~0.base| (store (store .cse2 .cse7 v_ArrVal_939) .cse1 v_ArrVal_941)) |c_~#stored_elements~0.base| v_ArrVal_943))) (let ((.cse4 (select .cse6 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_945))) (let ((.cse3 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 .cse7 v_ArrVal_946) .cse1 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_935 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (< (+ (select .cse0 .cse1) 1) v_ArrVal_948) (< (+ (select .cse2 .cse1) 1) v_ArrVal_941) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse4 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| (select .cse5 .cse1))) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647)))))))))) is different from false [2022-11-14 19:14:34,631 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|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_935)) |c_~#stored_elements~0.base| v_ArrVal_936))) (let ((.cse5 (select .cse8 |c_~#queue~0.base|))) (let ((.cse2 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_937)) (.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse6 (store (store .cse8 |c_~#queue~0.base| (store (store .cse2 .cse7 v_ArrVal_939) .cse1 v_ArrVal_941)) |c_~#stored_elements~0.base| v_ArrVal_943))) (let ((.cse4 (select .cse6 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_945))) (let ((.cse3 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 .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_948) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_935) (< (+ (select .cse2 .cse1) 1) v_ArrVal_941) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse4 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| (select .cse5 .cse1))) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647)))))))))) is different from false [2022-11-14 19:14:38,380 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88| Int)) (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (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 ((.cse6 (store .cse11 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_931))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_933) .cse7 v_ArrVal_935)) |c_~#stored_elements~0.base| v_ArrVal_936))) (let ((.cse0 (select .cse10 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_937)) (.cse9 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse8 (store (store .cse10 |c_~#queue~0.base| (store (store .cse5 .cse9 v_ArrVal_939) .cse1 v_ArrVal_941)) |c_~#stored_elements~0.base| v_ArrVal_943))) (let ((.cse2 (select .cse8 |c_~#queue~0.base|))) (let ((.cse4 (store .cse2 (+ (* 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 .cse4 .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_85| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse2 .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_79| (select .cse3 .cse1))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_948) (< (+ (select .cse5 .cse1) 1) v_ArrVal_941) (< (+ (select .cse6 .cse7) 1) v_ArrVal_935))))))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88| (select .cse11 .cse7)))))) is different from false [2022-11-14 19:14:38,525 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 ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_931)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_933) .cse6 v_ArrVal_935)) |c_~#stored_elements~0.base| v_ArrVal_936))) (let ((.cse3 (select .cse11 |c_~#queue~0.base|))) (let ((.cse7 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_937)) (.cse10 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (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 ((.cse0 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_945))) (let ((.cse2 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse0 .cse10 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_948) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse4 .cse1))) (< (+ (select .cse5 .cse6) 1) v_ArrVal_935) (< (+ (select .cse7 .cse1) 1) v_ArrVal_941) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88| (select .cse8 .cse6))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse2 .cse1)))))))))))))) is different from false [2022-11-14 19:14:52,614 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_928 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 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_928)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_929))) (let ((.cse5 (select .cse11 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88|) |c_~#queue~0.offset|) v_ArrVal_931)) (.cse9 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store (store .cse3 .cse9 v_ArrVal_933) .cse1 v_ArrVal_935)) |c_~#stored_elements~0.base| v_ArrVal_936))) (let ((.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse2 (store .cse7 (+ (* 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 .cse2 .cse9 v_ArrVal_939) .cse1 v_ArrVal_941)) |c_~#stored_elements~0.base| v_ArrVal_943))) (let ((.cse0 (select .cse8 |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_945))) (let ((.cse6 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse4 .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_82| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_941) (< (+ (select .cse3 .cse1) 1) v_ArrVal_935) (< (+ (select .cse4 .cse1) 1) v_ArrVal_948) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88| (select .cse5 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse6 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| (select .cse7 .cse1))) (< (select (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647))))))))))))) is different from false [2022-11-14 19:14:52,646 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:14:52,646 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-14 19:14:52,678 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:14:52,679 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-14 19:14:52,704 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 496 treesize of output 488 [2022-11-14 19:14:52,725 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 893 treesize of output 829 [2022-11-14 19:14:52,746 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 1010 treesize of output 978 [2022-11-14 19:14:52,768 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-14 19:14:52,800 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-14 19:14:53,222 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:14:53,223 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 469 treesize of output 465 [2022-11-14 19:14:54,539 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-11-14 19:14:54,540 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-14 19:14:54,597 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 82 refuted. 29 times theorem prover too weak. 0 trivial. 90 not checked. [2022-11-14 19:14:54,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170944802] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-14 19:14:54,599 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-14 19:14:54,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 43] total 110 [2022-11-14 19:14:54,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114861113] [2022-11-14 19:14:54,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-14 19:14:54,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 111 states [2022-11-14 19:14:54,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:14:54,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2022-11-14 19:14:54,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1298, Invalid=8052, Unknown=208, NotChecked=2652, Total=12210 [2022-11-14 19:14:54,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:14:54,603 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:14:54,604 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-14 19:14:54,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:14:54,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:14:54,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:14:54,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:14:54,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:14:54,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2022-11-14 19:14:54,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-14 19:14:54,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:14:54,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:14:54,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2022-11-14 19:14:54,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2022-11-14 19:14:54,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-11-14 19:14:54,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2022-11-14 19:14:54,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2022-11-14 19:14:54,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:16:22,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-14 19:16:22,976 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-14 19:16:22,977 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: at most one deprecated predicate at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:973) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:768) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.partialorder.MinimalSleepSetReduction.internalSuccessors(MinimalSleepSetReduction.java:154) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$0(INwaOutgoingLetterAndTransitionProvider.java:123) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.nextLetter(NestedIterator.java:69) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.(NestedIterator.java:62) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIteratorNoopConstruction.(NestedIteratorNoopConstruction.java:48) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$1(INwaOutgoingLetterAndTransitionProvider.java:124) at java.base/java.lang.Iterable.spliterator(Iterable.java:101) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:235) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:165) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:98) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:122) at de.uni_freiburg.informatik.ultimate.automata.partialorder.PersistentSetReduction.applyNewStateReduction(PersistentSetReduction.java:73) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:264) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:466) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-14 19:16:22,979 INFO L158 Benchmark]: Toolchain (without parser) took 715423.38ms. Allocated memory was 189.8MB in the beginning and 997.2MB in the end (delta: 807.4MB). Free memory was 132.0MB in the beginning and 523.6MB in the end (delta: -391.7MB). Peak memory consumption was 416.5MB. Max. memory is 8.0GB. [2022-11-14 19:16:22,979 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 189.8MB. Free memory is still 149.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-11-14 19:16:22,979 INFO L158 Benchmark]: CACSL2BoogieTranslator took 577.30ms. Allocated memory was 189.8MB in the beginning and 242.2MB in the end (delta: 52.4MB). Free memory was 131.7MB in the beginning and 196.3MB in the end (delta: -64.6MB). Peak memory consumption was 10.7MB. Max. memory is 8.0GB. [2022-11-14 19:16:22,979 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.66ms. Allocated memory is still 242.2MB. Free memory was 196.3MB in the beginning and 193.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-11-14 19:16:22,979 INFO L158 Benchmark]: Boogie Preprocessor took 42.15ms. Allocated memory is still 242.2MB. Free memory was 193.2MB in the beginning and 191.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-11-14 19:16:22,980 INFO L158 Benchmark]: RCFGBuilder took 695.60ms. Allocated memory is still 242.2MB. Free memory was 191.1MB in the beginning and 168.5MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-11-14 19:16:22,980 INFO L158 Benchmark]: TraceAbstraction took 714037.04ms. Allocated memory was 242.2MB in the beginning and 997.2MB in the end (delta: 755.0MB). Free memory was 167.5MB in the beginning and 523.6MB in the end (delta: -356.2MB). Peak memory consumption was 399.6MB. Max. memory is 8.0GB. [2022-11-14 19:16:22,981 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.42ms. Allocated memory is still 189.8MB. Free memory is still 149.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 577.30ms. Allocated memory was 189.8MB in the beginning and 242.2MB in the end (delta: 52.4MB). Free memory was 131.7MB in the beginning and 196.3MB in the end (delta: -64.6MB). Peak memory consumption was 10.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 64.66ms. Allocated memory is still 242.2MB. Free memory was 196.3MB in the beginning and 193.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.15ms. Allocated memory is still 242.2MB. Free memory was 193.2MB in the beginning and 191.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 695.60ms. Allocated memory is still 242.2MB. Free memory was 191.1MB in the beginning and 168.5MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 714037.04ms. Allocated memory was 242.2MB in the beginning and 997.2MB in the end (delta: 755.0MB). Free memory was 167.5MB in the beginning and 523.6MB in the end (delta: -356.2MB). Peak memory consumption was 399.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: at most one deprecated predicate de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: at most one deprecated predicate: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:973) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-11-14 19:16:22,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2022-11-14 19:16:23,388 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-11-14 19:16:23,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...