/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/weaver/popl20-send-receive-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.fix-rcfgbuilder-lbe-0ccecc1-m [2023-11-10 12:40:50,772 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-10 12:40:50,834 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-10 12:40:50,860 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-10 12:40:50,861 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-10 12:40:50,861 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-10 12:40:50,861 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-10 12:40:50,862 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-10 12:40:50,862 INFO L153 SettingsManager]: * Use SBE=true [2023-11-10 12:40:50,865 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-10 12:40:50,865 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-10 12:40:50,865 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-10 12:40:50,866 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-10 12:40:50,867 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-10 12:40:50,867 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-10 12:40:50,867 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-10 12:40:50,867 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-10 12:40:50,867 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-10 12:40:50,868 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-10 12:40:50,868 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-10 12:40:50,868 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-10 12:40:50,868 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-10 12:40:50,869 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-10 12:40:50,869 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-10 12:40:50,869 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-10 12:40:50,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 12:40:50,869 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-10 12:40:50,869 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-10 12:40:50,869 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-10 12:40:50,869 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-10 12:40:50,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-10 12:40:50,870 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-10 12:40:50,870 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-10 12:40:50,871 INFO L153 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 [2023-11-10 12:40:51,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-10 12:40:51,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-10 12:40:51,058 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-10 12:40:51,059 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-10 12:40:51,060 INFO L274 PluginConnector]: CDTParser initialized [2023-11-10 12:40:51,060 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-send-receive-alt.wvr.c [2023-11-10 12:40:52,160 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-10 12:40:52,268 INFO L384 CDTParser]: Found 1 translation units. [2023-11-10 12:40:52,268 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive-alt.wvr.c [2023-11-10 12:40:52,273 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf1eaff8e/f30ba5b14b1a4ff597bd9d4416ce8fff/FLAG2005f309b [2023-11-10 12:40:52,709 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf1eaff8e/f30ba5b14b1a4ff597bd9d4416ce8fff [2023-11-10 12:40:52,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-10 12:40:52,712 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-10 12:40:52,713 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-10 12:40:52,713 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-10 12:40:52,718 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-10 12:40:52,719 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:40:52" (1/1) ... [2023-11-10 12:40:52,719 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6890a405 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:40:52, skipping insertion in model container [2023-11-10 12:40:52,719 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:40:52" (1/1) ... [2023-11-10 12:40:52,738 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-10 12:40:52,837 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive-alt.wvr.c[2650,2663] [2023-11-10 12:40:52,843 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 12:40:52,849 INFO L202 MainTranslator]: Completed pre-run [2023-11-10 12:40:52,861 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive-alt.wvr.c[2650,2663] [2023-11-10 12:40:52,863 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 12:40:52,869 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-10 12:40:52,869 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-10 12:40:52,873 INFO L206 MainTranslator]: Completed translation [2023-11-10 12:40:52,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:40:52 WrapperNode [2023-11-10 12:40:52,874 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-10 12:40:52,875 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-10 12:40:52,875 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-10 12:40:52,875 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-10 12:40:52,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:40:52" (1/1) ... [2023-11-10 12:40:52,887 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:40:52" (1/1) ... [2023-11-10 12:40:52,903 INFO L138 Inliner]: procedures = 24, calls = 37, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 147 [2023-11-10 12:40:52,903 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-10 12:40:52,904 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-10 12:40:52,904 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-10 12:40:52,904 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-10 12:40:52,910 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:40:52" (1/1) ... [2023-11-10 12:40:52,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:40:52" (1/1) ... [2023-11-10 12:40:52,912 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:40:52" (1/1) ... [2023-11-10 12:40:52,913 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:40:52" (1/1) ... [2023-11-10 12:40:52,917 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:40:52" (1/1) ... [2023-11-10 12:40:52,920 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:40:52" (1/1) ... [2023-11-10 12:40:52,921 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:40:52" (1/1) ... [2023-11-10 12:40:52,922 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:40:52" (1/1) ... [2023-11-10 12:40:52,923 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-10 12:40:52,924 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-10 12:40:52,924 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-10 12:40:52,924 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-10 12:40:52,925 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:40:52" (1/1) ... [2023-11-10 12:40:52,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 12:40:52,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:40:52,975 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) [2023-11-10 12:40:53,002 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 [2023-11-10 12:40:53,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-10 12:40:53,013 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-10 12:40:53,013 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-10 12:40:53,013 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-10 12:40:53,013 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-10 12:40:53,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-10 12:40:53,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-10 12:40:53,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-10 12:40:53,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-10 12:40:53,014 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-10 12:40:53,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-10 12:40:53,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-10 12:40:53,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-10 12:40:53,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-10 12:40:53,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-10 12:40:53,015 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-10 12:40:53,081 INFO L236 CfgBuilder]: Building ICFG [2023-11-10 12:40:53,083 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-10 12:40:53,255 INFO L277 CfgBuilder]: Performing block encoding [2023-11-10 12:40:53,337 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-10 12:40:53,337 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-10 12:40:53,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:40:53 BoogieIcfgContainer [2023-11-10 12:40:53,341 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-10 12:40:53,343 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-10 12:40:53,343 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-10 12:40:53,345 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-10 12:40:53,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:40:52" (1/3) ... [2023-11-10 12:40:53,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19b06d2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:40:53, skipping insertion in model container [2023-11-10 12:40:53,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:40:52" (2/3) ... [2023-11-10 12:40:53,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19b06d2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:40:53, skipping insertion in model container [2023-11-10 12:40:53,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:40:53" (3/3) ... [2023-11-10 12:40:53,347 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-send-receive-alt.wvr.c [2023-11-10 12:40:53,360 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-10 12:40:53,360 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-10 12:40:53,360 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-10 12:40:53,407 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-10 12:40:53,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 135 transitions, 284 flow [2023-11-10 12:40:53,496 INFO L124 PetriNetUnfolderBase]: 11/133 cut-off events. [2023-11-10 12:40:53,496 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-10 12:40:53,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 133 events. 11/133 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-11-10 12:40:53,500 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 135 transitions, 284 flow [2023-11-10 12:40:53,503 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 124 transitions, 260 flow [2023-11-10 12:40:53,509 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-10 12:40:53,514 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=LoopHeads, 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;@3a4aed4a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-10 12:40:53,514 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-10 12:40:53,534 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-10 12:40:53,534 INFO L124 PetriNetUnfolderBase]: 11/123 cut-off events. [2023-11-10 12:40:53,534 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-10 12:40:53,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:40:53,535 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] [2023-11-10 12:40:53,536 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:40:53,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:40:53,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1584977957, now seen corresponding path program 1 times [2023-11-10 12:40:53,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:40:53,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329229125] [2023-11-10 12:40:53,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:40:53,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:40:53,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:40:53,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:40:53,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:40:53,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329229125] [2023-11-10 12:40:53,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329229125] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 12:40:53,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 12:40:53,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-10 12:40:53,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180894066] [2023-11-10 12:40:53,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:40:53,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-10 12:40:53,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:40:53,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-10 12:40:53,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-10 12:40:53,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 135 [2023-11-10 12:40:53,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 124 transitions, 260 flow. Second operand has 2 states, 2 states have (on average 123.0) internal successors, (246), 2 states have internal predecessors, (246), 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) [2023-11-10 12:40:53,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:40:53,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 135 [2023-11-10 12:40:53,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:40:53,810 INFO L124 PetriNetUnfolderBase]: 8/124 cut-off events. [2023-11-10 12:40:53,810 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-11-10 12:40:53,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 124 events. 8/124 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 1 based on Foata normal form. 11/125 useless extension candidates. Maximal degree in co-relation 84. Up to 13 conditions per place. [2023-11-10 12:40:53,812 INFO L140 encePairwiseOnDemand]: 128/135 looper letters, 7 selfloop transitions, 0 changer transitions 3/117 dead transitions. [2023-11-10 12:40:53,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 117 transitions, 260 flow [2023-11-10 12:40:53,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-10 12:40:53,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-10 12:40:53,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 254 transitions. [2023-11-10 12:40:53,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9407407407407408 [2023-11-10 12:40:53,826 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 254 transitions. [2023-11-10 12:40:53,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 254 transitions. [2023-11-10 12:40:53,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:40:53,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 254 transitions. [2023-11-10 12:40:53,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 127.0) internal successors, (254), 2 states have internal predecessors, (254), 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) [2023-11-10 12:40:53,840 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 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) [2023-11-10 12:40:53,841 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 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) [2023-11-10 12:40:53,842 INFO L175 Difference]: Start difference. First operand has 120 places, 124 transitions, 260 flow. Second operand 2 states and 254 transitions. [2023-11-10 12:40:53,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 117 transitions, 260 flow [2023-11-10 12:40:53,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 117 transitions, 252 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-10 12:40:53,849 INFO L231 Difference]: Finished difference. Result has 117 places, 114 transitions, 232 flow [2023-11-10 12:40:53,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=232, PETRI_PLACES=117, PETRI_TRANSITIONS=114} [2023-11-10 12:40:53,856 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -3 predicate places. [2023-11-10 12:40:53,856 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 114 transitions, 232 flow [2023-11-10 12:40:53,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 123.0) internal successors, (246), 2 states have internal predecessors, (246), 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) [2023-11-10 12:40:53,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:40:53,857 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] [2023-11-10 12:40:53,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-10 12:40:53,858 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:40:53,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:40:53,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1494282199, now seen corresponding path program 1 times [2023-11-10 12:40:53,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:40:53,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279849069] [2023-11-10 12:40:53,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:40:53,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:40:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:40:54,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:40:54,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:40:54,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279849069] [2023-11-10 12:40:54,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279849069] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 12:40:54,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 12:40:54,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-10 12:40:54,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342878538] [2023-11-10 12:40:54,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:40:54,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-10 12:40:54,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:40:54,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-10 12:40:54,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-10 12:40:54,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 135 [2023-11-10 12:40:54,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 114 transitions, 232 flow. Second operand has 5 states, 5 states have (on average 102.6) internal successors, (513), 5 states have internal predecessors, (513), 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) [2023-11-10 12:40:54,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:40:54,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 135 [2023-11-10 12:40:54,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:40:54,402 INFO L124 PetriNetUnfolderBase]: 13/161 cut-off events. [2023-11-10 12:40:54,402 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-10 12:40:54,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 161 events. 13/161 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 274 event pairs, 1 based on Foata normal form. 1/152 useless extension candidates. Maximal degree in co-relation 209. Up to 22 conditions per place. [2023-11-10 12:40:54,405 INFO L140 encePairwiseOnDemand]: 130/135 looper letters, 29 selfloop transitions, 2 changer transitions 4/123 dead transitions. [2023-11-10 12:40:54,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 123 transitions, 323 flow [2023-11-10 12:40:54,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-10 12:40:54,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-10 12:40:54,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 526 transitions. [2023-11-10 12:40:54,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7792592592592592 [2023-11-10 12:40:54,409 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 526 transitions. [2023-11-10 12:40:54,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 526 transitions. [2023-11-10 12:40:54,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:40:54,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 526 transitions. [2023-11-10 12:40:54,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.2) internal successors, (526), 5 states have internal predecessors, (526), 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) [2023-11-10 12:40:54,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 135.0) internal successors, (810), 6 states have internal predecessors, (810), 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) [2023-11-10 12:40:54,415 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 135.0) internal successors, (810), 6 states have internal predecessors, (810), 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) [2023-11-10 12:40:54,415 INFO L175 Difference]: Start difference. First operand has 117 places, 114 transitions, 232 flow. Second operand 5 states and 526 transitions. [2023-11-10 12:40:54,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 123 transitions, 323 flow [2023-11-10 12:40:54,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 123 transitions, 323 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-10 12:40:54,419 INFO L231 Difference]: Finished difference. Result has 121 places, 115 transitions, 248 flow [2023-11-10 12:40:54,420 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=248, PETRI_PLACES=121, PETRI_TRANSITIONS=115} [2023-11-10 12:40:54,420 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, 1 predicate places. [2023-11-10 12:40:54,421 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 115 transitions, 248 flow [2023-11-10 12:40:54,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.6) internal successors, (513), 5 states have internal predecessors, (513), 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) [2023-11-10 12:40:54,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:40:54,421 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:40:54,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-10 12:40:54,422 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:40:54,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:40:54,423 INFO L85 PathProgramCache]: Analyzing trace with hash 563359730, now seen corresponding path program 1 times [2023-11-10 12:40:54,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:40:54,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832192227] [2023-11-10 12:40:54,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:40:54,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:40:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:40:54,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:40:54,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:40:54,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832192227] [2023-11-10 12:40:54,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832192227] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 12:40:54,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 12:40:54,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-10 12:40:54,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373954181] [2023-11-10 12:40:54,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:40:54,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-10 12:40:54,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:40:54,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-10 12:40:54,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-10 12:40:54,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 135 [2023-11-10 12:40:54,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 115 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 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) [2023-11-10 12:40:54,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:40:54,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 135 [2023-11-10 12:40:54,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:40:54,604 INFO L124 PetriNetUnfolderBase]: 18/192 cut-off events. [2023-11-10 12:40:54,604 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-10 12:40:54,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 192 events. 18/192 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 375 event pairs, 3 based on Foata normal form. 3/179 useless extension candidates. Maximal degree in co-relation 241. Up to 30 conditions per place. [2023-11-10 12:40:54,607 INFO L140 encePairwiseOnDemand]: 131/135 looper letters, 13 selfloop transitions, 3 changer transitions 2/120 dead transitions. [2023-11-10 12:40:54,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 120 transitions, 296 flow [2023-11-10 12:40:54,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-10 12:40:54,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-10 12:40:54,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2023-11-10 12:40:54,609 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8962962962962963 [2023-11-10 12:40:54,609 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 363 transitions. [2023-11-10 12:40:54,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 363 transitions. [2023-11-10 12:40:54,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:40:54,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 363 transitions. [2023-11-10 12:40:54,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 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) [2023-11-10 12:40:54,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 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) [2023-11-10 12:40:54,611 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 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) [2023-11-10 12:40:54,611 INFO L175 Difference]: Start difference. First operand has 121 places, 115 transitions, 248 flow. Second operand 3 states and 363 transitions. [2023-11-10 12:40:54,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 120 transitions, 296 flow [2023-11-10 12:40:54,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 120 transitions, 290 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-10 12:40:54,615 INFO L231 Difference]: Finished difference. Result has 119 places, 117 transitions, 261 flow [2023-11-10 12:40:54,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=261, PETRI_PLACES=119, PETRI_TRANSITIONS=117} [2023-11-10 12:40:54,616 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -1 predicate places. [2023-11-10 12:40:54,617 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 117 transitions, 261 flow [2023-11-10 12:40:54,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 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) [2023-11-10 12:40:54,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:40:54,617 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:40:54,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-10 12:40:54,617 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:40:54,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:40:54,618 INFO L85 PathProgramCache]: Analyzing trace with hash -2035732867, now seen corresponding path program 1 times [2023-11-10 12:40:54,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:40:54,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162263188] [2023-11-10 12:40:54,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:40:54,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:40:54,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:40:54,773 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:40:54,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:40:54,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162263188] [2023-11-10 12:40:54,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162263188] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 12:40:54,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 12:40:54,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-10 12:40:54,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163211856] [2023-11-10 12:40:54,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:40:54,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-10 12:40:54,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:40:54,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-10 12:40:54,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-10 12:40:54,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 135 [2023-11-10 12:40:54,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 117 transitions, 261 flow. Second operand has 6 states, 6 states have (on average 105.33333333333333) internal successors, (632), 6 states have internal predecessors, (632), 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) [2023-11-10 12:40:54,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:40:54,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 135 [2023-11-10 12:40:54,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:40:54,911 INFO L124 PetriNetUnfolderBase]: 27/275 cut-off events. [2023-11-10 12:40:54,911 INFO L125 PetriNetUnfolderBase]: For 46/50 co-relation queries the response was YES. [2023-11-10 12:40:54,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 400 conditions, 275 events. 27/275 cut-off events. For 46/50 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 807 event pairs, 8 based on Foata normal form. 2/256 useless extension candidates. Maximal degree in co-relation 394. Up to 36 conditions per place. [2023-11-10 12:40:54,913 INFO L140 encePairwiseOnDemand]: 124/135 looper letters, 24 selfloop transitions, 8 changer transitions 13/134 dead transitions. [2023-11-10 12:40:54,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 134 transitions, 399 flow [2023-11-10 12:40:54,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-10 12:40:54,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-10 12:40:54,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 959 transitions. [2023-11-10 12:40:54,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7893004115226337 [2023-11-10 12:40:54,915 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 959 transitions. [2023-11-10 12:40:54,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 959 transitions. [2023-11-10 12:40:54,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:40:54,915 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 959 transitions. [2023-11-10 12:40:54,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 106.55555555555556) internal successors, (959), 9 states have internal predecessors, (959), 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) [2023-11-10 12:40:54,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 135.0) internal successors, (1350), 10 states have internal predecessors, (1350), 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) [2023-11-10 12:40:54,919 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 135.0) internal successors, (1350), 10 states have internal predecessors, (1350), 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) [2023-11-10 12:40:54,919 INFO L175 Difference]: Start difference. First operand has 119 places, 117 transitions, 261 flow. Second operand 9 states and 959 transitions. [2023-11-10 12:40:54,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 134 transitions, 399 flow [2023-11-10 12:40:54,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 134 transitions, 394 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-10 12:40:54,924 INFO L231 Difference]: Finished difference. Result has 129 places, 118 transitions, 288 flow [2023-11-10 12:40:54,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=288, PETRI_PLACES=129, PETRI_TRANSITIONS=118} [2023-11-10 12:40:54,926 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, 9 predicate places. [2023-11-10 12:40:54,926 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 118 transitions, 288 flow [2023-11-10 12:40:54,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.33333333333333) internal successors, (632), 6 states have internal predecessors, (632), 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) [2023-11-10 12:40:54,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:40:54,927 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:40:54,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-10 12:40:54,927 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:40:54,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:40:54,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1329237723, now seen corresponding path program 1 times [2023-11-10 12:40:54,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:40:54,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061086826] [2023-11-10 12:40:54,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:40:54,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:40:54,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:40:55,827 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:40:55,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:40:55,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061086826] [2023-11-10 12:40:55,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061086826] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:40:55,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057783438] [2023-11-10 12:40:55,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:40:55,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:40:55,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:40:55,865 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) [2023-11-10 12:40:55,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-10 12:40:55,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:40:55,970 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-10 12:40:55,979 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:40:56,023 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-10 12:40:56,067 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-10 12:40:56,068 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-10 12:40:56,491 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-10 12:40:56,491 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-10 12:40:56,645 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-10 12:40:56,963 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-10 12:40:57,026 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-10 12:40:57,195 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:40:57,195 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:40:58,251 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:40:58,252 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 51 [2023-11-10 12:40:58,260 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:40:58,261 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 144 [2023-11-10 12:40:58,272 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:40:58,272 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 116 [2023-11-10 12:40:58,282 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:40:58,282 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 79 [2023-11-10 12:40:58,495 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:40:58,497 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 50 [2023-11-10 12:40:58,504 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-10 12:40:58,504 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 136 [2023-11-10 12:40:58,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-10 12:40:58,533 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 89 [2023-11-10 12:40:58,542 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-10 12:40:58,542 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 100 [2023-11-10 12:41:01,322 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:41:01,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057783438] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:41:01,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:41:01,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23, 23] total 56 [2023-11-10 12:41:01,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257708397] [2023-11-10 12:41:01,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:41:01,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-11-10 12:41:01,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:41:01,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-11-10 12:41:01,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=606, Invalid=2448, Unknown=26, NotChecked=0, Total=3080 [2023-11-10 12:41:01,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 135 [2023-11-10 12:41:01,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 118 transitions, 288 flow. Second operand has 56 states, 56 states have (on average 53.94642857142857) internal successors, (3021), 56 states have internal predecessors, (3021), 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) [2023-11-10 12:41:01,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:41:01,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 135 [2023-11-10 12:41:01,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:41:02,842 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~sum~0 0)) (.cse1 (<= 0 (+ c_~sum~0 1))) (.cse14 (* c_~front~0 4)) (.cse15 (* c_~back~0 4))) (let ((.cse2 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| 1))))) (.cse5 (+ c_~queue~0.offset .cse15)) (.cse6 (+ c_~queue~0.offset .cse14)) (.cse3 (< c_~n~0 (+ c_~front~0 1))) (.cse9 (and .cse0 .cse1 (= c_~back~0 c_~front~0))) (.cse8 (< c_~front~0 0))) (and (or (and .cse0 (= c_~back~0 0) .cse1) (not (= c_~front~0 0)) .cse2) (= c_~sum~0 1) (or .cse3 (and (forall ((v_ArrVal_69 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) c_~queue~0.base))) (or (not (= (select .cse4 .cse5) 1)) (< (+ c_~sum~0 (select .cse4 .cse6)) 2)))) (forall ((v_ArrVal_69 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) c_~queue~0.base))) (or (not (= (select .cse7 .cse5) 1)) (< 0 (+ c_~sum~0 (select .cse7 .cse6) 1)))))) .cse8) (or .cse3 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse9 .cse8) (or .cse3 (let ((.cse11 (+ .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse12 (+ .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (let ((.cse10 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse10 .cse11) 1)) (< (+ c_~sum~0 (select .cse10 .cse12)) 2)))) (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse13 .cse11) 1)) (< 0 (+ c_~sum~0 (select .cse13 .cse12) 1))))))) .cse8) (or .cse3 (let ((.cse17 (+ .cse14 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse18 (+ .cse15 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (let ((.cse16 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (< 0 (+ (select .cse16 .cse17) c_~sum~0 1)) (not (= (select .cse16 .cse18) 1))))) (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (let ((.cse19 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (< (+ (select .cse19 .cse17) c_~sum~0) 2) (not (= (select .cse19 .cse18) 1))))))) .cse8) (or .cse3 .cse9 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse2 .cse8) (or .cse3 .cse8 (and (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (let ((.cse20 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) c_~queue~0.base))) (or (< (+ c_~sum~0 (select .cse20 .cse6)) 2) (not (= (select .cse20 .cse5) 1))))) (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (let ((.cse21 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) c_~queue~0.base))) (or (< 0 (+ c_~sum~0 1 (select .cse21 .cse6))) (not (= (select .cse21 .cse5) 1))))))) (or .cse3 .cse8 (let ((.cse23 (+ .cse14 |c_ULTIMATE.start_main_#t~ret11#1.offset|)) (.cse24 (+ .cse15 |c_ULTIMATE.start_main_#t~ret11#1.offset|))) (and (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (let ((.cse22 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (or (< (+ c_~sum~0 (select .cse22 .cse23)) 2) (not (= (select .cse22 .cse24) 1))))) (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (let ((.cse25 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (or (< 0 (+ c_~sum~0 (select .cse25 .cse23) 1)) (not (= (select .cse25 .cse24) 1)))))))) (or .cse3 (let ((.cse26 (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) .cse6)))) (and (<= .cse26 1) (<= 0 .cse26))) .cse8) (or .cse3 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse9 .cse8)))) is different from false [2023-11-10 12:41:03,646 INFO L124 PetriNetUnfolderBase]: 177/966 cut-off events. [2023-11-10 12:41:03,646 INFO L125 PetriNetUnfolderBase]: For 243/261 co-relation queries the response was YES. [2023-11-10 12:41:03,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1577 conditions, 966 events. 177/966 cut-off events. For 243/261 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 6230 event pairs, 12 based on Foata normal form. 5/865 useless extension candidates. Maximal degree in co-relation 1568. Up to 123 conditions per place. [2023-11-10 12:41:03,651 INFO L140 encePairwiseOnDemand]: 102/135 looper letters, 116 selfloop transitions, 54 changer transitions 37/253 dead transitions. [2023-11-10 12:41:03,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 253 transitions, 1098 flow [2023-11-10 12:41:03,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-11-10 12:41:03,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2023-11-10 12:41:03,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 2352 transitions. [2023-11-10 12:41:03,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4148148148148148 [2023-11-10 12:41:03,656 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 2352 transitions. [2023-11-10 12:41:03,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 2352 transitions. [2023-11-10 12:41:03,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:41:03,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 2352 transitions. [2023-11-10 12:41:03,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 56.0) internal successors, (2352), 42 states have internal predecessors, (2352), 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) [2023-11-10 12:41:03,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 135.0) internal successors, (5805), 43 states have internal predecessors, (5805), 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) [2023-11-10 12:41:03,667 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 135.0) internal successors, (5805), 43 states have internal predecessors, (5805), 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) [2023-11-10 12:41:03,667 INFO L175 Difference]: Start difference. First operand has 129 places, 118 transitions, 288 flow. Second operand 42 states and 2352 transitions. [2023-11-10 12:41:03,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 253 transitions, 1098 flow [2023-11-10 12:41:03,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 253 transitions, 1066 flow, removed 6 selfloop flow, removed 6 redundant places. [2023-11-10 12:41:03,671 INFO L231 Difference]: Finished difference. Result has 182 places, 153 transitions, 615 flow [2023-11-10 12:41:03,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=615, PETRI_PLACES=182, PETRI_TRANSITIONS=153} [2023-11-10 12:41:03,672 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, 62 predicate places. [2023-11-10 12:41:03,672 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 153 transitions, 615 flow [2023-11-10 12:41:03,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 53.94642857142857) internal successors, (3021), 56 states have internal predecessors, (3021), 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) [2023-11-10 12:41:03,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:41:03,673 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:41:03,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-10 12:41:03,877 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 [2023-11-10 12:41:03,878 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:41:03,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:41:03,878 INFO L85 PathProgramCache]: Analyzing trace with hash 979607275, now seen corresponding path program 1 times [2023-11-10 12:41:03,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:41:03,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094302564] [2023-11-10 12:41:03,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:41:03,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:41:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:41:03,956 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-10 12:41:03,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:41:03,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094302564] [2023-11-10 12:41:03,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094302564] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 12:41:03,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 12:41:03,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-10 12:41:03,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631670430] [2023-11-10 12:41:03,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:41:03,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-10 12:41:03,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:41:03,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-10 12:41:03,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-10 12:41:03,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 135 [2023-11-10 12:41:03,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 153 transitions, 615 flow. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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) [2023-11-10 12:41:03,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:41:03,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 135 [2023-11-10 12:41:03,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:41:04,072 INFO L124 PetriNetUnfolderBase]: 205/1008 cut-off events. [2023-11-10 12:41:04,073 INFO L125 PetriNetUnfolderBase]: For 1249/1298 co-relation queries the response was YES. [2023-11-10 12:41:04,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2089 conditions, 1008 events. 205/1008 cut-off events. For 1249/1298 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 6726 event pairs, 62 based on Foata normal form. 0/880 useless extension candidates. Maximal degree in co-relation 2061. Up to 285 conditions per place. [2023-11-10 12:41:04,080 INFO L140 encePairwiseOnDemand]: 132/135 looper letters, 41 selfloop transitions, 2 changer transitions 1/161 dead transitions. [2023-11-10 12:41:04,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 161 transitions, 751 flow [2023-11-10 12:41:04,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-10 12:41:04,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-10 12:41:04,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2023-11-10 12:41:04,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9037037037037037 [2023-11-10 12:41:04,081 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 366 transitions. [2023-11-10 12:41:04,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions. [2023-11-10 12:41:04,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:41:04,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions. [2023-11-10 12:41:04,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 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) [2023-11-10 12:41:04,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 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) [2023-11-10 12:41:04,083 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 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) [2023-11-10 12:41:04,083 INFO L175 Difference]: Start difference. First operand has 182 places, 153 transitions, 615 flow. Second operand 3 states and 366 transitions. [2023-11-10 12:41:04,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 161 transitions, 751 flow [2023-11-10 12:41:04,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 161 transitions, 664 flow, removed 29 selfloop flow, removed 18 redundant places. [2023-11-10 12:41:04,091 INFO L231 Difference]: Finished difference. Result has 161 places, 151 transitions, 531 flow [2023-11-10 12:41:04,091 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=531, PETRI_PLACES=161, PETRI_TRANSITIONS=151} [2023-11-10 12:41:04,093 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, 41 predicate places. [2023-11-10 12:41:04,093 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 151 transitions, 531 flow [2023-11-10 12:41:04,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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) [2023-11-10 12:41:04,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:41:04,094 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:41:04,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-10 12:41:04,094 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:41:04,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:41:04,094 INFO L85 PathProgramCache]: Analyzing trace with hash 187079008, now seen corresponding path program 2 times [2023-11-10 12:41:04,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:41:04,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285466808] [2023-11-10 12:41:04,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:41:04,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:41:04,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:41:04,236 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:41:04,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:41:04,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285466808] [2023-11-10 12:41:04,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285466808] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:41:04,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341451443] [2023-11-10 12:41:04,240 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-10 12:41:04,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:41:04,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:41:04,241 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) [2023-11-10 12:41:04,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-10 12:41:04,312 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-10 12:41:04,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:41:04,313 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-10 12:41:04,316 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:41:04,392 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:41:04,393 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-10 12:41:04,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341451443] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 12:41:04,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-10 12:41:04,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2023-11-10 12:41:04,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972765297] [2023-11-10 12:41:04,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:41:04,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-10 12:41:04,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:41:04,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-10 12:41:04,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-10 12:41:04,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 135 [2023-11-10 12:41:04,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 151 transitions, 531 flow. Second operand has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 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) [2023-11-10 12:41:04,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:41:04,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 135 [2023-11-10 12:41:04,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:41:04,535 INFO L124 PetriNetUnfolderBase]: 180/1123 cut-off events. [2023-11-10 12:41:04,535 INFO L125 PetriNetUnfolderBase]: For 1730/1786 co-relation queries the response was YES. [2023-11-10 12:41:04,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2304 conditions, 1123 events. 180/1123 cut-off events. For 1730/1786 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 7680 event pairs, 34 based on Foata normal form. 26/1036 useless extension candidates. Maximal degree in co-relation 2280. Up to 221 conditions per place. [2023-11-10 12:41:04,540 INFO L140 encePairwiseOnDemand]: 131/135 looper letters, 36 selfloop transitions, 23 changer transitions 0/175 dead transitions. [2023-11-10 12:41:04,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 175 transitions, 811 flow [2023-11-10 12:41:04,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-10 12:41:04,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-10 12:41:04,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 484 transitions. [2023-11-10 12:41:04,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8962962962962963 [2023-11-10 12:41:04,542 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 484 transitions. [2023-11-10 12:41:04,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 484 transitions. [2023-11-10 12:41:04,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:41:04,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 484 transitions. [2023-11-10 12:41:04,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 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) [2023-11-10 12:41:04,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 135.0) internal successors, (675), 5 states have internal predecessors, (675), 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) [2023-11-10 12:41:04,544 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 135.0) internal successors, (675), 5 states have internal predecessors, (675), 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) [2023-11-10 12:41:04,544 INFO L175 Difference]: Start difference. First operand has 161 places, 151 transitions, 531 flow. Second operand 4 states and 484 transitions. [2023-11-10 12:41:04,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 175 transitions, 811 flow [2023-11-10 12:41:04,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 175 transitions, 809 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-10 12:41:04,550 INFO L231 Difference]: Finished difference. Result has 165 places, 168 transitions, 788 flow [2023-11-10 12:41:04,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=788, PETRI_PLACES=165, PETRI_TRANSITIONS=168} [2023-11-10 12:41:04,551 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, 45 predicate places. [2023-11-10 12:41:04,551 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 168 transitions, 788 flow [2023-11-10 12:41:04,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 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) [2023-11-10 12:41:04,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:41:04,551 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:41:04,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-10 12:41:04,756 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 [2023-11-10 12:41:04,756 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:41:04,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:41:04,757 INFO L85 PathProgramCache]: Analyzing trace with hash -534406894, now seen corresponding path program 3 times [2023-11-10 12:41:04,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:41:04,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351464578] [2023-11-10 12:41:04,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:41:04,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:41:04,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:41:04,930 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:41:04,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:41:04,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351464578] [2023-11-10 12:41:04,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351464578] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 12:41:04,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 12:41:04,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-10 12:41:04,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070224962] [2023-11-10 12:41:04,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:41:04,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-10 12:41:04,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:41:04,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-10 12:41:04,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-10 12:41:04,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 135 [2023-11-10 12:41:04,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 168 transitions, 788 flow. Second operand has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 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) [2023-11-10 12:41:04,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:41:04,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 135 [2023-11-10 12:41:04,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:41:05,141 INFO L124 PetriNetUnfolderBase]: 302/1932 cut-off events. [2023-11-10 12:41:05,142 INFO L125 PetriNetUnfolderBase]: For 2415/2501 co-relation queries the response was YES. [2023-11-10 12:41:05,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3828 conditions, 1932 events. 302/1932 cut-off events. For 2415/2501 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 16195 event pairs, 76 based on Foata normal form. 71/1800 useless extension candidates. Maximal degree in co-relation 3802. Up to 344 conditions per place. [2023-11-10 12:41:05,154 INFO L140 encePairwiseOnDemand]: 131/135 looper letters, 59 selfloop transitions, 4 changer transitions 1/181 dead transitions. [2023-11-10 12:41:05,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 181 transitions, 1008 flow [2023-11-10 12:41:05,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-10 12:41:05,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-10 12:41:05,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 482 transitions. [2023-11-10 12:41:05,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8925925925925926 [2023-11-10 12:41:05,155 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 482 transitions. [2023-11-10 12:41:05,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 482 transitions. [2023-11-10 12:41:05,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:41:05,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 482 transitions. [2023-11-10 12:41:05,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 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) [2023-11-10 12:41:05,157 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 135.0) internal successors, (675), 5 states have internal predecessors, (675), 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) [2023-11-10 12:41:05,157 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 135.0) internal successors, (675), 5 states have internal predecessors, (675), 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) [2023-11-10 12:41:05,158 INFO L175 Difference]: Start difference. First operand has 165 places, 168 transitions, 788 flow. Second operand 4 states and 482 transitions. [2023-11-10 12:41:05,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 181 transitions, 1008 flow [2023-11-10 12:41:05,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 181 transitions, 980 flow, removed 14 selfloop flow, removed 0 redundant places. [2023-11-10 12:41:05,164 INFO L231 Difference]: Finished difference. Result has 170 places, 163 transitions, 722 flow [2023-11-10 12:41:05,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=722, PETRI_PLACES=170, PETRI_TRANSITIONS=163} [2023-11-10 12:41:05,166 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, 50 predicate places. [2023-11-10 12:41:05,166 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 163 transitions, 722 flow [2023-11-10 12:41:05,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 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) [2023-11-10 12:41:05,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:41:05,167 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:41:05,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-10 12:41:05,167 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:41:05,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:41:05,167 INFO L85 PathProgramCache]: Analyzing trace with hash -182043524, now seen corresponding path program 1 times [2023-11-10 12:41:05,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:41:05,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504297975] [2023-11-10 12:41:05,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:41:05,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:41:05,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:41:05,433 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:41:05,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:41:05,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504297975] [2023-11-10 12:41:05,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504297975] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:41:05,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970023634] [2023-11-10 12:41:05,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:41:05,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:41:05,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:41:05,435 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) [2023-11-10 12:41:05,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-10 12:41:05,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:41:05,522 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-10 12:41:05,532 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:41:05,999 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:41:05,999 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:41:06,539 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:41:06,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970023634] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:41:06,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:41:06,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 33 [2023-11-10 12:41:06,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320674068] [2023-11-10 12:41:06,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:41:06,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-10 12:41:06,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:41:06,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-10 12:41:06,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=852, Unknown=0, NotChecked=0, Total=1056 [2023-11-10 12:41:06,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 135 [2023-11-10 12:41:06,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 163 transitions, 722 flow. Second operand has 33 states, 33 states have (on average 94.21212121212122) internal successors, (3109), 33 states have internal predecessors, (3109), 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) [2023-11-10 12:41:06,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:41:06,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 135 [2023-11-10 12:41:06,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:41:07,632 INFO L124 PetriNetUnfolderBase]: 586/2737 cut-off events. [2023-11-10 12:41:07,632 INFO L125 PetriNetUnfolderBase]: For 4664/4857 co-relation queries the response was YES. [2023-11-10 12:41:07,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6045 conditions, 2737 events. 586/2737 cut-off events. For 4664/4857 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 24586 event pairs, 278 based on Foata normal form. 88/2497 useless extension candidates. Maximal degree in co-relation 6016. Up to 628 conditions per place. [2023-11-10 12:41:07,646 INFO L140 encePairwiseOnDemand]: 111/135 looper letters, 81 selfloop transitions, 51 changer transitions 19/236 dead transitions. [2023-11-10 12:41:07,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 236 transitions, 1381 flow [2023-11-10 12:41:07,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-10 12:41:07,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-11-10 12:41:07,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 2849 transitions. [2023-11-10 12:41:07,650 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7034567901234567 [2023-11-10 12:41:07,651 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 2849 transitions. [2023-11-10 12:41:07,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 2849 transitions. [2023-11-10 12:41:07,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:41:07,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 2849 transitions. [2023-11-10 12:41:07,656 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 94.96666666666667) internal successors, (2849), 30 states have internal predecessors, (2849), 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) [2023-11-10 12:41:07,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 135.0) internal successors, (4185), 31 states have internal predecessors, (4185), 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) [2023-11-10 12:41:07,661 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 135.0) internal successors, (4185), 31 states have internal predecessors, (4185), 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) [2023-11-10 12:41:07,661 INFO L175 Difference]: Start difference. First operand has 170 places, 163 transitions, 722 flow. Second operand 30 states and 2849 transitions. [2023-11-10 12:41:07,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 236 transitions, 1381 flow [2023-11-10 12:41:07,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 236 transitions, 1368 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-11-10 12:41:07,671 INFO L231 Difference]: Finished difference. Result has 209 places, 178 transitions, 1021 flow [2023-11-10 12:41:07,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1021, PETRI_PLACES=209, PETRI_TRANSITIONS=178} [2023-11-10 12:41:07,672 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, 89 predicate places. [2023-11-10 12:41:07,672 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 178 transitions, 1021 flow [2023-11-10 12:41:07,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 94.21212121212122) internal successors, (3109), 33 states have internal predecessors, (3109), 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) [2023-11-10 12:41:07,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:41:07,673 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:41:07,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-10 12:41:07,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:41:07,880 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:41:07,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:41:07,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1866253994, now seen corresponding path program 2 times [2023-11-10 12:41:07,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:41:07,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834067492] [2023-11-10 12:41:07,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:41:07,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:41:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:41:08,092 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:41:08,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:41:08,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834067492] [2023-11-10 12:41:08,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834067492] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:41:08,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045785147] [2023-11-10 12:41:08,092 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-10 12:41:08,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:41:08,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:41:08,107 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) [2023-11-10 12:41:08,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-10 12:41:08,189 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-10 12:41:08,189 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:41:08,190 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-10 12:41:08,195 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:41:08,451 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:41:08,452 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:41:08,872 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:41:08,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045785147] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:41:08,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:41:08,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 29 [2023-11-10 12:41:08,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708529739] [2023-11-10 12:41:08,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:41:08,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-10 12:41:08,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:41:08,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-10 12:41:08,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2023-11-10 12:41:08,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 135 [2023-11-10 12:41:08,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 178 transitions, 1021 flow. Second operand has 29 states, 29 states have (on average 94.3103448275862) internal successors, (2735), 29 states have internal predecessors, (2735), 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) [2023-11-10 12:41:08,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:41:08,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 135 [2023-11-10 12:41:08,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:41:09,549 INFO L124 PetriNetUnfolderBase]: 367/1787 cut-off events. [2023-11-10 12:41:09,549 INFO L125 PetriNetUnfolderBase]: For 4012/4138 co-relation queries the response was YES. [2023-11-10 12:41:09,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4572 conditions, 1787 events. 367/1787 cut-off events. For 4012/4138 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 13433 event pairs, 231 based on Foata normal form. 14/1629 useless extension candidates. Maximal degree in co-relation 4531. Up to 628 conditions per place. [2023-11-10 12:41:09,559 INFO L140 encePairwiseOnDemand]: 114/135 looper letters, 69 selfloop transitions, 24 changer transitions 23/201 dead transitions. [2023-11-10 12:41:09,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 201 transitions, 1201 flow [2023-11-10 12:41:09,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-10 12:41:09,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-11-10 12:41:09,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2283 transitions. [2023-11-10 12:41:09,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7046296296296296 [2023-11-10 12:41:09,565 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 2283 transitions. [2023-11-10 12:41:09,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 2283 transitions. [2023-11-10 12:41:09,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:41:09,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 2283 transitions. [2023-11-10 12:41:09,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 95.125) internal successors, (2283), 24 states have internal predecessors, (2283), 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) [2023-11-10 12:41:09,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 135.0) internal successors, (3375), 25 states have internal predecessors, (3375), 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) [2023-11-10 12:41:09,573 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 135.0) internal successors, (3375), 25 states have internal predecessors, (3375), 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) [2023-11-10 12:41:09,573 INFO L175 Difference]: Start difference. First operand has 209 places, 178 transitions, 1021 flow. Second operand 24 states and 2283 transitions. [2023-11-10 12:41:09,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 201 transitions, 1201 flow [2023-11-10 12:41:09,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 201 transitions, 1155 flow, removed 4 selfloop flow, removed 15 redundant places. [2023-11-10 12:41:09,582 INFO L231 Difference]: Finished difference. Result has 217 places, 154 transitions, 753 flow [2023-11-10 12:41:09,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=745, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=753, PETRI_PLACES=217, PETRI_TRANSITIONS=154} [2023-11-10 12:41:09,583 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, 97 predicate places. [2023-11-10 12:41:09,583 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 154 transitions, 753 flow [2023-11-10 12:41:09,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 94.3103448275862) internal successors, (2735), 29 states have internal predecessors, (2735), 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) [2023-11-10 12:41:09,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:41:09,584 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:41:09,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-10 12:41:09,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:41:09,789 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:41:09,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:41:09,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1493510706, now seen corresponding path program 3 times [2023-11-10 12:41:09,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:41:09,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309597144] [2023-11-10 12:41:09,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:41:09,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:41:09,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:41:10,018 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:41:10,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:41:10,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309597144] [2023-11-10 12:41:10,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309597144] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:41:10,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18536067] [2023-11-10 12:41:10,019 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-10 12:41:10,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:41:10,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:41:10,033 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) [2023-11-10 12:41:10,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-10 12:41:10,120 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-10 12:41:10,120 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:41:10,121 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-10 12:41:10,122 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:41:10,325 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-10 12:41:10,325 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:41:10,530 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-10 12:41:10,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18536067] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:41:10,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:41:10,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 26 [2023-11-10 12:41:10,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26097869] [2023-11-10 12:41:10,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:41:10,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-10 12:41:10,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:41:10,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-10 12:41:10,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2023-11-10 12:41:10,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 135 [2023-11-10 12:41:10,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 154 transitions, 753 flow. Second operand has 26 states, 26 states have (on average 94.3076923076923) internal successors, (2452), 26 states have internal predecessors, (2452), 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) [2023-11-10 12:41:10,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:41:10,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 135 [2023-11-10 12:41:10,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:41:11,229 INFO L124 PetriNetUnfolderBase]: 352/1781 cut-off events. [2023-11-10 12:41:11,229 INFO L125 PetriNetUnfolderBase]: For 4562/4681 co-relation queries the response was YES. [2023-11-10 12:41:11,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4609 conditions, 1781 events. 352/1781 cut-off events. For 4562/4681 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 13371 event pairs, 242 based on Foata normal form. 9/1622 useless extension candidates. Maximal degree in co-relation 4566. Up to 653 conditions per place. [2023-11-10 12:41:11,238 INFO L140 encePairwiseOnDemand]: 114/135 looper letters, 59 selfloop transitions, 25 changer transitions 10/178 dead transitions. [2023-11-10 12:41:11,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 178 transitions, 1045 flow [2023-11-10 12:41:11,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-10 12:41:11,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-11-10 12:41:11,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1987 transitions. [2023-11-10 12:41:11,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7008818342151676 [2023-11-10 12:41:11,240 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1987 transitions. [2023-11-10 12:41:11,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1987 transitions. [2023-11-10 12:41:11,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:41:11,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1987 transitions. [2023-11-10 12:41:11,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 94.61904761904762) internal successors, (1987), 21 states have internal predecessors, (1987), 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) [2023-11-10 12:41:11,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 135.0) internal successors, (2970), 22 states have internal predecessors, (2970), 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) [2023-11-10 12:41:11,252 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 135.0) internal successors, (2970), 22 states have internal predecessors, (2970), 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) [2023-11-10 12:41:11,252 INFO L175 Difference]: Start difference. First operand has 217 places, 154 transitions, 753 flow. Second operand 21 states and 1987 transitions. [2023-11-10 12:41:11,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 178 transitions, 1045 flow [2023-11-10 12:41:11,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 178 transitions, 972 flow, removed 10 selfloop flow, removed 22 redundant places. [2023-11-10 12:41:11,259 INFO L231 Difference]: Finished difference. Result has 207 places, 154 transitions, 738 flow [2023-11-10 12:41:11,260 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=738, PETRI_PLACES=207, PETRI_TRANSITIONS=154} [2023-11-10 12:41:11,260 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, 87 predicate places. [2023-11-10 12:41:11,261 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 154 transitions, 738 flow [2023-11-10 12:41:11,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 94.3076923076923) internal successors, (2452), 26 states have internal predecessors, (2452), 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) [2023-11-10 12:41:11,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:41:11,261 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:41:11,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-10 12:41:11,467 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,SelfDestructingSolverStorable10 [2023-11-10 12:41:11,468 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:41:11,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:41:11,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1152566668, now seen corresponding path program 4 times [2023-11-10 12:41:11,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:41:11,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206905114] [2023-11-10 12:41:11,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:41:11,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:41:11,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:41:11,667 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:41:11,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:41:11,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206905114] [2023-11-10 12:41:11,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206905114] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:41:11,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092148296] [2023-11-10 12:41:11,668 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-10 12:41:11,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:41:11,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:41:11,669 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) [2023-11-10 12:41:11,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-10 12:41:11,735 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-10 12:41:11,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:41:11,736 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-10 12:41:11,737 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:41:12,146 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:41:12,146 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:41:12,604 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:41:12,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092148296] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:41:12,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:41:12,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 31 [2023-11-10 12:41:12,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17211809] [2023-11-10 12:41:12,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:41:12,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-10 12:41:12,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:41:12,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-10 12:41:12,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=762, Unknown=0, NotChecked=0, Total=930 [2023-11-10 12:41:12,606 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 135 [2023-11-10 12:41:12,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 154 transitions, 738 flow. Second operand has 31 states, 31 states have (on average 94.2258064516129) internal successors, (2921), 31 states have internal predecessors, (2921), 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) [2023-11-10 12:41:12,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:41:12,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 135 [2023-11-10 12:41:12,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:41:13,449 INFO L124 PetriNetUnfolderBase]: 344/1647 cut-off events. [2023-11-10 12:41:13,449 INFO L125 PetriNetUnfolderBase]: For 3970/4083 co-relation queries the response was YES. [2023-11-10 12:41:13,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4291 conditions, 1647 events. 344/1647 cut-off events. For 3970/4083 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 12111 event pairs, 213 based on Foata normal form. 7/1499 useless extension candidates. Maximal degree in co-relation 4251. Up to 628 conditions per place. [2023-11-10 12:41:13,464 INFO L140 encePairwiseOnDemand]: 112/135 looper letters, 46 selfloop transitions, 21 changer transitions 33/180 dead transitions. [2023-11-10 12:41:13,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 180 transitions, 1038 flow [2023-11-10 12:41:13,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-10 12:41:13,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-11-10 12:41:13,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2356 transitions. [2023-11-10 12:41:13,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6980740740740741 [2023-11-10 12:41:13,467 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 2356 transitions. [2023-11-10 12:41:13,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 2356 transitions. [2023-11-10 12:41:13,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:41:13,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 2356 transitions. [2023-11-10 12:41:13,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 94.24) internal successors, (2356), 25 states have internal predecessors, (2356), 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) [2023-11-10 12:41:13,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 135.0) internal successors, (3510), 26 states have internal predecessors, (3510), 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) [2023-11-10 12:41:13,472 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 135.0) internal successors, (3510), 26 states have internal predecessors, (3510), 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) [2023-11-10 12:41:13,473 INFO L175 Difference]: Start difference. First operand has 207 places, 154 transitions, 738 flow. Second operand 25 states and 2356 transitions. [2023-11-10 12:41:13,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 180 transitions, 1038 flow [2023-11-10 12:41:13,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 180 transitions, 982 flow, removed 9 selfloop flow, removed 17 redundant places. [2023-11-10 12:41:13,479 INFO L231 Difference]: Finished difference. Result has 213 places, 141 transitions, 657 flow [2023-11-10 12:41:13,479 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=657, PETRI_PLACES=213, PETRI_TRANSITIONS=141} [2023-11-10 12:41:13,480 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, 93 predicate places. [2023-11-10 12:41:13,480 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 141 transitions, 657 flow [2023-11-10 12:41:13,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 94.2258064516129) internal successors, (2921), 31 states have internal predecessors, (2921), 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) [2023-11-10 12:41:13,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:41:13,481 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:41:13,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-10 12:41:13,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:41:13,685 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:41:13,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:41:13,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1037738221, now seen corresponding path program 5 times [2023-11-10 12:41:13,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:41:13,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995926639] [2023-11-10 12:41:13,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:41:13,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:41:13,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:41:14,496 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:41:14,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:41:14,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995926639] [2023-11-10 12:41:14,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995926639] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:41:14,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139530853] [2023-11-10 12:41:14,497 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-10 12:41:14,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:41:14,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:41:14,498 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) [2023-11-10 12:41:14,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-10 12:41:14,575 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-11-10 12:41:14,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:41:14,576 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 41 conjunts are in the unsatisfiable core [2023-11-10 12:41:14,578 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:41:15,631 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:41:15,632 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:41:16,049 INFO L322 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-11-10 12:41:16,050 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 50 [2023-11-10 12:41:17,132 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:41:17,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139530853] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:41:17,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:41:17,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 17] total 52 [2023-11-10 12:41:17,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925097860] [2023-11-10 12:41:17,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:41:17,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-11-10 12:41:17,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:41:17,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-11-10 12:41:17,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=2205, Unknown=0, NotChecked=0, Total=2652 [2023-11-10 12:41:17,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 135 [2023-11-10 12:41:17,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 141 transitions, 657 flow. Second operand has 52 states, 52 states have (on average 64.40384615384616) internal successors, (3349), 52 states have internal predecessors, (3349), 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) [2023-11-10 12:41:17,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:41:17,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 135 [2023-11-10 12:41:17,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:41:19,362 INFO L124 PetriNetUnfolderBase]: 467/3213 cut-off events. [2023-11-10 12:41:19,362 INFO L125 PetriNetUnfolderBase]: For 10981/11015 co-relation queries the response was YES. [2023-11-10 12:41:19,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9731 conditions, 3213 events. 467/3213 cut-off events. For 10981/11015 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 28140 event pairs, 56 based on Foata normal form. 37/3098 useless extension candidates. Maximal degree in co-relation 9688. Up to 465 conditions per place. [2023-11-10 12:41:19,378 INFO L140 encePairwiseOnDemand]: 107/135 looper letters, 100 selfloop transitions, 56 changer transitions 88/300 dead transitions. [2023-11-10 12:41:19,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 300 transitions, 2134 flow [2023-11-10 12:41:19,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-11-10 12:41:19,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2023-11-10 12:41:19,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 3216 transitions. [2023-11-10 12:41:19,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48616780045351476 [2023-11-10 12:41:19,382 INFO L72 ComplementDD]: Start complementDD. Operand 49 states and 3216 transitions. [2023-11-10 12:41:19,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 3216 transitions. [2023-11-10 12:41:19,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:41:19,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 49 states and 3216 transitions. [2023-11-10 12:41:19,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 50 states, 49 states have (on average 65.63265306122449) internal successors, (3216), 49 states have internal predecessors, (3216), 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) [2023-11-10 12:41:19,391 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 50 states, 50 states have (on average 135.0) internal successors, (6750), 50 states have internal predecessors, (6750), 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) [2023-11-10 12:41:19,391 INFO L81 ComplementDD]: Finished complementDD. Result has 50 states, 50 states have (on average 135.0) internal successors, (6750), 50 states have internal predecessors, (6750), 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) [2023-11-10 12:41:19,391 INFO L175 Difference]: Start difference. First operand has 213 places, 141 transitions, 657 flow. Second operand 49 states and 3216 transitions. [2023-11-10 12:41:19,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 300 transitions, 2134 flow [2023-11-10 12:41:19,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 300 transitions, 1961 flow, removed 58 selfloop flow, removed 27 redundant places. [2023-11-10 12:41:19,405 INFO L231 Difference]: Finished difference. Result has 233 places, 165 transitions, 946 flow [2023-11-10 12:41:19,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=946, PETRI_PLACES=233, PETRI_TRANSITIONS=165} [2023-11-10 12:41:19,405 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, 113 predicate places. [2023-11-10 12:41:19,405 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 165 transitions, 946 flow [2023-11-10 12:41:19,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 64.40384615384616) internal successors, (3349), 52 states have internal predecessors, (3349), 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) [2023-11-10 12:41:19,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:41:19,407 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:41:19,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-10 12:41:19,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:41:19,611 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:41:19,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:41:19,612 INFO L85 PathProgramCache]: Analyzing trace with hash -308283239, now seen corresponding path program 6 times [2023-11-10 12:41:19,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:41:19,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125501184] [2023-11-10 12:41:19,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:41:19,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:41:19,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:41:20,539 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:41:20,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:41:20,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125501184] [2023-11-10 12:41:20,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125501184] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:41:20,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469452425] [2023-11-10 12:41:20,539 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-10 12:41:20,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:41:20,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:41:20,541 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 12:41:20,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-10 12:41:20,650 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-11-10 12:41:20,651 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:41:20,652 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-10 12:41:20,655 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:41:21,212 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-10 12:41:21,502 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-10 12:41:21,563 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-10 12:41:21,882 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:41:21,882 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:41:22,804 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~front~0 1))) (or (< c_~n~0 .cse0) (let ((.cse7 (* c_~front~0 4)) (.cse8 (* c_~back~0 4))) (let ((.cse2 (+ c_~queue~0.offset .cse8)) (.cse3 (+ c_~queue~0.offset .cse8 4)) (.cse4 (+ c_~queue~0.offset .cse7)) (.cse5 (+ c_~queue~0.offset .cse7 4))) (and (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272) c_~queue~0.base))) (or (not (= (select .cse1 .cse2) 1)) (not (= (+ (select .cse1 .cse3) 1) 0)) (< (+ c_~sum~0 (select .cse1 .cse4) (select .cse1 .cse5)) 2)))) (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272) c_~queue~0.base))) (or (not (= (select .cse6 .cse2) 1)) (not (= (+ (select .cse6 .cse3) 1) 0)) (< 0 (+ c_~sum~0 (select .cse6 .cse4) (select .cse6 .cse5) 1)))))))) (= .cse0 c_~n~0) (< c_~front~0 0))) is different from false [2023-11-10 12:41:23,674 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:41:23,674 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 88 [2023-11-10 12:41:23,695 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:41:23,695 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 570 treesize of output 538 [2023-11-10 12:41:23,724 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:41:23,724 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 180 treesize of output 190 [2023-11-10 12:41:23,754 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:41:23,755 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 179 treesize of output 163 [2023-11-10 12:41:24,544 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:41:24,545 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 87 [2023-11-10 12:41:24,561 INFO L322 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-11-10 12:41:24,561 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 266 treesize of output 240 [2023-11-10 12:41:24,579 INFO L322 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-11-10 12:41:24,580 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 232 treesize of output 188 [2023-11-10 12:41:24,619 INFO L322 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-11-10 12:41:24,619 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 153 treesize of output 135 [2023-11-10 12:41:24,691 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-11-10 12:41:25,408 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:41:25,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469452425] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:41:25,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:41:25,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 26, 23] total 62 [2023-11-10 12:41:25,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446138649] [2023-11-10 12:41:25,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:41:25,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2023-11-10 12:41:25,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:41:25,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2023-11-10 12:41:25,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=618, Invalid=3002, Unknown=44, NotChecked=118, Total=3782 [2023-11-10 12:41:25,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 135 [2023-11-10 12:41:25,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 165 transitions, 946 flow. Second operand has 62 states, 62 states have (on average 57.016129032258064) internal successors, (3535), 62 states have internal predecessors, (3535), 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) [2023-11-10 12:41:25,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:41:25,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 135 [2023-11-10 12:41:25,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:41:27,412 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse33 (+ c_~front~0 1)) (.cse12 (<= 0 c_~sum~0)) (.cse13 (<= c_~sum~0 1))) (let ((.cse0 (select |c_#memory_int| c_~queue~0.base)) (.cse14 (and (= c_~back~0 c_~front~0) .cse12 .cse13)) (.cse2 (< c_~n~0 .cse33)) (.cse11 (= .cse33 c_~n~0)) (.cse1 (< c_~front~0 0)) (.cse10 (* c_~front~0 4)) (.cse9 (* c_~back~0 4))) (and (or (< c_~n~0 (+ 2 c_~front~0)) (and (= (+ (select .cse0 4) 1) 0) (= (select .cse0 0) 1) (<= c_~n~0 2)) .cse1) (or .cse2 (let ((.cse4 (+ .cse10 |c_ULTIMATE.start_main_#t~ret11#1.offset|)) (.cse5 (+ .cse10 |c_ULTIMATE.start_main_#t~ret11#1.offset| 4)) (.cse6 (+ .cse9 |c_ULTIMATE.start_main_#t~ret11#1.offset|)) (.cse7 (+ .cse9 |c_ULTIMATE.start_main_#t~ret11#1.offset| 4))) (and (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (or (< 0 (+ c_~sum~0 (select .cse3 .cse4) (select .cse3 .cse5) 1)) (not (= (select .cse3 .cse6) 1)) (not (= (+ (select .cse3 .cse7) 1) 0))))) (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (or (< (+ c_~sum~0 (select .cse8 .cse4) (select .cse8 .cse5)) 2) (not (= (select .cse8 .cse6) 1)) (not (= (+ (select .cse8 .cse7) 1) 0))))))) .cse11 .cse1) (or (not (= c_~front~0 0)) (and (= c_~back~0 0) .cse12 .cse13)) (or .cse2 (< 2 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse11 .cse14 .cse1) (or (= (+ c_~sum~0 (select .cse0 .cse10)) 0) .cse2) (or .cse2 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_#t~post19#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse11 .cse14 .cse1) (= c_~queue~0.offset 0) (or .cse2 .cse11 (let ((.cse16 (+ .cse9 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse18 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse19 (+ .cse10 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse17 (+ .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int))) (let ((.cse15 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= 0 (+ (select .cse15 .cse16) 1))) (not (= (select .cse15 .cse17) 1)) (< (+ c_~sum~0 (select .cse15 .cse18) (select .cse15 .cse19)) 2)))) (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int))) (let ((.cse20 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= 0 (+ (select .cse20 .cse16) 1))) (< 0 (+ c_~sum~0 (select .cse20 .cse18) (select .cse20 .cse19) 1)) (not (= (select .cse20 .cse17) 1))))))) .cse1) (or .cse2 (< 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse11 .cse14 .cse1) (or .cse2 (let ((.cse24 (+ c_~queue~0.offset .cse9 4)) (.cse22 (+ c_~queue~0.offset .cse10)) (.cse23 (+ c_~queue~0.offset .cse10 4)) (.cse25 (+ c_~queue~0.offset .cse9))) (and (forall ((v_ArrVal_272 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272) c_~queue~0.base))) (or (< 0 (+ c_~sum~0 (select .cse21 .cse22) (select .cse21 .cse23) 1)) (not (= (+ (select .cse21 .cse24) 1) 0)) (not (= (select .cse21 .cse25) 1))))) (forall ((v_ArrVal_272 (Array Int Int))) (let ((.cse26 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272) c_~queue~0.base))) (or (not (= (+ (select .cse26 .cse24) 1) 0)) (< (+ c_~sum~0 (select .cse26 .cse22) (select .cse26 .cse23)) 2) (not (= (select .cse26 .cse25) 1))))))) .cse11 .cse1) (or .cse2 .cse11 .cse14 .cse1 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (= c_~sum~0 0) (or .cse2 .cse11 .cse1 (let ((.cse30 (+ .cse9 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) (.cse31 (+ .cse9 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse28 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse29 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4))) (and (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int))) (let ((.cse27 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (< 0 (+ c_~sum~0 (select .cse27 .cse28) 1 (select .cse27 .cse29))) (not (= (+ (select .cse27 .cse30) 1) 0)) (not (= (select .cse27 .cse31) 1))))) (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int))) (let ((.cse32 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (+ (select .cse32 .cse30) 1) 0)) (not (= (select .cse32 .cse31) 1)) (< (+ c_~sum~0 (select .cse32 .cse28) (select .cse32 .cse29)) 2)))))))))) is different from false [2023-11-10 12:41:29,016 INFO L124 PetriNetUnfolderBase]: 713/4296 cut-off events. [2023-11-10 12:41:29,016 INFO L125 PetriNetUnfolderBase]: For 17289/17386 co-relation queries the response was YES. [2023-11-10 12:41:29,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12572 conditions, 4296 events. 713/4296 cut-off events. For 17289/17386 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 41220 event pairs, 74 based on Foata normal form. 54/4123 useless extension candidates. Maximal degree in co-relation 12516. Up to 619 conditions per place. [2023-11-10 12:41:29,051 INFO L140 encePairwiseOnDemand]: 101/135 looper letters, 168 selfloop transitions, 90 changer transitions 52/363 dead transitions. [2023-11-10 12:41:29,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 363 transitions, 3046 flow [2023-11-10 12:41:29,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2023-11-10 12:41:29,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2023-11-10 12:41:29,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 3304 transitions. [2023-11-10 12:41:29,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43703703703703706 [2023-11-10 12:41:29,061 INFO L72 ComplementDD]: Start complementDD. Operand 56 states and 3304 transitions. [2023-11-10 12:41:29,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 3304 transitions. [2023-11-10 12:41:29,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:41:29,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 56 states and 3304 transitions. [2023-11-10 12:41:29,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 57 states, 56 states have (on average 59.0) internal successors, (3304), 56 states have internal predecessors, (3304), 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) [2023-11-10 12:41:29,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 57 states, 57 states have (on average 135.0) internal successors, (7695), 57 states have internal predecessors, (7695), 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) [2023-11-10 12:41:29,077 INFO L81 ComplementDD]: Finished complementDD. Result has 57 states, 57 states have (on average 135.0) internal successors, (7695), 57 states have internal predecessors, (7695), 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) [2023-11-10 12:41:29,077 INFO L175 Difference]: Start difference. First operand has 233 places, 165 transitions, 946 flow. Second operand 56 states and 3304 transitions. [2023-11-10 12:41:29,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 363 transitions, 3046 flow [2023-11-10 12:41:29,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 363 transitions, 2733 flow, removed 142 selfloop flow, removed 24 redundant places. [2023-11-10 12:41:29,097 INFO L231 Difference]: Finished difference. Result has 268 places, 203 transitions, 1576 flow [2023-11-10 12:41:29,097 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=867, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=1576, PETRI_PLACES=268, PETRI_TRANSITIONS=203} [2023-11-10 12:41:29,098 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, 148 predicate places. [2023-11-10 12:41:29,098 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 203 transitions, 1576 flow [2023-11-10 12:41:29,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 57.016129032258064) internal successors, (3535), 62 states have internal predecessors, (3535), 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) [2023-11-10 12:41:29,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:41:29,099 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:41:29,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-10 12:41:29,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-10 12:41:29,303 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:41:29,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:41:29,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1525478033, now seen corresponding path program 7 times [2023-11-10 12:41:29,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:41:29,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800438697] [2023-11-10 12:41:29,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:41:29,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:41:29,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:41:30,371 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:41:30,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:41:30,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800438697] [2023-11-10 12:41:30,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800438697] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:41:30,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532554981] [2023-11-10 12:41:30,372 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-10 12:41:30,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:41:30,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:41:30,381 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 12:41:30,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-10 12:41:30,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:41:30,491 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-10 12:41:30,493 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:41:31,140 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:41:31,141 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:41:31,505 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:41:31,506 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 60 [2023-11-10 12:41:32,469 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:41:32,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532554981] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:41:32,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:41:32,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17, 17] total 47 [2023-11-10 12:41:32,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630005179] [2023-11-10 12:41:32,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:41:32,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-11-10 12:41:32,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:41:32,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-11-10 12:41:32,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=1816, Unknown=0, NotChecked=0, Total=2162 [2023-11-10 12:41:32,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 135 [2023-11-10 12:41:32,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 203 transitions, 1576 flow. Second operand has 47 states, 47 states have (on average 64.74468085106383) internal successors, (3043), 47 states have internal predecessors, (3043), 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) [2023-11-10 12:41:32,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:41:32,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 135 [2023-11-10 12:41:32,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:41:34,992 INFO L124 PetriNetUnfolderBase]: 851/5054 cut-off events. [2023-11-10 12:41:34,992 INFO L125 PetriNetUnfolderBase]: For 26755/26913 co-relation queries the response was YES. [2023-11-10 12:41:35,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16108 conditions, 5054 events. 851/5054 cut-off events. For 26755/26913 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 50073 event pairs, 84 based on Foata normal form. 65/4852 useless extension candidates. Maximal degree in co-relation 16045. Up to 715 conditions per place. [2023-11-10 12:41:35,018 INFO L140 encePairwiseOnDemand]: 107/135 looper letters, 88 selfloop transitions, 49 changer transitions 135/328 dead transitions. [2023-11-10 12:41:35,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 328 transitions, 3090 flow [2023-11-10 12:41:35,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-11-10 12:41:35,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2023-11-10 12:41:35,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 3090 transitions. [2023-11-10 12:41:35,020 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48699763593380613 [2023-11-10 12:41:35,020 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 3090 transitions. [2023-11-10 12:41:35,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 3090 transitions. [2023-11-10 12:41:35,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:41:35,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 3090 transitions. [2023-11-10 12:41:35,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 65.74468085106383) internal successors, (3090), 47 states have internal predecessors, (3090), 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) [2023-11-10 12:41:35,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 135.0) internal successors, (6480), 48 states have internal predecessors, (6480), 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) [2023-11-10 12:41:35,028 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 135.0) internal successors, (6480), 48 states have internal predecessors, (6480), 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) [2023-11-10 12:41:35,029 INFO L175 Difference]: Start difference. First operand has 268 places, 203 transitions, 1576 flow. Second operand 47 states and 3090 transitions. [2023-11-10 12:41:35,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 328 transitions, 3090 flow [2023-11-10 12:41:35,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 328 transitions, 2831 flow, removed 98 selfloop flow, removed 38 redundant places. [2023-11-10 12:41:35,054 INFO L231 Difference]: Finished difference. Result has 278 places, 160 transitions, 1062 flow [2023-11-10 12:41:35,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=1383, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=1062, PETRI_PLACES=278, PETRI_TRANSITIONS=160} [2023-11-10 12:41:35,055 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, 158 predicate places. [2023-11-10 12:41:35,055 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 160 transitions, 1062 flow [2023-11-10 12:41:35,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 64.74468085106383) internal successors, (3043), 47 states have internal predecessors, (3043), 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) [2023-11-10 12:41:35,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:41:35,056 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:41:35,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-10 12:41:35,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-10 12:41:35,260 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:41:35,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:41:35,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1348840920, now seen corresponding path program 8 times [2023-11-10 12:41:35,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:41:35,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693873316] [2023-11-10 12:41:35,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:41:35,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:41:35,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:41:35,328 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-10 12:41:35,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:41:35,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693873316] [2023-11-10 12:41:35,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693873316] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:41:35,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837421137] [2023-11-10 12:41:35,328 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-10 12:41:35,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:41:35,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:41:35,329 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 12:41:35,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-10 12:41:35,410 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-10 12:41:35,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:41:35,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-10 12:41:35,413 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:41:35,481 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-10 12:41:35,481 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:41:35,670 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 23 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-10 12:41:35,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837421137] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:41:35,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:41:35,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 7] total 10 [2023-11-10 12:41:35,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379492448] [2023-11-10 12:41:35,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:41:35,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-10 12:41:35,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:41:35,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-10 12:41:35,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2023-11-10 12:41:35,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 135 [2023-11-10 12:41:35,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 160 transitions, 1062 flow. Second operand has 10 states, 10 states have (on average 117.5) internal successors, (1175), 10 states have internal predecessors, (1175), 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) [2023-11-10 12:41:35,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:41:35,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 135 [2023-11-10 12:41:35,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:41:36,130 INFO L124 PetriNetUnfolderBase]: 337/2182 cut-off events. [2023-11-10 12:41:36,130 INFO L125 PetriNetUnfolderBase]: For 12499/12713 co-relation queries the response was YES. [2023-11-10 12:41:36,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7036 conditions, 2182 events. 337/2182 cut-off events. For 12499/12713 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 17703 event pairs, 107 based on Foata normal form. 9/2011 useless extension candidates. Maximal degree in co-relation 6970. Up to 400 conditions per place. [2023-11-10 12:41:36,144 INFO L140 encePairwiseOnDemand]: 129/135 looper letters, 36 selfloop transitions, 38 changer transitions 0/188 dead transitions. [2023-11-10 12:41:36,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 188 transitions, 1582 flow [2023-11-10 12:41:36,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-10 12:41:36,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-10 12:41:36,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 720 transitions. [2023-11-10 12:41:36,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2023-11-10 12:41:36,145 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 720 transitions. [2023-11-10 12:41:36,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 720 transitions. [2023-11-10 12:41:36,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:41:36,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 720 transitions. [2023-11-10 12:41:36,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 120.0) internal successors, (720), 6 states have internal predecessors, (720), 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) [2023-11-10 12:41:36,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 135.0) internal successors, (945), 7 states have internal predecessors, (945), 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) [2023-11-10 12:41:36,147 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 135.0) internal successors, (945), 7 states have internal predecessors, (945), 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) [2023-11-10 12:41:36,148 INFO L175 Difference]: Start difference. First operand has 278 places, 160 transitions, 1062 flow. Second operand 6 states and 720 transitions. [2023-11-10 12:41:36,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 188 transitions, 1582 flow [2023-11-10 12:41:36,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 188 transitions, 1383 flow, removed 34 selfloop flow, removed 51 redundant places. [2023-11-10 12:41:36,162 INFO L231 Difference]: Finished difference. Result has 194 places, 179 transitions, 1361 flow [2023-11-10 12:41:36,162 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1361, PETRI_PLACES=194, PETRI_TRANSITIONS=179} [2023-11-10 12:41:36,163 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, 74 predicate places. [2023-11-10 12:41:36,163 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 179 transitions, 1361 flow [2023-11-10 12:41:36,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 117.5) internal successors, (1175), 10 states have internal predecessors, (1175), 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) [2023-11-10 12:41:36,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:41:36,164 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:41:36,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-10 12:41:36,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-10 12:41:36,370 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:41:36,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:41:36,371 INFO L85 PathProgramCache]: Analyzing trace with hash -341419106, now seen corresponding path program 9 times [2023-11-10 12:41:36,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:41:36,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411887377] [2023-11-10 12:41:36,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:41:36,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:41:36,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:41:37,332 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:41:37,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:41:37,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411887377] [2023-11-10 12:41:37,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411887377] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:41:37,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136899091] [2023-11-10 12:41:37,333 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-10 12:41:37,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:41:37,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:41:37,334 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 12:41:37,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-10 12:41:37,530 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-10 12:41:37,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:41:37,532 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-10 12:41:37,534 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:41:38,549 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:41:38,549 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:41:38,896 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:41:38,896 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 60 [2023-11-10 12:41:39,980 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:41:39,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136899091] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:41:39,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:41:39,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 22, 22] total 62 [2023-11-10 12:41:39,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605308725] [2023-11-10 12:41:39,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:41:39,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2023-11-10 12:41:39,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:41:39,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2023-11-10 12:41:39,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=594, Invalid=3188, Unknown=0, NotChecked=0, Total=3782 [2023-11-10 12:41:39,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 135 [2023-11-10 12:41:39,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 179 transitions, 1361 flow. Second operand has 62 states, 62 states have (on average 58.935483870967744) internal successors, (3654), 62 states have internal predecessors, (3654), 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) [2023-11-10 12:41:39,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:41:39,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 135 [2023-11-10 12:41:39,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:41:50,982 INFO L124 PetriNetUnfolderBase]: 6362/21774 cut-off events. [2023-11-10 12:41:50,982 INFO L125 PetriNetUnfolderBase]: For 152010/152566 co-relation queries the response was YES. [2023-11-10 12:41:51,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73373 conditions, 21774 events. 6362/21774 cut-off events. For 152010/152566 co-relation queries the response was YES. Maximal size of possible extension queue 554. Compared 250791 event pairs, 756 based on Foata normal form. 235/20814 useless extension candidates. Maximal degree in co-relation 73327. Up to 3719 conditions per place. [2023-11-10 12:41:51,119 INFO L140 encePairwiseOnDemand]: 102/135 looper letters, 653 selfloop transitions, 327 changer transitions 219/1247 dead transitions. [2023-11-10 12:41:51,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 1247 transitions, 12637 flow [2023-11-10 12:41:51,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2023-11-10 12:41:51,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2023-11-10 12:41:51,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 9489 transitions. [2023-11-10 12:41:51,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4564213564213564 [2023-11-10 12:41:51,127 INFO L72 ComplementDD]: Start complementDD. Operand 154 states and 9489 transitions. [2023-11-10 12:41:51,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 154 states and 9489 transitions. [2023-11-10 12:41:51,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:41:51,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 154 states and 9489 transitions. [2023-11-10 12:41:51,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 155 states, 154 states have (on average 61.616883116883116) internal successors, (9489), 154 states have internal predecessors, (9489), 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) [2023-11-10 12:41:51,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 155 states, 155 states have (on average 135.0) internal successors, (20925), 155 states have internal predecessors, (20925), 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) [2023-11-10 12:41:51,153 INFO L81 ComplementDD]: Finished complementDD. Result has 155 states, 155 states have (on average 135.0) internal successors, (20925), 155 states have internal predecessors, (20925), 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) [2023-11-10 12:41:51,153 INFO L175 Difference]: Start difference. First operand has 194 places, 179 transitions, 1361 flow. Second operand 154 states and 9489 transitions. [2023-11-10 12:41:51,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 1247 transitions, 12637 flow [2023-11-10 12:41:51,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 1247 transitions, 12231 flow, removed 202 selfloop flow, removed 1 redundant places. [2023-11-10 12:41:51,249 INFO L231 Difference]: Finished difference. Result has 470 places, 491 transitions, 7595 flow [2023-11-10 12:41:51,250 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=1315, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=154, PETRI_FLOW=7595, PETRI_PLACES=470, PETRI_TRANSITIONS=491} [2023-11-10 12:41:51,250 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, 350 predicate places. [2023-11-10 12:41:51,250 INFO L495 AbstractCegarLoop]: Abstraction has has 470 places, 491 transitions, 7595 flow [2023-11-10 12:41:51,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 58.935483870967744) internal successors, (3654), 62 states have internal predecessors, (3654), 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) [2023-11-10 12:41:51,251 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:41:51,251 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:41:51,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-10 12:41:51,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-10 12:41:51,457 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:41:51,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:41:51,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1989492699, now seen corresponding path program 10 times [2023-11-10 12:41:51,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:41:51,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564553382] [2023-11-10 12:41:51,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:41:51,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:41:51,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:41:53,014 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:41:53,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:41:53,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564553382] [2023-11-10 12:41:53,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564553382] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:41:53,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452207710] [2023-11-10 12:41:53,015 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-10 12:41:53,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:41:53,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:41:53,016 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 12:41:53,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-10 12:41:53,101 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-10 12:41:53,101 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:41:53,102 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-10 12:41:53,104 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:41:54,099 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 2 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:41:54,099 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:41:54,661 INFO L322 Elim1Store]: treesize reduction 30, result has 64.7 percent of original size [2023-11-10 12:41:54,662 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 108 treesize of output 84 [2023-11-10 12:41:55,771 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:41:55,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452207710] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:41:55,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:41:55,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 22, 22] total 61 [2023-11-10 12:41:55,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792864378] [2023-11-10 12:41:55,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:41:55,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2023-11-10 12:41:55,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:41:55,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2023-11-10 12:41:55,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=3036, Unknown=0, NotChecked=0, Total=3660 [2023-11-10 12:41:55,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 135 [2023-11-10 12:41:55,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 470 places, 491 transitions, 7595 flow. Second operand has 61 states, 61 states have (on average 64.29508196721312) internal successors, (3922), 61 states have internal predecessors, (3922), 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) [2023-11-10 12:41:55,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:41:55,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 135 [2023-11-10 12:41:55,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:42:01,631 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([434] L68-->L71: Formula: (and (not (= (ite (= (+ (select (select |v_#memory_int_40| v_~queue~0.base_32) (+ (* 4 v_~back~0_60) v_~queue~0.offset_32)) 1) 0) 1 0) 0)) (= (+ v_~back~0_60 1) v_~back~0_59)) InVars {~back~0=v_~back~0_60, #memory_int=|v_#memory_int_40|, ~queue~0.offset=v_~queue~0.offset_32, ~queue~0.base=v_~queue~0.base_32} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~queue~0.offset=v_~queue~0.offset_32, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, ~back~0=v_~back~0_59, #memory_int=|v_#memory_int_40|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~queue~0.base=v_~queue~0.base_32} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, ~back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1][391], [3827#(<= ~front~0 ~back~0), 102#L89-4true, Black: 7563#(<= ~back~0 ~front~0), Black: 7564#(<= ~back~0 (+ ~front~0 1)), 1363#(and (<= |thread2Thread1of1ForFork1_~b~0#1| (* (div |thread2Thread1of1ForFork1_~b~0#1| 256) 256)) (<= 0 (div |thread2Thread1of1ForFork1_~b~0#1| 256))), Black: 7565#(<= ~back~0 (+ 2 ~front~0)), 7561#true, Black: 9618#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))), Black: 9580#(and (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (or (and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (= (select (select |#memory_int| ~queue~0.base) 0) 1)) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9688#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9596#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9666#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 4605#(and (or (= ~back~0 ~front~0) (< ~n~0 (+ ~front~0 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (< ~front~0 0)) (<= ~front~0 ~back~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0)) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~front~0 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (< ~front~0 0))), Black: 9566#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 9724#(and (or (< ~back~0 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~back~0 1))) (= ~sum~0 0) (<= ~front~0 ~back~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4634#(and (<= ~front~0 ~back~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0)) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~front~0 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (< ~front~0 0))), Black: 9742#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4632#(and (<= ~front~0 ~back~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9544#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9574#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 9704#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1)), Black: 9612#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1)))), Black: 9608#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0))), Black: 9642#(and (or (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))), Black: 9548#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~sum~0 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))), Black: 9638#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), 108#L71true, Black: 9734#(and (or (< ~back~0 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~back~0 1))) (= ~sum~0 0) (<= ~front~0 ~back~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9736#(and (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (= ~sum~0 0) (<= ~front~0 ~back~0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9534#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (<= ~sum~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))))), Black: 9684#(and (<= 0 ~sum~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9678#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9740#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9722#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9576#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9746#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~sum~0 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9562#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= ~front~0 1))) (<= 1 ~front~0) (<= ~front~0 ~n~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4))))) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= ~front~0 1)))), Black: 9694#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))))), Black: 9586#(and (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 9690#(and (<= 0 ~sum~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9714#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9708#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9536#(and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (<= 2 ~back~0) (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (= ~queue~0.offset 0) (<= 1 ~n~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~front~0 1)), Black: 9726#(and (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (= ~sum~0 0) (<= ~front~0 ~back~0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9676#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9710#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9550#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0))), Black: 9662#(and (or (< ~back~0 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~back~0 1))) (= ~sum~0 0) (<= ~front~0 ~back~0) (or (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))), Black: 9532#(and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (<= 2 ~back~0) (= ~sum~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (= ~queue~0.offset 0) (<= 1 ~n~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~front~0 1)), Black: 9718#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8468#(and (= ~sum~0 0) (<= ~front~0 ~back~0)), Black: 9634#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9494#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 3) (= ~back~0 ~front~0) (= ~sum~0 0) (<= ~n~0 3) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9528#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (<= ~sum~0 1)), Black: 9698#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9700#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)), Black: 9652#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))))), Black: 9640#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9616#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9754#(and (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9486#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9568#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0)) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1)))), Black: 1082#(<= ~back~0 ~front~0), Black: 9614#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= ~sum~0 1)), Black: 1263#(<= ~back~0 (+ ~front~0 1)), Black: 9594#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9654#(and (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (= ~sum~0 0) (<= ~front~0 ~back~0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0))), Black: 9674#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9588#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9600#(and (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 9556#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 1362#(not (= (* (div |thread2Thread1of1ForFork1_~b~0#1| 256) 256) |thread2Thread1of1ForFork1_~b~0#1|)), Black: 9524#(and (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)), Black: 9526#(and (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (< ~n~0 (+ ~back~0 2)) (< ~front~0 0)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9630#(and (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (or (and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (= (select (select |#memory_int| ~queue~0.base) 0) 1)) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9540#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (<= 1 ~front~0) (<= ~front~0 ~n~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4))))) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0)), Black: 9628#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9578#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 9648#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= ~sum~0 1)), Black: 9598#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9564#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 9496#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (<= ~n~0 3) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9626#(and (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (or (and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (= (select (select |#memory_int| ~queue~0.base) 0) 1)) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9658#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9582#(and (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (or (and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (= (select (select |#memory_int| ~queue~0.base) 0) 1)) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9646#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9686#(and (<= 0 ~sum~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9692#(and (or (< ~back~0 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~back~0 1))) (or (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (= ~sum~0 0) (<= ~front~0 ~back~0) (or (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))), Black: 9682#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9622#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0))), Black: 9696#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9716#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9492#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 3) (= ~back~0 ~front~0) (= ~sum~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9728#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9706#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9744#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9620#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9668#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9522#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (<= 1 ~front~0) (<= ~front~0 ~n~0) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= ~front~0 1)))), Black: 9542#(and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (<= 2 ~back~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) 8) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) 8)))) (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (= ~queue~0.offset 0) (<= 1 ~n~0) (= ~front~0 1)), Black: 9504#(and (= ~back~0 ~front~0) (= ~sum~0 0) (<= ~n~0 3) (= |ULTIMATE.start_main_#t~ret11#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9738#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9558#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (<= 1 ~front~0) (<= ~front~0 ~n~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4))))) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= ~front~0 1)))), Black: 9732#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9650#(and (or (< ~back~0 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~back~0 1))) (= ~sum~0 0) (<= ~front~0 ~back~0)), Black: 9602#(and (<= 0 ~sum~0) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9624#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9672#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9506#(and (= ~back~0 ~front~0) (= ~sum~0 0) (<= ~n~0 3) (= ~queue~0.offset 0) (= |ULTIMATE.start_main_#t~ret11#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9584#(and (<= 0 ~sum~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= ~sum~0 1)), Black: 9670#(and (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (or (and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (= (select (select |#memory_int| ~queue~0.base) 0) 1)) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9514#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)), Black: 9644#(and (or (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1)))), Black: 9660#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9664#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))))), Black: 9680#(and (<= 0 ~sum~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9750#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9592#(and (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 9560#(and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (<= 2 ~back~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) 8) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) 8)))) (= ~sum~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (= ~queue~0.offset 0) (<= 1 ~n~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~front~0 1)), Black: 9498#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (<= ~n~0 3) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9712#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9546#(and (<= 0 ~sum~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (<= ~sum~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))))), Black: 9720#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9516#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= ~sum~0 1)), 134#true, Black: 9656#(and (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (or (and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (= (select (select |#memory_int| ~queue~0.base) 0) 1)) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9530#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= ~front~0 1))) (<= 1 ~front~0) (<= ~front~0 ~n~0) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= ~front~0 1)))), 998#true, Black: 9632#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 6607#true, Black: 9520#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (<= 1 ~front~0) (<= ~front~0 ~n~0) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0)), Black: 9512#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= ~sum~0 1)), Black: 9636#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), 9880#true, Black: 9730#(and (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1)), Black: 9604#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 2176#(and (<= (+ ~back~0 1) ~n~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= ~n~0 1) (<= 0 ~back~0) (<= (+ ~front~0 1) ~back~0)), Black: 9554#(and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (<= 2 ~back~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) 8) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) 8)))) (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (= ~queue~0.offset 0) (<= 1 ~n~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~front~0 1)), Black: 2151#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~front~0 ~back~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 139#(= ~sum~0 0), Black: 2184#(and (<= (+ ~front~0 1) 0) (<= ~n~0 1) (<= (+ ~front~0 1) ~back~0)), Black: 9490#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 3) (= ~back~0 ~front~0) (= ~sum~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9752#(and (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9748#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9606#(and (<= 0 ~sum~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9610#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 2180#(and (<= (+ ~back~0 1) ~n~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~n~0 1) (<= 0 ~back~0) (<= (+ ~front~0 1) ~back~0)), Black: 2190#(and (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)))) (and (<= (+ ~back~0 1) ~n~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= 0 ~back~0))) (or (and (<= (+ ~back~0 1) ~n~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 ~back~0)) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1))))) (<= (+ ~front~0 1) 0) (<= ~n~0 1) (<= (+ ~front~0 1) ~back~0)), Black: 152#(<= ~back~0 ~front~0), Black: 2188#(and (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)))) (and (<= (+ ~back~0 1) ~n~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= 0 ~back~0))) (<= (+ ~front~0 1) 0) (<= ~n~0 1) (<= (+ ~front~0 1) ~back~0)), 4645#true, Black: 164#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 9390#(or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)), 175#true, Black: 6091#(and (<= 0 ~sum~0) (<= ~sum~0 1)), Black: 6550#(and (<= 0 ~sum~0) (or (= ~back~0 0) (not (= ~front~0 0))) (<= ~sum~0 1)), 2206#(<= ~front~0 ~back~0), Black: 932#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 6548#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (= ~n~0 (+ ~front~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~sum~0 0) (or (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~front~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 926#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 956#(and (<= 0 ~sum~0) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| Int)) (or (< |#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| 1)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8|) 0)))) (and (= ~back~0 0) (= ~sum~0 0)) (not (= ~front~0 0))) (<= ~sum~0 1)), Black: 192#(and (<= 0 ~sum~0) (<= ~sum~0 1)), Black: 930#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 952#(and (or (< ~n~0 (+ ~front~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (< ~front~0 0)) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (or (< ~n~0 (+ ~front~0 1)) (and (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 2))) (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (< 0 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1))))) (< ~front~0 0)) (or (and (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)) (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) ~sum~0 1)))) (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) ~sum~0) 2)))) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (= ~sum~0 1) (or (< ~n~0 (+ ~front~0 1)) (and (forall ((v_ArrVal_69 (Array Int Int))) (or (< 0 (+ ~sum~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))) (forall ((v_ArrVal_69 (Array Int Int))) (or (< (+ ~sum~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 2) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (< ~front~0 0)) (or (< ~n~0 (+ ~front~0 1)) (and (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 2))) (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (< 0 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (< ~front~0 0)) (or (and (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_main_#t~ret11#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_main_#t~ret11#1.offset|)) 1)) (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_main_#t~ret11#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_main_#t~ret11#1.offset|))) 2))) (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_main_#t~ret11#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_main_#t~ret11#1.offset|)) 1)) (< 0 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_main_#t~ret11#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_main_#t~ret11#1.offset|)) 1))))) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (or (and (= ~back~0 0) (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| Int)) (or (< |#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| 1)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8|) 0)))) (not (= ~front~0 0))) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| Int)) (or (< |#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| 1)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8|) 0)))) (< ~n~0 (+ ~front~0 1)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0)))), 5619#true, Black: 5536#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 2) (<= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 5558#(and (or (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (= ~sum~0 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (= ~n~0 (+ ~front~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 827#(or (and (= ~back~0 0) (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| Int)) (or (< |#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| 1)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8|) 0)))) (not (= ~front~0 0))), Black: 5568#(and (<= 0 ~sum~0) (or (< ~back~0 0) (= ~back~0 0) (not (= ~front~0 0))) (<= ~sum~0 1)), Black: 5538#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 995#(= |thread2Thread1of1ForFork1_~b~0#1| 1), Black: 3821#(and (<= ~front~0 ~back~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1))) (<= ~n~0 1)), Black: 5532#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 17#L52true, Black: 5113#(and (<= 0 ~sum~0) (<= ~sum~0 1))]) [2023-11-10 12:42:01,633 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2023-11-10 12:42:01,633 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-10 12:42:01,633 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-10 12:42:01,633 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-10 12:42:02,056 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([434] L68-->L71: Formula: (and (not (= (ite (= (+ (select (select |v_#memory_int_40| v_~queue~0.base_32) (+ (* 4 v_~back~0_60) v_~queue~0.offset_32)) 1) 0) 1 0) 0)) (= (+ v_~back~0_60 1) v_~back~0_59)) InVars {~back~0=v_~back~0_60, #memory_int=|v_#memory_int_40|, ~queue~0.offset=v_~queue~0.offset_32, ~queue~0.base=v_~queue~0.base_32} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~queue~0.offset=v_~queue~0.offset_32, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, ~back~0=v_~back~0_59, #memory_int=|v_#memory_int_40|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~queue~0.base=v_~queue~0.base_32} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, ~back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1][391], [3827#(<= ~front~0 ~back~0), Black: 7563#(<= ~back~0 ~front~0), 1363#(and (<= |thread2Thread1of1ForFork1_~b~0#1| (* (div |thread2Thread1of1ForFork1_~b~0#1| 256) 256)) (<= 0 (div |thread2Thread1of1ForFork1_~b~0#1| 256))), Black: 7564#(<= ~back~0 (+ ~front~0 1)), Black: 7565#(<= ~back~0 (+ 2 ~front~0)), 7561#true, Black: 9618#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))), Black: 9580#(and (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (or (and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (= (select (select |#memory_int| ~queue~0.base) 0) 1)) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9688#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9596#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9666#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 4605#(and (or (= ~back~0 ~front~0) (< ~n~0 (+ ~front~0 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (< ~front~0 0)) (<= ~front~0 ~back~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0)) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~front~0 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (< ~front~0 0))), Black: 9566#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 9724#(and (or (< ~back~0 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~back~0 1))) (= ~sum~0 0) (<= ~front~0 ~back~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4634#(and (<= ~front~0 ~back~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0)) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~front~0 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (< ~front~0 0))), Black: 9742#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4632#(and (<= ~front~0 ~back~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9544#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9574#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 9704#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1)), Black: 9612#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1)))), Black: 9608#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0))), Black: 9642#(and (or (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))), Black: 9548#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~sum~0 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))), 108#L71true, Black: 9638#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9734#(and (or (< ~back~0 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~back~0 1))) (= ~sum~0 0) (<= ~front~0 ~back~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9736#(and (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (= ~sum~0 0) (<= ~front~0 ~back~0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9534#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (<= ~sum~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))))), Black: 9684#(and (<= 0 ~sum~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9678#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9740#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9722#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9576#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9746#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~sum~0 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9562#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= ~front~0 1))) (<= 1 ~front~0) (<= ~front~0 ~n~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4))))) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= ~front~0 1)))), Black: 9694#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))))), Black: 9586#(and (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 9690#(and (<= 0 ~sum~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9714#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9708#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9536#(and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (<= 2 ~back~0) (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (= ~queue~0.offset 0) (<= 1 ~n~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~front~0 1)), Black: 9726#(and (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (= ~sum~0 0) (<= ~front~0 ~back~0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9676#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9710#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9550#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0))), Black: 9662#(and (or (< ~back~0 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~back~0 1))) (= ~sum~0 0) (<= ~front~0 ~back~0) (or (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))), Black: 9532#(and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (<= 2 ~back~0) (= ~sum~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (= ~queue~0.offset 0) (<= 1 ~n~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~front~0 1)), Black: 9718#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8468#(and (= ~sum~0 0) (<= ~front~0 ~back~0)), Black: 9634#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9494#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 3) (= ~back~0 ~front~0) (= ~sum~0 0) (<= ~n~0 3) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9528#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (<= ~sum~0 1)), Black: 9698#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9700#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)), Black: 9652#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))))), Black: 9640#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9616#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9754#(and (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9486#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9568#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0)) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1)))), Black: 1082#(<= ~back~0 ~front~0), Black: 1263#(<= ~back~0 (+ ~front~0 1)), Black: 9614#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= ~sum~0 1)), Black: 9594#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9654#(and (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (= ~sum~0 0) (<= ~front~0 ~back~0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0))), Black: 9674#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9588#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9600#(and (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 9556#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 1362#(not (= (* (div |thread2Thread1of1ForFork1_~b~0#1| 256) 256) |thread2Thread1of1ForFork1_~b~0#1|)), Black: 9524#(and (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)), Black: 9526#(and (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (< ~n~0 (+ ~back~0 2)) (< ~front~0 0)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9630#(and (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (or (and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (= (select (select |#memory_int| ~queue~0.base) 0) 1)) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9540#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (<= 1 ~front~0) (<= ~front~0 ~n~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4))))) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0)), Black: 9628#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9578#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 9648#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= ~sum~0 1)), Black: 9598#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9564#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 9496#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (<= ~n~0 3) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9626#(and (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (or (and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (= (select (select |#memory_int| ~queue~0.base) 0) 1)) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9658#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9582#(and (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (or (and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (= (select (select |#memory_int| ~queue~0.base) 0) 1)) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9646#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9686#(and (<= 0 ~sum~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9692#(and (or (< ~back~0 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~back~0 1))) (or (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (= ~sum~0 0) (<= ~front~0 ~back~0) (or (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))), Black: 9682#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9622#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0))), Black: 9696#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9716#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9492#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 3) (= ~back~0 ~front~0) (= ~sum~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9728#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9706#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9744#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9620#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9668#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9522#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (<= 1 ~front~0) (<= ~front~0 ~n~0) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= ~front~0 1)))), Black: 9542#(and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (<= 2 ~back~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) 8) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) 8)))) (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (= ~queue~0.offset 0) (<= 1 ~n~0) (= ~front~0 1)), Black: 9504#(and (= ~back~0 ~front~0) (= ~sum~0 0) (<= ~n~0 3) (= |ULTIMATE.start_main_#t~ret11#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9738#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9558#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (<= 1 ~front~0) (<= ~front~0 ~n~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4))))) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= ~front~0 1)))), Black: 9732#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9650#(and (or (< ~back~0 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~back~0 1))) (= ~sum~0 0) (<= ~front~0 ~back~0)), Black: 9602#(and (<= 0 ~sum~0) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9624#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9672#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9506#(and (= ~back~0 ~front~0) (= ~sum~0 0) (<= ~n~0 3) (= ~queue~0.offset 0) (= |ULTIMATE.start_main_#t~ret11#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9584#(and (<= 0 ~sum~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= ~sum~0 1)), Black: 9670#(and (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (or (and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (= (select (select |#memory_int| ~queue~0.base) 0) 1)) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9514#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)), Black: 9644#(and (or (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1)))), Black: 9660#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9664#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))))), Black: 9680#(and (<= 0 ~sum~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9750#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9592#(and (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 9560#(and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (<= 2 ~back~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) 8) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) 8)))) (= ~sum~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (= ~queue~0.offset 0) (<= 1 ~n~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~front~0 1)), Black: 9498#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (<= ~n~0 3) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9712#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9546#(and (<= 0 ~sum~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (<= ~sum~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))))), Black: 9720#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9516#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= ~sum~0 1)), 134#true, Black: 9656#(and (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (or (and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (= (select (select |#memory_int| ~queue~0.base) 0) 1)) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9530#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= ~front~0 1))) (<= 1 ~front~0) (<= ~front~0 ~n~0) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= ~front~0 1)))), Black: 9632#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 998#true, 6607#true, Black: 9520#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (<= 1 ~front~0) (<= ~front~0 ~n~0) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0)), Black: 9512#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= ~sum~0 1)), 9880#true, Black: 9636#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9730#(and (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1)), Black: 2176#(and (<= (+ ~back~0 1) ~n~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= ~n~0 1) (<= 0 ~back~0) (<= (+ ~front~0 1) ~back~0)), Black: 9604#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 9554#(and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (<= 2 ~back~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) 8) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) 8)))) (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (= ~queue~0.offset 0) (<= 1 ~n~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~front~0 1)), Black: 2151#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~front~0 ~back~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 2184#(and (<= (+ ~front~0 1) 0) (<= ~n~0 1) (<= (+ ~front~0 1) ~back~0)), Black: 9490#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 3) (= ~back~0 ~front~0) (= ~sum~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 139#(= ~sum~0 0), Black: 9752#(and (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9748#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9606#(and (<= 0 ~sum~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9610#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 2180#(and (<= (+ ~back~0 1) ~n~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~n~0 1) (<= 0 ~back~0) (<= (+ ~front~0 1) ~back~0)), Black: 2190#(and (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)))) (and (<= (+ ~back~0 1) ~n~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= 0 ~back~0))) (or (and (<= (+ ~back~0 1) ~n~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 ~back~0)) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1))))) (<= (+ ~front~0 1) 0) (<= ~n~0 1) (<= (+ ~front~0 1) ~back~0)), Black: 2188#(and (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)))) (and (<= (+ ~back~0 1) ~n~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= 0 ~back~0))) (<= (+ ~front~0 1) 0) (<= ~n~0 1) (<= (+ ~front~0 1) ~back~0)), Black: 152#(<= ~back~0 ~front~0), 4645#true, Black: 164#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 9390#(or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)), 175#true, Black: 6091#(and (<= 0 ~sum~0) (<= ~sum~0 1)), Black: 6550#(and (<= 0 ~sum~0) (or (= ~back~0 0) (not (= ~front~0 0))) (<= ~sum~0 1)), 2206#(<= ~front~0 ~back~0), Black: 932#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 6548#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (= ~n~0 (+ ~front~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~sum~0 0) (or (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~front~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 926#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 956#(and (<= 0 ~sum~0) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| Int)) (or (< |#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| 1)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8|) 0)))) (and (= ~back~0 0) (= ~sum~0 0)) (not (= ~front~0 0))) (<= ~sum~0 1)), Black: 192#(and (<= 0 ~sum~0) (<= ~sum~0 1)), Black: 930#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 952#(and (or (< ~n~0 (+ ~front~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (< ~front~0 0)) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (or (< ~n~0 (+ ~front~0 1)) (and (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 2))) (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (< 0 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1))))) (< ~front~0 0)) (or (and (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)) (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) ~sum~0 1)))) (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) ~sum~0) 2)))) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (= ~sum~0 1) (or (< ~n~0 (+ ~front~0 1)) (and (forall ((v_ArrVal_69 (Array Int Int))) (or (< 0 (+ ~sum~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))) (forall ((v_ArrVal_69 (Array Int Int))) (or (< (+ ~sum~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 2) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (< ~front~0 0)) (or (< ~n~0 (+ ~front~0 1)) (and (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 2))) (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (< 0 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (< ~front~0 0)) (or (and (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_main_#t~ret11#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_main_#t~ret11#1.offset|)) 1)) (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_main_#t~ret11#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_main_#t~ret11#1.offset|))) 2))) (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_main_#t~ret11#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_main_#t~ret11#1.offset|)) 1)) (< 0 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_main_#t~ret11#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_main_#t~ret11#1.offset|)) 1))))) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (or (and (= ~back~0 0) (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| Int)) (or (< |#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| 1)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8|) 0)))) (not (= ~front~0 0))) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| Int)) (or (< |#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| 1)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8|) 0)))) (< ~n~0 (+ ~front~0 1)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0)))), 5619#true, Black: 5536#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 2) (<= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 5558#(and (or (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (= ~sum~0 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (= ~n~0 (+ ~front~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 827#(or (and (= ~back~0 0) (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| Int)) (or (< |#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| 1)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8|) 0)))) (not (= ~front~0 0))), Black: 5568#(and (<= 0 ~sum~0) (or (< ~back~0 0) (= ~back~0 0) (not (= ~front~0 0))) (<= ~sum~0 1)), 23#L90-1true, Black: 5538#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 995#(= |thread2Thread1of1ForFork1_~b~0#1| 1), Black: 3821#(and (<= ~front~0 ~back~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1))) (<= ~n~0 1)), Black: 5532#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 17#L52true, Black: 5113#(and (<= 0 ~sum~0) (<= ~sum~0 1))]) [2023-11-10 12:42:02,056 INFO L294 olderBase$Statistics]: this new event has 174 ancestors and is cut-off event [2023-11-10 12:42:02,056 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-10 12:42:02,056 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-10 12:42:02,056 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-10 12:42:02,829 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([434] L68-->L71: Formula: (and (not (= (ite (= (+ (select (select |v_#memory_int_40| v_~queue~0.base_32) (+ (* 4 v_~back~0_60) v_~queue~0.offset_32)) 1) 0) 1 0) 0)) (= (+ v_~back~0_60 1) v_~back~0_59)) InVars {~back~0=v_~back~0_60, #memory_int=|v_#memory_int_40|, ~queue~0.offset=v_~queue~0.offset_32, ~queue~0.base=v_~queue~0.base_32} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~queue~0.offset=v_~queue~0.offset_32, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, ~back~0=v_~back~0_59, #memory_int=|v_#memory_int_40|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~queue~0.base=v_~queue~0.base_32} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, ~back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1][391], [3827#(<= ~front~0 ~back~0), Black: 7563#(<= ~back~0 ~front~0), 1363#(and (<= |thread2Thread1of1ForFork1_~b~0#1| (* (div |thread2Thread1of1ForFork1_~b~0#1| 256) 256)) (<= 0 (div |thread2Thread1of1ForFork1_~b~0#1| 256))), Black: 7564#(<= ~back~0 (+ ~front~0 1)), Black: 7565#(<= ~back~0 (+ 2 ~front~0)), 7561#true, Black: 9618#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))), Black: 9580#(and (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (or (and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (= (select (select |#memory_int| ~queue~0.base) 0) 1)) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9688#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9596#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9666#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 4605#(and (or (= ~back~0 ~front~0) (< ~n~0 (+ ~front~0 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (< ~front~0 0)) (<= ~front~0 ~back~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0)) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~front~0 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (< ~front~0 0))), Black: 9566#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 9724#(and (or (< ~back~0 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~back~0 1))) (= ~sum~0 0) (<= ~front~0 ~back~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4634#(and (<= ~front~0 ~back~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0)) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~front~0 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (< ~front~0 0))), Black: 9742#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4632#(and (<= ~front~0 ~back~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9544#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9574#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 9704#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1)), Black: 9612#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1)))), Black: 9608#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0))), Black: 9642#(and (or (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))), Black: 9548#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~sum~0 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))), 108#L71true, Black: 9638#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9734#(and (or (< ~back~0 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~back~0 1))) (= ~sum~0 0) (<= ~front~0 ~back~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9736#(and (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (= ~sum~0 0) (<= ~front~0 ~back~0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9534#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (<= ~sum~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))))), Black: 9684#(and (<= 0 ~sum~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9678#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9740#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9722#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 27#L90-2true, Black: 9576#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9746#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~sum~0 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9562#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= ~front~0 1))) (<= 1 ~front~0) (<= ~front~0 ~n~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4))))) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= ~front~0 1)))), Black: 9694#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))))), Black: 9586#(and (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 9690#(and (<= 0 ~sum~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9714#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9708#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9536#(and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (<= 2 ~back~0) (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (= ~queue~0.offset 0) (<= 1 ~n~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~front~0 1)), Black: 9726#(and (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (= ~sum~0 0) (<= ~front~0 ~back~0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9676#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9710#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9550#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0))), Black: 9662#(and (or (< ~back~0 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~back~0 1))) (= ~sum~0 0) (<= ~front~0 ~back~0) (or (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))), Black: 9532#(and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (<= 2 ~back~0) (= ~sum~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (= ~queue~0.offset 0) (<= 1 ~n~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~front~0 1)), Black: 9718#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8468#(and (= ~sum~0 0) (<= ~front~0 ~back~0)), Black: 9634#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9494#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 3) (= ~back~0 ~front~0) (= ~sum~0 0) (<= ~n~0 3) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9528#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (<= ~sum~0 1)), Black: 9698#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9700#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)), Black: 9652#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))))), Black: 9640#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9616#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9754#(and (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9486#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9568#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0)) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1)))), Black: 1082#(<= ~back~0 ~front~0), Black: 1263#(<= ~back~0 (+ ~front~0 1)), Black: 9614#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= ~sum~0 1)), Black: 9594#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9654#(and (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (= ~sum~0 0) (<= ~front~0 ~back~0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0))), Black: 9674#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9588#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9600#(and (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 9556#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 1362#(not (= (* (div |thread2Thread1of1ForFork1_~b~0#1| 256) 256) |thread2Thread1of1ForFork1_~b~0#1|)), Black: 9524#(and (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)), Black: 9526#(and (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (< ~n~0 (+ ~back~0 2)) (< ~front~0 0)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9630#(and (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (or (and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (= (select (select |#memory_int| ~queue~0.base) 0) 1)) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9540#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (<= 1 ~front~0) (<= ~front~0 ~n~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4))))) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0)), Black: 9628#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9578#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 9648#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= ~sum~0 1)), Black: 9598#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9564#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 9496#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (<= ~n~0 3) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9626#(and (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (or (and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (= (select (select |#memory_int| ~queue~0.base) 0) 1)) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9658#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9582#(and (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (or (and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (= (select (select |#memory_int| ~queue~0.base) 0) 1)) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9646#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9686#(and (<= 0 ~sum~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9692#(and (or (< ~back~0 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~back~0 1))) (or (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (= ~sum~0 0) (<= ~front~0 ~back~0) (or (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))), Black: 9682#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9622#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0))), Black: 9696#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9716#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9492#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 3) (= ~back~0 ~front~0) (= ~sum~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9728#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9706#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9744#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9620#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9668#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9522#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (<= 1 ~front~0) (<= ~front~0 ~n~0) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= ~front~0 1)))), Black: 9542#(and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (<= 2 ~back~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) 8) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) 8)))) (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (= ~queue~0.offset 0) (<= 1 ~n~0) (= ~front~0 1)), Black: 9504#(and (= ~back~0 ~front~0) (= ~sum~0 0) (<= ~n~0 3) (= |ULTIMATE.start_main_#t~ret11#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9738#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9558#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (<= 1 ~front~0) (<= ~front~0 ~n~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4))))) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= ~front~0 1)))), Black: 9732#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9650#(and (or (< ~back~0 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~back~0 1))) (= ~sum~0 0) (<= ~front~0 ~back~0)), Black: 9602#(and (<= 0 ~sum~0) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9624#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9672#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9506#(and (= ~back~0 ~front~0) (= ~sum~0 0) (<= ~n~0 3) (= ~queue~0.offset 0) (= |ULTIMATE.start_main_#t~ret11#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9584#(and (<= 0 ~sum~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= ~sum~0 1)), Black: 9670#(and (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (or (and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (= (select (select |#memory_int| ~queue~0.base) 0) 1)) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9514#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)), Black: 9644#(and (or (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1)))), Black: 9660#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9664#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))))), Black: 9680#(and (<= 0 ~sum~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9750#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9592#(and (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 9560#(and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (<= 2 ~back~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) 8) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) 8)))) (= ~sum~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (= ~queue~0.offset 0) (<= 1 ~n~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~front~0 1)), Black: 9498#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (<= ~n~0 3) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9712#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9546#(and (<= 0 ~sum~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (<= ~sum~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))))), Black: 9720#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9516#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= ~sum~0 1)), 134#true, Black: 9656#(and (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (or (and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (= (select (select |#memory_int| ~queue~0.base) 0) 1)) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9530#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= ~front~0 1))) (<= 1 ~front~0) (<= ~front~0 ~n~0) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= ~front~0 1)))), 6607#true, Black: 9632#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 998#true, Black: 9520#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (<= 1 ~front~0) (<= ~front~0 ~n~0) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0)), Black: 9512#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= ~sum~0 1)), 9880#true, Black: 9636#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9730#(and (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1)), Black: 2176#(and (<= (+ ~back~0 1) ~n~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= ~n~0 1) (<= 0 ~back~0) (<= (+ ~front~0 1) ~back~0)), Black: 9604#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 9554#(and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (<= 2 ~back~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) 8) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) 8)))) (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (= ~queue~0.offset 0) (<= 1 ~n~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~front~0 1)), Black: 2151#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~front~0 ~back~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 2184#(and (<= (+ ~front~0 1) 0) (<= ~n~0 1) (<= (+ ~front~0 1) ~back~0)), Black: 9490#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 3) (= ~back~0 ~front~0) (= ~sum~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 139#(= ~sum~0 0), Black: 9752#(and (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9748#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9606#(and (<= 0 ~sum~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9610#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 2180#(and (<= (+ ~back~0 1) ~n~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~n~0 1) (<= 0 ~back~0) (<= (+ ~front~0 1) ~back~0)), Black: 2190#(and (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)))) (and (<= (+ ~back~0 1) ~n~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= 0 ~back~0))) (or (and (<= (+ ~back~0 1) ~n~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 ~back~0)) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1))))) (<= (+ ~front~0 1) 0) (<= ~n~0 1) (<= (+ ~front~0 1) ~back~0)), Black: 2188#(and (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)))) (and (<= (+ ~back~0 1) ~n~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= 0 ~back~0))) (<= (+ ~front~0 1) 0) (<= ~n~0 1) (<= (+ ~front~0 1) ~back~0)), Black: 152#(<= ~back~0 ~front~0), 4645#true, Black: 164#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 9390#(or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)), 175#true, Black: 6091#(and (<= 0 ~sum~0) (<= ~sum~0 1)), Black: 6550#(and (<= 0 ~sum~0) (or (= ~back~0 0) (not (= ~front~0 0))) (<= ~sum~0 1)), 2206#(<= ~front~0 ~back~0), Black: 932#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 6548#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (= ~n~0 (+ ~front~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~sum~0 0) (or (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~front~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 926#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 956#(and (<= 0 ~sum~0) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| Int)) (or (< |#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| 1)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8|) 0)))) (and (= ~back~0 0) (= ~sum~0 0)) (not (= ~front~0 0))) (<= ~sum~0 1)), Black: 192#(and (<= 0 ~sum~0) (<= ~sum~0 1)), Black: 930#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 952#(and (or (< ~n~0 (+ ~front~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (< ~front~0 0)) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (or (< ~n~0 (+ ~front~0 1)) (and (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 2))) (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (< 0 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1))))) (< ~front~0 0)) (or (and (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)) (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) ~sum~0 1)))) (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) ~sum~0) 2)))) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (= ~sum~0 1) (or (< ~n~0 (+ ~front~0 1)) (and (forall ((v_ArrVal_69 (Array Int Int))) (or (< 0 (+ ~sum~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))) (forall ((v_ArrVal_69 (Array Int Int))) (or (< (+ ~sum~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 2) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (< ~front~0 0)) (or (< ~n~0 (+ ~front~0 1)) (and (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 2))) (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (< 0 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (< ~front~0 0)) (or (and (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_main_#t~ret11#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_main_#t~ret11#1.offset|)) 1)) (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_main_#t~ret11#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_main_#t~ret11#1.offset|))) 2))) (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_main_#t~ret11#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_main_#t~ret11#1.offset|)) 1)) (< 0 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_main_#t~ret11#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_main_#t~ret11#1.offset|)) 1))))) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (or (and (= ~back~0 0) (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| Int)) (or (< |#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| 1)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8|) 0)))) (not (= ~front~0 0))) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| Int)) (or (< |#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| 1)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8|) 0)))) (< ~n~0 (+ ~front~0 1)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0)))), 5619#true, Black: 5536#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 2) (<= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 5558#(and (or (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (= ~sum~0 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (= ~n~0 (+ ~front~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 827#(or (and (= ~back~0 0) (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| Int)) (or (< |#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| 1)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8|) 0)))) (not (= ~front~0 0))), Black: 5568#(and (<= 0 ~sum~0) (or (< ~back~0 0) (= ~back~0 0) (not (= ~front~0 0))) (<= ~sum~0 1)), Black: 5538#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 995#(= |thread2Thread1of1ForFork1_~b~0#1| 1), Black: 3821#(and (<= ~front~0 ~back~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1))) (<= ~n~0 1)), Black: 5532#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 5113#(and (<= 0 ~sum~0) (<= ~sum~0 1))]) [2023-11-10 12:42:02,830 INFO L294 olderBase$Statistics]: this new event has 180 ancestors and is cut-off event [2023-11-10 12:42:02,830 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-10 12:42:02,830 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2023-11-10 12:42:02,830 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-10 12:42:03,055 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([434] L68-->L71: Formula: (and (not (= (ite (= (+ (select (select |v_#memory_int_40| v_~queue~0.base_32) (+ (* 4 v_~back~0_60) v_~queue~0.offset_32)) 1) 0) 1 0) 0)) (= (+ v_~back~0_60 1) v_~back~0_59)) InVars {~back~0=v_~back~0_60, #memory_int=|v_#memory_int_40|, ~queue~0.offset=v_~queue~0.offset_32, ~queue~0.base=v_~queue~0.base_32} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~queue~0.offset=v_~queue~0.offset_32, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, ~back~0=v_~back~0_59, #memory_int=|v_#memory_int_40|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~queue~0.base=v_~queue~0.base_32} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, ~back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1][391], [3827#(<= ~front~0 ~back~0), Black: 7563#(<= ~back~0 ~front~0), 1363#(and (<= |thread2Thread1of1ForFork1_~b~0#1| (* (div |thread2Thread1of1ForFork1_~b~0#1| 256) 256)) (<= 0 (div |thread2Thread1of1ForFork1_~b~0#1| 256))), Black: 7564#(<= ~back~0 (+ ~front~0 1)), Black: 7565#(<= ~back~0 (+ 2 ~front~0)), 7561#true, Black: 9618#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))), Black: 9580#(and (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (or (and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (= (select (select |#memory_int| ~queue~0.base) 0) 1)) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9688#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9596#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9666#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 4605#(and (or (= ~back~0 ~front~0) (< ~n~0 (+ ~front~0 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (< ~front~0 0)) (<= ~front~0 ~back~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0)) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~front~0 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (< ~front~0 0))), Black: 9566#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 9724#(and (or (< ~back~0 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~back~0 1))) (= ~sum~0 0) (<= ~front~0 ~back~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4634#(and (<= ~front~0 ~back~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0)) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~front~0 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (< ~front~0 0))), Black: 9742#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4632#(and (<= ~front~0 ~back~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9544#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9574#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 9704#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1)), Black: 9612#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1)))), Black: 9608#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0))), Black: 9642#(and (or (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))), Black: 9548#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~sum~0 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))), 108#L71true, Black: 9638#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9734#(and (or (< ~back~0 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~back~0 1))) (= ~sum~0 0) (<= ~front~0 ~back~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9736#(and (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (= ~sum~0 0) (<= ~front~0 ~back~0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9534#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (<= ~sum~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))))), Black: 9684#(and (<= 0 ~sum~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9678#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9740#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9722#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9576#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9746#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~sum~0 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9562#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= ~front~0 1))) (<= 1 ~front~0) (<= ~front~0 ~n~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4))))) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= ~front~0 1)))), Black: 9694#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))))), Black: 9586#(and (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 9690#(and (<= 0 ~sum~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9714#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9708#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9536#(and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (<= 2 ~back~0) (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (= ~queue~0.offset 0) (<= 1 ~n~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~front~0 1)), Black: 9726#(and (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (= ~sum~0 0) (<= ~front~0 ~back~0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9676#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9710#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9550#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0))), Black: 9662#(and (or (< ~back~0 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~back~0 1))) (= ~sum~0 0) (<= ~front~0 ~back~0) (or (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))), Black: 9532#(and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (<= 2 ~back~0) (= ~sum~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (= ~queue~0.offset 0) (<= 1 ~n~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~front~0 1)), Black: 9718#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8468#(and (= ~sum~0 0) (<= ~front~0 ~back~0)), Black: 9634#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9494#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 3) (= ~back~0 ~front~0) (= ~sum~0 0) (<= ~n~0 3) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9528#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (<= ~sum~0 1)), Black: 9698#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9700#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)), Black: 9652#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))))), Black: 9640#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9616#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9754#(and (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9486#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9568#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0)) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1)))), Black: 1082#(<= ~back~0 ~front~0), Black: 1263#(<= ~back~0 (+ ~front~0 1)), Black: 9614#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= ~sum~0 1)), Black: 9594#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9654#(and (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (= ~sum~0 0) (<= ~front~0 ~back~0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0))), Black: 9674#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9588#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9600#(and (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 9556#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 1362#(not (= (* (div |thread2Thread1of1ForFork1_~b~0#1| 256) 256) |thread2Thread1of1ForFork1_~b~0#1|)), Black: 9524#(and (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)), Black: 9526#(and (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (< ~n~0 (+ ~back~0 2)) (< ~front~0 0)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9630#(and (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (or (and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (= (select (select |#memory_int| ~queue~0.base) 0) 1)) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9540#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (<= 1 ~front~0) (<= ~front~0 ~n~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4))))) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0)), Black: 9628#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9578#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 9648#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= ~sum~0 1)), Black: 9598#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9564#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 9496#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (<= ~n~0 3) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9626#(and (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (or (and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (= (select (select |#memory_int| ~queue~0.base) 0) 1)) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9658#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9582#(and (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (or (and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (= (select (select |#memory_int| ~queue~0.base) 0) 1)) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9646#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9686#(and (<= 0 ~sum~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9692#(and (or (< ~back~0 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~back~0 1))) (or (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (= ~sum~0 0) (<= ~front~0 ~back~0) (or (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))), Black: 9682#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9622#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0))), Black: 9696#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9716#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9492#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 3) (= ~back~0 ~front~0) (= ~sum~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9728#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9706#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9744#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9620#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9668#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9522#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (<= 1 ~front~0) (<= ~front~0 ~n~0) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= ~front~0 1)))), Black: 9542#(and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (<= 2 ~back~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) 8) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) 8)))) (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (= ~queue~0.offset 0) (<= 1 ~n~0) (= ~front~0 1)), Black: 9504#(and (= ~back~0 ~front~0) (= ~sum~0 0) (<= ~n~0 3) (= |ULTIMATE.start_main_#t~ret11#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9738#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9558#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (<= 1 ~front~0) (<= ~front~0 ~n~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4))))) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= ~front~0 1)))), Black: 9732#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9650#(and (or (< ~back~0 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~back~0 1))) (= ~sum~0 0) (<= ~front~0 ~back~0)), Black: 9602#(and (<= 0 ~sum~0) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9624#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9672#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9506#(and (= ~back~0 ~front~0) (= ~sum~0 0) (<= ~n~0 3) (= ~queue~0.offset 0) (= |ULTIMATE.start_main_#t~ret11#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9584#(and (<= 0 ~sum~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= ~sum~0 1)), Black: 9670#(and (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (or (and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (= (select (select |#memory_int| ~queue~0.base) 0) 1)) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9514#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)), Black: 9644#(and (or (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1)))), Black: 9660#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9664#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))))), Black: 9680#(and (<= 0 ~sum~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9750#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9592#(and (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 9560#(and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (<= 2 ~back~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) 8) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) 8)))) (= ~sum~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (= ~queue~0.offset 0) (<= 1 ~n~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~front~0 1)), Black: 9498#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (<= ~n~0 3) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9712#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9546#(and (<= 0 ~sum~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (<= ~sum~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))))), Black: 9720#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9516#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= ~sum~0 1)), 134#true, Black: 9656#(and (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (or (and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (= (select (select |#memory_int| ~queue~0.base) 0) 1)) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9530#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= ~front~0 1))) (<= 1 ~front~0) (<= ~front~0 ~n~0) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= ~front~0 1)))), Black: 9632#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 6607#true, 998#true, Black: 9520#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (<= 1 ~front~0) (<= ~front~0 ~n~0) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0)), Black: 9512#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= ~sum~0 1)), 9880#true, Black: 9636#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9730#(and (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1)), Black: 2176#(and (<= (+ ~back~0 1) ~n~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= ~n~0 1) (<= 0 ~back~0) (<= (+ ~front~0 1) ~back~0)), Black: 9604#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 9554#(and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (<= 2 ~back~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) 8) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) 8)))) (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (= ~queue~0.offset 0) (<= 1 ~n~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~front~0 1)), Black: 2151#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~front~0 ~back~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 2184#(and (<= (+ ~front~0 1) 0) (<= ~n~0 1) (<= (+ ~front~0 1) ~back~0)), Black: 9490#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 3) (= ~back~0 ~front~0) (= ~sum~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 139#(= ~sum~0 0), Black: 9752#(and (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9748#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9606#(and (<= 0 ~sum~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9610#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 2180#(and (<= (+ ~back~0 1) ~n~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~n~0 1) (<= 0 ~back~0) (<= (+ ~front~0 1) ~back~0)), Black: 2190#(and (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)))) (and (<= (+ ~back~0 1) ~n~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= 0 ~back~0))) (or (and (<= (+ ~back~0 1) ~n~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 ~back~0)) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1))))) (<= (+ ~front~0 1) 0) (<= ~n~0 1) (<= (+ ~front~0 1) ~back~0)), Black: 2188#(and (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)))) (and (<= (+ ~back~0 1) ~n~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= 0 ~back~0))) (<= (+ ~front~0 1) 0) (<= ~n~0 1) (<= (+ ~front~0 1) ~back~0)), Black: 152#(<= ~back~0 ~front~0), 4645#true, Black: 164#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 9390#(or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)), 175#true, Black: 6091#(and (<= 0 ~sum~0) (<= ~sum~0 1)), Black: 6550#(and (<= 0 ~sum~0) (or (= ~back~0 0) (not (= ~front~0 0))) (<= ~sum~0 1)), 33#L91-1true, 2206#(<= ~front~0 ~back~0), Black: 932#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 6548#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (= ~n~0 (+ ~front~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~sum~0 0) (or (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~front~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 926#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 956#(and (<= 0 ~sum~0) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| Int)) (or (< |#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| 1)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8|) 0)))) (and (= ~back~0 0) (= ~sum~0 0)) (not (= ~front~0 0))) (<= ~sum~0 1)), Black: 192#(and (<= 0 ~sum~0) (<= ~sum~0 1)), Black: 930#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 952#(and (or (< ~n~0 (+ ~front~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (< ~front~0 0)) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (or (< ~n~0 (+ ~front~0 1)) (and (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 2))) (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (< 0 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1))))) (< ~front~0 0)) (or (and (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)) (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) ~sum~0 1)))) (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) ~sum~0) 2)))) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (= ~sum~0 1) (or (< ~n~0 (+ ~front~0 1)) (and (forall ((v_ArrVal_69 (Array Int Int))) (or (< 0 (+ ~sum~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))) (forall ((v_ArrVal_69 (Array Int Int))) (or (< (+ ~sum~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 2) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (< ~front~0 0)) (or (< ~n~0 (+ ~front~0 1)) (and (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 2))) (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (< 0 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (< ~front~0 0)) (or (and (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_main_#t~ret11#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_main_#t~ret11#1.offset|)) 1)) (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_main_#t~ret11#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_main_#t~ret11#1.offset|))) 2))) (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_main_#t~ret11#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_main_#t~ret11#1.offset|)) 1)) (< 0 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_main_#t~ret11#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_main_#t~ret11#1.offset|)) 1))))) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (or (and (= ~back~0 0) (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| Int)) (or (< |#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| 1)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8|) 0)))) (not (= ~front~0 0))) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| Int)) (or (< |#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| 1)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8|) 0)))) (< ~n~0 (+ ~front~0 1)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0)))), 5619#true, Black: 5536#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 2) (<= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 5558#(and (or (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (= ~sum~0 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (= ~n~0 (+ ~front~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 827#(or (and (= ~back~0 0) (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| Int)) (or (< |#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| 1)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8|) 0)))) (not (= ~front~0 0))), Black: 5568#(and (<= 0 ~sum~0) (or (< ~back~0 0) (= ~back~0 0) (not (= ~front~0 0))) (<= ~sum~0 1)), Black: 5538#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 995#(= |thread2Thread1of1ForFork1_~b~0#1| 1), Black: 3821#(and (<= ~front~0 ~back~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1))) (<= ~n~0 1)), Black: 5532#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 5113#(and (<= 0 ~sum~0) (<= ~sum~0 1))]) [2023-11-10 12:42:03,056 INFO L294 olderBase$Statistics]: this new event has 182 ancestors and is cut-off event [2023-11-10 12:42:03,056 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2023-11-10 12:42:03,056 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-10 12:42:03,056 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2023-11-10 12:42:04,944 INFO L124 PetriNetUnfolderBase]: 3840/21208 cut-off events. [2023-11-10 12:42:04,944 INFO L125 PetriNetUnfolderBase]: For 549662/550282 co-relation queries the response was YES. [2023-11-10 12:42:05,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115791 conditions, 21208 events. 3840/21208 cut-off events. For 549662/550282 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 273625 event pairs, 304 based on Foata normal form. 419/20532 useless extension candidates. Maximal degree in co-relation 115620. Up to 2835 conditions per place. [2023-11-10 12:42:05,209 INFO L140 encePairwiseOnDemand]: 107/135 looper letters, 314 selfloop transitions, 341 changer transitions 147/885 dead transitions. [2023-11-10 12:42:05,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 499 places, 885 transitions, 15511 flow [2023-11-10 12:42:05,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2023-11-10 12:42:05,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2023-11-10 12:42:05,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 5191 transitions. [2023-11-10 12:42:05,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4929724596391263 [2023-11-10 12:42:05,213 INFO L72 ComplementDD]: Start complementDD. Operand 78 states and 5191 transitions. [2023-11-10 12:42:05,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 5191 transitions. [2023-11-10 12:42:05,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:42:05,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 78 states and 5191 transitions. [2023-11-10 12:42:05,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 79 states, 78 states have (on average 66.55128205128206) internal successors, (5191), 78 states have internal predecessors, (5191), 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) [2023-11-10 12:42:05,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 79 states, 79 states have (on average 135.0) internal successors, (10665), 79 states have internal predecessors, (10665), 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) [2023-11-10 12:42:05,224 INFO L81 ComplementDD]: Finished complementDD. Result has 79 states, 79 states have (on average 135.0) internal successors, (10665), 79 states have internal predecessors, (10665), 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) [2023-11-10 12:42:05,224 INFO L175 Difference]: Start difference. First operand has 470 places, 491 transitions, 7595 flow. Second operand 78 states and 5191 transitions. [2023-11-10 12:42:05,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 499 places, 885 transitions, 15511 flow [2023-11-10 12:42:06,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 885 transitions, 13210 flow, removed 1132 selfloop flow, removed 63 redundant places. [2023-11-10 12:42:06,450 INFO L231 Difference]: Finished difference. Result has 466 places, 581 transitions, 9038 flow [2023-11-10 12:42:06,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=6301, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=491, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=253, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=78, PETRI_FLOW=9038, PETRI_PLACES=466, PETRI_TRANSITIONS=581} [2023-11-10 12:42:06,451 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, 346 predicate places. [2023-11-10 12:42:06,451 INFO L495 AbstractCegarLoop]: Abstraction has has 466 places, 581 transitions, 9038 flow [2023-11-10 12:42:06,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 64.29508196721312) internal successors, (3922), 61 states have internal predecessors, (3922), 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) [2023-11-10 12:42:06,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:42:06,452 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:42:06,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-10 12:42:06,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-10 12:42:06,657 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:42:06,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:42:06,658 INFO L85 PathProgramCache]: Analyzing trace with hash 566196177, now seen corresponding path program 11 times [2023-11-10 12:42:06,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:42:06,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564611740] [2023-11-10 12:42:06,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:42:06,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:42:06,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:42:07,937 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:42:07,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:42:07,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564611740] [2023-11-10 12:42:07,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564611740] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:42:07,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510656925] [2023-11-10 12:42:07,938 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-10 12:42:07,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:42:07,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:42:07,939 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 12:42:07,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-10 12:42:08,039 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-11-10 12:42:08,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:42:08,040 INFO L262 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 53 conjunts are in the unsatisfiable core [2023-11-10 12:42:08,042 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:42:09,384 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:42:09,384 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:42:09,942 INFO L322 Elim1Store]: treesize reduction 30, result has 64.7 percent of original size [2023-11-10 12:42:09,943 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 108 treesize of output 84 [2023-11-10 12:42:11,063 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 3 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:42:11,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510656925] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:42:11,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:42:11,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 22] total 66 [2023-11-10 12:42:11,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693366367] [2023-11-10 12:42:11,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:42:11,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2023-11-10 12:42:11,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:42:11,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2023-11-10 12:42:11,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=762, Invalid=3528, Unknown=0, NotChecked=0, Total=4290 [2023-11-10 12:42:11,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 135 [2023-11-10 12:42:11,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 466 places, 581 transitions, 9038 flow. Second operand has 66 states, 66 states have (on average 64.04545454545455) internal successors, (4227), 66 states have internal predecessors, (4227), 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) [2023-11-10 12:42:11,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:42:11,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 135 [2023-11-10 12:42:11,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:42:15,783 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([434] L68-->L71: Formula: (and (not (= (ite (= (+ (select (select |v_#memory_int_40| v_~queue~0.base_32) (+ (* 4 v_~back~0_60) v_~queue~0.offset_32)) 1) 0) 1 0) 0)) (= (+ v_~back~0_60 1) v_~back~0_59)) InVars {~back~0=v_~back~0_60, #memory_int=|v_#memory_int_40|, ~queue~0.offset=v_~queue~0.offset_32, ~queue~0.base=v_~queue~0.base_32} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~queue~0.offset=v_~queue~0.offset_32, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, ~back~0=v_~back~0_59, #memory_int=|v_#memory_int_40|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~queue~0.base=v_~queue~0.base_32} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, ~back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1][349], [3827#(<= ~front~0 ~back~0), 102#L89-4true, Black: 7563#(<= ~back~0 ~front~0), Black: 7564#(<= ~back~0 (+ ~front~0 1)), 1363#(and (<= |thread2Thread1of1ForFork1_~b~0#1| (* (div |thread2Thread1of1ForFork1_~b~0#1| 256) 256)) (<= 0 (div |thread2Thread1of1ForFork1_~b~0#1| 256))), Black: 7565#(<= ~back~0 (+ 2 ~front~0)), 7561#true, Black: 10956#(and (<= 2 ~back~0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~back~0 4) (- 8))) 1) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (- 4) (* ~back~0 4))) 1) 0) (= ~sum~0 1) (<= ~n~0 3) (<= ~back~0 (+ ~n~0 1)) (= ~queue~0.offset 0) (= ~back~0 (+ ~front~0 1))), Black: 9618#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))), Black: 9580#(and (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (or (and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (= (select (select |#memory_int| ~queue~0.base) 0) 1)) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 10988#(and (<= 0 ~sum~0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< (+ ~front~0 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (< ~n~0 (+ 2 ~front~0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= ~sum~0 1) (or (< (+ ~front~0 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ 2 ~front~0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1)))), Black: 10992#(and (= ~sum~0 0) (or (< ~n~0 (+ ~front~0 1)) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1)) (= ~queue~0.offset 0) (or (< (+ ~front~0 1) 0) (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (< ~n~0 (+ 2 ~front~0)) (not (= (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1)))), Black: 11024#(and (<= 2 ~back~0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~back~0 4) (- 8))) 1) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (- 4) (* ~back~0 4))) 1) 0) (= ~sum~0 1) (<= ~n~0 3) (<= ~back~0 (+ ~n~0 1)) (= ~queue~0.offset 0) (= ~back~0 (+ ~front~0 1)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~n~0 ~front~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 11026#(and (= ~sum~0 1) (= ~queue~0.offset 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~n~0 ~front~0) (or (< ~back~0 0) (not (= ~front~0 0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9666#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 4605#(and (or (= ~back~0 ~front~0) (< ~n~0 (+ ~front~0 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (< ~front~0 0)) (<= ~front~0 ~back~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0)) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~front~0 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (< ~front~0 0))), Black: 11002#(and (= ~sum~0 1) (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (or (< ~back~0 0) (not (= ~front~0 0)))), Black: 9566#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 11030#(and (<= 0 ~sum~0) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4634#(and (<= ~front~0 ~back~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0)) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~front~0 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (< ~front~0 0))), Black: 4632#(and (<= ~front~0 ~back~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 11032#(and (= ~sum~0 1) (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9544#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 10424#(and (<= 0 ~sum~0) (<= ~sum~0 1)), Black: 11020#(and (<= 2 ~back~0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~back~0 4) (- 8))) 1) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (- 4) (* ~back~0 4))) 1) 0) (= ~sum~0 1) (<= ~n~0 3) (<= ~back~0 (+ ~n~0 1)) (= ~queue~0.offset 0) (= ~back~0 (+ ~front~0 1)) (<= ~n~0 ~front~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9574#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 10984#(and (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) 0) (<= ~front~0 (+ ~n~0 1)) (= ~sum~0 0) (<= ~n~0 3) (<= 2 ~front~0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 8))) 1) (= ~queue~0.offset 0) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (= ~back~0 (+ ~front~0 1))), Black: 9704#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1)), Black: 11014#(and (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< (+ ~front~0 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (< ~n~0 (+ 2 ~front~0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (or (< (+ ~front~0 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ 2 ~front~0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1)))), Black: 9612#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1)))), Black: 10994#(and (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 0) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1))) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (< ~n~0 (+ 3 ~front~0)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< (+ ~front~0 1) 0) (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ 2 ~front~0))) (= ~sum~0 1)), Black: 9608#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0))), Black: 9642#(and (or (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))), Black: 11004#(and (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< (+ ~front~0 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0)) (< ~n~0 (+ 2 ~front~0))) (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 0) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1))) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< (+ ~front~0 1) 0) (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ 2 ~front~0))) (= ~sum~0 1)), Black: 9548#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~sum~0 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))), Black: 11012#(and (<= 0 ~sum~0) (<= ~sum~0 1) (or (< ~back~0 0) (and (= ~back~0 0) (= ~sum~0 0)) (not (= ~front~0 0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9638#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 11018#(and (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 0) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1))) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< (+ ~front~0 1) 0) (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ 2 ~front~0))) (= ~sum~0 1)), 108#L71true, Black: 11006#(and (<= 1 ~back~0) (= ~back~0 ~front~0) (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (- 4) (* ~back~0 4))) 1) (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (<= ~back~0 ~n~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 11028#(and (<= 0 ~sum~0) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 10496#(or (< (+ ~front~0 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ 2 ~front~0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))), Black: 9534#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (<= ~sum~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))))), Black: 11022#(and (= ~sum~0 1) (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (or (< ~back~0 0) (not (= ~front~0 0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 10958#(and (or (< (+ ~front~0 1) 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (< ~n~0 (+ 2 ~front~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ (* ~back~0 4) 4)) 1))) (= ~sum~0 0) (or (< ~n~0 (+ ~front~0 1)) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1)) (= ~queue~0.offset 0) (or (< (+ ~front~0 1) 0) (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (< ~n~0 (+ 2 ~front~0)) (not (= (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1)))), Black: 9678#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 11034#(and (= ~sum~0 1) (= ~queue~0.offset 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~n~0 ~front~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 10966#(and (<= 0 ~sum~0) (<= ~sum~0 1) (or (< (+ ~front~0 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ 2 ~front~0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1)))), Black: 9576#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 10978#(and (<= 0 ~sum~0) (<= ~sum~0 1) (or (< ~back~0 0) (and (= ~back~0 0) (= ~sum~0 0)) (not (= ~front~0 0)))), Black: 11008#(and (<= 1 ~back~0) (= ~back~0 ~front~0) (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (- 4) (* ~back~0 4))) 1) (= ~queue~0.offset 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~n~0 ~front~0) (<= ~back~0 ~n~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 10986#(and (<= 1 ~back~0) (= ~back~0 ~front~0) (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (- 4) (* ~back~0 4))) 1) (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (<= ~back~0 ~n~0)), Black: 9562#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= ~front~0 1))) (<= 1 ~front~0) (<= ~front~0 ~n~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4))))) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= ~front~0 1)))), Black: 11010#(and (= ~sum~0 1) (= ~queue~0.offset 0) (<= ~n~0 ~front~0)), Black: 9694#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))))), Black: 9586#(and (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 10998#(and (<= 2 ~back~0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~back~0 4) (- 8))) 1) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (- 4) (* ~back~0 4))) 1) 0) (= ~sum~0 1) (<= ~n~0 3) (<= ~back~0 (+ ~n~0 1)) (= ~queue~0.offset 0) (= ~back~0 (+ ~front~0 1)) (<= ~n~0 ~front~0)), Black: 11016#(and (<= 0 ~sum~0) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (< ~back~0 0) (and (= ~back~0 0) (= ~sum~0 0)) (not (= ~front~0 0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 10974#(and (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< (+ ~front~0 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0)) (< ~n~0 (+ 2 ~front~0))) (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 0) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1))) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< (+ ~front~0 1) 0) (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ 2 ~front~0))) (= ~sum~0 1) (or (< ~back~0 ~front~0) (< ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= ~front~0 0)))), Black: 9536#(and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (<= 2 ~back~0) (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (= ~queue~0.offset 0) (<= 1 ~n~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~front~0 1)), Black: 9676#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9550#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0))), Black: 9662#(and (or (< ~back~0 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~back~0 1))) (= ~sum~0 0) (<= ~front~0 ~back~0) (or (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))), Black: 9532#(and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (<= 2 ~back~0) (= ~sum~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (= ~queue~0.offset 0) (<= 1 ~n~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~front~0 1)), Black: 8468#(and (= ~sum~0 0) (<= ~front~0 ~back~0)), Black: 9494#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 3) (= ~back~0 ~front~0) (= ~sum~0 0) (<= ~n~0 3) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9528#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (<= ~sum~0 1)), Black: 9700#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)), Black: 9652#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))))), Black: 9640#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9486#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1082#(<= ~back~0 ~front~0), Black: 9568#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0)) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1)))), Black: 1263#(<= ~back~0 (+ ~front~0 1)), Black: 9614#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= ~sum~0 1)), Black: 9594#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9654#(and (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (= ~sum~0 0) (<= ~front~0 ~back~0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0))), Black: 9588#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9600#(and (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 9556#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 1362#(not (= (* (div |thread2Thread1of1ForFork1_~b~0#1| 256) 256) |thread2Thread1of1ForFork1_~b~0#1|)), Black: 9524#(and (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)), Black: 9526#(and (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (< ~n~0 (+ ~back~0 2)) (< ~front~0 0)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9540#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (<= 1 ~front~0) (<= ~front~0 ~n~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4))))) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0)), Black: 9578#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 9648#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= ~sum~0 1)), Black: 9564#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), 11066#true, Black: 9496#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (<= ~n~0 3) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9582#(and (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (or (and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (= (select (select |#memory_int| ~queue~0.base) 0) 1)) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9646#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9692#(and (or (< ~back~0 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~back~0 1))) (or (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (= ~sum~0 0) (<= ~front~0 ~back~0) (or (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))), Black: 9622#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0))), Black: 9492#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 3) (= ~back~0 ~front~0) (= ~sum~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9668#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9522#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (<= 1 ~front~0) (<= ~front~0 ~n~0) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= ~front~0 1)))), Black: 9542#(and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (<= 2 ~back~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) 8) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) 8)))) (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (= ~queue~0.offset 0) (<= 1 ~n~0) (= ~front~0 1)), Black: 9504#(and (= ~back~0 ~front~0) (= ~sum~0 0) (<= ~n~0 3) (= |ULTIMATE.start_main_#t~ret11#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9558#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (<= 1 ~front~0) (<= ~front~0 ~n~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4))))) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= ~front~0 1)))), Black: 9650#(and (or (< ~back~0 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~back~0 1))) (= ~sum~0 0) (<= ~front~0 ~back~0)), Black: 9602#(and (<= 0 ~sum~0) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9506#(and (= ~back~0 ~front~0) (= ~sum~0 0) (<= ~n~0 3) (= ~queue~0.offset 0) (= |ULTIMATE.start_main_#t~ret11#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9584#(and (<= 0 ~sum~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= ~sum~0 1)), Black: 9514#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)), Black: 9644#(and (or (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1)))), Black: 9664#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))))), Black: 9592#(and (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 9560#(and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (<= 2 ~back~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) 8) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) 8)))) (= ~sum~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (= ~queue~0.offset 0) (<= 1 ~n~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~front~0 1)), Black: 9498#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (<= ~n~0 3) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9546#(and (<= 0 ~sum~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (<= ~sum~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))))), Black: 9516#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= ~sum~0 1)), 134#true, Black: 9530#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= ~front~0 1))) (<= 1 ~front~0) (<= ~front~0 ~n~0) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= ~front~0 1)))), 998#true, 6607#true, Black: 9520#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (<= 1 ~front~0) (<= ~front~0 ~n~0) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0)), Black: 9512#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= ~sum~0 1)), Black: 9636#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), 9880#true, Black: 9730#(and (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1)), Black: 9604#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 2176#(and (<= (+ ~back~0 1) ~n~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= ~n~0 1) (<= 0 ~back~0) (<= (+ ~front~0 1) ~back~0)), Black: 9554#(and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (<= 2 ~back~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) 8) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) 8)))) (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (= ~queue~0.offset 0) (<= 1 ~n~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~front~0 1)), Black: 2151#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~front~0 ~back~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 9490#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 3) (= ~back~0 ~front~0) (= ~sum~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2184#(and (<= (+ ~front~0 1) 0) (<= ~n~0 1) (<= (+ ~front~0 1) ~back~0)), Black: 139#(= ~sum~0 0), Black: 9606#(and (<= 0 ~sum~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9610#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 2180#(and (<= (+ ~back~0 1) ~n~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~n~0 1) (<= 0 ~back~0) (<= (+ ~front~0 1) ~back~0)), Black: 2190#(and (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)))) (and (<= (+ ~back~0 1) ~n~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= 0 ~back~0))) (or (and (<= (+ ~back~0 1) ~n~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 ~back~0)) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1))))) (<= (+ ~front~0 1) 0) (<= ~n~0 1) (<= (+ ~front~0 1) ~back~0)), Black: 2188#(and (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)))) (and (<= (+ ~back~0 1) ~n~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= 0 ~back~0))) (<= (+ ~front~0 1) 0) (<= ~n~0 1) (<= (+ ~front~0 1) ~back~0)), Black: 152#(<= ~back~0 ~front~0), 4645#true, Black: 164#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 9390#(or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)), 175#true, Black: 6091#(and (<= 0 ~sum~0) (<= ~sum~0 1)), Black: 6550#(and (<= 0 ~sum~0) (or (= ~back~0 0) (not (= ~front~0 0))) (<= ~sum~0 1)), 2206#(<= ~front~0 ~back~0), Black: 932#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 926#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 6548#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (= ~n~0 (+ ~front~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~sum~0 0) (or (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~front~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 956#(and (<= 0 ~sum~0) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| Int)) (or (< |#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| 1)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8|) 0)))) (and (= ~back~0 0) (= ~sum~0 0)) (not (= ~front~0 0))) (<= ~sum~0 1)), Black: 192#(and (<= 0 ~sum~0) (<= ~sum~0 1)), Black: 930#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 952#(and (or (< ~n~0 (+ ~front~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (< ~front~0 0)) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (or (< ~n~0 (+ ~front~0 1)) (and (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 2))) (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (< 0 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1))))) (< ~front~0 0)) (or (and (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)) (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) ~sum~0 1)))) (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) ~sum~0) 2)))) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (= ~sum~0 1) (or (< ~n~0 (+ ~front~0 1)) (and (forall ((v_ArrVal_69 (Array Int Int))) (or (< 0 (+ ~sum~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))) (forall ((v_ArrVal_69 (Array Int Int))) (or (< (+ ~sum~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 2) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (< ~front~0 0)) (or (< ~n~0 (+ ~front~0 1)) (and (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 2))) (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (< 0 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (< ~front~0 0)) (or (and (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_main_#t~ret11#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_main_#t~ret11#1.offset|)) 1)) (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_main_#t~ret11#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_main_#t~ret11#1.offset|))) 2))) (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_main_#t~ret11#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_main_#t~ret11#1.offset|)) 1)) (< 0 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_main_#t~ret11#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_main_#t~ret11#1.offset|)) 1))))) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (or (and (= ~back~0 0) (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| Int)) (or (< |#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| 1)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8|) 0)))) (not (= ~front~0 0))) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| Int)) (or (< |#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| 1)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8|) 0)))) (< ~n~0 (+ ~front~0 1)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0)))), 5619#true, Black: 5536#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 2) (<= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 5558#(and (or (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (= ~sum~0 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (= ~n~0 (+ ~front~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 827#(or (and (= ~back~0 0) (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| Int)) (or (< |#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| 1)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8|) 0)))) (not (= ~front~0 0))), Black: 5568#(and (<= 0 ~sum~0) (or (< ~back~0 0) (= ~back~0 0) (not (= ~front~0 0))) (<= ~sum~0 1)), Black: 5538#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 995#(= |thread2Thread1of1ForFork1_~b~0#1| 1), Black: 5532#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 3821#(and (<= ~front~0 ~back~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1))) (<= ~n~0 1)), 17#L52true, Black: 5113#(and (<= 0 ~sum~0) (<= ~sum~0 1))]) [2023-11-10 12:42:15,784 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2023-11-10 12:42:15,784 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-10 12:42:15,784 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-10 12:42:15,784 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-10 12:42:16,241 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([434] L68-->L71: Formula: (and (not (= (ite (= (+ (select (select |v_#memory_int_40| v_~queue~0.base_32) (+ (* 4 v_~back~0_60) v_~queue~0.offset_32)) 1) 0) 1 0) 0)) (= (+ v_~back~0_60 1) v_~back~0_59)) InVars {~back~0=v_~back~0_60, #memory_int=|v_#memory_int_40|, ~queue~0.offset=v_~queue~0.offset_32, ~queue~0.base=v_~queue~0.base_32} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~queue~0.offset=v_~queue~0.offset_32, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, ~back~0=v_~back~0_59, #memory_int=|v_#memory_int_40|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~queue~0.base=v_~queue~0.base_32} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, ~back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1][349], [3827#(<= ~front~0 ~back~0), Black: 7563#(<= ~back~0 ~front~0), 1363#(and (<= |thread2Thread1of1ForFork1_~b~0#1| (* (div |thread2Thread1of1ForFork1_~b~0#1| 256) 256)) (<= 0 (div |thread2Thread1of1ForFork1_~b~0#1| 256))), Black: 7564#(<= ~back~0 (+ ~front~0 1)), Black: 7565#(<= ~back~0 (+ 2 ~front~0)), 7561#true, Black: 10956#(and (<= 2 ~back~0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~back~0 4) (- 8))) 1) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (- 4) (* ~back~0 4))) 1) 0) (= ~sum~0 1) (<= ~n~0 3) (<= ~back~0 (+ ~n~0 1)) (= ~queue~0.offset 0) (= ~back~0 (+ ~front~0 1))), Black: 9618#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))), Black: 9580#(and (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (or (and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (= (select (select |#memory_int| ~queue~0.base) 0) 1)) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 10988#(and (<= 0 ~sum~0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< (+ ~front~0 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (< ~n~0 (+ 2 ~front~0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= ~sum~0 1) (or (< (+ ~front~0 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ 2 ~front~0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1)))), Black: 10992#(and (= ~sum~0 0) (or (< ~n~0 (+ ~front~0 1)) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1)) (= ~queue~0.offset 0) (or (< (+ ~front~0 1) 0) (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (< ~n~0 (+ 2 ~front~0)) (not (= (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1)))), Black: 11024#(and (<= 2 ~back~0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~back~0 4) (- 8))) 1) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (- 4) (* ~back~0 4))) 1) 0) (= ~sum~0 1) (<= ~n~0 3) (<= ~back~0 (+ ~n~0 1)) (= ~queue~0.offset 0) (= ~back~0 (+ ~front~0 1)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~n~0 ~front~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 11026#(and (= ~sum~0 1) (= ~queue~0.offset 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~n~0 ~front~0) (or (< ~back~0 0) (not (= ~front~0 0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9666#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 4605#(and (or (= ~back~0 ~front~0) (< ~n~0 (+ ~front~0 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (< ~front~0 0)) (<= ~front~0 ~back~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0)) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~front~0 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (< ~front~0 0))), Black: 11002#(and (= ~sum~0 1) (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (or (< ~back~0 0) (not (= ~front~0 0)))), Black: 9566#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 11030#(and (<= 0 ~sum~0) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4634#(and (<= ~front~0 ~back~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0)) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~front~0 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (< ~front~0 0))), Black: 11032#(and (= ~sum~0 1) (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4632#(and (<= ~front~0 ~back~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 10424#(and (<= 0 ~sum~0) (<= ~sum~0 1)), Black: 9544#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 11020#(and (<= 2 ~back~0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~back~0 4) (- 8))) 1) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (- 4) (* ~back~0 4))) 1) 0) (= ~sum~0 1) (<= ~n~0 3) (<= ~back~0 (+ ~n~0 1)) (= ~queue~0.offset 0) (= ~back~0 (+ ~front~0 1)) (<= ~n~0 ~front~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9574#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 10984#(and (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) 0) (<= ~front~0 (+ ~n~0 1)) (= ~sum~0 0) (<= ~n~0 3) (<= 2 ~front~0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 8))) 1) (= ~queue~0.offset 0) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (= ~back~0 (+ ~front~0 1))), Black: 9704#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1)), Black: 11014#(and (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< (+ ~front~0 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (< ~n~0 (+ 2 ~front~0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (or (< (+ ~front~0 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ 2 ~front~0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1)))), Black: 9612#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1)))), Black: 10994#(and (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 0) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1))) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (< ~n~0 (+ 3 ~front~0)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< (+ ~front~0 1) 0) (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ 2 ~front~0))) (= ~sum~0 1)), Black: 9608#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0))), Black: 9642#(and (or (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))), Black: 11004#(and (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< (+ ~front~0 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0)) (< ~n~0 (+ 2 ~front~0))) (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 0) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1))) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< (+ ~front~0 1) 0) (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ 2 ~front~0))) (= ~sum~0 1)), Black: 9548#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~sum~0 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))), Black: 11012#(and (<= 0 ~sum~0) (<= ~sum~0 1) (or (< ~back~0 0) (and (= ~back~0 0) (= ~sum~0 0)) (not (= ~front~0 0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 11018#(and (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 0) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1))) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< (+ ~front~0 1) 0) (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ 2 ~front~0))) (= ~sum~0 1)), 108#L71true, Black: 9638#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 11006#(and (<= 1 ~back~0) (= ~back~0 ~front~0) (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (- 4) (* ~back~0 4))) 1) (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (<= ~back~0 ~n~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 11028#(and (<= 0 ~sum~0) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 10496#(or (< (+ ~front~0 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ 2 ~front~0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))), Black: 9534#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (<= ~sum~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))))), Black: 11022#(and (= ~sum~0 1) (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (or (< ~back~0 0) (not (= ~front~0 0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 10958#(and (or (< (+ ~front~0 1) 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (< ~n~0 (+ 2 ~front~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ (* ~back~0 4) 4)) 1))) (= ~sum~0 0) (or (< ~n~0 (+ ~front~0 1)) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1)) (= ~queue~0.offset 0) (or (< (+ ~front~0 1) 0) (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (< ~n~0 (+ 2 ~front~0)) (not (= (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1)))), Black: 9678#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 11034#(and (= ~sum~0 1) (= ~queue~0.offset 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~n~0 ~front~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 10966#(and (<= 0 ~sum~0) (<= ~sum~0 1) (or (< (+ ~front~0 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ 2 ~front~0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1)))), Black: 9576#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 10978#(and (<= 0 ~sum~0) (<= ~sum~0 1) (or (< ~back~0 0) (and (= ~back~0 0) (= ~sum~0 0)) (not (= ~front~0 0)))), Black: 11008#(and (<= 1 ~back~0) (= ~back~0 ~front~0) (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (- 4) (* ~back~0 4))) 1) (= ~queue~0.offset 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~n~0 ~front~0) (<= ~back~0 ~n~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 10986#(and (<= 1 ~back~0) (= ~back~0 ~front~0) (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (- 4) (* ~back~0 4))) 1) (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (<= ~back~0 ~n~0)), Black: 9562#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= ~front~0 1))) (<= 1 ~front~0) (<= ~front~0 ~n~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4))))) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= ~front~0 1)))), Black: 11010#(and (= ~sum~0 1) (= ~queue~0.offset 0) (<= ~n~0 ~front~0)), Black: 9694#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))))), Black: 10998#(and (<= 2 ~back~0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~back~0 4) (- 8))) 1) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (- 4) (* ~back~0 4))) 1) 0) (= ~sum~0 1) (<= ~n~0 3) (<= ~back~0 (+ ~n~0 1)) (= ~queue~0.offset 0) (= ~back~0 (+ ~front~0 1)) (<= ~n~0 ~front~0)), Black: 9586#(and (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 11016#(and (<= 0 ~sum~0) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (< ~back~0 0) (and (= ~back~0 0) (= ~sum~0 0)) (not (= ~front~0 0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 10974#(and (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< (+ ~front~0 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0)) (< ~n~0 (+ 2 ~front~0))) (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 0) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1))) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< (+ ~front~0 1) 0) (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ 2 ~front~0))) (= ~sum~0 1) (or (< ~back~0 ~front~0) (< ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= ~front~0 0)))), Black: 9536#(and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (<= 2 ~back~0) (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (= ~queue~0.offset 0) (<= 1 ~n~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~front~0 1)), Black: 9676#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9550#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0))), Black: 9662#(and (or (< ~back~0 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~back~0 1))) (= ~sum~0 0) (<= ~front~0 ~back~0) (or (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))), Black: 9532#(and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (<= 2 ~back~0) (= ~sum~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (= ~queue~0.offset 0) (<= 1 ~n~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~front~0 1)), Black: 8468#(and (= ~sum~0 0) (<= ~front~0 ~back~0)), Black: 9494#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 3) (= ~back~0 ~front~0) (= ~sum~0 0) (<= ~n~0 3) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9528#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (<= ~sum~0 1)), Black: 9700#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)), Black: 9652#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))))), Black: 9640#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9486#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1082#(<= ~back~0 ~front~0), Black: 9568#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0)) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1)))), Black: 9614#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= ~sum~0 1)), Black: 1263#(<= ~back~0 (+ ~front~0 1)), Black: 9594#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9654#(and (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (= ~sum~0 0) (<= ~front~0 ~back~0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0))), Black: 9588#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9600#(and (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 9556#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 1362#(not (= (* (div |thread2Thread1of1ForFork1_~b~0#1| 256) 256) |thread2Thread1of1ForFork1_~b~0#1|)), Black: 9524#(and (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)), Black: 9526#(and (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (< ~n~0 (+ ~back~0 2)) (< ~front~0 0)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9540#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (<= 1 ~front~0) (<= ~front~0 ~n~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4))))) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0)), Black: 9578#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 9648#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= ~sum~0 1)), 11066#true, Black: 9564#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 9496#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (<= ~n~0 3) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9582#(and (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (or (and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (= (select (select |#memory_int| ~queue~0.base) 0) 1)) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9646#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9692#(and (or (< ~back~0 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~back~0 1))) (or (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (= ~sum~0 0) (<= ~front~0 ~back~0) (or (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))), Black: 9622#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0))), Black: 9492#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 3) (= ~back~0 ~front~0) (= ~sum~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9668#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9522#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (<= 1 ~front~0) (<= ~front~0 ~n~0) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= ~front~0 1)))), Black: 9542#(and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (<= 2 ~back~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) 8) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) 8)))) (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (= ~queue~0.offset 0) (<= 1 ~n~0) (= ~front~0 1)), Black: 9504#(and (= ~back~0 ~front~0) (= ~sum~0 0) (<= ~n~0 3) (= |ULTIMATE.start_main_#t~ret11#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9558#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (<= 1 ~front~0) (<= ~front~0 ~n~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4))))) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= ~front~0 1)))), Black: 9650#(and (or (< ~back~0 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~back~0 1))) (= ~sum~0 0) (<= ~front~0 ~back~0)), Black: 9602#(and (<= 0 ~sum~0) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9506#(and (= ~back~0 ~front~0) (= ~sum~0 0) (<= ~n~0 3) (= ~queue~0.offset 0) (= |ULTIMATE.start_main_#t~ret11#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9584#(and (<= 0 ~sum~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= ~sum~0 1)), Black: 9514#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)), Black: 9644#(and (or (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1)))), Black: 9664#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))))), Black: 9592#(and (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 9560#(and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (<= 2 ~back~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) 8) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) 8)))) (= ~sum~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (= ~queue~0.offset 0) (<= 1 ~n~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~front~0 1)), Black: 9498#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (<= ~n~0 3) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9546#(and (<= 0 ~sum~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (<= ~sum~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))))), Black: 9516#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= ~sum~0 1)), 134#true, Black: 9530#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= ~front~0 1))) (<= 1 ~front~0) (<= ~front~0 ~n~0) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= ~front~0 1)))), 6607#true, 998#true, Black: 9520#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (<= 1 ~front~0) (<= ~front~0 ~n~0) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0)), Black: 9512#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= ~sum~0 1)), 9880#true, Black: 9636#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9730#(and (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1)), Black: 9604#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 2176#(and (<= (+ ~back~0 1) ~n~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= ~n~0 1) (<= 0 ~back~0) (<= (+ ~front~0 1) ~back~0)), Black: 2151#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~front~0 ~back~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 9554#(and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (<= 2 ~back~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) 8) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) 8)))) (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (= ~queue~0.offset 0) (<= 1 ~n~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~front~0 1)), Black: 139#(= ~sum~0 0), Black: 9490#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 3) (= ~back~0 ~front~0) (= ~sum~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2184#(and (<= (+ ~front~0 1) 0) (<= ~n~0 1) (<= (+ ~front~0 1) ~back~0)), Black: 9606#(and (<= 0 ~sum~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9610#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 2180#(and (<= (+ ~back~0 1) ~n~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~n~0 1) (<= 0 ~back~0) (<= (+ ~front~0 1) ~back~0)), Black: 2190#(and (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)))) (and (<= (+ ~back~0 1) ~n~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= 0 ~back~0))) (or (and (<= (+ ~back~0 1) ~n~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 ~back~0)) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1))))) (<= (+ ~front~0 1) 0) (<= ~n~0 1) (<= (+ ~front~0 1) ~back~0)), Black: 152#(<= ~back~0 ~front~0), Black: 2188#(and (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)))) (and (<= (+ ~back~0 1) ~n~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= 0 ~back~0))) (<= (+ ~front~0 1) 0) (<= ~n~0 1) (<= (+ ~front~0 1) ~back~0)), 4645#true, Black: 164#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 9390#(or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)), 175#true, Black: 6091#(and (<= 0 ~sum~0) (<= ~sum~0 1)), Black: 6550#(and (<= 0 ~sum~0) (or (= ~back~0 0) (not (= ~front~0 0))) (<= ~sum~0 1)), 2206#(<= ~front~0 ~back~0), Black: 932#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 926#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 6548#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (= ~n~0 (+ ~front~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~sum~0 0) (or (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~front~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 956#(and (<= 0 ~sum~0) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| Int)) (or (< |#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| 1)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8|) 0)))) (and (= ~back~0 0) (= ~sum~0 0)) (not (= ~front~0 0))) (<= ~sum~0 1)), Black: 192#(and (<= 0 ~sum~0) (<= ~sum~0 1)), Black: 930#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 952#(and (or (< ~n~0 (+ ~front~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (< ~front~0 0)) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (or (< ~n~0 (+ ~front~0 1)) (and (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 2))) (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (< 0 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1))))) (< ~front~0 0)) (or (and (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)) (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) ~sum~0 1)))) (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) ~sum~0) 2)))) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (= ~sum~0 1) (or (< ~n~0 (+ ~front~0 1)) (and (forall ((v_ArrVal_69 (Array Int Int))) (or (< 0 (+ ~sum~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))) (forall ((v_ArrVal_69 (Array Int Int))) (or (< (+ ~sum~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 2) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (< ~front~0 0)) (or (< ~n~0 (+ ~front~0 1)) (and (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 2))) (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (< 0 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (< ~front~0 0)) (or (and (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_main_#t~ret11#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_main_#t~ret11#1.offset|)) 1)) (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_main_#t~ret11#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_main_#t~ret11#1.offset|))) 2))) (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_main_#t~ret11#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_main_#t~ret11#1.offset|)) 1)) (< 0 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_main_#t~ret11#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_main_#t~ret11#1.offset|)) 1))))) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (or (and (= ~back~0 0) (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| Int)) (or (< |#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| 1)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8|) 0)))) (not (= ~front~0 0))) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| Int)) (or (< |#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| 1)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8|) 0)))) (< ~n~0 (+ ~front~0 1)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0)))), 5619#true, Black: 5536#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 2) (<= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 5558#(and (or (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (= ~sum~0 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (= ~n~0 (+ ~front~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 827#(or (and (= ~back~0 0) (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| Int)) (or (< |#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| 1)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8|) 0)))) (not (= ~front~0 0))), Black: 5568#(and (<= 0 ~sum~0) (or (< ~back~0 0) (= ~back~0 0) (not (= ~front~0 0))) (<= ~sum~0 1)), 23#L90-1true, Black: 5538#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 995#(= |thread2Thread1of1ForFork1_~b~0#1| 1), Black: 5532#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 3821#(and (<= ~front~0 ~back~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1))) (<= ~n~0 1)), 17#L52true, Black: 5113#(and (<= 0 ~sum~0) (<= ~sum~0 1))]) [2023-11-10 12:42:16,241 INFO L294 olderBase$Statistics]: this new event has 174 ancestors and is cut-off event [2023-11-10 12:42:16,242 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-10 12:42:16,242 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-10 12:42:16,242 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-10 12:42:17,063 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([434] L68-->L71: Formula: (and (not (= (ite (= (+ (select (select |v_#memory_int_40| v_~queue~0.base_32) (+ (* 4 v_~back~0_60) v_~queue~0.offset_32)) 1) 0) 1 0) 0)) (= (+ v_~back~0_60 1) v_~back~0_59)) InVars {~back~0=v_~back~0_60, #memory_int=|v_#memory_int_40|, ~queue~0.offset=v_~queue~0.offset_32, ~queue~0.base=v_~queue~0.base_32} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~queue~0.offset=v_~queue~0.offset_32, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, ~back~0=v_~back~0_59, #memory_int=|v_#memory_int_40|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~queue~0.base=v_~queue~0.base_32} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, ~back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1][349], [3827#(<= ~front~0 ~back~0), Black: 7563#(<= ~back~0 ~front~0), 1363#(and (<= |thread2Thread1of1ForFork1_~b~0#1| (* (div |thread2Thread1of1ForFork1_~b~0#1| 256) 256)) (<= 0 (div |thread2Thread1of1ForFork1_~b~0#1| 256))), Black: 7564#(<= ~back~0 (+ ~front~0 1)), Black: 7565#(<= ~back~0 (+ 2 ~front~0)), 7561#true, Black: 10956#(and (<= 2 ~back~0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~back~0 4) (- 8))) 1) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (- 4) (* ~back~0 4))) 1) 0) (= ~sum~0 1) (<= ~n~0 3) (<= ~back~0 (+ ~n~0 1)) (= ~queue~0.offset 0) (= ~back~0 (+ ~front~0 1))), Black: 9618#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))), Black: 9580#(and (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (or (and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (= (select (select |#memory_int| ~queue~0.base) 0) 1)) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 10988#(and (<= 0 ~sum~0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< (+ ~front~0 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (< ~n~0 (+ 2 ~front~0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= ~sum~0 1) (or (< (+ ~front~0 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ 2 ~front~0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1)))), Black: 10992#(and (= ~sum~0 0) (or (< ~n~0 (+ ~front~0 1)) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1)) (= ~queue~0.offset 0) (or (< (+ ~front~0 1) 0) (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (< ~n~0 (+ 2 ~front~0)) (not (= (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1)))), Black: 11024#(and (<= 2 ~back~0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~back~0 4) (- 8))) 1) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (- 4) (* ~back~0 4))) 1) 0) (= ~sum~0 1) (<= ~n~0 3) (<= ~back~0 (+ ~n~0 1)) (= ~queue~0.offset 0) (= ~back~0 (+ ~front~0 1)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~n~0 ~front~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 11026#(and (= ~sum~0 1) (= ~queue~0.offset 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~n~0 ~front~0) (or (< ~back~0 0) (not (= ~front~0 0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9666#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 4605#(and (or (= ~back~0 ~front~0) (< ~n~0 (+ ~front~0 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (< ~front~0 0)) (<= ~front~0 ~back~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0)) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~front~0 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (< ~front~0 0))), Black: 11002#(and (= ~sum~0 1) (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (or (< ~back~0 0) (not (= ~front~0 0)))), Black: 9566#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 11030#(and (<= 0 ~sum~0) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4634#(and (<= ~front~0 ~back~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0)) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~front~0 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (< ~front~0 0))), Black: 11032#(and (= ~sum~0 1) (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4632#(and (<= ~front~0 ~back~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 10424#(and (<= 0 ~sum~0) (<= ~sum~0 1)), Black: 9544#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 11020#(and (<= 2 ~back~0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~back~0 4) (- 8))) 1) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (- 4) (* ~back~0 4))) 1) 0) (= ~sum~0 1) (<= ~n~0 3) (<= ~back~0 (+ ~n~0 1)) (= ~queue~0.offset 0) (= ~back~0 (+ ~front~0 1)) (<= ~n~0 ~front~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9574#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 10984#(and (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) 0) (<= ~front~0 (+ ~n~0 1)) (= ~sum~0 0) (<= ~n~0 3) (<= 2 ~front~0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 8))) 1) (= ~queue~0.offset 0) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (= ~back~0 (+ ~front~0 1))), Black: 9704#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1)), Black: 11014#(and (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< (+ ~front~0 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (< ~n~0 (+ 2 ~front~0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (or (< (+ ~front~0 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ 2 ~front~0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1)))), Black: 9612#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1)))), Black: 10994#(and (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 0) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1))) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (< ~n~0 (+ 3 ~front~0)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< (+ ~front~0 1) 0) (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ 2 ~front~0))) (= ~sum~0 1)), Black: 9608#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0))), Black: 9642#(and (or (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))), Black: 11004#(and (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< (+ ~front~0 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0)) (< ~n~0 (+ 2 ~front~0))) (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 0) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1))) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< (+ ~front~0 1) 0) (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ 2 ~front~0))) (= ~sum~0 1)), Black: 9548#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~sum~0 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))), Black: 11012#(and (<= 0 ~sum~0) (<= ~sum~0 1) (or (< ~back~0 0) (and (= ~back~0 0) (= ~sum~0 0)) (not (= ~front~0 0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 11018#(and (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 0) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1))) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< (+ ~front~0 1) 0) (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ 2 ~front~0))) (= ~sum~0 1)), 108#L71true, Black: 9638#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 11006#(and (<= 1 ~back~0) (= ~back~0 ~front~0) (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (- 4) (* ~back~0 4))) 1) (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (<= ~back~0 ~n~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 11028#(and (<= 0 ~sum~0) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 10496#(or (< (+ ~front~0 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ 2 ~front~0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))), Black: 9534#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (<= ~sum~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))))), Black: 11022#(and (= ~sum~0 1) (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (or (< ~back~0 0) (not (= ~front~0 0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 10958#(and (or (< (+ ~front~0 1) 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (< ~n~0 (+ 2 ~front~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ (* ~back~0 4) 4)) 1))) (= ~sum~0 0) (or (< ~n~0 (+ ~front~0 1)) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1)) (= ~queue~0.offset 0) (or (< (+ ~front~0 1) 0) (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (< ~n~0 (+ 2 ~front~0)) (not (= (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1)))), Black: 9678#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 11034#(and (= ~sum~0 1) (= ~queue~0.offset 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~n~0 ~front~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 10966#(and (<= 0 ~sum~0) (<= ~sum~0 1) (or (< (+ ~front~0 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ 2 ~front~0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1)))), 27#L90-2true, Black: 9576#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 10978#(and (<= 0 ~sum~0) (<= ~sum~0 1) (or (< ~back~0 0) (and (= ~back~0 0) (= ~sum~0 0)) (not (= ~front~0 0)))), Black: 11008#(and (<= 1 ~back~0) (= ~back~0 ~front~0) (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (- 4) (* ~back~0 4))) 1) (= ~queue~0.offset 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~n~0 ~front~0) (<= ~back~0 ~n~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 10986#(and (<= 1 ~back~0) (= ~back~0 ~front~0) (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (- 4) (* ~back~0 4))) 1) (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (<= ~back~0 ~n~0)), Black: 9562#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= ~front~0 1))) (<= 1 ~front~0) (<= ~front~0 ~n~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4))))) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= ~front~0 1)))), Black: 11010#(and (= ~sum~0 1) (= ~queue~0.offset 0) (<= ~n~0 ~front~0)), Black: 9694#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))))), Black: 10998#(and (<= 2 ~back~0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~back~0 4) (- 8))) 1) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (- 4) (* ~back~0 4))) 1) 0) (= ~sum~0 1) (<= ~n~0 3) (<= ~back~0 (+ ~n~0 1)) (= ~queue~0.offset 0) (= ~back~0 (+ ~front~0 1)) (<= ~n~0 ~front~0)), Black: 9586#(and (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 11016#(and (<= 0 ~sum~0) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (< ~back~0 0) (and (= ~back~0 0) (= ~sum~0 0)) (not (= ~front~0 0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 10974#(and (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< (+ ~front~0 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0)) (< ~n~0 (+ 2 ~front~0))) (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 0) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1))) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< (+ ~front~0 1) 0) (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ 2 ~front~0))) (= ~sum~0 1) (or (< ~back~0 ~front~0) (< ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= ~front~0 0)))), Black: 9536#(and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (<= 2 ~back~0) (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (= ~queue~0.offset 0) (<= 1 ~n~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~front~0 1)), Black: 9676#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9550#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0))), Black: 9662#(and (or (< ~back~0 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~back~0 1))) (= ~sum~0 0) (<= ~front~0 ~back~0) (or (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))), Black: 9532#(and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (<= 2 ~back~0) (= ~sum~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (= ~queue~0.offset 0) (<= 1 ~n~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~front~0 1)), Black: 8468#(and (= ~sum~0 0) (<= ~front~0 ~back~0)), Black: 9494#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 3) (= ~back~0 ~front~0) (= ~sum~0 0) (<= ~n~0 3) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9528#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (<= ~sum~0 1)), Black: 9700#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)), Black: 9652#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))))), Black: 9640#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9486#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1082#(<= ~back~0 ~front~0), Black: 9568#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0)) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1)))), Black: 9614#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= ~sum~0 1)), Black: 1263#(<= ~back~0 (+ ~front~0 1)), Black: 9594#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9654#(and (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (= ~sum~0 0) (<= ~front~0 ~back~0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0))), Black: 9588#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9600#(and (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 9556#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 1362#(not (= (* (div |thread2Thread1of1ForFork1_~b~0#1| 256) 256) |thread2Thread1of1ForFork1_~b~0#1|)), Black: 9524#(and (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)), Black: 9526#(and (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (< ~n~0 (+ ~back~0 2)) (< ~front~0 0)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9540#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (<= 1 ~front~0) (<= ~front~0 ~n~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4))))) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0)), Black: 9578#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 9648#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= ~sum~0 1)), 11066#true, Black: 9564#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 9496#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (<= ~n~0 3) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9582#(and (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (or (and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (= (select (select |#memory_int| ~queue~0.base) 0) 1)) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9646#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9692#(and (or (< ~back~0 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~back~0 1))) (or (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (= ~sum~0 0) (<= ~front~0 ~back~0) (or (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))), Black: 9622#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0))), Black: 9492#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 3) (= ~back~0 ~front~0) (= ~sum~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9668#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9522#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (<= 1 ~front~0) (<= ~front~0 ~n~0) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= ~front~0 1)))), Black: 9542#(and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (<= 2 ~back~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) 8) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) 8)))) (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (= ~queue~0.offset 0) (<= 1 ~n~0) (= ~front~0 1)), Black: 9504#(and (= ~back~0 ~front~0) (= ~sum~0 0) (<= ~n~0 3) (= |ULTIMATE.start_main_#t~ret11#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9558#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (<= 1 ~front~0) (<= ~front~0 ~n~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4))))) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= ~front~0 1)))), Black: 9650#(and (or (< ~back~0 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~back~0 1))) (= ~sum~0 0) (<= ~front~0 ~back~0)), Black: 9602#(and (<= 0 ~sum~0) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9506#(and (= ~back~0 ~front~0) (= ~sum~0 0) (<= ~n~0 3) (= ~queue~0.offset 0) (= |ULTIMATE.start_main_#t~ret11#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9584#(and (<= 0 ~sum~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= ~sum~0 1)), Black: 9514#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)), Black: 9644#(and (or (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1)))), Black: 9664#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))))), Black: 9592#(and (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 9560#(and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (<= 2 ~back~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) 8) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) 8)))) (= ~sum~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (= ~queue~0.offset 0) (<= 1 ~n~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~front~0 1)), Black: 9498#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (<= ~n~0 3) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9546#(and (<= 0 ~sum~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (<= ~sum~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))))), Black: 9516#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= ~sum~0 1)), 134#true, Black: 9530#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= ~front~0 1))) (<= 1 ~front~0) (<= ~front~0 ~n~0) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= ~front~0 1)))), 6607#true, 998#true, Black: 9520#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (<= 1 ~front~0) (<= ~front~0 ~n~0) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0)), Black: 9512#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= ~sum~0 1)), 9880#true, Black: 9636#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9730#(and (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1)), Black: 9604#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 2176#(and (<= (+ ~back~0 1) ~n~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= ~n~0 1) (<= 0 ~back~0) (<= (+ ~front~0 1) ~back~0)), Black: 2151#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~front~0 ~back~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 9554#(and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (<= 2 ~back~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) 8) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) 8)))) (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (= ~queue~0.offset 0) (<= 1 ~n~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~front~0 1)), Black: 139#(= ~sum~0 0), Black: 9490#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 3) (= ~back~0 ~front~0) (= ~sum~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2184#(and (<= (+ ~front~0 1) 0) (<= ~n~0 1) (<= (+ ~front~0 1) ~back~0)), Black: 9606#(and (<= 0 ~sum~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9610#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 2180#(and (<= (+ ~back~0 1) ~n~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~n~0 1) (<= 0 ~back~0) (<= (+ ~front~0 1) ~back~0)), Black: 2190#(and (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)))) (and (<= (+ ~back~0 1) ~n~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= 0 ~back~0))) (or (and (<= (+ ~back~0 1) ~n~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 ~back~0)) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1))))) (<= (+ ~front~0 1) 0) (<= ~n~0 1) (<= (+ ~front~0 1) ~back~0)), Black: 152#(<= ~back~0 ~front~0), Black: 2188#(and (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)))) (and (<= (+ ~back~0 1) ~n~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= 0 ~back~0))) (<= (+ ~front~0 1) 0) (<= ~n~0 1) (<= (+ ~front~0 1) ~back~0)), 4645#true, Black: 164#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 9390#(or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)), 175#true, Black: 6091#(and (<= 0 ~sum~0) (<= ~sum~0 1)), Black: 6550#(and (<= 0 ~sum~0) (or (= ~back~0 0) (not (= ~front~0 0))) (<= ~sum~0 1)), 2206#(<= ~front~0 ~back~0), Black: 932#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 926#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 6548#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (= ~n~0 (+ ~front~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~sum~0 0) (or (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~front~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 956#(and (<= 0 ~sum~0) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| Int)) (or (< |#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| 1)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8|) 0)))) (and (= ~back~0 0) (= ~sum~0 0)) (not (= ~front~0 0))) (<= ~sum~0 1)), Black: 192#(and (<= 0 ~sum~0) (<= ~sum~0 1)), Black: 930#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 952#(and (or (< ~n~0 (+ ~front~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (< ~front~0 0)) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (or (< ~n~0 (+ ~front~0 1)) (and (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 2))) (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (< 0 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1))))) (< ~front~0 0)) (or (and (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)) (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) ~sum~0 1)))) (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) ~sum~0) 2)))) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (= ~sum~0 1) (or (< ~n~0 (+ ~front~0 1)) (and (forall ((v_ArrVal_69 (Array Int Int))) (or (< 0 (+ ~sum~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))) (forall ((v_ArrVal_69 (Array Int Int))) (or (< (+ ~sum~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 2) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (< ~front~0 0)) (or (< ~n~0 (+ ~front~0 1)) (and (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 2))) (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (< 0 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (< ~front~0 0)) (or (and (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_main_#t~ret11#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_main_#t~ret11#1.offset|)) 1)) (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_main_#t~ret11#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_main_#t~ret11#1.offset|))) 2))) (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_main_#t~ret11#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_main_#t~ret11#1.offset|)) 1)) (< 0 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_main_#t~ret11#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_main_#t~ret11#1.offset|)) 1))))) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (or (and (= ~back~0 0) (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| Int)) (or (< |#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| 1)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8|) 0)))) (not (= ~front~0 0))) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| Int)) (or (< |#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| 1)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8|) 0)))) (< ~n~0 (+ ~front~0 1)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0)))), 5619#true, Black: 5536#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 2) (<= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 5558#(and (or (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (= ~sum~0 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (= ~n~0 (+ ~front~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 827#(or (and (= ~back~0 0) (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| Int)) (or (< |#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| 1)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8|) 0)))) (not (= ~front~0 0))), Black: 5568#(and (<= 0 ~sum~0) (or (< ~back~0 0) (= ~back~0 0) (not (= ~front~0 0))) (<= ~sum~0 1)), Black: 5538#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 995#(= |thread2Thread1of1ForFork1_~b~0#1| 1), Black: 5532#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 3821#(and (<= ~front~0 ~back~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1))) (<= ~n~0 1)), Black: 5113#(and (<= 0 ~sum~0) (<= ~sum~0 1))]) [2023-11-10 12:42:17,063 INFO L294 olderBase$Statistics]: this new event has 180 ancestors and is cut-off event [2023-11-10 12:42:17,063 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-10 12:42:17,063 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-10 12:42:17,063 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2023-11-10 12:42:17,395 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([434] L68-->L71: Formula: (and (not (= (ite (= (+ (select (select |v_#memory_int_40| v_~queue~0.base_32) (+ (* 4 v_~back~0_60) v_~queue~0.offset_32)) 1) 0) 1 0) 0)) (= (+ v_~back~0_60 1) v_~back~0_59)) InVars {~back~0=v_~back~0_60, #memory_int=|v_#memory_int_40|, ~queue~0.offset=v_~queue~0.offset_32, ~queue~0.base=v_~queue~0.base_32} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~queue~0.offset=v_~queue~0.offset_32, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, ~back~0=v_~back~0_59, #memory_int=|v_#memory_int_40|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~queue~0.base=v_~queue~0.base_32} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, ~back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1][349], [3827#(<= ~front~0 ~back~0), Black: 7563#(<= ~back~0 ~front~0), 1363#(and (<= |thread2Thread1of1ForFork1_~b~0#1| (* (div |thread2Thread1of1ForFork1_~b~0#1| 256) 256)) (<= 0 (div |thread2Thread1of1ForFork1_~b~0#1| 256))), Black: 7564#(<= ~back~0 (+ ~front~0 1)), Black: 7565#(<= ~back~0 (+ 2 ~front~0)), 7561#true, Black: 10956#(and (<= 2 ~back~0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~back~0 4) (- 8))) 1) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (- 4) (* ~back~0 4))) 1) 0) (= ~sum~0 1) (<= ~n~0 3) (<= ~back~0 (+ ~n~0 1)) (= ~queue~0.offset 0) (= ~back~0 (+ ~front~0 1))), Black: 9618#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))), Black: 9580#(and (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (or (and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (= (select (select |#memory_int| ~queue~0.base) 0) 1)) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 10988#(and (<= 0 ~sum~0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< (+ ~front~0 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (< ~n~0 (+ 2 ~front~0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= ~sum~0 1) (or (< (+ ~front~0 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ 2 ~front~0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1)))), Black: 10992#(and (= ~sum~0 0) (or (< ~n~0 (+ ~front~0 1)) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1)) (= ~queue~0.offset 0) (or (< (+ ~front~0 1) 0) (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (< ~n~0 (+ 2 ~front~0)) (not (= (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1)))), Black: 11024#(and (<= 2 ~back~0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~back~0 4) (- 8))) 1) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (- 4) (* ~back~0 4))) 1) 0) (= ~sum~0 1) (<= ~n~0 3) (<= ~back~0 (+ ~n~0 1)) (= ~queue~0.offset 0) (= ~back~0 (+ ~front~0 1)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~n~0 ~front~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 11026#(and (= ~sum~0 1) (= ~queue~0.offset 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~n~0 ~front~0) (or (< ~back~0 0) (not (= ~front~0 0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9666#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 4605#(and (or (= ~back~0 ~front~0) (< ~n~0 (+ ~front~0 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (< ~front~0 0)) (<= ~front~0 ~back~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0)) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~front~0 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (< ~front~0 0))), Black: 11002#(and (= ~sum~0 1) (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (or (< ~back~0 0) (not (= ~front~0 0)))), Black: 9566#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 11030#(and (<= 0 ~sum~0) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4634#(and (<= ~front~0 ~back~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0)) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~front~0 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (< ~front~0 0))), Black: 11032#(and (= ~sum~0 1) (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4632#(and (<= ~front~0 ~back~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 10424#(and (<= 0 ~sum~0) (<= ~sum~0 1)), Black: 9544#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 11020#(and (<= 2 ~back~0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~back~0 4) (- 8))) 1) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (- 4) (* ~back~0 4))) 1) 0) (= ~sum~0 1) (<= ~n~0 3) (<= ~back~0 (+ ~n~0 1)) (= ~queue~0.offset 0) (= ~back~0 (+ ~front~0 1)) (<= ~n~0 ~front~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9574#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 10984#(and (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) 0) (<= ~front~0 (+ ~n~0 1)) (= ~sum~0 0) (<= ~n~0 3) (<= 2 ~front~0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 8))) 1) (= ~queue~0.offset 0) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (= ~back~0 (+ ~front~0 1))), Black: 9704#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1)), Black: 11014#(and (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< (+ ~front~0 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (< ~n~0 (+ 2 ~front~0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (or (< (+ ~front~0 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ 2 ~front~0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1)))), Black: 9612#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1)))), Black: 10994#(and (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 0) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1))) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (< ~n~0 (+ 3 ~front~0)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< (+ ~front~0 1) 0) (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ 2 ~front~0))) (= ~sum~0 1)), Black: 9608#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0))), Black: 9642#(and (or (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))), Black: 11004#(and (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< (+ ~front~0 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0)) (< ~n~0 (+ 2 ~front~0))) (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 0) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1))) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< (+ ~front~0 1) 0) (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ 2 ~front~0))) (= ~sum~0 1)), Black: 9548#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~sum~0 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))), Black: 11012#(and (<= 0 ~sum~0) (<= ~sum~0 1) (or (< ~back~0 0) (and (= ~back~0 0) (= ~sum~0 0)) (not (= ~front~0 0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 11018#(and (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 0) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1))) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< (+ ~front~0 1) 0) (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ 2 ~front~0))) (= ~sum~0 1)), 108#L71true, Black: 9638#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 11006#(and (<= 1 ~back~0) (= ~back~0 ~front~0) (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (- 4) (* ~back~0 4))) 1) (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (<= ~back~0 ~n~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 11028#(and (<= 0 ~sum~0) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 10496#(or (< (+ ~front~0 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ 2 ~front~0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))), Black: 9534#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (<= ~sum~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))))), Black: 11022#(and (= ~sum~0 1) (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (or (< ~back~0 0) (not (= ~front~0 0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 10958#(and (or (< (+ ~front~0 1) 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (< ~n~0 (+ 2 ~front~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ (* ~back~0 4) 4)) 1))) (= ~sum~0 0) (or (< ~n~0 (+ ~front~0 1)) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1)) (= ~queue~0.offset 0) (or (< (+ ~front~0 1) 0) (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (< ~n~0 (+ 2 ~front~0)) (not (= (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1)))), Black: 9678#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 11034#(and (= ~sum~0 1) (= ~queue~0.offset 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~n~0 ~front~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 10966#(and (<= 0 ~sum~0) (<= ~sum~0 1) (or (< (+ ~front~0 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ 2 ~front~0)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1)))), Black: 9576#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 10978#(and (<= 0 ~sum~0) (<= ~sum~0 1) (or (< ~back~0 0) (and (= ~back~0 0) (= ~sum~0 0)) (not (= ~front~0 0)))), Black: 11008#(and (<= 1 ~back~0) (= ~back~0 ~front~0) (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (- 4) (* ~back~0 4))) 1) (= ~queue~0.offset 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~n~0 ~front~0) (<= ~back~0 ~n~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 10986#(and (<= 1 ~back~0) (= ~back~0 ~front~0) (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (- 4) (* ~back~0 4))) 1) (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (<= ~back~0 ~n~0)), Black: 9562#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= ~front~0 1))) (<= 1 ~front~0) (<= ~front~0 ~n~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4))))) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= ~front~0 1)))), Black: 11010#(and (= ~sum~0 1) (= ~queue~0.offset 0) (<= ~n~0 ~front~0)), Black: 9694#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))))), Black: 10998#(and (<= 2 ~back~0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~back~0 4) (- 8))) 1) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (- 4) (* ~back~0 4))) 1) 0) (= ~sum~0 1) (<= ~n~0 3) (<= ~back~0 (+ ~n~0 1)) (= ~queue~0.offset 0) (= ~back~0 (+ ~front~0 1)) (<= ~n~0 ~front~0)), Black: 9586#(and (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 11016#(and (<= 0 ~sum~0) (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (< ~back~0 0) (and (= ~back~0 0) (= ~sum~0 0)) (not (= ~front~0 0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 10974#(and (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< (+ ~front~0 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0)) (< ~n~0 (+ 2 ~front~0))) (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 0) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1))) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< (+ ~front~0 1) 0) (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ 2 ~front~0))) (= ~sum~0 1) (or (< ~back~0 ~front~0) (< ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= ~front~0 0)))), Black: 9536#(and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (<= 2 ~back~0) (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (= ~queue~0.offset 0) (<= 1 ~n~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~front~0 1)), Black: 9676#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9550#(and (or (< ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (not (= ~front~0 0))) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0))), Black: 9662#(and (or (< ~back~0 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~back~0 1))) (= ~sum~0 0) (<= ~front~0 ~back~0) (or (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))), Black: 9532#(and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (<= 2 ~back~0) (= ~sum~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (= ~queue~0.offset 0) (<= 1 ~n~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~front~0 1)), Black: 8468#(and (= ~sum~0 0) (<= ~front~0 ~back~0)), Black: 9494#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 3) (= ~back~0 ~front~0) (= ~sum~0 0) (<= ~n~0 3) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9528#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (<= ~sum~0 1)), Black: 9700#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)), Black: 9652#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))))), Black: 9640#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9486#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1082#(<= ~back~0 ~front~0), Black: 9568#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0)) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1)))), Black: 9614#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= ~sum~0 1)), Black: 1263#(<= ~back~0 (+ ~front~0 1)), Black: 9594#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9654#(and (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (= ~sum~0 0) (<= ~front~0 ~back~0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0))), Black: 9588#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9600#(and (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 9556#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1))) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 1362#(not (= (* (div |thread2Thread1of1ForFork1_~b~0#1| 256) 256) |thread2Thread1of1ForFork1_~b~0#1|)), Black: 9524#(and (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)), Black: 9526#(and (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (< ~n~0 (+ ~back~0 2)) (< ~front~0 0)) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (= ~queue~0.offset 0) (or (and (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) 1)) (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9540#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (<= 1 ~front~0) (<= ~front~0 ~n~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4))))) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0)), Black: 9578#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 9648#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (<= ~sum~0 1)), 11066#true, Black: 9564#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 9496#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (<= ~n~0 3) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9582#(and (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= 0 (select (select |#memory_int| ~queue~0.base) (* ~front~0 4))) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 3) (<= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (= ~queue~0.offset 0) (or (< 0 ~back~0) (< ~front~0 ~back~0)) (or (and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (= (select (select |#memory_int| ~queue~0.base) 0) 1)) (< ~n~0 (+ ~back~0 1)) (< ~front~0 0))), Black: 9646#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9692#(and (or (< ~back~0 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~back~0 1))) (or (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (= ~sum~0 0) (<= ~front~0 ~back~0) (or (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))), Black: 9622#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0))), Black: 9492#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 3) (= ~back~0 ~front~0) (= ~sum~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9668#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9522#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (<= 1 ~front~0) (<= ~front~0 ~n~0) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= ~front~0 1)))), Black: 9542#(and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (<= 2 ~back~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) 8) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) 8)))) (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (= ~queue~0.offset 0) (<= 1 ~n~0) (= ~front~0 1)), Black: 9504#(and (= ~back~0 ~front~0) (= ~sum~0 0) (<= ~n~0 3) (= |ULTIMATE.start_main_#t~ret11#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9558#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (<= 1 ~front~0) (<= ~front~0 ~n~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4))))) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= ~front~0 1)))), Black: 9650#(and (or (< ~back~0 0) (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~back~0 1))) (= ~sum~0 0) (<= ~front~0 ~back~0)), Black: 9602#(and (<= 0 ~sum~0) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9506#(and (= ~back~0 ~front~0) (= ~sum~0 0) (<= ~n~0 3) (= ~queue~0.offset 0) (= |ULTIMATE.start_main_#t~ret11#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9584#(and (<= 0 ~sum~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= ~sum~0 1)), Black: 9514#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (< ~front~0 0)) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)), Black: 9644#(and (or (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1)))), Black: 9664#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))))), Black: 9592#(and (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 9560#(and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (<= 2 ~back~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) 8) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) 8)))) (= ~sum~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (= ~queue~0.offset 0) (<= 1 ~n~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~front~0 1)), Black: 9498#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (<= ~n~0 3) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9546#(and (<= 0 ~sum~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (<= ~sum~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))))), Black: 9516#(and (<= 0 ~sum~0) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= ~sum~0 1)), 134#true, Black: 9530#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= ~front~0 1))) (<= 1 ~front~0) (<= ~front~0 ~n~0) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= ~front~0 1)))), 6607#true, 998#true, Black: 9520#(and (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) (- 4))) 1) (= ~queue~0.offset 0) (<= 1 ~front~0) (<= ~front~0 ~n~0) (= (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) 0) (<= (+ ~front~0 1) ~back~0)), Black: 9512#(and (<= 0 ~sum~0) (or (< ~n~0 (+ ~back~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1))) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (<= ~sum~0 1)), 9880#true, Black: 9636#(and (or (< ~n~0 (+ ~back~0 1)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< ~n~0 (+ ~back~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9730#(and (<= 0 ~sum~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1)), Black: 9604#(and (or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (= ~queue~0.offset 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0)) (or (< ~n~0 (+ 2 ~front~0)) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 2176#(and (<= (+ ~back~0 1) ~n~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= ~n~0 1) (<= 0 ~back~0) (<= (+ ~front~0 1) ~back~0)), Black: 2151#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~front~0 ~back~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 9554#(and (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (<= 2 ~back~0) (or (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int| ~queue~0.base) 8) 1) (<= 0 (select (select |#memory_int| ~queue~0.base) 8)))) (= ~sum~0 1) (<= ~n~0 3) (= (select (select |#memory_int| ~queue~0.base) 0) 1) (= ~queue~0.offset 0) (<= 1 ~n~0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~front~0 1)), Black: 139#(= ~sum~0 0), Black: 9490#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 3) (= ~back~0 ~front~0) (= ~sum~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2184#(and (<= (+ ~front~0 1) 0) (<= ~n~0 1) (<= (+ ~front~0 1) ~back~0)), Black: 9606#(and (<= 0 ~sum~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ 2 ~front~0)) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0)) (or (< 0 ~back~0) (= ~back~0 ~front~0) (< 1 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= ~sum~0 1) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (* ~back~0 4)) 1) 0)) (< ~n~0 (+ ~back~0 2)) (< ~n~0 (+ 2 ~front~0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) ~sum~0))) (< ~front~0 0))), Black: 9610#(and (= ~sum~0 0) (<= ~front~0 ~back~0) (or (= ~back~0 ~front~0) (< ~n~0 (+ ~back~0 3)) (< ~front~0 0))), Black: 2180#(and (<= (+ ~back~0 1) ~n~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~n~0 1) (<= 0 ~back~0) (<= (+ ~front~0 1) ~back~0)), Black: 2190#(and (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)))) (and (<= (+ ~back~0 1) ~n~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= 0 ~back~0))) (or (and (<= (+ ~back~0 1) ~n~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 ~back~0)) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1))))) (<= (+ ~front~0 1) 0) (<= ~n~0 1) (<= (+ ~front~0 1) ~back~0)), Black: 152#(<= ~back~0 ~front~0), Black: 2188#(and (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)))) (and (<= (+ ~back~0 1) ~n~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= 0 ~back~0))) (<= (+ ~front~0 1) 0) (<= ~n~0 1) (<= (+ ~front~0 1) ~back~0)), 4645#true, Black: 164#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 9390#(or (< 0 ~back~0) (< 1 ~front~0) (and (<= 0 ~sum~0) (= ~back~0 ~front~0) (<= ~sum~0 1)) (< ~front~0 0)), 175#true, Black: 6091#(and (<= 0 ~sum~0) (<= ~sum~0 1)), Black: 6550#(and (<= 0 ~sum~0) (or (= ~back~0 0) (not (= ~front~0 0))) (<= ~sum~0 1)), 33#L91-1true, 2206#(<= ~front~0 ~back~0), Black: 932#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 926#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 6548#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (= ~n~0 (+ ~front~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~sum~0 0) (or (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~front~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 956#(and (<= 0 ~sum~0) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| Int)) (or (< |#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| 1)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8|) 0)))) (and (= ~back~0 0) (= ~sum~0 0)) (not (= ~front~0 0))) (<= ~sum~0 1)), Black: 192#(and (<= 0 ~sum~0) (<= ~sum~0 1)), Black: 930#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 952#(and (or (< ~n~0 (+ ~front~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (< ~front~0 0)) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (or (< ~n~0 (+ ~front~0 1)) (and (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 2))) (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (< 0 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1))))) (< ~front~0 0)) (or (and (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)) (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) ~sum~0 1)))) (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) ~sum~0) 2)))) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (= ~sum~0 1) (or (< ~n~0 (+ ~front~0 1)) (and (forall ((v_ArrVal_69 (Array Int Int))) (or (< 0 (+ ~sum~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))) (forall ((v_ArrVal_69 (Array Int Int))) (or (< (+ ~sum~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 2) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (< ~front~0 0)) (or (< ~n~0 (+ ~front~0 1)) (and (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 2))) (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (< 0 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (< ~front~0 0)) (or (and (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_main_#t~ret11#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_main_#t~ret11#1.offset|)) 1)) (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_main_#t~ret11#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_main_#t~ret11#1.offset|))) 2))) (forall ((v_ArrVal_68 (Array Int Int)) (v_ArrVal_69 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_main_#t~ret11#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_main_#t~ret11#1.offset|)) 1)) (< 0 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_68) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_69) |ULTIMATE.start_main_#t~ret11#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_main_#t~ret11#1.offset|)) 1))))) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (or (and (= ~back~0 0) (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| Int)) (or (< |#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| 1)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8|) 0)))) (not (= ~front~0 0))) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| Int)) (or (< |#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| 1)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8|) 0)))) (< ~n~0 (+ ~front~0 1)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0)))), 5619#true, Black: 5536#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 2) (<= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 5558#(and (or (and (<= 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (= ~sum~0 0) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (and (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (= ~n~0 (+ ~front~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~back~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 827#(or (and (= ~back~0 0) (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| Int)) (or (< |#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8| 1)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_8|) 0)))) (not (= ~front~0 0))), Black: 5568#(and (<= 0 ~sum~0) (or (< ~back~0 0) (= ~back~0 0) (not (= ~front~0 0))) (<= ~sum~0 1)), Black: 5538#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 995#(= |thread2Thread1of1ForFork1_~b~0#1| 1), Black: 5532#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 3821#(and (<= ~front~0 ~back~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1))) (<= ~n~0 1)), Black: 5113#(and (<= 0 ~sum~0) (<= ~sum~0 1))]) [2023-11-10 12:42:17,396 INFO L294 olderBase$Statistics]: this new event has 182 ancestors and is cut-off event [2023-11-10 12:42:17,396 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2023-11-10 12:42:17,396 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-10 12:42:17,396 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2023-11-10 12:42:19,577 INFO L124 PetriNetUnfolderBase]: 3974/22526 cut-off events. [2023-11-10 12:42:19,577 INFO L125 PetriNetUnfolderBase]: For 572342/572902 co-relation queries the response was YES. [2023-11-10 12:42:19,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119263 conditions, 22526 events. 3974/22526 cut-off events. For 572342/572902 co-relation queries the response was YES. Maximal size of possible extension queue 588. Compared 296208 event pairs, 328 based on Foata normal form. 555/21898 useless extension candidates. Maximal degree in co-relation 119110. Up to 3015 conditions per place. [2023-11-10 12:42:19,871 INFO L140 encePairwiseOnDemand]: 107/135 looper letters, 235 selfloop transitions, 314 changer transitions 138/770 dead transitions. [2023-11-10 12:42:19,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 506 places, 770 transitions, 12923 flow [2023-11-10 12:42:19,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-11-10 12:42:19,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2023-11-10 12:42:19,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 3961 transitions. [2023-11-10 12:42:19,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48901234567901236 [2023-11-10 12:42:19,874 INFO L72 ComplementDD]: Start complementDD. Operand 60 states and 3961 transitions. [2023-11-10 12:42:19,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 3961 transitions. [2023-11-10 12:42:19,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:42:19,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 60 states and 3961 transitions. [2023-11-10 12:42:19,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 61 states, 60 states have (on average 66.01666666666667) internal successors, (3961), 60 states have internal predecessors, (3961), 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) [2023-11-10 12:42:19,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 61 states, 61 states have (on average 135.0) internal successors, (8235), 61 states have internal predecessors, (8235), 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) [2023-11-10 12:42:19,882 INFO L81 ComplementDD]: Finished complementDD. Result has 61 states, 61 states have (on average 135.0) internal successors, (8235), 61 states have internal predecessors, (8235), 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) [2023-11-10 12:42:19,882 INFO L175 Difference]: Start difference. First operand has 466 places, 581 transitions, 9038 flow. Second operand 60 states and 3961 transitions. [2023-11-10 12:42:19,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 506 places, 770 transitions, 12923 flow [2023-11-10 12:42:21,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 770 transitions, 12223 flow, removed 293 selfloop flow, removed 52 redundant places. [2023-11-10 12:42:21,367 INFO L231 Difference]: Finished difference. Result has 466 places, 558 transitions, 8927 flow [2023-11-10 12:42:21,367 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=8172, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=292, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=8927, PETRI_PLACES=466, PETRI_TRANSITIONS=558} [2023-11-10 12:42:21,368 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, 346 predicate places. [2023-11-10 12:42:21,368 INFO L495 AbstractCegarLoop]: Abstraction has has 466 places, 558 transitions, 8927 flow [2023-11-10 12:42:21,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 64.04545454545455) internal successors, (4227), 66 states have internal predecessors, (4227), 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) [2023-11-10 12:42:21,368 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:42:21,369 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:42:21,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-11-10 12:42:21,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:42:21,573 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:42:21,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:42:21,574 INFO L85 PathProgramCache]: Analyzing trace with hash -288374777, now seen corresponding path program 12 times [2023-11-10 12:42:21,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:42:21,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007146514] [2023-11-10 12:42:21,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:42:21,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:42:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:42:22,914 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:42:22,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:42:22,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007146514] [2023-11-10 12:42:22,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007146514] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:42:22,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460959848] [2023-11-10 12:42:22,914 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-10 12:42:22,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:42:22,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:42:22,916 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 12:42:22,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-10 12:42:23,125 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-11-10 12:42:23,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:42:23,132 INFO L262 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-10 12:42:23,134 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:42:24,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-10 12:42:24,353 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-10 12:42:24,354 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:42:24,355 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 18 [2023-11-10 12:42:24,371 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:42:24,371 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:42:25,887 INFO L322 Elim1Store]: treesize reduction 59, result has 49.6 percent of original size [2023-11-10 12:42:25,888 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 72 treesize of output 79 [2023-11-10 12:42:25,990 INFO L322 Elim1Store]: treesize reduction 104, result has 11.1 percent of original size [2023-11-10 12:42:25,990 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 73 treesize of output 35 [2023-11-10 12:42:28,196 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:42:28,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460959848] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:42:28,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:42:28,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 23] total 67 [2023-11-10 12:42:28,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716547491] [2023-11-10 12:42:28,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:42:28,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2023-11-10 12:42:28,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:42:28,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2023-11-10 12:42:28,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=694, Invalid=3728, Unknown=0, NotChecked=0, Total=4422 [2023-11-10 12:42:28,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 135 [2023-11-10 12:42:28,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 466 places, 558 transitions, 8927 flow. Second operand has 67 states, 67 states have (on average 64.0) internal successors, (4288), 67 states have internal predecessors, (4288), 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) [2023-11-10 12:42:28,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:42:28,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 135 [2023-11-10 12:42:28,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:42:40,290 INFO L124 PetriNetUnfolderBase]: 4832/25520 cut-off events. [2023-11-10 12:42:40,290 INFO L125 PetriNetUnfolderBase]: For 697727/698373 co-relation queries the response was YES. [2023-11-10 12:42:40,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141098 conditions, 25520 events. 4832/25520 cut-off events. For 697727/698373 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 337637 event pairs, 493 based on Foata normal form. 585/24794 useless extension candidates. Maximal degree in co-relation 140950. Up to 3539 conditions per place. [2023-11-10 12:42:40,648 INFO L140 encePairwiseOnDemand]: 106/135 looper letters, 317 selfloop transitions, 416 changer transitions 138/954 dead transitions. [2023-11-10 12:42:40,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 512 places, 954 transitions, 16400 flow [2023-11-10 12:42:40,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2023-11-10 12:42:40,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2023-11-10 12:42:40,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 4789 transitions. [2023-11-10 12:42:40,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4926954732510288 [2023-11-10 12:42:40,651 INFO L72 ComplementDD]: Start complementDD. Operand 72 states and 4789 transitions. [2023-11-10 12:42:40,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 4789 transitions. [2023-11-10 12:42:40,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:42:40,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 72 states and 4789 transitions. [2023-11-10 12:42:40,656 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 73 states, 72 states have (on average 66.51388888888889) internal successors, (4789), 72 states have internal predecessors, (4789), 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) [2023-11-10 12:42:40,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 73 states, 73 states have (on average 135.0) internal successors, (9855), 73 states have internal predecessors, (9855), 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) [2023-11-10 12:42:40,662 INFO L81 ComplementDD]: Finished complementDD. Result has 73 states, 73 states have (on average 135.0) internal successors, (9855), 73 states have internal predecessors, (9855), 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) [2023-11-10 12:42:40,662 INFO L175 Difference]: Start difference. First operand has 466 places, 558 transitions, 8927 flow. Second operand 72 states and 4789 transitions. [2023-11-10 12:42:40,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 512 places, 954 transitions, 16400 flow [2023-11-10 12:42:42,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 954 transitions, 14943 flow, removed 279 selfloop flow, removed 59 redundant places. [2023-11-10 12:42:42,360 INFO L231 Difference]: Finished difference. Result has 477 places, 658 transitions, 11100 flow [2023-11-10 12:42:42,361 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=7891, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=301, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=72, PETRI_FLOW=11100, PETRI_PLACES=477, PETRI_TRANSITIONS=658} [2023-11-10 12:42:42,361 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, 357 predicate places. [2023-11-10 12:42:42,361 INFO L495 AbstractCegarLoop]: Abstraction has has 477 places, 658 transitions, 11100 flow [2023-11-10 12:42:42,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 64.0) internal successors, (4288), 67 states have internal predecessors, (4288), 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) [2023-11-10 12:42:42,362 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:42:42,362 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:42:42,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-11-10 12:42:42,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:42:42,566 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:42:42,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:42:42,567 INFO L85 PathProgramCache]: Analyzing trace with hash 219752093, now seen corresponding path program 13 times [2023-11-10 12:42:42,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:42:42,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684817253] [2023-11-10 12:42:42,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:42:42,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:42:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:42:43,936 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:42:43,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:42:43,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684817253] [2023-11-10 12:42:43,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684817253] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:42:43,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415041672] [2023-11-10 12:42:43,936 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-10 12:42:43,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:42:43,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:42:43,953 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 12:42:43,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-10 12:42:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:42:44,060 INFO L262 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-10 12:42:44,062 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:42:44,772 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:42:44,773 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:42:45,277 INFO L322 Elim1Store]: treesize reduction 10, result has 88.2 percent of original size [2023-11-10 12:42:45,278 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 108 treesize of output 104 [2023-11-10 12:42:46,144 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:42:46,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415041672] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:42:46,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:42:46,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 22, 22] total 61 [2023-11-10 12:42:46,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203879539] [2023-11-10 12:42:46,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:42:46,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2023-11-10 12:42:46,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:42:46,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2023-11-10 12:42:46,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=594, Invalid=3066, Unknown=0, NotChecked=0, Total=3660 [2023-11-10 12:42:46,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 135 [2023-11-10 12:42:46,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 477 places, 658 transitions, 11100 flow. Second operand has 61 states, 61 states have (on average 64.29508196721312) internal successors, (3922), 61 states have internal predecessors, (3922), 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) [2023-11-10 12:42:46,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:42:46,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 135 [2023-11-10 12:42:46,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:42:57,755 INFO L124 PetriNetUnfolderBase]: 4825/28500 cut-off events. [2023-11-10 12:42:57,755 INFO L125 PetriNetUnfolderBase]: For 742626/743246 co-relation queries the response was YES. [2023-11-10 12:42:58,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148472 conditions, 28500 events. 4825/28500 cut-off events. For 742626/743246 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 383713 event pairs, 446 based on Foata normal form. 1167/28171 useless extension candidates. Maximal degree in co-relation 148320. Up to 3841 conditions per place. [2023-11-10 12:42:58,193 INFO L140 encePairwiseOnDemand]: 107/135 looper letters, 239 selfloop transitions, 364 changer transitions 194/880 dead transitions. [2023-11-10 12:42:58,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 519 places, 880 transitions, 15122 flow [2023-11-10 12:42:58,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-11-10 12:42:58,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2023-11-10 12:42:58,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 3961 transitions. [2023-11-10 12:42:58,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48901234567901236 [2023-11-10 12:42:58,197 INFO L72 ComplementDD]: Start complementDD. Operand 60 states and 3961 transitions. [2023-11-10 12:42:58,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 3961 transitions. [2023-11-10 12:42:58,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:42:58,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 60 states and 3961 transitions. [2023-11-10 12:42:58,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 61 states, 60 states have (on average 66.01666666666667) internal successors, (3961), 60 states have internal predecessors, (3961), 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) [2023-11-10 12:42:58,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 61 states, 61 states have (on average 135.0) internal successors, (8235), 61 states have internal predecessors, (8235), 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) [2023-11-10 12:42:58,205 INFO L81 ComplementDD]: Finished complementDD. Result has 61 states, 61 states have (on average 135.0) internal successors, (8235), 61 states have internal predecessors, (8235), 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) [2023-11-10 12:42:58,205 INFO L175 Difference]: Start difference. First operand has 477 places, 658 transitions, 11100 flow. Second operand 60 states and 3961 transitions. [2023-11-10 12:42:58,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 519 places, 880 transitions, 15122 flow [2023-11-10 12:42:59,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 472 places, 880 transitions, 14513 flow, removed 239 selfloop flow, removed 47 redundant places. [2023-11-10 12:42:59,951 INFO L231 Difference]: Finished difference. Result has 485 places, 584 transitions, 9947 flow [2023-11-10 12:42:59,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=8578, PETRI_DIFFERENCE_MINUEND_PLACES=413, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=286, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=9947, PETRI_PLACES=485, PETRI_TRANSITIONS=584} [2023-11-10 12:42:59,952 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, 365 predicate places. [2023-11-10 12:42:59,952 INFO L495 AbstractCegarLoop]: Abstraction has has 485 places, 584 transitions, 9947 flow [2023-11-10 12:42:59,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 64.29508196721312) internal successors, (3922), 61 states have internal predecessors, (3922), 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) [2023-11-10 12:42:59,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:42:59,960 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:42:59,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-11-10 12:43:00,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:43:00,166 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:43:00,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:43:00,166 INFO L85 PathProgramCache]: Analyzing trace with hash -2137158041, now seen corresponding path program 14 times [2023-11-10 12:43:00,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:43:00,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135059948] [2023-11-10 12:43:00,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:43:00,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:43:00,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:43:01,862 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:43:01,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:43:01,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135059948] [2023-11-10 12:43:01,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135059948] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:43:01,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825571560] [2023-11-10 12:43:01,862 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-10 12:43:01,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:43:01,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:43:01,863 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 12:43:01,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-10 12:43:01,980 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-10 12:43:01,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:43:01,982 INFO L262 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-10 12:43:01,987 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:43:02,604 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-10 12:43:02,863 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-10 12:43:02,911 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-10 12:43:03,429 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:43:03,429 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:43:05,514 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:43:05,515 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 183 treesize of output 123 [2023-11-10 12:43:05,556 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:43:05,556 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 800 treesize of output 780 [2023-11-10 12:43:05,614 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:43:05,615 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 256 treesize of output 300 [2023-11-10 12:43:05,661 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:43:05,662 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 255 treesize of output 259 [2023-11-10 12:43:08,039 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:43:08,039 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 122 [2023-11-10 12:43:08,081 INFO L322 Elim1Store]: treesize reduction 72, result has 15.3 percent of original size [2023-11-10 12:43:08,082 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 792 treesize of output 700 [2023-11-10 12:43:08,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-10 12:43:08,098 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-10 12:43:08,098 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-10 12:43:08,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-10 12:43:08,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-10 12:43:08,100 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 256 treesize of output 216 [2023-11-10 12:43:08,125 INFO L322 Elim1Store]: treesize reduction 72, result has 15.3 percent of original size [2023-11-10 12:43:08,125 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 255 treesize of output 187 [2023-11-10 12:43:08,933 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 11 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:43:08,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825571560] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:43:08,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:43:08,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 31, 28] total 77 [2023-11-10 12:43:08,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145238349] [2023-11-10 12:43:08,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:43:08,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2023-11-10 12:43:08,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:43:08,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2023-11-10 12:43:08,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=4864, Unknown=42, NotChecked=0, Total=5852 [2023-11-10 12:43:08,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 135 [2023-11-10 12:43:08,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 485 places, 584 transitions, 9947 flow. Second operand has 77 states, 77 states have (on average 56.74025974025974) internal successors, (4369), 77 states have internal predecessors, (4369), 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) [2023-11-10 12:43:08,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:43:08,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 135 [2023-11-10 12:43:08,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:43:18,212 INFO L124 PetriNetUnfolderBase]: 2987/19616 cut-off events. [2023-11-10 12:43:18,213 INFO L125 PetriNetUnfolderBase]: For 536948/537505 co-relation queries the response was YES. [2023-11-10 12:43:18,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101047 conditions, 19616 events. 2987/19616 cut-off events. For 536948/537505 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 252879 event pairs, 660 based on Foata normal form. 1217/19732 useless extension candidates. Maximal degree in co-relation 100895. Up to 2803 conditions per place. [2023-11-10 12:43:18,521 INFO L140 encePairwiseOnDemand]: 104/135 looper letters, 124 selfloop transitions, 134 changer transitions 250/563 dead transitions. [2023-11-10 12:43:18,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 505 places, 563 transitions, 9518 flow [2023-11-10 12:43:18,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-11-10 12:43:18,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2023-11-10 12:43:18,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 3154 transitions. [2023-11-10 12:43:18,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4326474622770919 [2023-11-10 12:43:18,524 INFO L72 ComplementDD]: Start complementDD. Operand 54 states and 3154 transitions. [2023-11-10 12:43:18,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 3154 transitions. [2023-11-10 12:43:18,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:43:18,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 54 states and 3154 transitions. [2023-11-10 12:43:18,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 55 states, 54 states have (on average 58.407407407407405) internal successors, (3154), 54 states have internal predecessors, (3154), 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) [2023-11-10 12:43:18,531 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 55 states, 55 states have (on average 135.0) internal successors, (7425), 55 states have internal predecessors, (7425), 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) [2023-11-10 12:43:18,531 INFO L81 ComplementDD]: Finished complementDD. Result has 55 states, 55 states have (on average 135.0) internal successors, (7425), 55 states have internal predecessors, (7425), 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) [2023-11-10 12:43:18,531 INFO L175 Difference]: Start difference. First operand has 485 places, 584 transitions, 9947 flow. Second operand 54 states and 3154 transitions. [2023-11-10 12:43:18,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 505 places, 563 transitions, 9518 flow [2023-11-10 12:43:19,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 563 transitions, 8766 flow, removed 198 selfloop flow, removed 67 redundant places. [2023-11-10 12:43:19,454 INFO L231 Difference]: Finished difference. Result has 447 places, 275 transitions, 4218 flow [2023-11-10 12:43:19,454 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=6480, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=54, PETRI_FLOW=4218, PETRI_PLACES=447, PETRI_TRANSITIONS=275} [2023-11-10 12:43:19,455 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, 327 predicate places. [2023-11-10 12:43:19,455 INFO L495 AbstractCegarLoop]: Abstraction has has 447 places, 275 transitions, 4218 flow [2023-11-10 12:43:19,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 56.74025974025974) internal successors, (4369), 77 states have internal predecessors, (4369), 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) [2023-11-10 12:43:19,455 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:43:19,456 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:43:19,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-11-10 12:43:19,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-10 12:43:19,661 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:43:19,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:43:19,661 INFO L85 PathProgramCache]: Analyzing trace with hash -769555217, now seen corresponding path program 15 times [2023-11-10 12:43:19,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:43:19,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77993923] [2023-11-10 12:43:19,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:43:19,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:43:19,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:43:21,490 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:43:21,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:43:21,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77993923] [2023-11-10 12:43:21,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77993923] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:43:21,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136702741] [2023-11-10 12:43:21,491 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-10 12:43:21,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:43:21,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:43:21,492 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 12:43:21,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-10 12:43:22,001 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-11-10 12:43:22,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:43:22,003 INFO L262 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 76 conjunts are in the unsatisfiable core [2023-11-10 12:43:22,006 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:43:22,597 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-10 12:43:22,724 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-10 12:43:23,033 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-10 12:43:23,083 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-10 12:43:23,832 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 7 proven. 103 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:43:23,833 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:43:27,195 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:43:27,196 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 231 treesize of output 136 [2023-11-10 12:43:27,200 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-10 12:43:27,201 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-10 12:43:27,202 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-10 12:43:27,229 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:43:27,230 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 380 treesize of output 382 [2023-11-10 12:43:27,251 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-10 12:43:27,252 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-10 12:43:27,253 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-10 12:43:27,279 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:43:27,280 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 324 treesize of output 298 [2023-11-10 12:43:27,291 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-10 12:43:27,292 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-10 12:43:27,293 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-10 12:43:27,320 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:43:27,321 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 215 treesize of output 229 [2023-11-10 12:43:29,079 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:43:29,080 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 230 treesize of output 135 [2023-11-10 12:43:29,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-10 12:43:29,085 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-10 12:43:29,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-10 12:43:29,086 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-10 12:43:29,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-10 12:43:29,087 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 792 treesize of output 688 [2023-11-10 12:43:29,098 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-10 12:43:29,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-10 12:43:29,099 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-10 12:43:29,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-10 12:43:29,099 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-10 12:43:29,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-10 12:43:29,100 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 256 treesize of output 216 [2023-11-10 12:43:29,107 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-10 12:43:29,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-10 12:43:29,108 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-10 12:43:29,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-10 12:43:29,109 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-10 12:43:29,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-10 12:43:29,110 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 255 treesize of output 175 [2023-11-10 12:43:30,217 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:43:30,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136702741] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:43:30,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:43:30,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 36, 34] total 89 [2023-11-10 12:43:30,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430149928] [2023-11-10 12:43:30,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:43:30,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2023-11-10 12:43:30,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:43:30,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2023-11-10 12:43:30,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1673, Invalid=6109, Unknown=50, NotChecked=0, Total=7832 [2023-11-10 12:43:30,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 135 [2023-11-10 12:43:30,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 275 transitions, 4218 flow. Second operand has 89 states, 89 states have (on average 51.04494382022472) internal successors, (4543), 89 states have internal predecessors, (4543), 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) [2023-11-10 12:43:30,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:43:30,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 135 [2023-11-10 12:43:30,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:43:34,194 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_~front~0 4))) (let ((.cse9 (+ 2 c_~front~0)) (.cse7 (select |c_#memory_int| c_~queue~0.base)) (.cse15 (+ c_~queue~0.offset .cse10)) (.cse11 (+ c_~front~0 1)) (.cse20 (* c_~back~0 4))) (let ((.cse8 (+ c_~queue~0.offset .cse20)) (.cse17 (+ c_~queue~0.offset .cse20 8)) (.cse13 (+ c_~queue~0.offset .cse10 4)) (.cse14 (+ c_~queue~0.offset .cse10 8)) (.cse16 (+ c_~queue~0.offset .cse20 4)) (.cse1 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (= c_~back~0 c_~front~0))) (.cse4 (< c_~n~0 .cse11)) (.cse5 (let ((.cse28 (+ c_~sum~0 (select .cse7 .cse15)))) (and (<= .cse28 1) (<= 0 .cse28)))) (.cse6 (< c_~front~0 0)) (.cse0 (< .cse9 0)) (.cse2 (< c_~back~0 c_~front~0)) (.cse3 (< c_~n~0 (+ c_~back~0 3)))) (and (or .cse0 .cse1 (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post19#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse2 .cse3) (or .cse4 .cse2 .cse5 .cse6 (not (= (select .cse7 .cse8) 1))) (or (< c_~n~0 .cse9) (and (= (+ c_~sum~0 (select .cse7 .cse10)) 0) (= c_~n~0 .cse9) (= .cse11 c_~back~0)) (and (= (+ c_~sum~0 (select .cse7 4)) 0) (= c_~front~0 1) (= c_~back~0 2))) (or .cse0 (and (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_566 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_567) c_~queue~0.base))) (or (not (= (select .cse12 .cse8) 1)) (< 0 (+ c_~sum~0 (select .cse12 .cse13) (select .cse12 .cse14) (select .cse12 .cse15) 1)) (not (= (+ (select .cse12 .cse16) 1) 0)) (not (= (select .cse12 .cse17) 1))))) (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_566 (Array Int Int))) (let ((.cse18 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_567) c_~queue~0.base))) (or (< (+ c_~sum~0 (select .cse18 .cse13) (select .cse18 .cse14) (select .cse18 .cse15)) 2) (not (= (select .cse18 .cse8) 1)) (not (= (+ (select .cse18 .cse16) 1) 0)) (not (= (select .cse18 .cse17) 1)))))) .cse2 .cse3) (= c_~sum~0 1) (or .cse0 (and (forall ((v_~queue~0.offset_53 Int)) (or (< |c_ULTIMATE.start_main_#t~ret11#1.offset| v_~queue~0.offset_53) (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_566 (Array Int Int))) (let ((.cse19 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_567) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (or (not (= (select .cse19 (+ .cse20 v_~queue~0.offset_53)) 1)) (not (= (+ (select .cse19 (+ .cse20 4 v_~queue~0.offset_53)) 1) 0)) (not (= (select .cse19 (+ .cse20 8 v_~queue~0.offset_53)) 1)) (< 0 (+ c_~sum~0 (select .cse19 (+ .cse10 8 v_~queue~0.offset_53)) (select .cse19 (+ .cse10 4 v_~queue~0.offset_53)) (select .cse19 (+ .cse10 v_~queue~0.offset_53)) 1))))))) (forall ((v_~queue~0.offset_53 Int)) (or (< |c_ULTIMATE.start_main_#t~ret11#1.offset| v_~queue~0.offset_53) (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_566 (Array Int Int))) (let ((.cse21 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_567) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (or (< (+ c_~sum~0 (select .cse21 (+ .cse10 8 v_~queue~0.offset_53)) (select .cse21 (+ .cse10 4 v_~queue~0.offset_53)) (select .cse21 (+ .cse10 v_~queue~0.offset_53))) 2) (not (= (select .cse21 (+ .cse20 v_~queue~0.offset_53)) 1)) (not (= (+ (select .cse21 (+ .cse20 4 v_~queue~0.offset_53)) 1) 0)) (not (= (select .cse21 (+ .cse20 8 v_~queue~0.offset_53)) 1)))))))) .cse2 .cse3) (or .cse0 .cse1 (< 4 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse2 .cse3) (= c_~queue~0.offset 0) (or .cse0 (< 1 c_~back~0) .cse1 .cse2) (or .cse0 .cse2 .cse3 (and (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (v_~queue~0.offset_53 Int)) (let ((.cse22 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_567) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (< (+ c_~sum~0 (select .cse22 (+ .cse10 8 v_~queue~0.offset_53)) (select .cse22 (+ .cse10 v_~queue~0.offset_53)) (select .cse22 (+ .cse10 4 v_~queue~0.offset_53))) 2) (not (= (select .cse22 (+ .cse20 v_~queue~0.offset_53)) 1)) (not (= (+ (select .cse22 (+ .cse20 4 v_~queue~0.offset_53)) 1) 0)) (not (= (select .cse22 (+ .cse20 8 v_~queue~0.offset_53)) 1)) (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| v_~queue~0.offset_53)))) (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (v_~queue~0.offset_53 Int)) (let ((.cse23 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_567) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse23 (+ .cse20 v_~queue~0.offset_53)) 1)) (not (= (+ (select .cse23 (+ .cse20 4 v_~queue~0.offset_53)) 1) 0)) (not (= (select .cse23 (+ .cse20 8 v_~queue~0.offset_53)) 1)) (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| v_~queue~0.offset_53) (< 0 (+ c_~sum~0 (select .cse23 (+ .cse10 8 v_~queue~0.offset_53)) (select .cse23 (+ .cse10 v_~queue~0.offset_53)) (select .cse23 (+ .cse10 4 v_~queue~0.offset_53)) 1))))))) (or .cse0 .cse1 .cse2 .cse3 (< 4 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (or .cse0 (and (forall ((v_ArrVal_567 (Array Int Int))) (let ((.cse24 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_567) c_~queue~0.base))) (or (not (= (select .cse24 .cse8) 1)) (< (+ c_~sum~0 (select .cse24 .cse13) (select .cse24 .cse15) (select .cse24 .cse14)) 2) (not (= (select .cse24 .cse17) 1)) (not (= (+ (select .cse24 .cse16) 1) 0))))) (forall ((v_ArrVal_567 (Array Int Int))) (let ((.cse25 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_567) c_~queue~0.base))) (or (not (= (select .cse25 .cse8) 1)) (not (= (select .cse25 .cse17) 1)) (< 0 (+ c_~sum~0 (select .cse25 .cse13) (select .cse25 .cse15) 1 (select .cse25 .cse14))) (not (= (+ (select .cse25 .cse16) 1) 0)))))) .cse2 .cse3) (or .cse0 .cse1 .cse2 (< (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse3) (or .cse4 (< c_~back~0 .cse11) .cse5 .cse6) (or .cse0 .cse2 .cse3 (and (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (v_~queue~0.offset_53 Int)) (let ((.cse26 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_567) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse26 (+ .cse20 v_~queue~0.offset_53)) 1)) (not (= (select .cse26 (+ .cse20 8 v_~queue~0.offset_53)) 1)) (not (= (+ (select .cse26 (+ .cse20 4 v_~queue~0.offset_53)) 1) 0)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| v_~queue~0.offset_53) (< (+ c_~sum~0 (select .cse26 (+ .cse10 v_~queue~0.offset_53)) (select .cse26 (+ .cse10 8 v_~queue~0.offset_53)) (select .cse26 (+ .cse10 4 v_~queue~0.offset_53))) 2)))) (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (v_~queue~0.offset_53 Int)) (let ((.cse27 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_567) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse27 (+ .cse20 v_~queue~0.offset_53)) 1)) (not (= (select .cse27 (+ .cse20 8 v_~queue~0.offset_53)) 1)) (not (= (+ (select .cse27 (+ .cse20 4 v_~queue~0.offset_53)) 1) 0)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| v_~queue~0.offset_53) (< 0 (+ c_~sum~0 (select .cse27 (+ .cse10 v_~queue~0.offset_53)) (select .cse27 (+ .cse10 8 v_~queue~0.offset_53)) 1 (select .cse27 (+ .cse10 4 v_~queue~0.offset_53))))))))))))) is different from false [2023-11-10 12:43:37,107 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~queue~0.base))) (let ((.cse1 (* c_~front~0 4)) (.cse22 (* c_~back~0 4)) (.cse27 (select .cse0 4))) (let ((.cse8 (not (= c_~front~0 1))) (.cse25 (< c_~n~0 4)) (.cse26 (= c_~back~0 2)) (.cse24 (= .cse27 1)) (.cse9 (<= c_~n~0 4)) (.cse10 (<= 1 c_~front~0)) (.cse12 (< c_~front~0 0)) (.cse11 (= c_~front~0 0)) (.cse28 (= (select .cse0 0) 1)) (.cse14 (+ c_~queue~0.offset .cse22)) (.cse19 (+ c_~queue~0.offset .cse22 8)) (.cse15 (+ c_~queue~0.offset .cse1 4)) (.cse17 (+ c_~queue~0.offset .cse1)) (.cse16 (+ c_~queue~0.offset .cse1 8)) (.cse18 (+ c_~queue~0.offset .cse22 4)) (.cse3 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (= c_~back~0 c_~front~0))) (.cse2 (< (+ 2 c_~front~0) 0)) (.cse4 (< c_~back~0 c_~front~0)) (.cse5 (< c_~n~0 (+ c_~back~0 3))) (.cse31 (= c_~sum~0 0)) (.cse6 (+ c_~front~0 1))) (and (= (select .cse0 (+ c_~queue~0.offset .cse1 (- 8))) 1) (or .cse2 .cse3 (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post19#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse4 .cse5) (<= c_~back~0 .cse6) (<= c_~queue~0.offset 0) (or (let ((.cse7 (= c_~back~0 0))) (and (or .cse7 (and (or .cse8 (< (+ c_~back~0 c_~n~0) 6)) .cse9 .cse10)) (or (not .cse7) .cse11 .cse12))) (< c_~back~0 0)) (or .cse2 (and (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_566 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_567) c_~queue~0.base))) (or (not (= (select .cse13 .cse14) 1)) (< 0 (+ c_~sum~0 (select .cse13 .cse15) (select .cse13 .cse16) (select .cse13 .cse17) 1)) (not (= (+ (select .cse13 .cse18) 1) 0)) (not (= (select .cse13 .cse19) 1))))) (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_566 (Array Int Int))) (let ((.cse20 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_567) c_~queue~0.base))) (or (< (+ c_~sum~0 (select .cse20 .cse15) (select .cse20 .cse16) (select .cse20 .cse17)) 2) (not (= (select .cse20 .cse14) 1)) (not (= (+ (select .cse20 .cse18) 1) 0)) (not (= (select .cse20 .cse19) 1)))))) .cse4 .cse5) (or .cse2 (and (forall ((v_~queue~0.offset_53 Int)) (or (< |c_ULTIMATE.start_main_#t~ret11#1.offset| v_~queue~0.offset_53) (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_566 (Array Int Int))) (let ((.cse21 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_567) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (or (not (= (select .cse21 (+ .cse22 v_~queue~0.offset_53)) 1)) (not (= (+ (select .cse21 (+ .cse22 4 v_~queue~0.offset_53)) 1) 0)) (not (= (select .cse21 (+ .cse22 8 v_~queue~0.offset_53)) 1)) (< 0 (+ c_~sum~0 (select .cse21 (+ .cse1 8 v_~queue~0.offset_53)) (select .cse21 (+ .cse1 4 v_~queue~0.offset_53)) (select .cse21 (+ .cse1 v_~queue~0.offset_53)) 1))))))) (forall ((v_~queue~0.offset_53 Int)) (or (< |c_ULTIMATE.start_main_#t~ret11#1.offset| v_~queue~0.offset_53) (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_566 (Array Int Int))) (let ((.cse23 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_567) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (or (< (+ c_~sum~0 (select .cse23 (+ .cse1 8 v_~queue~0.offset_53)) (select .cse23 (+ .cse1 4 v_~queue~0.offset_53)) (select .cse23 (+ .cse1 v_~queue~0.offset_53))) 2) (not (= (select .cse23 (+ .cse22 v_~queue~0.offset_53)) 1)) (not (= (+ (select .cse23 (+ .cse22 4 v_~queue~0.offset_53)) 1) 0)) (not (= (select .cse23 (+ .cse22 8 v_~queue~0.offset_53)) 1)))))))) .cse4 .cse5) .cse9 (= .cse6 c_~back~0) (or .cse2 .cse3 (< 4 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse4 .cse5) (or (and (or (and (= (+ (select .cse0 8) 1) 0) (= c_~back~0 3) .cse24) .cse8 .cse25) .cse9 .cse10) (and .cse26 (= (+ .cse27 1) 0) .cse11 .cse28) .cse12) (= c_~queue~0.offset 0) (or .cse2 (< 1 c_~back~0) .cse3 .cse4) (or .cse2 .cse4 .cse5 (and (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (v_~queue~0.offset_53 Int)) (let ((.cse29 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_567) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (< (+ c_~sum~0 (select .cse29 (+ .cse1 8 v_~queue~0.offset_53)) (select .cse29 (+ .cse1 v_~queue~0.offset_53)) (select .cse29 (+ .cse1 4 v_~queue~0.offset_53))) 2) (not (= (select .cse29 (+ .cse22 v_~queue~0.offset_53)) 1)) (not (= (+ (select .cse29 (+ .cse22 4 v_~queue~0.offset_53)) 1) 0)) (not (= (select .cse29 (+ .cse22 8 v_~queue~0.offset_53)) 1)) (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| v_~queue~0.offset_53)))) (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (v_~queue~0.offset_53 Int)) (let ((.cse30 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_567) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse30 (+ .cse22 v_~queue~0.offset_53)) 1)) (not (= (+ (select .cse30 (+ .cse22 4 v_~queue~0.offset_53)) 1) 0)) (not (= (select .cse30 (+ .cse22 8 v_~queue~0.offset_53)) 1)) (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| v_~queue~0.offset_53) (< 0 (+ c_~sum~0 (select .cse30 (+ .cse1 8 v_~queue~0.offset_53)) (select .cse30 (+ .cse1 v_~queue~0.offset_53)) (select .cse30 (+ .cse1 4 v_~queue~0.offset_53)) 1))))))) (= (+ (select .cse0 (+ c_~queue~0.offset .cse1 (- 4))) 1) 0) (or (and (or .cse8 .cse25 (and .cse26 .cse24)) .cse9 .cse10) .cse12 (and .cse11 (= c_~back~0 1) .cse28)) (<= 0 c_~front~0) (= (select .cse0 .cse17) 1) (or .cse2 .cse3 .cse4 .cse5 (< 4 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (or (< c_~n~0 .cse6) (and (= (select .cse0 .cse1) 1) .cse31)) (or .cse2 (and (forall ((v_ArrVal_567 (Array Int Int))) (let ((.cse32 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_567) c_~queue~0.base))) (or (not (= (select .cse32 .cse14) 1)) (< (+ c_~sum~0 (select .cse32 .cse15) (select .cse32 .cse17) (select .cse32 .cse16)) 2) (not (= (select .cse32 .cse19) 1)) (not (= (+ (select .cse32 .cse18) 1) 0))))) (forall ((v_ArrVal_567 (Array Int Int))) (let ((.cse33 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_567) c_~queue~0.base))) (or (not (= (select .cse33 .cse14) 1)) (not (= (select .cse33 .cse19) 1)) (< 0 (+ c_~sum~0 (select .cse33 .cse15) (select .cse33 .cse17) 1 (select .cse33 .cse16))) (not (= (+ (select .cse33 .cse18) 1) 0)))))) .cse4 .cse5) (or .cse2 .cse3 .cse4 (< (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse5) (or .cse2 .cse4 .cse5 (and (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (v_~queue~0.offset_53 Int)) (let ((.cse34 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_567) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse34 (+ .cse22 v_~queue~0.offset_53)) 1)) (not (= (select .cse34 (+ .cse22 8 v_~queue~0.offset_53)) 1)) (not (= (+ (select .cse34 (+ .cse22 4 v_~queue~0.offset_53)) 1) 0)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| v_~queue~0.offset_53) (< (+ c_~sum~0 (select .cse34 (+ .cse1 v_~queue~0.offset_53)) (select .cse34 (+ .cse1 8 v_~queue~0.offset_53)) (select .cse34 (+ .cse1 4 v_~queue~0.offset_53))) 2)))) (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (v_~queue~0.offset_53 Int)) (let ((.cse35 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_567) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse35 (+ .cse22 v_~queue~0.offset_53)) 1)) (not (= (select .cse35 (+ .cse22 8 v_~queue~0.offset_53)) 1)) (not (= (+ (select .cse35 (+ .cse22 4 v_~queue~0.offset_53)) 1) 0)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| v_~queue~0.offset_53) (< 0 (+ c_~sum~0 (select .cse35 (+ .cse1 v_~queue~0.offset_53)) (select .cse35 (+ .cse1 8 v_~queue~0.offset_53)) 1 (select .cse35 (+ .cse1 4 v_~queue~0.offset_53))))))))) .cse31 (let ((.cse36 (+ c_~back~0 1))) (or (< c_~front~0 .cse36) (< 0 .cse36))) (<= .cse6 c_~n~0))))) is different from false [2023-11-10 12:43:43,512 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 2 c_~front~0)) (.cse6 (* c_~front~0 4)) (.cse17 (* c_~back~0 4))) (let ((.cse7 (+ c_~front~0 1)) (.cse5 (select |c_#memory_int| c_~queue~0.base)) (.cse9 (+ c_~queue~0.offset .cse17)) (.cse14 (+ c_~queue~0.offset .cse17 8)) (.cse10 (+ c_~queue~0.offset .cse6 4)) (.cse12 (+ c_~queue~0.offset .cse6)) (.cse11 (+ c_~queue~0.offset .cse6 8)) (.cse13 (+ c_~queue~0.offset .cse17 4)) (.cse1 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (= c_~back~0 c_~front~0))) (.cse0 (< .cse4 0)) (.cse2 (< c_~back~0 c_~front~0)) (.cse3 (< c_~n~0 (+ c_~back~0 3)))) (and (or .cse0 .cse1 (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post19#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse2 .cse3) (or (< c_~n~0 .cse4) (and (= (+ c_~sum~0 (select .cse5 .cse6)) 0) (= c_~n~0 .cse4) (= .cse7 c_~back~0)) (and (= (+ c_~sum~0 (select .cse5 4)) 0) (= c_~front~0 1) (= c_~back~0 2))) (or .cse0 (and (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_566 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_567) c_~queue~0.base))) (or (not (= (select .cse8 .cse9) 1)) (< 0 (+ c_~sum~0 (select .cse8 .cse10) (select .cse8 .cse11) (select .cse8 .cse12) 1)) (not (= (+ (select .cse8 .cse13) 1) 0)) (not (= (select .cse8 .cse14) 1))))) (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_566 (Array Int Int))) (let ((.cse15 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_567) c_~queue~0.base))) (or (< (+ c_~sum~0 (select .cse15 .cse10) (select .cse15 .cse11) (select .cse15 .cse12)) 2) (not (= (select .cse15 .cse9) 1)) (not (= (+ (select .cse15 .cse13) 1) 0)) (not (= (select .cse15 .cse14) 1)))))) .cse2 .cse3) (= c_~sum~0 1) (or .cse0 (and (forall ((v_~queue~0.offset_53 Int)) (or (< |c_ULTIMATE.start_main_#t~ret11#1.offset| v_~queue~0.offset_53) (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_566 (Array Int Int))) (let ((.cse16 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_567) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (or (not (= (select .cse16 (+ .cse17 v_~queue~0.offset_53)) 1)) (not (= (+ (select .cse16 (+ .cse17 4 v_~queue~0.offset_53)) 1) 0)) (not (= (select .cse16 (+ .cse17 8 v_~queue~0.offset_53)) 1)) (< 0 (+ c_~sum~0 (select .cse16 (+ .cse6 8 v_~queue~0.offset_53)) (select .cse16 (+ .cse6 4 v_~queue~0.offset_53)) (select .cse16 (+ .cse6 v_~queue~0.offset_53)) 1))))))) (forall ((v_~queue~0.offset_53 Int)) (or (< |c_ULTIMATE.start_main_#t~ret11#1.offset| v_~queue~0.offset_53) (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_566 (Array Int Int))) (let ((.cse18 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_567) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (or (< (+ c_~sum~0 (select .cse18 (+ .cse6 8 v_~queue~0.offset_53)) (select .cse18 (+ .cse6 4 v_~queue~0.offset_53)) (select .cse18 (+ .cse6 v_~queue~0.offset_53))) 2) (not (= (select .cse18 (+ .cse17 v_~queue~0.offset_53)) 1)) (not (= (+ (select .cse18 (+ .cse17 4 v_~queue~0.offset_53)) 1) 0)) (not (= (select .cse18 (+ .cse17 8 v_~queue~0.offset_53)) 1)))))))) .cse2 .cse3) (or .cse0 .cse1 (< 4 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse2 .cse3) (or (< c_~n~0 .cse7) .cse2 (= |c_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (let ((.cse19 (+ c_~sum~0 (select .cse5 .cse12)))) (and (<= .cse19 1) (<= 0 .cse19))) (< c_~front~0 0) (not (= (select .cse5 .cse9) 1))) (= c_~queue~0.offset 0) (or .cse0 (< 1 c_~back~0) .cse1 .cse2) (or .cse0 .cse2 .cse3 (and (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (v_~queue~0.offset_53 Int)) (let ((.cse20 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_567) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (< (+ c_~sum~0 (select .cse20 (+ .cse6 8 v_~queue~0.offset_53)) (select .cse20 (+ .cse6 v_~queue~0.offset_53)) (select .cse20 (+ .cse6 4 v_~queue~0.offset_53))) 2) (not (= (select .cse20 (+ .cse17 v_~queue~0.offset_53)) 1)) (not (= (+ (select .cse20 (+ .cse17 4 v_~queue~0.offset_53)) 1) 0)) (not (= (select .cse20 (+ .cse17 8 v_~queue~0.offset_53)) 1)) (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| v_~queue~0.offset_53)))) (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (v_~queue~0.offset_53 Int)) (let ((.cse21 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_567) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse21 (+ .cse17 v_~queue~0.offset_53)) 1)) (not (= (+ (select .cse21 (+ .cse17 4 v_~queue~0.offset_53)) 1) 0)) (not (= (select .cse21 (+ .cse17 8 v_~queue~0.offset_53)) 1)) (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| v_~queue~0.offset_53) (< 0 (+ c_~sum~0 (select .cse21 (+ .cse6 8 v_~queue~0.offset_53)) (select .cse21 (+ .cse6 v_~queue~0.offset_53)) (select .cse21 (+ .cse6 4 v_~queue~0.offset_53)) 1))))))) (or .cse0 .cse1 .cse2 .cse3 (< 4 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (or .cse0 (and (forall ((v_ArrVal_567 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_567) c_~queue~0.base))) (or (not (= (select .cse22 .cse9) 1)) (< (+ c_~sum~0 (select .cse22 .cse10) (select .cse22 .cse12) (select .cse22 .cse11)) 2) (not (= (select .cse22 .cse14) 1)) (not (= (+ (select .cse22 .cse13) 1) 0))))) (forall ((v_ArrVal_567 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_567) c_~queue~0.base))) (or (not (= (select .cse23 .cse9) 1)) (not (= (select .cse23 .cse14) 1)) (< 0 (+ c_~sum~0 (select .cse23 .cse10) (select .cse23 .cse12) 1 (select .cse23 .cse11))) (not (= (+ (select .cse23 .cse13) 1) 0)))))) .cse2 .cse3) (or .cse0 .cse1 .cse2 (< (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse3) (or .cse0 .cse2 .cse3 (and (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (v_~queue~0.offset_53 Int)) (let ((.cse24 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_567) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse24 (+ .cse17 v_~queue~0.offset_53)) 1)) (not (= (select .cse24 (+ .cse17 8 v_~queue~0.offset_53)) 1)) (not (= (+ (select .cse24 (+ .cse17 4 v_~queue~0.offset_53)) 1) 0)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| v_~queue~0.offset_53) (< (+ c_~sum~0 (select .cse24 (+ .cse6 v_~queue~0.offset_53)) (select .cse24 (+ .cse6 8 v_~queue~0.offset_53)) (select .cse24 (+ .cse6 4 v_~queue~0.offset_53))) 2)))) (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (v_~queue~0.offset_53 Int)) (let ((.cse25 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_567) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse25 (+ .cse17 v_~queue~0.offset_53)) 1)) (not (= (select .cse25 (+ .cse17 8 v_~queue~0.offset_53)) 1)) (not (= (+ (select .cse25 (+ .cse17 4 v_~queue~0.offset_53)) 1) 0)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| v_~queue~0.offset_53) (< 0 (+ c_~sum~0 (select .cse25 (+ .cse6 v_~queue~0.offset_53)) (select .cse25 (+ .cse6 8 v_~queue~0.offset_53)) 1 (select .cse25 (+ .cse6 4 v_~queue~0.offset_53)))))))))))) is different from false [2023-11-10 12:43:45,679 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 2 c_~front~0)) (.cse6 (* c_~front~0 4)) (.cse16 (* c_~back~0 4))) (let ((.cse8 (+ c_~queue~0.offset .cse16)) (.cse13 (+ c_~queue~0.offset .cse16 8)) (.cse9 (+ c_~queue~0.offset .cse6 4)) (.cse11 (+ c_~queue~0.offset .cse6)) (.cse10 (+ c_~queue~0.offset .cse6 8)) (.cse12 (+ c_~queue~0.offset .cse16 4)) (.cse1 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (= c_~back~0 c_~front~0))) (.cse0 (< .cse4 0)) (.cse2 (< c_~back~0 c_~front~0)) (.cse3 (< c_~n~0 (+ c_~back~0 3)))) (and (or .cse0 .cse1 (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post19#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse2 .cse3) (let ((.cse5 (select |c_#memory_int| c_~queue~0.base))) (or (< c_~n~0 .cse4) (and (= (+ c_~sum~0 (select .cse5 .cse6)) 0) (= c_~n~0 .cse4) (= (+ c_~front~0 1) c_~back~0)) (and (= (+ c_~sum~0 (select .cse5 4)) 0) (= c_~front~0 1) (= c_~back~0 2)))) (or .cse0 (and (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_566 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_567) c_~queue~0.base))) (or (not (= (select .cse7 .cse8) 1)) (< 0 (+ c_~sum~0 (select .cse7 .cse9) (select .cse7 .cse10) (select .cse7 .cse11) 1)) (not (= (+ (select .cse7 .cse12) 1) 0)) (not (= (select .cse7 .cse13) 1))))) (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_566 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_567) c_~queue~0.base))) (or (< (+ c_~sum~0 (select .cse14 .cse9) (select .cse14 .cse10) (select .cse14 .cse11)) 2) (not (= (select .cse14 .cse8) 1)) (not (= (+ (select .cse14 .cse12) 1) 0)) (not (= (select .cse14 .cse13) 1)))))) .cse2 .cse3) (= c_~sum~0 1) (or .cse0 (and (forall ((v_~queue~0.offset_53 Int)) (or (< |c_ULTIMATE.start_main_#t~ret11#1.offset| v_~queue~0.offset_53) (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_566 (Array Int Int))) (let ((.cse15 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_567) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (or (not (= (select .cse15 (+ .cse16 v_~queue~0.offset_53)) 1)) (not (= (+ (select .cse15 (+ .cse16 4 v_~queue~0.offset_53)) 1) 0)) (not (= (select .cse15 (+ .cse16 8 v_~queue~0.offset_53)) 1)) (< 0 (+ c_~sum~0 (select .cse15 (+ .cse6 8 v_~queue~0.offset_53)) (select .cse15 (+ .cse6 4 v_~queue~0.offset_53)) (select .cse15 (+ .cse6 v_~queue~0.offset_53)) 1))))))) (forall ((v_~queue~0.offset_53 Int)) (or (< |c_ULTIMATE.start_main_#t~ret11#1.offset| v_~queue~0.offset_53) (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_566 (Array Int Int))) (let ((.cse17 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_567) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (or (< (+ c_~sum~0 (select .cse17 (+ .cse6 8 v_~queue~0.offset_53)) (select .cse17 (+ .cse6 4 v_~queue~0.offset_53)) (select .cse17 (+ .cse6 v_~queue~0.offset_53))) 2) (not (= (select .cse17 (+ .cse16 v_~queue~0.offset_53)) 1)) (not (= (+ (select .cse17 (+ .cse16 4 v_~queue~0.offset_53)) 1) 0)) (not (= (select .cse17 (+ .cse16 8 v_~queue~0.offset_53)) 1)))))))) .cse2 .cse3) (or .cse0 .cse1 (< 4 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse2 .cse3) (= c_~queue~0.offset 0) (or .cse0 (< 1 c_~back~0) .cse1 .cse2) (or .cse0 .cse2 .cse3 (and (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (v_~queue~0.offset_53 Int)) (let ((.cse18 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_567) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (< (+ c_~sum~0 (select .cse18 (+ .cse6 8 v_~queue~0.offset_53)) (select .cse18 (+ .cse6 v_~queue~0.offset_53)) (select .cse18 (+ .cse6 4 v_~queue~0.offset_53))) 2) (not (= (select .cse18 (+ .cse16 v_~queue~0.offset_53)) 1)) (not (= (+ (select .cse18 (+ .cse16 4 v_~queue~0.offset_53)) 1) 0)) (not (= (select .cse18 (+ .cse16 8 v_~queue~0.offset_53)) 1)) (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| v_~queue~0.offset_53)))) (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (v_~queue~0.offset_53 Int)) (let ((.cse19 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_567) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse19 (+ .cse16 v_~queue~0.offset_53)) 1)) (not (= (+ (select .cse19 (+ .cse16 4 v_~queue~0.offset_53)) 1) 0)) (not (= (select .cse19 (+ .cse16 8 v_~queue~0.offset_53)) 1)) (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| v_~queue~0.offset_53) (< 0 (+ c_~sum~0 (select .cse19 (+ .cse6 8 v_~queue~0.offset_53)) (select .cse19 (+ .cse6 v_~queue~0.offset_53)) (select .cse19 (+ .cse6 4 v_~queue~0.offset_53)) 1))))))) (or .cse0 .cse1 .cse2 .cse3 (< 4 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (or .cse0 (and (forall ((v_ArrVal_567 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_567) c_~queue~0.base))) (or (not (= (select .cse20 .cse8) 1)) (< (+ c_~sum~0 (select .cse20 .cse9) (select .cse20 .cse11) (select .cse20 .cse10)) 2) (not (= (select .cse20 .cse13) 1)) (not (= (+ (select .cse20 .cse12) 1) 0))))) (forall ((v_ArrVal_567 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_567) c_~queue~0.base))) (or (not (= (select .cse21 .cse8) 1)) (not (= (select .cse21 .cse13) 1)) (< 0 (+ c_~sum~0 (select .cse21 .cse9) (select .cse21 .cse11) 1 (select .cse21 .cse10))) (not (= (+ (select .cse21 .cse12) 1) 0)))))) .cse2 .cse3) (or .cse0 .cse1 .cse2 (< (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse3) (or .cse0 .cse2 .cse3 (and (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (v_~queue~0.offset_53 Int)) (let ((.cse22 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_567) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse22 (+ .cse16 v_~queue~0.offset_53)) 1)) (not (= (select .cse22 (+ .cse16 8 v_~queue~0.offset_53)) 1)) (not (= (+ (select .cse22 (+ .cse16 4 v_~queue~0.offset_53)) 1) 0)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| v_~queue~0.offset_53) (< (+ c_~sum~0 (select .cse22 (+ .cse6 v_~queue~0.offset_53)) (select .cse22 (+ .cse6 8 v_~queue~0.offset_53)) (select .cse22 (+ .cse6 4 v_~queue~0.offset_53))) 2)))) (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (v_~queue~0.offset_53 Int)) (let ((.cse23 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_567) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse23 (+ .cse16 v_~queue~0.offset_53)) 1)) (not (= (select .cse23 (+ .cse16 8 v_~queue~0.offset_53)) 1)) (not (= (+ (select .cse23 (+ .cse16 4 v_~queue~0.offset_53)) 1) 0)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| v_~queue~0.offset_53) (< 0 (+ c_~sum~0 (select .cse23 (+ .cse6 v_~queue~0.offset_53)) (select .cse23 (+ .cse6 8 v_~queue~0.offset_53)) 1 (select .cse23 (+ .cse6 4 v_~queue~0.offset_53)))))))))))) is different from false [2023-11-10 12:43:55,380 INFO L124 PetriNetUnfolderBase]: 8681/28135 cut-off events. [2023-11-10 12:43:55,380 INFO L125 PetriNetUnfolderBase]: For 604456/604906 co-relation queries the response was YES. [2023-11-10 12:43:55,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152477 conditions, 28135 events. 8681/28135 cut-off events. For 604456/604906 co-relation queries the response was YES. Maximal size of possible extension queue 774. Compared 338979 event pairs, 2276 based on Foata normal form. 145/26806 useless extension candidates. Maximal degree in co-relation 152342. Up to 8197 conditions per place. [2023-11-10 12:43:55,761 INFO L140 encePairwiseOnDemand]: 94/135 looper letters, 709 selfloop transitions, 324 changer transitions 226/1304 dead transitions. [2023-11-10 12:43:55,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 505 places, 1304 transitions, 22225 flow [2023-11-10 12:43:55,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2023-11-10 12:43:55,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2023-11-10 12:43:55,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 8548 transitions. [2023-11-10 12:43:55,768 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4033026657230479 [2023-11-10 12:43:55,768 INFO L72 ComplementDD]: Start complementDD. Operand 157 states and 8548 transitions. [2023-11-10 12:43:55,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 157 states and 8548 transitions. [2023-11-10 12:43:55,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:43:55,769 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 157 states and 8548 transitions. [2023-11-10 12:43:55,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 158 states, 157 states have (on average 54.445859872611464) internal successors, (8548), 157 states have internal predecessors, (8548), 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) [2023-11-10 12:43:55,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 158 states, 158 states have (on average 135.0) internal successors, (21330), 158 states have internal predecessors, (21330), 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) [2023-11-10 12:43:55,830 INFO L81 ComplementDD]: Finished complementDD. Result has 158 states, 158 states have (on average 135.0) internal successors, (21330), 158 states have internal predecessors, (21330), 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) [2023-11-10 12:43:55,830 INFO L175 Difference]: Start difference. First operand has 447 places, 275 transitions, 4218 flow. Second operand 157 states and 8548 transitions. [2023-11-10 12:43:55,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 505 places, 1304 transitions, 22225 flow [2023-11-10 12:43:56,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 1304 transitions, 16363 flow, removed 2487 selfloop flow, removed 95 redundant places. [2023-11-10 12:43:56,948 INFO L231 Difference]: Finished difference. Result has 509 places, 594 transitions, 10794 flow [2023-11-10 12:43:56,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=3624, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=157, PETRI_FLOW=10794, PETRI_PLACES=509, PETRI_TRANSITIONS=594} [2023-11-10 12:43:56,949 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, 389 predicate places. [2023-11-10 12:43:56,949 INFO L495 AbstractCegarLoop]: Abstraction has has 509 places, 594 transitions, 10794 flow [2023-11-10 12:43:56,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 89 states have (on average 51.04494382022472) internal successors, (4543), 89 states have internal predecessors, (4543), 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) [2023-11-10 12:43:56,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:43:56,950 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:43:56,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-11-10 12:43:57,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:43:57,155 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:43:57,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:43:57,155 INFO L85 PathProgramCache]: Analyzing trace with hash 493638271, now seen corresponding path program 16 times [2023-11-10 12:43:57,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:43:57,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399518561] [2023-11-10 12:43:57,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:43:57,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:43:57,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:43:58,878 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:43:58,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:43:58,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399518561] [2023-11-10 12:43:58,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399518561] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:43:58,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486316876] [2023-11-10 12:43:58,879 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-10 12:43:58,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:43:58,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:43:58,880 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 12:43:58,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-10 12:43:58,979 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-10 12:43:58,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:43:58,980 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 53 conjunts are in the unsatisfiable core [2023-11-10 12:43:58,988 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:44:00,139 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 6 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:44:00,139 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:44:00,805 INFO L322 Elim1Store]: treesize reduction 10, result has 88.2 percent of original size [2023-11-10 12:44:00,805 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 108 treesize of output 104 [2023-11-10 12:44:01,957 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:44:01,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486316876] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:44:01,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:44:01,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 24, 24] total 65 [2023-11-10 12:44:01,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432229639] [2023-11-10 12:44:01,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:44:01,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2023-11-10 12:44:01,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:44:01,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2023-11-10 12:44:01,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=837, Invalid=3323, Unknown=0, NotChecked=0, Total=4160 [2023-11-10 12:44:01,961 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 135 [2023-11-10 12:44:01,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 509 places, 594 transitions, 10794 flow. Second operand has 65 states, 65 states have (on average 64.07692307692308) internal successors, (4165), 65 states have internal predecessors, (4165), 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) [2023-11-10 12:44:01,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:44:01,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 135 [2023-11-10 12:44:01,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:44:22,189 INFO L124 PetriNetUnfolderBase]: 9730/38774 cut-off events. [2023-11-10 12:44:22,189 INFO L125 PetriNetUnfolderBase]: For 1354463/1356249 co-relation queries the response was YES. [2023-11-10 12:44:23,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237335 conditions, 38774 events. 9730/38774 cut-off events. For 1354463/1356249 co-relation queries the response was YES. Maximal size of possible extension queue 926. Compared 526463 event pairs, 2292 based on Foata normal form. 821/37276 useless extension candidates. Maximal degree in co-relation 237162. Up to 13164 conditions per place. [2023-11-10 12:44:23,511 INFO L140 encePairwiseOnDemand]: 107/135 looper letters, 475 selfloop transitions, 440 changer transitions 267/1302 dead transitions. [2023-11-10 12:44:23,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 596 places, 1302 transitions, 29697 flow [2023-11-10 12:44:23,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2023-11-10 12:44:23,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2023-11-10 12:44:23,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 8456 transitions. [2023-11-10 12:44:23,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48935185185185187 [2023-11-10 12:44:23,540 INFO L72 ComplementDD]: Start complementDD. Operand 128 states and 8456 transitions. [2023-11-10 12:44:23,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 128 states and 8456 transitions. [2023-11-10 12:44:23,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:44:23,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 128 states and 8456 transitions. [2023-11-10 12:44:23,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 129 states, 128 states have (on average 66.0625) internal successors, (8456), 128 states have internal predecessors, (8456), 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) [2023-11-10 12:44:23,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 129 states, 129 states have (on average 135.0) internal successors, (17415), 129 states have internal predecessors, (17415), 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) [2023-11-10 12:44:23,581 INFO L81 ComplementDD]: Finished complementDD. Result has 129 states, 129 states have (on average 135.0) internal successors, (17415), 129 states have internal predecessors, (17415), 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) [2023-11-10 12:44:23,581 INFO L175 Difference]: Start difference. First operand has 509 places, 594 transitions, 10794 flow. Second operand 128 states and 8456 transitions. [2023-11-10 12:44:23,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 596 places, 1302 transitions, 29697 flow [2023-11-10 12:44:26,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 536 places, 1302 transitions, 25768 flow, removed 1936 selfloop flow, removed 60 redundant places. [2023-11-10 12:44:26,095 INFO L231 Difference]: Finished difference. Result has 613 places, 771 transitions, 15495 flow [2023-11-10 12:44:26,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=9169, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=589, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=262, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=128, PETRI_FLOW=15495, PETRI_PLACES=613, PETRI_TRANSITIONS=771} [2023-11-10 12:44:26,096 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, 493 predicate places. [2023-11-10 12:44:26,096 INFO L495 AbstractCegarLoop]: Abstraction has has 613 places, 771 transitions, 15495 flow [2023-11-10 12:44:26,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 64.07692307692308) internal successors, (4165), 65 states have internal predecessors, (4165), 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) [2023-11-10 12:44:26,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:44:26,097 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:44:26,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-11-10 12:44:26,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:44:26,311 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:44:26,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:44:26,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1944980590, now seen corresponding path program 17 times [2023-11-10 12:44:26,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:44:26,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408466498] [2023-11-10 12:44:26,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:44:26,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:44:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:44:26,395 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 40 proven. 32 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-10 12:44:26,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:44:26,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408466498] [2023-11-10 12:44:26,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408466498] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:44:26,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926089545] [2023-11-10 12:44:26,395 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-10 12:44:26,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:44:26,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:44:26,396 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 12:44:26,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-11-10 12:44:26,557 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-11-10 12:44:26,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:44:26,559 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-10 12:44:26,560 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:44:26,699 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 40 proven. 32 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-10 12:44:26,699 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:44:27,037 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 28 proven. 44 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-10 12:44:27,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926089545] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:44:27,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:44:27,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 9] total 13 [2023-11-10 12:44:27,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136436936] [2023-11-10 12:44:27,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:44:27,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-10 12:44:27,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:44:27,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-10 12:44:27,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2023-11-10 12:44:27,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 135 [2023-11-10 12:44:27,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 613 places, 771 transitions, 15495 flow. Second operand has 13 states, 13 states have (on average 117.38461538461539) internal successors, (1526), 13 states have internal predecessors, (1526), 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) [2023-11-10 12:44:27,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:44:27,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 135 [2023-11-10 12:44:27,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand