/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/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_ok_longer.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-?-3902331-m [2022-09-20 22:14:06,050 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-20 22:14:06,052 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-20 22:14:06,095 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-20 22:14:06,096 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-20 22:14:06,099 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-20 22:14:06,102 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-20 22:14:06,104 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-20 22:14:06,106 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-20 22:14:06,110 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-20 22:14:06,111 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-20 22:14:06,112 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-20 22:14:06,113 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-20 22:14:06,115 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-20 22:14:06,116 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-20 22:14:06,119 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-20 22:14:06,119 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-20 22:14:06,120 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-20 22:14:06,122 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-20 22:14:06,128 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-20 22:14:06,129 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-20 22:14:06,131 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-20 22:14:06,132 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-20 22:14:06,133 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-20 22:14:06,140 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-20 22:14:06,140 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-20 22:14:06,141 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-20 22:14:06,142 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-20 22:14:06,143 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-20 22:14:06,143 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-20 22:14:06,143 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-20 22:14:06,144 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-20 22:14:06,146 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-20 22:14:06,146 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-20 22:14:06,147 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-20 22:14:06,147 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-20 22:14:06,148 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-20 22:14:06,148 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-20 22:14:06,148 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-20 22:14:06,149 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-20 22:14:06,149 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-20 22:14:06,150 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-09-20 22:14:06,181 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-20 22:14:06,182 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-20 22:14:06,183 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-20 22:14:06,183 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-20 22:14:06,183 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-20 22:14:06,184 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-20 22:14:06,184 INFO L138 SettingsManager]: * Use SBE=true [2022-09-20 22:14:06,184 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-20 22:14:06,184 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-20 22:14:06,184 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-20 22:14:06,185 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-20 22:14:06,185 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-20 22:14:06,185 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-20 22:14:06,185 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-20 22:14:06,185 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-20 22:14:06,185 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-20 22:14:06,185 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-20 22:14:06,185 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-20 22:14:06,185 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-20 22:14:06,186 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-20 22:14:06,186 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-20 22:14:06,186 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-20 22:14:06,186 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-20 22:14:06,186 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 22:14:06,186 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-20 22:14:06,186 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-20 22:14:06,186 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-20 22:14:06,186 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-20 22:14:06,186 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-20 22:14:06,186 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-20 22:14:06,186 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-09-20 22:14:06,187 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 [2022-09-20 22:14:06,417 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-20 22:14:06,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-20 22:14:06,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-20 22:14:06,446 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-20 22:14:06,446 INFO L275 PluginConnector]: CDTParser initialized [2022-09-20 22:14:06,448 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longer.i [2022-09-20 22:14:06,514 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c73e4f788/8c1258ed45684876bfc3ed8698b3dd76/FLAG2a9473269 [2022-09-20 22:14:06,965 INFO L306 CDTParser]: Found 1 translation units. [2022-09-20 22:14:06,966 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i [2022-09-20 22:14:06,981 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c73e4f788/8c1258ed45684876bfc3ed8698b3dd76/FLAG2a9473269 [2022-09-20 22:14:07,288 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c73e4f788/8c1258ed45684876bfc3ed8698b3dd76 [2022-09-20 22:14:07,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-20 22:14:07,291 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-20 22:14:07,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-20 22:14:07,293 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-20 22:14:07,295 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-20 22:14:07,296 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 10:14:07" (1/1) ... [2022-09-20 22:14:07,297 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cae7e2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:14:07, skipping insertion in model container [2022-09-20 22:14:07,297 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 10:14:07" (1/1) ... [2022-09-20 22:14:07,303 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-20 22:14:07,339 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-20 22:14:07,719 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i[43272,43285] [2022-09-20 22:14:07,723 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i[43545,43558] [2022-09-20 22:14:07,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 22:14:07,736 INFO L203 MainTranslator]: Completed pre-run [2022-09-20 22:14:07,788 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i[43272,43285] [2022-09-20 22:14:07,791 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i[43545,43558] [2022-09-20 22:14:07,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 22:14:07,836 INFO L208 MainTranslator]: Completed translation [2022-09-20 22:14:07,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:14:07 WrapperNode [2022-09-20 22:14:07,837 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-20 22:14:07,838 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-20 22:14:07,839 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-20 22:14:07,839 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-20 22:14:07,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:14:07" (1/1) ... [2022-09-20 22:14:07,872 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:14:07" (1/1) ... [2022-09-20 22:14:07,908 INFO L138 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 204 [2022-09-20 22:14:07,909 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-20 22:14:07,910 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-20 22:14:07,910 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-20 22:14:07,910 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-20 22:14:07,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:14:07" (1/1) ... [2022-09-20 22:14:07,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:14:07" (1/1) ... [2022-09-20 22:14:07,920 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:14:07" (1/1) ... [2022-09-20 22:14:07,920 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:14:07" (1/1) ... [2022-09-20 22:14:07,929 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:14:07" (1/1) ... [2022-09-20 22:14:07,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:14:07" (1/1) ... [2022-09-20 22:14:07,935 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:14:07" (1/1) ... [2022-09-20 22:14:07,939 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-20 22:14:07,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-20 22:14:07,939 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-20 22:14:07,940 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-20 22:14:07,940 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:14:07" (1/1) ... [2022-09-20 22:14:07,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 22:14:07,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 22:14:07,970 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-09-20 22:14:07,981 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-09-20 22:14:08,005 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-09-20 22:14:08,005 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-09-20 22:14:08,005 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-09-20 22:14:08,005 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-09-20 22:14:08,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-20 22:14:08,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-20 22:14:08,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-09-20 22:14:08,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-20 22:14:08,006 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-09-20 22:14:08,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-20 22:14:08,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-20 22:14:08,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-20 22:14:08,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-20 22:14:08,008 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-20 22:14:08,153 INFO L234 CfgBuilder]: Building ICFG [2022-09-20 22:14:08,154 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-20 22:14:08,478 INFO L275 CfgBuilder]: Performing block encoding [2022-09-20 22:14:08,490 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-20 22:14:08,490 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-09-20 22:14:08,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 10:14:08 BoogieIcfgContainer [2022-09-20 22:14:08,493 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-20 22:14:08,495 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-20 22:14:08,496 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-20 22:14:08,499 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-20 22:14:08,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 10:14:07" (1/3) ... [2022-09-20 22:14:08,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b131a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 10:14:08, skipping insertion in model container [2022-09-20 22:14:08,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:14:07" (2/3) ... [2022-09-20 22:14:08,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b131a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 10:14:08, skipping insertion in model container [2022-09-20 22:14:08,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 10:14:08" (3/3) ... [2022-09-20 22:14:08,502 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2022-09-20 22:14:08,518 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-20 22:14:08,518 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-09-20 22:14:08,518 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-20 22:14:08,637 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-09-20 22:14:08,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 225 places, 231 transitions, 478 flow [2022-09-20 22:14:08,802 INFO L130 PetriNetUnfolder]: 13/229 cut-off events. [2022-09-20 22:14:08,802 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-09-20 22:14:08,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 229 events. 13/229 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 364 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 146. Up to 3 conditions per place. [2022-09-20 22:14:08,810 INFO L82 GeneralOperation]: Start removeDead. Operand has 225 places, 231 transitions, 478 flow [2022-09-20 22:14:08,820 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 213 places, 219 transitions, 447 flow [2022-09-20 22:14:08,834 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-09-20 22:14:08,842 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=false, mAutomataTypeConcurrency=PETRI_NET, 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;@42a16273, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-20 22:14:08,842 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-09-20 22:14:08,866 INFO L130 PetriNetUnfolder]: 1/64 cut-off events. [2022-09-20 22:14:08,866 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-09-20 22:14:08,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:14:08,867 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:14:08,868 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-09-20 22:14:08,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:14:08,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1145000913, now seen corresponding path program 1 times [2022-09-20 22:14:08,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:14:08,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506370988] [2022-09-20 22:14:08,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:14:08,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:14:09,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:14:09,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:14:09,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:14:09,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506370988] [2022-09-20 22:14:09,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506370988] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:14:09,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:14:09,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-20 22:14:09,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9847597] [2022-09-20 22:14:09,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:14:09,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-09-20 22:14:09,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:14:09,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-09-20 22:14:09,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-09-20 22:14:09,159 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 231 [2022-09-20 22:14:09,165 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 219 transitions, 447 flow. Second operand has 2 states, 2 states have (on average 220.5) internal successors, (441), 2 states have internal predecessors, (441), 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-09-20 22:14:09,165 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:14:09,165 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 231 [2022-09-20 22:14:09,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:14:09,252 INFO L130 PetriNetUnfolder]: 9/210 cut-off events. [2022-09-20 22:14:09,252 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-09-20 22:14:09,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 210 events. 9/210 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 274 event pairs, 0 based on Foata normal form. 5/205 useless extension candidates. Maximal degree in co-relation 143. Up to 4 conditions per place. [2022-09-20 22:14:09,256 INFO L137 encePairwiseOnDemand]: 227/231 looper letters, 3 selfloop transitions, 0 changer transitions 0/210 dead transitions. [2022-09-20 22:14:09,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 210 transitions, 435 flow [2022-09-20 22:14:09,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-20 22:14:09,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-09-20 22:14:09,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 447 transitions. [2022-09-20 22:14:09,273 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9675324675324676 [2022-09-20 22:14:09,273 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 447 transitions. [2022-09-20 22:14:09,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 447 transitions. [2022-09-20 22:14:09,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:14:09,277 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 447 transitions. [2022-09-20 22:14:09,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 223.5) internal successors, (447), 2 states have internal predecessors, (447), 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-09-20 22:14:09,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:14:09,286 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:14:09,287 INFO L175 Difference]: Start difference. First operand has 213 places, 219 transitions, 447 flow. Second operand 2 states and 447 transitions. [2022-09-20 22:14:09,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 210 transitions, 435 flow [2022-09-20 22:14:09,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 210 transitions, 430 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-09-20 22:14:09,295 INFO L231 Difference]: Finished difference. Result has 206 places, 210 transitions, 424 flow [2022-09-20 22:14:09,298 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=424, PETRI_PLACES=206, PETRI_TRANSITIONS=210} [2022-09-20 22:14:09,301 INFO L287 CegarLoopForPetriNet]: 213 programPoint places, -7 predicate places. [2022-09-20 22:14:09,301 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 210 transitions, 424 flow [2022-09-20 22:14:09,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 220.5) internal successors, (441), 2 states have internal predecessors, (441), 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-09-20 22:14:09,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:14:09,302 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:14:09,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-20 22:14:09,302 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-09-20 22:14:09,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:14:09,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1194749697, now seen corresponding path program 1 times [2022-09-20 22:14:09,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:14:09,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617109736] [2022-09-20 22:14:09,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:14:09,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:14:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:14:09,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:14:09,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:14:09,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617109736] [2022-09-20 22:14:09,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617109736] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:14:09,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:14:09,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-09-20 22:14:09,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762329486] [2022-09-20 22:14:09,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:14:09,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-09-20 22:14:09,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:14:09,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-09-20 22:14:09,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-09-20 22:14:09,722 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 231 [2022-09-20 22:14:09,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 210 transitions, 424 flow. Second operand has 12 states, 12 states have (on average 169.25) internal successors, (2031), 12 states have internal predecessors, (2031), 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-09-20 22:14:09,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:14:09,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 231 [2022-09-20 22:14:09,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:14:10,521 INFO L130 PetriNetUnfolder]: 611/2582 cut-off events. [2022-09-20 22:14:10,523 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-09-20 22:14:10,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3514 conditions, 2582 events. 611/2582 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 20479 event pairs, 459 based on Foata normal form. 0/2410 useless extension candidates. Maximal degree in co-relation 3511. Up to 882 conditions per place. [2022-09-20 22:14:10,553 INFO L137 encePairwiseOnDemand]: 218/231 looper letters, 42 selfloop transitions, 12 changer transitions 0/206 dead transitions. [2022-09-20 22:14:10,553 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 206 transitions, 524 flow [2022-09-20 22:14:10,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-20 22:14:10,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-09-20 22:14:10,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2213 transitions. [2022-09-20 22:14:10,560 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.736929736929737 [2022-09-20 22:14:10,560 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2213 transitions. [2022-09-20 22:14:10,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2213 transitions. [2022-09-20 22:14:10,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:14:10,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2213 transitions. [2022-09-20 22:14:10,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 170.23076923076923) internal successors, (2213), 13 states have internal predecessors, (2213), 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-09-20 22:14:10,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 231.0) internal successors, (3234), 14 states have internal predecessors, (3234), 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-09-20 22:14:10,577 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 231.0) internal successors, (3234), 14 states have internal predecessors, (3234), 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-09-20 22:14:10,577 INFO L175 Difference]: Start difference. First operand has 206 places, 210 transitions, 424 flow. Second operand 13 states and 2213 transitions. [2022-09-20 22:14:10,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 206 transitions, 524 flow [2022-09-20 22:14:10,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 206 transitions, 524 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-09-20 22:14:10,586 INFO L231 Difference]: Finished difference. Result has 215 places, 206 transitions, 440 flow [2022-09-20 22:14:10,587 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=440, PETRI_PLACES=215, PETRI_TRANSITIONS=206} [2022-09-20 22:14:10,588 INFO L287 CegarLoopForPetriNet]: 213 programPoint places, 2 predicate places. [2022-09-20 22:14:10,588 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 206 transitions, 440 flow [2022-09-20 22:14:10,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 169.25) internal successors, (2031), 12 states have internal predecessors, (2031), 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-09-20 22:14:10,589 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:14:10,590 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:14:10,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-20 22:14:10,590 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-09-20 22:14:10,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:14:10,591 INFO L85 PathProgramCache]: Analyzing trace with hash -933293975, now seen corresponding path program 1 times [2022-09-20 22:14:10,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:14:10,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761444138] [2022-09-20 22:14:10,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:14:10,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:14:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:14:10,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:14:10,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:14:10,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761444138] [2022-09-20 22:14:10,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761444138] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:14:10,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:14:10,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-20 22:14:10,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446579056] [2022-09-20 22:14:10,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:14:10,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-20 22:14:10,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:14:10,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-20 22:14:10,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-20 22:14:10,737 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 231 [2022-09-20 22:14:10,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 206 transitions, 440 flow. Second operand has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 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-09-20 22:14:10,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:14:10,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 231 [2022-09-20 22:14:10,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:14:10,784 INFO L130 PetriNetUnfolder]: 16/307 cut-off events. [2022-09-20 22:14:10,784 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-09-20 22:14:10,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 350 conditions, 307 events. 16/307 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 693 event pairs, 2 based on Foata normal form. 0/291 useless extension candidates. Maximal degree in co-relation 346. Up to 12 conditions per place. [2022-09-20 22:14:10,786 INFO L137 encePairwiseOnDemand]: 227/231 looper letters, 7 selfloop transitions, 2 changer transitions 5/209 dead transitions. [2022-09-20 22:14:10,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 209 transitions, 473 flow [2022-09-20 22:14:10,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-20 22:14:10,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-09-20 22:14:10,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 655 transitions. [2022-09-20 22:14:10,788 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9451659451659452 [2022-09-20 22:14:10,788 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 655 transitions. [2022-09-20 22:14:10,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 655 transitions. [2022-09-20 22:14:10,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:14:10,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 655 transitions. [2022-09-20 22:14:10,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 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-09-20 22:14:10,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 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-09-20 22:14:10,795 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 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-09-20 22:14:10,795 INFO L175 Difference]: Start difference. First operand has 215 places, 206 transitions, 440 flow. Second operand 3 states and 655 transitions. [2022-09-20 22:14:10,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 209 transitions, 473 flow [2022-09-20 22:14:10,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 209 transitions, 450 flow, removed 0 selfloop flow, removed 11 redundant places. [2022-09-20 22:14:10,800 INFO L231 Difference]: Finished difference. Result has 207 places, 203 transitions, 419 flow [2022-09-20 22:14:10,800 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=419, PETRI_PLACES=207, PETRI_TRANSITIONS=203} [2022-09-20 22:14:10,802 INFO L287 CegarLoopForPetriNet]: 213 programPoint places, -6 predicate places. [2022-09-20 22:14:10,802 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 203 transitions, 419 flow [2022-09-20 22:14:10,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 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-09-20 22:14:10,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:14:10,803 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:14:10,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-09-20 22:14:10,804 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-09-20 22:14:10,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:14:10,805 INFO L85 PathProgramCache]: Analyzing trace with hash -501272042, now seen corresponding path program 1 times [2022-09-20 22:14:10,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:14:10,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822145681] [2022-09-20 22:14:10,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:14:10,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:14:10,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:14:10,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:14:10,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:14:10,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822145681] [2022-09-20 22:14:10,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822145681] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:14:10,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:14:10,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-20 22:14:10,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056387318] [2022-09-20 22:14:10,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:14:10,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-20 22:14:10,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:14:10,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-20 22:14:10,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-20 22:14:10,894 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 231 [2022-09-20 22:14:10,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 203 transitions, 419 flow. Second operand has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 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-09-20 22:14:10,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:14:10,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 231 [2022-09-20 22:14:10,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:14:10,943 INFO L130 PetriNetUnfolder]: 20/336 cut-off events. [2022-09-20 22:14:10,943 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-09-20 22:14:10,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406 conditions, 336 events. 20/336 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 664 event pairs, 6 based on Foata normal form. 0/324 useless extension candidates. Maximal degree in co-relation 401. Up to 24 conditions per place. [2022-09-20 22:14:10,945 INFO L137 encePairwiseOnDemand]: 228/231 looper letters, 13 selfloop transitions, 2 changer transitions 1/208 dead transitions. [2022-09-20 22:14:10,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 208 transitions, 461 flow [2022-09-20 22:14:10,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-20 22:14:10,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-09-20 22:14:10,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 655 transitions. [2022-09-20 22:14:10,947 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9451659451659452 [2022-09-20 22:14:10,947 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 655 transitions. [2022-09-20 22:14:10,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 655 transitions. [2022-09-20 22:14:10,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:14:10,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 655 transitions. [2022-09-20 22:14:10,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 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-09-20 22:14:10,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 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-09-20 22:14:10,952 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 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-09-20 22:14:10,952 INFO L175 Difference]: Start difference. First operand has 207 places, 203 transitions, 419 flow. Second operand 3 states and 655 transitions. [2022-09-20 22:14:10,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 208 transitions, 461 flow [2022-09-20 22:14:10,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 208 transitions, 457 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-09-20 22:14:10,956 INFO L231 Difference]: Finished difference. Result has 207 places, 203 transitions, 425 flow [2022-09-20 22:14:10,957 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=425, PETRI_PLACES=207, PETRI_TRANSITIONS=203} [2022-09-20 22:14:10,958 INFO L287 CegarLoopForPetriNet]: 213 programPoint places, -6 predicate places. [2022-09-20 22:14:10,958 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 203 transitions, 425 flow [2022-09-20 22:14:10,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 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-09-20 22:14:10,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:14:10,964 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:14:10,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-09-20 22:14:10,964 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-09-20 22:14:10,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:14:10,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1789731816, now seen corresponding path program 1 times [2022-09-20 22:14:10,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:14:10,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801542628] [2022-09-20 22:14:10,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:14:10,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:14:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:14:11,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:14:11,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:14:11,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801542628] [2022-09-20 22:14:11,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801542628] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 22:14:11,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238141286] [2022-09-20 22:14:11,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:14:11,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 22:14:11,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 22:14:11,103 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-20 22:14:11,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-09-20 22:14:11,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:14:11,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 4 conjunts are in the unsatisfiable core [2022-09-20 22:14:11,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 22:14:11,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:14:11,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 22:14:11,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:14:11,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238141286] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-20 22:14:11,520 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-20 22:14:11,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-09-20 22:14:11,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507059999] [2022-09-20 22:14:11,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-20 22:14:11,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-09-20 22:14:11,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:14:11,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-09-20 22:14:11,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-09-20 22:14:11,525 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 231 [2022-09-20 22:14:11,527 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 203 transitions, 425 flow. Second operand has 10 states, 10 states have (on average 214.2) internal successors, (2142), 10 states have internal predecessors, (2142), 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-09-20 22:14:11,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:14:11,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 231 [2022-09-20 22:14:11,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:14:11,637 INFO L130 PetriNetUnfolder]: 30/423 cut-off events. [2022-09-20 22:14:11,637 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-09-20 22:14:11,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 423 events. 30/423 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 682 event pairs, 4 based on Foata normal form. 4/416 useless extension candidates. Maximal degree in co-relation 537. Up to 19 conditions per place. [2022-09-20 22:14:11,640 INFO L137 encePairwiseOnDemand]: 225/231 looper letters, 20 selfloop transitions, 9 changer transitions 0/220 dead transitions. [2022-09-20 22:14:11,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 220 transitions, 533 flow [2022-09-20 22:14:11,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 22:14:11,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 22:14:11,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1939 transitions. [2022-09-20 22:14:11,645 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9326599326599326 [2022-09-20 22:14:11,645 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1939 transitions. [2022-09-20 22:14:11,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1939 transitions. [2022-09-20 22:14:11,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:14:11,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1939 transitions. [2022-09-20 22:14:11,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 215.44444444444446) internal successors, (1939), 9 states have internal predecessors, (1939), 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-09-20 22:14:11,653 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 231.0) internal successors, (2310), 10 states have internal predecessors, (2310), 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-09-20 22:14:11,654 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 231.0) internal successors, (2310), 10 states have internal predecessors, (2310), 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-09-20 22:14:11,654 INFO L175 Difference]: Start difference. First operand has 207 places, 203 transitions, 425 flow. Second operand 9 states and 1939 transitions. [2022-09-20 22:14:11,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 220 transitions, 533 flow [2022-09-20 22:14:11,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 220 transitions, 531 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-09-20 22:14:11,659 INFO L231 Difference]: Finished difference. Result has 216 places, 209 transitions, 473 flow [2022-09-20 22:14:11,659 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=473, PETRI_PLACES=216, PETRI_TRANSITIONS=209} [2022-09-20 22:14:11,662 INFO L287 CegarLoopForPetriNet]: 213 programPoint places, 3 predicate places. [2022-09-20 22:14:11,662 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 209 transitions, 473 flow [2022-09-20 22:14:11,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 214.2) internal successors, (2142), 10 states have internal predecessors, (2142), 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-09-20 22:14:11,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:14:11,665 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:14:11,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-09-20 22:14:11,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 22:14:11,888 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-09-20 22:14:11,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:14:11,888 INFO L85 PathProgramCache]: Analyzing trace with hash -146638564, now seen corresponding path program 2 times [2022-09-20 22:14:11,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:14:11,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520666944] [2022-09-20 22:14:11,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:14:11,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:14:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:14:12,007 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-09-20 22:14:12,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:14:12,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520666944] [2022-09-20 22:14:12,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520666944] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:14:12,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:14:12,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-20 22:14:12,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922811838] [2022-09-20 22:14:12,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:14:12,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-20 22:14:12,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:14:12,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-20 22:14:12,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-20 22:14:12,013 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 231 [2022-09-20 22:14:12,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 209 transitions, 473 flow. Second operand has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 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-09-20 22:14:12,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:14:12,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 231 [2022-09-20 22:14:12,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:14:12,103 INFO L130 PetriNetUnfolder]: 25/611 cut-off events. [2022-09-20 22:14:12,103 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-09-20 22:14:12,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 733 conditions, 611 events. 25/611 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 1292 event pairs, 3 based on Foata normal form. 2/596 useless extension candidates. Maximal degree in co-relation 725. Up to 19 conditions per place. [2022-09-20 22:14:12,107 INFO L137 encePairwiseOnDemand]: 227/231 looper letters, 12 selfloop transitions, 3 changer transitions 3/211 dead transitions. [2022-09-20 22:14:12,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 211 transitions, 512 flow [2022-09-20 22:14:12,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-20 22:14:12,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-09-20 22:14:12,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 645 transitions. [2022-09-20 22:14:12,112 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9307359307359307 [2022-09-20 22:14:12,112 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 645 transitions. [2022-09-20 22:14:12,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 645 transitions. [2022-09-20 22:14:12,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:14:12,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 645 transitions. [2022-09-20 22:14:12,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 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-09-20 22:14:12,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 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-09-20 22:14:12,116 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 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-09-20 22:14:12,116 INFO L175 Difference]: Start difference. First operand has 216 places, 209 transitions, 473 flow. Second operand 3 states and 645 transitions. [2022-09-20 22:14:12,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 211 transitions, 512 flow [2022-09-20 22:14:12,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 211 transitions, 506 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-09-20 22:14:12,122 INFO L231 Difference]: Finished difference. Result has 217 places, 206 transitions, 467 flow [2022-09-20 22:14:12,122 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=467, PETRI_PLACES=217, PETRI_TRANSITIONS=206} [2022-09-20 22:14:12,125 INFO L287 CegarLoopForPetriNet]: 213 programPoint places, 4 predicate places. [2022-09-20 22:14:12,125 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 206 transitions, 467 flow [2022-09-20 22:14:12,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 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-09-20 22:14:12,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:14:12,126 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:14:12,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-09-20 22:14:12,126 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-09-20 22:14:12,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:14:12,126 INFO L85 PathProgramCache]: Analyzing trace with hash -575821856, now seen corresponding path program 1 times [2022-09-20 22:14:12,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:14:12,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470284738] [2022-09-20 22:14:12,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:14:12,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:14:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:14:12,295 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:14:12,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:14:12,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470284738] [2022-09-20 22:14:12,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470284738] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 22:14:12,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744988008] [2022-09-20 22:14:12,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:14:12,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 22:14:12,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 22:14:12,297 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-09-20 22:14:12,299 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-09-20 22:14:12,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:14:12,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 8 conjunts are in the unsatisfiable core [2022-09-20 22:14:12,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 22:14:12,620 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:14:12,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 22:14:12,801 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:14:12,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744988008] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-20 22:14:12,801 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-20 22:14:12,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-09-20 22:14:12,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975773653] [2022-09-20 22:14:12,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-20 22:14:12,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-09-20 22:14:12,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:14:12,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-09-20 22:14:12,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-09-20 22:14:12,808 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 231 [2022-09-20 22:14:12,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 206 transitions, 467 flow. Second operand has 18 states, 18 states have (on average 214.33333333333334) internal successors, (3858), 18 states have internal predecessors, (3858), 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-09-20 22:14:12,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:14:12,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 231 [2022-09-20 22:14:12,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:14:13,108 INFO L130 PetriNetUnfolder]: 58/747 cut-off events. [2022-09-20 22:14:13,108 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2022-09-20 22:14:13,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1056 conditions, 747 events. 58/747 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1397 event pairs, 4 based on Foata normal form. 8/736 useless extension candidates. Maximal degree in co-relation 1047. Up to 39 conditions per place. [2022-09-20 22:14:13,113 INFO L137 encePairwiseOnDemand]: 225/231 looper letters, 40 selfloop transitions, 21 changer transitions 1/249 dead transitions. [2022-09-20 22:14:13,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 249 transitions, 765 flow [2022-09-20 22:14:13,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-09-20 22:14:13,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-09-20 22:14:13,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4517 transitions. [2022-09-20 22:14:13,123 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9311482168625026 [2022-09-20 22:14:13,123 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 4517 transitions. [2022-09-20 22:14:13,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 4517 transitions. [2022-09-20 22:14:13,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:14:13,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 4517 transitions. [2022-09-20 22:14:13,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 215.0952380952381) internal successors, (4517), 21 states have internal predecessors, (4517), 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-09-20 22:14:13,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 231.0) internal successors, (5082), 22 states have internal predecessors, (5082), 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-09-20 22:14:13,145 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 231.0) internal successors, (5082), 22 states have internal predecessors, (5082), 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-09-20 22:14:13,145 INFO L175 Difference]: Start difference. First operand has 217 places, 206 transitions, 467 flow. Second operand 21 states and 4517 transitions. [2022-09-20 22:14:13,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 249 transitions, 765 flow [2022-09-20 22:14:13,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 249 transitions, 762 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-09-20 22:14:13,150 INFO L231 Difference]: Finished difference. Result has 238 places, 218 transitions, 592 flow [2022-09-20 22:14:13,151 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=592, PETRI_PLACES=238, PETRI_TRANSITIONS=218} [2022-09-20 22:14:13,151 INFO L287 CegarLoopForPetriNet]: 213 programPoint places, 25 predicate places. [2022-09-20 22:14:13,151 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 218 transitions, 592 flow [2022-09-20 22:14:13,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 214.33333333333334) internal successors, (3858), 18 states have internal predecessors, (3858), 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-09-20 22:14:13,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:14:13,153 INFO L208 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:14:13,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-09-20 22:14:13,376 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,SelfDestructingSolverStorable6 [2022-09-20 22:14:13,377 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-09-20 22:14:13,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:14:13,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1487146016, now seen corresponding path program 2 times [2022-09-20 22:14:13,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:14:13,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83584313] [2022-09-20 22:14:13,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:14:13,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:14:13,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:14:13,679 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:14:13,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:14:13,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83584313] [2022-09-20 22:14:13,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83584313] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 22:14:13,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982777927] [2022-09-20 22:14:13,679 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-20 22:14:13,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 22:14:13,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 22:14:13,681 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-09-20 22:14:13,710 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-09-20 22:14:13,939 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-20 22:14:13,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-20 22:14:13,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 16 conjunts are in the unsatisfiable core [2022-09-20 22:14:13,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 22:14:14,253 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:14:14,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 22:14:14,723 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:14:14,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982777927] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-20 22:14:14,723 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-20 22:14:14,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2022-09-20 22:14:14,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000099452] [2022-09-20 22:14:14,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-20 22:14:14,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-09-20 22:14:14,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:14:14,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-09-20 22:14:14,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2022-09-20 22:14:14,739 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 231 [2022-09-20 22:14:14,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 218 transitions, 592 flow. Second operand has 34 states, 34 states have (on average 214.41176470588235) internal successors, (7290), 34 states have internal predecessors, (7290), 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-09-20 22:14:14,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:14:14,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 231 [2022-09-20 22:14:14,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:14:15,631 INFO L130 PetriNetUnfolder]: 114/1393 cut-off events. [2022-09-20 22:14:15,631 INFO L131 PetriNetUnfolder]: For 465/465 co-relation queries the response was YES. [2022-09-20 22:14:15,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2169 conditions, 1393 events. 114/1393 cut-off events. For 465/465 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 2819 event pairs, 4 based on Foata normal form. 16/1374 useless extension candidates. Maximal degree in co-relation 2155. Up to 79 conditions per place. [2022-09-20 22:14:15,639 INFO L137 encePairwiseOnDemand]: 225/231 looper letters, 80 selfloop transitions, 45 changer transitions 0/312 dead transitions. [2022-09-20 22:14:15,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 312 transitions, 1330 flow [2022-09-20 22:14:15,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-09-20 22:14:15,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2022-09-20 22:14:15,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 9673 transitions. [2022-09-20 22:14:15,658 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9305435305435306 [2022-09-20 22:14:15,659 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 9673 transitions. [2022-09-20 22:14:15,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 9673 transitions. [2022-09-20 22:14:15,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:14:15,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 9673 transitions. [2022-09-20 22:14:15,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 46 states, 45 states have (on average 214.95555555555555) internal successors, (9673), 45 states have internal predecessors, (9673), 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-09-20 22:14:15,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 46 states, 46 states have (on average 231.0) internal successors, (10626), 46 states have internal predecessors, (10626), 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-09-20 22:14:15,706 INFO L81 ComplementDD]: Finished complementDD. Result has 46 states, 46 states have (on average 231.0) internal successors, (10626), 46 states have internal predecessors, (10626), 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-09-20 22:14:15,707 INFO L175 Difference]: Start difference. First operand has 238 places, 218 transitions, 592 flow. Second operand 45 states and 9673 transitions. [2022-09-20 22:14:15,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 312 transitions, 1330 flow [2022-09-20 22:14:15,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 312 transitions, 1290 flow, removed 14 selfloop flow, removed 6 redundant places. [2022-09-20 22:14:15,720 INFO L231 Difference]: Finished difference. Result has 284 places, 243 transitions, 870 flow [2022-09-20 22:14:15,721 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=870, PETRI_PLACES=284, PETRI_TRANSITIONS=243} [2022-09-20 22:14:15,723 INFO L287 CegarLoopForPetriNet]: 213 programPoint places, 71 predicate places. [2022-09-20 22:14:15,723 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 243 transitions, 870 flow [2022-09-20 22:14:15,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 214.41176470588235) internal successors, (7290), 34 states have internal predecessors, (7290), 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-09-20 22:14:15,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:14:15,725 INFO L208 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:14:15,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-09-20 22:14:15,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 22:14:15,949 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-09-20 22:14:15,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:14:15,950 INFO L85 PathProgramCache]: Analyzing trace with hash -328403168, now seen corresponding path program 3 times [2022-09-20 22:14:15,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:14:15,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264268776] [2022-09-20 22:14:15,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:14:15,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:14:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:14:16,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3270 backedges. 0 proven. 3270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:14:16,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:14:16,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264268776] [2022-09-20 22:14:16,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264268776] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 22:14:16,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088082777] [2022-09-20 22:14:16,619 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-09-20 22:14:16,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 22:14:16,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 22:14:16,621 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-09-20 22:14:16,622 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-09-20 22:14:16,966 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-09-20 22:14:16,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-20 22:14:16,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 47 conjunts are in the unsatisfiable core [2022-09-20 22:14:16,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 22:14:18,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-09-20 22:14:18,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-20 22:14:18,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-20 22:14:18,705 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-20 22:14:18,717 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-09-20 22:14:18,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-09-20 22:14:18,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-20 22:14:18,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-09-20 22:14:18,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-09-20 22:14:18,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3270 backedges. 455 proven. 319 refuted. 0 times theorem prover too weak. 2496 trivial. 0 not checked. [2022-09-20 22:14:18,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 22:14:18,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-09-20 22:14:19,135 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_775 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 400)) is different from false [2022-09-20 22:14:19,158 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 22:14:19,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-09-20 22:14:19,169 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 22:14:19,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 39 [2022-09-20 22:14:19,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-09-20 22:14:19,930 INFO L134 CoverageAnalysis]: Checked inductivity of 3270 backedges. 377 proven. 319 refuted. 0 times theorem prover too weak. 2496 trivial. 78 not checked. [2022-09-20 22:14:19,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088082777] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-20 22:14:19,931 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-20 22:14:19,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 12, 14] total 55 [2022-09-20 22:14:19,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507371589] [2022-09-20 22:14:19,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-20 22:14:19,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-09-20 22:14:19,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:14:19,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-09-20 22:14:19,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=2497, Unknown=1, NotChecked=104, Total=2970 [2022-09-20 22:14:19,940 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 231 [2022-09-20 22:14:19,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 243 transitions, 870 flow. Second operand has 55 states, 55 states have (on average 162.8181818181818) internal successors, (8955), 55 states have internal predecessors, (8955), 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-09-20 22:14:19,946 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:14:19,946 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 231 [2022-09-20 22:14:19,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:14:30,486 INFO L130 PetriNetUnfolder]: 2172/7769 cut-off events. [2022-09-20 22:14:30,487 INFO L131 PetriNetUnfolder]: For 2841/2841 co-relation queries the response was YES. [2022-09-20 22:14:30,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16123 conditions, 7769 events. 2172/7769 cut-off events. For 2841/2841 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 41120 event pairs, 39 based on Foata normal form. 8/7665 useless extension candidates. Maximal degree in co-relation 16100. Up to 700 conditions per place. [2022-09-20 22:14:30,548 INFO L137 encePairwiseOnDemand]: 206/231 looper letters, 887 selfloop transitions, 376 changer transitions 0/1393 dead transitions. [2022-09-20 22:14:30,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 466 places, 1393 transitions, 6700 flow [2022-09-20 22:14:30,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2022-09-20 22:14:30,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2022-09-20 22:14:30,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 29662 transitions. [2022-09-20 22:14:30,583 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7016771934804722 [2022-09-20 22:14:30,583 INFO L72 ComplementDD]: Start complementDD. Operand 183 states and 29662 transitions. [2022-09-20 22:14:30,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 183 states and 29662 transitions. [2022-09-20 22:14:30,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:14:30,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 183 states and 29662 transitions. [2022-09-20 22:14:30,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 184 states, 183 states have (on average 162.08743169398906) internal successors, (29662), 183 states have internal predecessors, (29662), 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-09-20 22:14:30,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 184 states, 184 states have (on average 231.0) internal successors, (42504), 184 states have internal predecessors, (42504), 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-09-20 22:14:30,721 INFO L81 ComplementDD]: Finished complementDD. Result has 184 states, 184 states have (on average 231.0) internal successors, (42504), 184 states have internal predecessors, (42504), 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-09-20 22:14:30,721 INFO L175 Difference]: Start difference. First operand has 284 places, 243 transitions, 870 flow. Second operand 183 states and 29662 transitions. [2022-09-20 22:14:30,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 466 places, 1393 transitions, 6700 flow [2022-09-20 22:14:30,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 1393 transitions, 6585 flow, removed 22 selfloop flow, removed 18 redundant places. [2022-09-20 22:14:30,757 INFO L231 Difference]: Finished difference. Result has 518 places, 649 transitions, 3396 flow [2022-09-20 22:14:30,758 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=183, PETRI_FLOW=3396, PETRI_PLACES=518, PETRI_TRANSITIONS=649} [2022-09-20 22:14:30,759 INFO L287 CegarLoopForPetriNet]: 213 programPoint places, 305 predicate places. [2022-09-20 22:14:30,759 INFO L495 AbstractCegarLoop]: Abstraction has has 518 places, 649 transitions, 3396 flow [2022-09-20 22:14:30,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 162.8181818181818) internal successors, (8955), 55 states have internal predecessors, (8955), 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-09-20 22:14:30,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:14:30,762 INFO L208 CegarLoopForPetriNet]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:14:30,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-09-20 22:14:30,987 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-09-20 22:14:30,988 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-09-20 22:14:30,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:14:30,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1233996393, now seen corresponding path program 1 times [2022-09-20 22:14:30,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:14:30,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007952013] [2022-09-20 22:14:30,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:14:30,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:14:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:14:31,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3694 backedges. 0 proven. 3694 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:14:31,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:14:31,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007952013] [2022-09-20 22:14:31,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007952013] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 22:14:31,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669290665] [2022-09-20 22:14:31,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:14:31,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 22:14:31,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 22:14:31,725 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-09-20 22:14:31,725 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-09-20 22:14:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:14:32,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 1380 conjuncts, 34 conjunts are in the unsatisfiable core [2022-09-20 22:14:32,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 22:14:32,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3694 backedges. 0 proven. 3694 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:14:32,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 22:14:33,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3694 backedges. 0 proven. 3694 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:14:33,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669290665] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-20 22:14:33,944 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-20 22:14:33,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 70 [2022-09-20 22:14:33,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146672102] [2022-09-20 22:14:33,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-20 22:14:33,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-09-20 22:14:33,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:14:33,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-09-20 22:14:33,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1260, Invalid=3570, Unknown=0, NotChecked=0, Total=4830 [2022-09-20 22:14:33,957 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 231 [2022-09-20 22:14:33,966 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 518 places, 649 transitions, 3396 flow. Second operand has 70 states, 70 states have (on average 214.4857142857143) internal successors, (15014), 70 states have internal predecessors, (15014), 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-09-20 22:14:33,966 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:14:33,966 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 231 [2022-09-20 22:14:33,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:14:40,383 INFO L130 PetriNetUnfolder]: 929/8298 cut-off events. [2022-09-20 22:14:40,384 INFO L131 PetriNetUnfolder]: For 115978/115978 co-relation queries the response was YES. [2022-09-20 22:14:40,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26481 conditions, 8298 events. 929/8298 cut-off events. For 115978/115978 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 37406 event pairs, 7 based on Foata normal form. 102/8390 useless extension candidates. Maximal degree in co-relation 26387. Up to 590 conditions per place. [2022-09-20 22:14:40,472 INFO L137 encePairwiseOnDemand]: 225/231 looper letters, 170 selfloop transitions, 162 changer transitions 0/874 dead transitions. [2022-09-20 22:14:40,472 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 616 places, 874 transitions, 5732 flow [2022-09-20 22:14:40,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-09-20 22:14:40,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2022-09-20 22:14:40,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 21274 transitions. [2022-09-20 22:14:40,487 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9302549302549302 [2022-09-20 22:14:40,487 INFO L72 ComplementDD]: Start complementDD. Operand 99 states and 21274 transitions. [2022-09-20 22:14:40,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 21274 transitions. [2022-09-20 22:14:40,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:14:40,493 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 99 states and 21274 transitions. [2022-09-20 22:14:40,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 100 states, 99 states have (on average 214.88888888888889) internal successors, (21274), 99 states have internal predecessors, (21274), 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-09-20 22:14:40,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 100 states, 100 states have (on average 231.0) internal successors, (23100), 100 states have internal predecessors, (23100), 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-09-20 22:14:40,540 INFO L81 ComplementDD]: Finished complementDD. Result has 100 states, 100 states have (on average 231.0) internal successors, (23100), 100 states have internal predecessors, (23100), 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-09-20 22:14:40,540 INFO L175 Difference]: Start difference. First operand has 518 places, 649 transitions, 3396 flow. Second operand 99 states and 21274 transitions. [2022-09-20 22:14:40,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 616 places, 874 transitions, 5732 flow [2022-09-20 22:14:40,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 570 places, 874 transitions, 5550 flow, removed 4 selfloop flow, removed 46 redundant places. [2022-09-20 22:14:40,957 INFO L231 Difference]: Finished difference. Result has 588 places, 716 transitions, 4484 flow [2022-09-20 22:14:40,958 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=3214, PETRI_DIFFERENCE_MINUEND_PLACES=472, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=649, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=99, PETRI_FLOW=4484, PETRI_PLACES=588, PETRI_TRANSITIONS=716} [2022-09-20 22:14:40,959 INFO L287 CegarLoopForPetriNet]: 213 programPoint places, 375 predicate places. [2022-09-20 22:14:40,959 INFO L495 AbstractCegarLoop]: Abstraction has has 588 places, 716 transitions, 4484 flow [2022-09-20 22:14:40,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 214.4857142857143) internal successors, (15014), 70 states have internal predecessors, (15014), 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-09-20 22:14:40,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:14:40,962 INFO L208 CegarLoopForPetriNet]: trace histogram [33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:14:40,989 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-09-20 22:14:41,177 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-09-20 22:14:41,177 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-09-20 22:14:41,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:14:41,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1146358288, now seen corresponding path program 2 times [2022-09-20 22:14:41,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:14:41,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962292625] [2022-09-20 22:14:41,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:14:41,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:14:41,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:14:43,124 INFO L134 CoverageAnalysis]: Checked inductivity of 16337 backedges. 0 proven. 16337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:14:43,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:14:43,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962292625] [2022-09-20 22:14:43,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962292625] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 22:14:43,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400600273] [2022-09-20 22:14:43,124 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-20 22:14:43,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 22:14:43,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 22:14:43,126 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-09-20 22:14:43,131 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-09-20 22:14:43,622 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-20 22:14:43,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-20 22:14:43,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 2513 conjuncts, 68 conjunts are in the unsatisfiable core [2022-09-20 22:14:43,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 22:14:44,783 INFO L134 CoverageAnalysis]: Checked inductivity of 16337 backedges. 0 proven. 16337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:14:44,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 22:14:48,678 INFO L134 CoverageAnalysis]: Checked inductivity of 16337 backedges. 0 proven. 16337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:14:48,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400600273] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-20 22:14:48,678 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-20 22:14:48,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 138 [2022-09-20 22:14:48,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596436576] [2022-09-20 22:14:48,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-20 22:14:48,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 138 states [2022-09-20 22:14:48,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:14:48,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2022-09-20 22:14:48,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4830, Invalid=14076, Unknown=0, NotChecked=0, Total=18906 [2022-09-20 22:14:48,699 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 231 [2022-09-20 22:14:48,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 588 places, 716 transitions, 4484 flow. Second operand has 138 states, 138 states have (on average 214.47826086956522) internal successors, (29598), 138 states have internal predecessors, (29598), 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-09-20 22:14:48,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:14:48,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 231 [2022-09-20 22:14:48,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:15:13,464 INFO L130 PetriNetUnfolder]: 1813/16560 cut-off events. [2022-09-20 22:15:13,464 INFO L131 PetriNetUnfolder]: For 328983/328983 co-relation queries the response was YES. [2022-09-20 22:15:13,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55548 conditions, 16560 events. 1813/16560 cut-off events. For 328983/328983 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 75548 event pairs, 7 based on Foata normal form. 204/16754 useless extension candidates. Maximal degree in co-relation 55437. Up to 1474 conditions per place. [2022-09-20 22:15:13,770 INFO L137 encePairwiseOnDemand]: 225/231 looper letters, 340 selfloop transitions, 298 changer transitions 0/1180 dead transitions. [2022-09-20 22:15:13,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 788 places, 1180 transitions, 9864 flow [2022-09-20 22:15:13,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2022-09-20 22:15:13,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2022-09-20 22:15:13,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 43187 transitions. [2022-09-20 22:15:13,798 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.930132885356766 [2022-09-20 22:15:13,799 INFO L72 ComplementDD]: Start complementDD. Operand 201 states and 43187 transitions. [2022-09-20 22:15:13,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 201 states and 43187 transitions. [2022-09-20 22:15:13,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:15:13,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 201 states and 43187 transitions. [2022-09-20 22:15:13,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 202 states, 201 states have (on average 214.86069651741295) internal successors, (43187), 201 states have internal predecessors, (43187), 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-09-20 22:15:13,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 202 states, 202 states have (on average 231.0) internal successors, (46662), 202 states have internal predecessors, (46662), 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-09-20 22:15:13,907 INFO L81 ComplementDD]: Finished complementDD. Result has 202 states, 202 states have (on average 231.0) internal successors, (46662), 202 states have internal predecessors, (46662), 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-09-20 22:15:13,908 INFO L175 Difference]: Start difference. First operand has 588 places, 716 transitions, 4484 flow. Second operand 201 states and 43187 transitions. [2022-09-20 22:15:13,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 788 places, 1180 transitions, 9864 flow [2022-09-20 22:15:14,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 740 places, 1180 transitions, 9254 flow, removed 208 selfloop flow, removed 48 redundant places. [2022-09-20 22:15:14,654 INFO L231 Difference]: Finished difference. Result has 775 places, 853 transitions, 6812 flow [2022-09-20 22:15:14,655 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=4146, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=716, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=163, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=552, PETRI_DIFFERENCE_SUBTRAHEND_STATES=201, PETRI_FLOW=6812, PETRI_PLACES=775, PETRI_TRANSITIONS=853} [2022-09-20 22:15:14,655 INFO L287 CegarLoopForPetriNet]: 213 programPoint places, 562 predicate places. [2022-09-20 22:15:14,655 INFO L495 AbstractCegarLoop]: Abstraction has has 775 places, 853 transitions, 6812 flow [2022-09-20 22:15:14,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 138 states, 138 states have (on average 214.47826086956522) internal successors, (29598), 138 states have internal predecessors, (29598), 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-09-20 22:15:14,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:15:14,660 INFO L208 CegarLoopForPetriNet]: trace histogram [67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 34, 34, 34, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:15:14,682 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-09-20 22:15:14,866 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-09-20 22:15:14,866 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-09-20 22:15:14,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:15:14,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1318813699, now seen corresponding path program 3 times [2022-09-20 22:15:14,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:15:14,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946029434] [2022-09-20 22:15:14,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:15:14,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:15:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:15:20,905 INFO L134 CoverageAnalysis]: Checked inductivity of 68476 backedges. 0 proven. 68476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:15:20,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:15:20,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946029434] [2022-09-20 22:15:20,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946029434] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 22:15:20,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301816549] [2022-09-20 22:15:20,906 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-09-20 22:15:20,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 22:15:20,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 22:15:20,911 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-09-20 22:15:20,921 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-09-20 22:15:21,477 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-09-20 22:15:21,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-20 22:15:21,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 91 conjunts are in the unsatisfiable core [2022-09-20 22:15:21,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 22:15:29,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-09-20 22:15:29,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-20 22:15:29,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-20 22:15:29,969 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-20 22:15:29,976 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-09-20 22:15:29,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-09-20 22:15:30,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-20 22:15:30,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-09-20 22:15:30,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-09-20 22:15:30,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-20 22:15:30,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-20 22:15:30,773 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-20 22:15:30,782 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-09-20 22:15:30,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-09-20 22:15:30,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-20 22:15:30,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-09-20 22:15:30,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-09-20 22:15:30,924 INFO L134 CoverageAnalysis]: Checked inductivity of 68476 backedges. 5630 proven. 30 refuted. 0 times theorem prover too weak. 62816 trivial. 0 not checked. [2022-09-20 22:15:30,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 22:15:31,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-09-20 22:15:31,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-09-20 22:15:31,816 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2816 Int) (v_ArrVal_2815 (Array Int Int))) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2816)) .cse1))))) is different from false [2022-09-20 22:15:31,864 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2816 Int) (v_ArrVal_2815 (Array Int Int))) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1))))) is different from false [2022-09-20 22:15:31,872 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2816 Int) (v_ArrVal_2815 (Array Int Int))) (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)) 400))) is different from false [2022-09-20 22:15:31,881 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2816 Int) (v_ArrVal_2815 (Array Int Int))) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (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 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2816)) .cse1))))) is different from false [2022-09-20 22:15:31,893 WARN L833 $PredicateComparison]: unable to prove that (or (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|) (forall ((v_ArrVal_2816 Int) (v_ArrVal_2815 (Array Int Int))) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (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 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2816)) .cse1)))))) is different from false [2022-09-20 22:15:31,903 WARN L833 $PredicateComparison]: unable to prove that (or (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (forall ((v_ArrVal_2816 Int) (v_ArrVal_2815 (Array Int Int))) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (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 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2816)) .cse1)))))) is different from false [2022-09-20 22:15:31,928 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (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 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2811) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2816)) .cse1))))) (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) is different from false [2022-09-20 22:15:31,961 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2816 Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int 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_2809)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2811) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse2)))))))) is different from false [2022-09-20 22:15:31,983 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2811) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)))) (= .cse4 400))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))))) is different from false [2022-09-20 22:15:32,025 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2811) .cse3 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3))) (= 400 .cse4)))))) is different from false [2022-09-20 22:15:32,066 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) is different from false [2022-09-20 22:15:32,171 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2808))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse1))))))))) is different from false [2022-09-20 22:15:32,243 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 22:15:32,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 234 treesize of output 164 [2022-09-20 22:15:32,254 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 22:15:32,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 266 treesize of output 262 [2022-09-20 22:15:32,259 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-20 22:15:32,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 326 treesize of output 306 [2022-09-20 22:15:32,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 297 treesize of output 273 [2022-09-20 22:15:32,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-09-20 22:15:32,352 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 22:15:32,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 147 [2022-09-20 22:15:35,467 INFO L134 CoverageAnalysis]: Checked inductivity of 68476 backedges. 1422 proven. 1753 refuted. 0 times theorem prover too weak. 62816 trivial. 2485 not checked. [2022-09-20 22:15:35,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301816549] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-20 22:15:35,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-20 22:15:35,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [137, 20, 28] total 181 [2022-09-20 22:15:35,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877097729] [2022-09-20 22:15:35,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-20 22:15:35,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 181 states [2022-09-20 22:15:35,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:15:35,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 181 interpolants. [2022-09-20 22:15:35,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4999, Invalid=23429, Unknown=12, NotChecked=4140, Total=32580 [2022-09-20 22:15:35,499 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 231 [2022-09-20 22:15:35,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 775 places, 853 transitions, 6812 flow. Second operand has 181 states, 181 states have (on average 158.39226519337018) internal successors, (28669), 181 states have internal predecessors, (28669), 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-09-20 22:15:35,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:15:35,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 231 [2022-09-20 22:15:35,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:15:36,959 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_t1Thread1of1ForFork0_~i~0#1| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (not (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2808))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse1))))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:15:37,612 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_t1Thread1of1ForFork0_~i~0#1| 0) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:15:38,117 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_t1Thread1of1ForFork0_#t~post50#1| 0) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:15:38,579 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 1)) is different from false [2022-09-20 22:15:39,318 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2811) .cse3 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3))) (= 400 .cse4)))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 1)) is different from false [2022-09-20 22:15:41,370 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2811) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)))) (= .cse4 400))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 1)) is different from false [2022-09-20 22:15:43,514 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2808))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse1))))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 1)) is different from false [2022-09-20 22:15:44,041 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2808))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse1))))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:15:44,924 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:15:45,426 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_#t~post50#1| 1) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:15:45,973 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 2) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:15:46,970 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2811) .cse3 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3))) (= 400 .cse4)))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 2) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:15:47,492 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2811) .cse3 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3))) (= 400 .cse4)))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:15:49,608 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2811) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)))) (= .cse4 400))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 2) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:15:51,621 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2811) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)))) (= .cse4 400))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:15:56,633 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (not (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2808))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse1))))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 2) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:15:57,462 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 2) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:15:58,055 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 3) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:15:59,112 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2811) .cse3 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3))) (= 400 .cse4)))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 3) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:16:01,675 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2811) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)))) (= .cse4 400))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 3) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:16:04,359 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (not (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2808))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse1))))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:16:05,168 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (not (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2808))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse1))))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 3) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:16:06,017 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (not (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2808))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse1)))))))))) is different from false [2022-09-20 22:16:06,697 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:16:07,234 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 4) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:16:07,748 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 5) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:16:08,332 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 3) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:16:14,438 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2811) .cse3 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3))) (= 400 .cse4)))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 5) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:16:15,067 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2811) .cse3 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3))) (= 400 .cse4)))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:16:17,127 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 5) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2811) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)))) (= .cse4 400))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:16:24,335 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2811) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)))) (= .cse4 400))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:16:51,867 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (not (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 5) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2808))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse1))))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:16:57,564 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)))) (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= .cse0 2) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2808))) (let ((.cse6 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse5 (select .cse4 .cse2))) (or (not (= 400 (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse2))) (= 400 .cse5) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse6 .cse2))))))))) (<= .cse0 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-20 22:16:58,180 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 5) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:16:58,750 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:17:04,386 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2811) .cse3 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3))) (= 400 .cse4)))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:17:06,809 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2811) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)))) (= .cse4 400))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:17:18,045 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (not (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2808))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse1))))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:17:19,208 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 6) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:17:19,827 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 7)) is different from false [2022-09-20 22:17:21,213 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2811) .cse3 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3))) (= 400 .cse4)))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 7)) is different from false [2022-09-20 22:17:23,446 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2811) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)))) (= .cse4 400))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 7)) is different from false [2022-09-20 22:17:26,122 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (not (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2808))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse1))))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 7)) is different from false [2022-09-20 22:17:27,585 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 7)) is different from false [2022-09-20 22:17:28,110 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 8) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:17:29,646 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 8) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2811) .cse3 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3))) (= 400 .cse4)))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:17:31,895 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 8) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2811) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)))) (= .cse4 400))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:17:35,478 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 8) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (not (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2808))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse1))))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:17:36,902 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_#t~post50#1| 8) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:17:37,498 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 9) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:17:39,053 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2811) .cse3 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3))) (= 400 .cse4)))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 9) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:17:41,355 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2811) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)))) (= .cse4 400))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 9) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:17:44,484 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (not (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2808))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse1))))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 9) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:17:46,083 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 9) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:17:46,640 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 10) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:17:48,139 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2811) .cse3 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3))) (= 400 .cse4)))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 10) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:17:50,503 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 10) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2811) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)))) (= .cse4 400))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:17:54,118 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 10) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2808))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse1))))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:17:55,571 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_#t~post50#1| 10) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:17:56,102 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 11) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:17:57,814 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2811) .cse3 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3))) (= 400 .cse4)))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 11) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:18:00,117 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2811) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)))) (= .cse4 400))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 11) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:18:04,049 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (not (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2808))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse1))))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 11) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:18:05,477 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 11) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:18:06,286 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 12) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:18:07,851 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2811) .cse3 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3))) (= 400 .cse4)))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 12) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:18:10,183 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2811) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)))) (= .cse4 400))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 12) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:18:13,894 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2808))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse1))))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 12) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:18:16,391 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 12) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:18:17,080 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 13)) is different from false [2022-09-20 22:18:19,289 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2811) .cse3 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3))) (= 400 .cse4)))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 13)) is different from false [2022-09-20 22:18:21,805 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2811) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)))) (= .cse4 400))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 13)) is different from false [2022-09-20 22:18:26,419 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2808))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse1))))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 13)) is different from false [2022-09-20 22:18:28,614 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 13) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:18:29,129 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 14) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:18:31,088 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2811) .cse3 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3))) (= 400 .cse4)))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 14) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:18:33,414 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 14) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2811) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)))) (= .cse4 400))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:18:37,874 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (not (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 14) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2808))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse1))))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:18:39,079 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (not (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 14) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2808))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse1))))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:18:39,854 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 14) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:18:40,525 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 15) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:18:42,516 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2811) .cse3 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3))) (= 400 .cse4)))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 15) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:18:45,140 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2811) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)))) (= .cse4 400))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 15) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:18:49,198 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (not (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2808))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse1))))))))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 15) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:18:51,189 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_#t~post50#1| 15) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:18:51,892 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 16) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:18:53,947 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2811) .cse3 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3))) (= 400 .cse4)))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 16) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:18:56,516 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2811) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)))) (= .cse4 400))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 16) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:19:00,996 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (not (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2808))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse1))))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 16) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:19:03,052 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_#t~post50#1| 16) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:19:03,634 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 17) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:19:05,817 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2811) .cse3 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3))) (= 400 .cse4)))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 17) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:19:08,413 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 17) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2811) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)))) (= .cse4 400))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:19:13,321 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 17) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2808))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse1))))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:19:14,842 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 17) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2808))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse1))))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:19:15,500 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_#t~post50#1| 17) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:19:16,193 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 18) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:19:18,044 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2811) .cse3 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3))) (= 400 .cse4)))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 18) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:19:20,536 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2811) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)))) (= .cse4 400))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 18) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:19:25,330 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2808))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse1))))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 18) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:19:27,637 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_#t~post50#1| 18) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:19:28,156 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 19) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:19:30,417 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2811) .cse3 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3))) (= 400 .cse4)))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 19) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:19:32,849 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2811) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)))) (= .cse4 400))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 19) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:19:37,789 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 19) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2808))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse1))))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:19:40,020 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 19) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:19:40,622 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 20) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:19:42,867 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2811) .cse3 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3))) (= 400 .cse4)))))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 20) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:19:45,540 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 20) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2811) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)))) (= .cse4 400))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:19:51,280 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 20) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2808))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse1))))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:19:53,188 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_#t~post50#1| 20) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:19:53,925 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 21) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:19:56,271 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2811) .cse3 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3))) (= 400 .cse4)))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 21) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:19:58,696 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2811) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)))) (= .cse4 400))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 21) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:20:03,925 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 21) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2808))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse1))))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:20:06,239 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 21) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:20:06,779 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 22) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:20:09,397 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2811) .cse3 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3))) (= 400 .cse4)))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 22) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:20:11,895 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2811) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)))) (= .cse4 400))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 22) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:20:17,643 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2808))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse1))))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 22) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:20:19,834 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 22) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:20:20,369 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 23) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:20:22,860 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2811) .cse3 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3))) (= 400 .cse4)))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 23) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:20:25,297 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 23) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2811) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)))) (= .cse4 400))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:20:31,536 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 23) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2808))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse1))))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:20:33,404 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 23) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2808))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse1))))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:20:34,125 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 23) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:20:34,819 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 24) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:20:37,567 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 24) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2811) .cse3 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3))) (= 400 .cse4)))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:20:40,161 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 24) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2811) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)))) (= .cse4 400))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:20:45,629 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 24) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2808))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse1))))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:20:48,042 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 24) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:20:48,572 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 25) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:20:51,388 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2811) .cse3 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3))) (= 400 .cse4)))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 25) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:20:53,923 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2811) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)))) (= .cse4 400))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 25) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:20:59,968 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2808))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse1))))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 25) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:21:02,292 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 25) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:21:02,855 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 26) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:21:05,200 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2811) .cse3 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3))) (= 400 .cse4)))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 26) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:21:07,649 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 26) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2811) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)))) (= .cse4 400))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:21:14,310 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (not (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 26) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2808))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse1))))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:21:15,489 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 26) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2808))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse1))))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:21:16,763 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 26) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:21:17,456 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 27) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:21:20,292 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2811) .cse3 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3))) (= 400 .cse4)))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 27) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:21:22,731 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2811) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)))) (= .cse4 400))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 27) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:21:28,481 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2808))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse1))))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 27) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:21:30,998 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 27) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:21:31,551 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 28)) is different from false [2022-09-20 22:21:34,068 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2811) .cse3 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3))) (= 400 .cse4)))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 28)) is different from false [2022-09-20 22:21:36,953 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2811) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)))) (= .cse4 400))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 28)) is different from false [2022-09-20 22:21:43,010 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2808))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse1))))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 28)) is different from false [2022-09-20 22:21:45,357 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 28) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:21:45,913 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 29) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:21:48,804 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 29) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2811) .cse3 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3))) (= 400 .cse4)))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:21:51,300 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 29) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2811) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)))) (= .cse4 400))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:21:58,434 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 29) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (not (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2808))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse1))))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:22:00,715 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 29) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:22:01,527 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 30) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:22:04,289 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 30) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2811) .cse3 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3))) (= 400 .cse4)))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:22:06,798 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 30) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2811) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)))) (= .cse4 400))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:22:12,551 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 30) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2808))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse1))))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:22:14,902 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_#t~post50#1| 30) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:22:15,448 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 31) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:22:18,480 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2811) .cse3 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3))) (= 400 .cse4)))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 31) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:22:20,978 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 31) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2811) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)))) (= .cse4 400))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:22:28,088 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 31) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2808))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse1))))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:22:30,578 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_#t~post50#1| 31) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:22:31,147 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 32) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:22:33,851 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 32) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2811) .cse3 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3))) (= 400 .cse4)))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:22:36,384 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 32) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2811) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)))) (= .cse4 400))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:22:44,390 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 32) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (not (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2808))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse1))))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:22:46,013 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_#t~post50#1| 32) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:22:47,318 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 33) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:22:49,879 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2811) .cse3 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3))) (= 400 .cse4)))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 33) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:22:52,558 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 33) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2811) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)))) (= .cse4 400))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:22:59,330 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 33) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2808))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse1))))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:23:01,885 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 33) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:23:02,461 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 34) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:23:05,339 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2811) .cse3 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3))) (= 400 .cse4)))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 34) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:23:08,454 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 34) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2811) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)))) (= .cse4 400))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:23:15,701 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 34) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2808))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse1))))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:23:18,724 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_#t~post50#1| 34) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:23:19,316 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 35) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:23:22,301 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2811) .cse3 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3))) (= 400 .cse4)))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 35) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:23:24,975 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 35) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2811) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)))) (= .cse4 400))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:23:32,605 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (not (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 35) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2808))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse1))))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:23:35,022 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 35)) is different from false [2022-09-20 22:23:35,788 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 36) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:23:38,947 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2811) .cse3 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3))) (= 400 .cse4)))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 36) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:23:41,680 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2811) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)))) (= .cse4 400))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 36) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:23:48,598 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (not (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 36) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2808))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse1))))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:23:50,314 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (not (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 36) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2808))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse1))))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:23:51,774 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_#t~post50#1| 36) (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:23:52,380 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2809)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2811) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2816)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 37) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:23:55,397 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2811) .cse3 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3))) (= 400 .cse4)))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 37) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-20 22:23:58,176 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2809 Int) (v_ArrVal_2811 Int) (v_ArrVal_2815 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2811) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2815) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2816)) .cse1)))) (= .cse4 400))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 37) (<= |c_~#stored_elements~0.base| 6)) is different from false