./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound100.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 574ddb4e Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound100.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c39f3d25be406fa166da46a61b4a36c0a90262202dfdee83ae8e5211f182a6f7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 07:31:47,122 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 07:31:47,124 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 07:31:47,164 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 07:31:47,165 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 07:31:47,168 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 07:31:47,171 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 07:31:47,174 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 07:31:47,176 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 07:31:47,182 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 07:31:47,184 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 07:31:47,186 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 07:31:47,186 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 07:31:47,191 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 07:31:47,192 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 07:31:47,194 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 07:31:47,195 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 07:31:47,196 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 07:31:47,198 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 07:31:47,202 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 07:31:47,205 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 07:31:47,205 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 07:31:47,207 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 07:31:47,207 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 07:31:47,212 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 07:31:47,212 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 07:31:47,212 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 07:31:47,214 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 07:31:47,214 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 07:31:47,215 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 07:31:47,215 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 07:31:47,216 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 07:31:47,217 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 07:31:47,218 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 07:31:47,219 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 07:31:47,220 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 07:31:47,220 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 07:31:47,220 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 07:31:47,221 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 07:31:47,222 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 07:31:47,223 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 07:31:47,224 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 07:31:47,254 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 07:31:47,255 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 07:31:47,255 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 07:31:47,256 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 07:31:47,256 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 07:31:47,257 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 07:31:47,257 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 07:31:47,257 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 07:31:47,257 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 07:31:47,258 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 07:31:47,258 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 07:31:47,259 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 07:31:47,259 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 07:31:47,259 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 07:31:47,259 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 07:31:47,259 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 07:31:47,260 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 07:31:47,260 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 07:31:47,260 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 07:31:47,260 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 07:31:47,260 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 07:31:47,261 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 07:31:47,261 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 07:31:47,261 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 07:31:47,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 07:31:47,261 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 07:31:47,262 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 07:31:47,262 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 07:31:47,262 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 07:31:47,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 07:31:47,263 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 07:31:47,263 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 07:31:47,263 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 07:31:47,263 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 07:31:47,263 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 07:31:47,264 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c39f3d25be406fa166da46a61b4a36c0a90262202dfdee83ae8e5211f182a6f7 [2023-02-17 07:31:47,461 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 07:31:47,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 07:31:47,494 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 07:31:47,494 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 07:31:47,495 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 07:31:47,496 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound100.c [2023-02-17 07:31:48,605 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 07:31:48,818 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 07:31:48,818 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound100.c [2023-02-17 07:31:48,825 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c28ccecd/7d339a7b5fb84dbe8faa9ddc1b68e820/FLAG7343dd1f1 [2023-02-17 07:31:48,842 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c28ccecd/7d339a7b5fb84dbe8faa9ddc1b68e820 [2023-02-17 07:31:48,844 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 07:31:48,846 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 07:31:48,847 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 07:31:48,847 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 07:31:48,850 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 07:31:48,851 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 07:31:48" (1/1) ... [2023-02-17 07:31:48,852 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cd4eb2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:31:48, skipping insertion in model container [2023-02-17 07:31:48,852 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 07:31:48" (1/1) ... [2023-02-17 07:31:48,858 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 07:31:48,873 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 07:31:48,999 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound100.c[526,539] [2023-02-17 07:31:49,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 07:31:49,039 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 07:31:49,052 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound100.c[526,539] [2023-02-17 07:31:49,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 07:31:49,073 INFO L208 MainTranslator]: Completed translation [2023-02-17 07:31:49,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:31:49 WrapperNode [2023-02-17 07:31:49,075 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 07:31:49,076 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 07:31:49,076 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 07:31:49,077 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 07:31:49,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:31:49" (1/1) ... [2023-02-17 07:31:49,087 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:31:49" (1/1) ... [2023-02-17 07:31:49,106 INFO L138 Inliner]: procedures = 14, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2023-02-17 07:31:49,107 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 07:31:49,107 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 07:31:49,107 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 07:31:49,108 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 07:31:49,115 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:31:49" (1/1) ... [2023-02-17 07:31:49,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:31:49" (1/1) ... [2023-02-17 07:31:49,126 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:31:49" (1/1) ... [2023-02-17 07:31:49,127 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:31:49" (1/1) ... [2023-02-17 07:31:49,129 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:31:49" (1/1) ... [2023-02-17 07:31:49,132 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:31:49" (1/1) ... [2023-02-17 07:31:49,135 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:31:49" (1/1) ... [2023-02-17 07:31:49,136 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:31:49" (1/1) ... [2023-02-17 07:31:49,138 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 07:31:49,138 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 07:31:49,139 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 07:31:49,139 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 07:31:49,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:31:49" (1/1) ... [2023-02-17 07:31:49,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 07:31:49,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:31:49,166 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-02-17 07:31:49,167 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-02-17 07:31:49,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 07:31:49,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 07:31:49,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 07:31:49,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 07:31:49,192 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-17 07:31:49,192 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-17 07:31:49,247 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 07:31:49,248 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 07:31:49,411 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 07:31:49,416 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 07:31:49,424 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-17 07:31:49,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 07:31:49 BoogieIcfgContainer [2023-02-17 07:31:49,427 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 07:31:49,428 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 07:31:49,429 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 07:31:49,431 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 07:31:49,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 07:31:48" (1/3) ... [2023-02-17 07:31:49,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f7af394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 07:31:49, skipping insertion in model container [2023-02-17 07:31:49,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:31:49" (2/3) ... [2023-02-17 07:31:49,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f7af394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 07:31:49, skipping insertion in model container [2023-02-17 07:31:49,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 07:31:49" (3/3) ... [2023-02-17 07:31:49,434 INFO L112 eAbstractionObserver]: Analyzing ICFG hard2_valuebound100.c [2023-02-17 07:31:49,464 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 07:31:49,464 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 07:31:49,527 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 07:31:49,536 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@48ec1da7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 07:31:49,536 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 07:31:49,540 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-17 07:31:49,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-17 07:31:49,547 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:31:49,547 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:31:49,548 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:31:49,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:31:49,554 INFO L85 PathProgramCache]: Analyzing trace with hash -586848446, now seen corresponding path program 1 times [2023-02-17 07:31:49,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:31:49,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375703314] [2023-02-17 07:31:49,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:31:49,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:31:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:31:49,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 07:31:49,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:31:49,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375703314] [2023-02-17 07:31:49,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375703314] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 07:31:49,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 07:31:49,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 07:31:49,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743229692] [2023-02-17 07:31:49,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 07:31:49,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 07:31:49,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:31:49,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 07:31:49,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 07:31:49,777 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 07:31:49,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:31:49,803 INFO L93 Difference]: Finished difference Result 49 states and 83 transitions. [2023-02-17 07:31:49,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 07:31:49,806 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-17 07:31:49,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:31:49,812 INFO L225 Difference]: With dead ends: 49 [2023-02-17 07:31:49,812 INFO L226 Difference]: Without dead ends: 22 [2023-02-17 07:31:49,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 07:31:49,822 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 07:31:49,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 07:31:49,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-02-17 07:31:49,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-02-17 07:31:49,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-17 07:31:49,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2023-02-17 07:31:49,857 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 9 [2023-02-17 07:31:49,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:31:49,859 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2023-02-17 07:31:49,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 07:31:49,860 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2023-02-17 07:31:49,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-17 07:31:49,861 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:31:49,861 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:31:49,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 07:31:49,862 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:31:49,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:31:49,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1188158916, now seen corresponding path program 1 times [2023-02-17 07:31:49,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:31:49,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198891468] [2023-02-17 07:31:49,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:31:49,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:31:49,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:31:49,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 07:31:49,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:31:49,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198891468] [2023-02-17 07:31:49,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198891468] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 07:31:49,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 07:31:49,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 07:31:49,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764621004] [2023-02-17 07:31:49,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 07:31:49,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 07:31:49,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:31:49,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 07:31:49,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 07:31:49,996 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 07:31:50,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:31:50,053 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2023-02-17 07:31:50,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 07:31:50,054 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-17 07:31:50,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:31:50,056 INFO L225 Difference]: With dead ends: 35 [2023-02-17 07:31:50,056 INFO L226 Difference]: Without dead ends: 33 [2023-02-17 07:31:50,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 07:31:50,058 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 12 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 07:31:50,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 92 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 07:31:50,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-02-17 07:31:50,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2023-02-17 07:31:50,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-17 07:31:50,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2023-02-17 07:31:50,075 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2023-02-17 07:31:50,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:31:50,076 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2023-02-17 07:31:50,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 07:31:50,078 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2023-02-17 07:31:50,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-17 07:31:50,079 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:31:50,079 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:31:50,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-17 07:31:50,080 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:31:50,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:31:50,088 INFO L85 PathProgramCache]: Analyzing trace with hash -697944935, now seen corresponding path program 1 times [2023-02-17 07:31:50,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:31:50,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639217672] [2023-02-17 07:31:50,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:31:50,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:31:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:31:50,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 07:31:50,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:31:50,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 07:31:50,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:31:50,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639217672] [2023-02-17 07:31:50,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639217672] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 07:31:50,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 07:31:50,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 07:31:50,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357652554] [2023-02-17 07:31:50,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 07:31:50,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 07:31:50,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:31:50,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 07:31:50,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 07:31:50,219 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 07:31:50,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:31:50,287 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2023-02-17 07:31:50,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 07:31:50,288 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-02-17 07:31:50,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:31:50,289 INFO L225 Difference]: With dead ends: 39 [2023-02-17 07:31:50,290 INFO L226 Difference]: Without dead ends: 37 [2023-02-17 07:31:50,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 07:31:50,295 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 10 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 07:31:50,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 88 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 07:31:50,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-02-17 07:31:50,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2023-02-17 07:31:50,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-17 07:31:50,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2023-02-17 07:31:50,310 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 14 [2023-02-17 07:31:50,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:31:50,310 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2023-02-17 07:31:50,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 07:31:50,311 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2023-02-17 07:31:50,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-17 07:31:50,312 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:31:50,312 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:31:50,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-17 07:31:50,313 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:31:50,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:31:50,314 INFO L85 PathProgramCache]: Analyzing trace with hash 262992548, now seen corresponding path program 1 times [2023-02-17 07:31:50,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:31:50,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244739500] [2023-02-17 07:31:50,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:31:50,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:31:50,340 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 07:31:50,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [106814376] [2023-02-17 07:31:50,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:31:50,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:31:50,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:31:50,353 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-02-17 07:31:50,374 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-02-17 07:31:50,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:31:50,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-17 07:31:50,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:31:50,527 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 07:31:50,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:31:50,646 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 07:31:50,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:31:50,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244739500] [2023-02-17 07:31:50,647 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 07:31:50,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106814376] [2023-02-17 07:31:50,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106814376] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:31:50,648 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 07:31:50,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-17 07:31:50,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434249072] [2023-02-17 07:31:50,649 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 07:31:50,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 07:31:50,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:31:50,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 07:31:50,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-17 07:31:50,659 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 07:31:50,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:31:50,846 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2023-02-17 07:31:50,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 07:31:50,847 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 19 [2023-02-17 07:31:50,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:31:50,851 INFO L225 Difference]: With dead ends: 65 [2023-02-17 07:31:50,851 INFO L226 Difference]: Without dead ends: 51 [2023-02-17 07:31:50,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-17 07:31:50,859 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 30 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 07:31:50,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 48 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 07:31:50,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-02-17 07:31:50,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-02-17 07:31:50,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 33 states have internal predecessors, (35), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-02-17 07:31:50,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2023-02-17 07:31:50,880 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 19 [2023-02-17 07:31:50,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:31:50,881 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2023-02-17 07:31:50,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 07:31:50,881 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2023-02-17 07:31:50,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-17 07:31:50,882 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:31:50,882 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:31:50,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-17 07:31:51,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:31:51,088 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:31:51,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:31:51,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1807142342, now seen corresponding path program 1 times [2023-02-17 07:31:51,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:31:51,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428085407] [2023-02-17 07:31:51,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:31:51,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:31:51,097 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 07:31:51,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1837130152] [2023-02-17 07:31:51,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:31:51,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:31:51,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:31:51,101 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-02-17 07:31:51,103 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-02-17 07:31:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:31:51,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 07:31:51,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:31:51,188 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-17 07:31:51,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:31:51,276 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-17 07:31:51,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:31:51,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428085407] [2023-02-17 07:31:51,277 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 07:31:51,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837130152] [2023-02-17 07:31:51,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837130152] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:31:51,277 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 07:31:51,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2023-02-17 07:31:51,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796607794] [2023-02-17 07:31:51,278 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 07:31:51,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 07:31:51,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:31:51,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 07:31:51,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-02-17 07:31:51,280 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-17 07:31:51,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:31:51,407 INFO L93 Difference]: Finished difference Result 66 states and 83 transitions. [2023-02-17 07:31:51,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 07:31:51,407 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 26 [2023-02-17 07:31:51,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:31:51,410 INFO L225 Difference]: With dead ends: 66 [2023-02-17 07:31:51,410 INFO L226 Difference]: Without dead ends: 59 [2023-02-17 07:31:51,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-02-17 07:31:51,411 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 24 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 07:31:51,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 67 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 07:31:51,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-02-17 07:31:51,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2023-02-17 07:31:51,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 39 states have internal predecessors, (41), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-17 07:31:51,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2023-02-17 07:31:51,436 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 26 [2023-02-17 07:31:51,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:31:51,436 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2023-02-17 07:31:51,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-17 07:31:51,437 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2023-02-17 07:31:51,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-17 07:31:51,438 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:31:51,438 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:31:51,450 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-02-17 07:31:51,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:31:51,645 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:31:51,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:31:51,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1034157389, now seen corresponding path program 1 times [2023-02-17 07:31:51,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:31:51,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556291557] [2023-02-17 07:31:51,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:31:51,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:31:51,665 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 07:31:51,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [406982295] [2023-02-17 07:31:51,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:31:51,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:31:51,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:31:51,677 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-02-17 07:31:51,679 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-02-17 07:31:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:31:51,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-17 07:31:51,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:31:51,831 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-02-17 07:31:51,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:31:52,093 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-02-17 07:31:52,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:31:52,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556291557] [2023-02-17 07:31:52,094 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 07:31:52,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406982295] [2023-02-17 07:31:52,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406982295] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:31:52,095 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 07:31:52,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2023-02-17 07:31:52,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447150959] [2023-02-17 07:31:52,095 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 07:31:52,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-17 07:31:52,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:31:52,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-17 07:31:52,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2023-02-17 07:31:52,099 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) [2023-02-17 07:31:52,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:31:52,896 INFO L93 Difference]: Finished difference Result 142 states and 193 transitions. [2023-02-17 07:31:52,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 07:31:52,896 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) Word has length 56 [2023-02-17 07:31:52,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:31:52,898 INFO L225 Difference]: With dead ends: 142 [2023-02-17 07:31:52,898 INFO L226 Difference]: Without dead ends: 111 [2023-02-17 07:31:52,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 94 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2023-02-17 07:31:52,899 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 46 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-17 07:31:52,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 116 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-17 07:31:52,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-02-17 07:31:52,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2023-02-17 07:31:52,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 64 states have (on average 1.203125) internal successors, (77), 71 states have internal predecessors, (77), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (30), 24 states have call predecessors, (30), 30 states have call successors, (30) [2023-02-17 07:31:52,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 138 transitions. [2023-02-17 07:31:52,936 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 138 transitions. Word has length 56 [2023-02-17 07:31:52,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:31:52,936 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 138 transitions. [2023-02-17 07:31:52,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) [2023-02-17 07:31:52,937 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 138 transitions. [2023-02-17 07:31:52,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-02-17 07:31:52,938 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:31:52,938 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:31:52,953 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-02-17 07:31:53,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:31:53,152 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:31:53,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:31:53,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1199454569, now seen corresponding path program 1 times [2023-02-17 07:31:53,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:31:53,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979263381] [2023-02-17 07:31:53,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:31:53,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:31:53,161 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 07:31:53,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1472515517] [2023-02-17 07:31:53,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:31:53,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:31:53,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:31:53,163 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-02-17 07:31:53,185 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-02-17 07:31:53,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:31:53,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-17 07:31:53,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:31:53,283 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 19 proven. 37 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-17 07:31:53,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:31:53,494 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 19 proven. 37 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-17 07:31:53,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:31:53,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979263381] [2023-02-17 07:31:53,495 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 07:31:53,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472515517] [2023-02-17 07:31:53,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472515517] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:31:53,495 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 07:31:53,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2023-02-17 07:31:53,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333619694] [2023-02-17 07:31:53,496 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 07:31:53,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-17 07:31:53,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:31:53,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-17 07:31:53,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2023-02-17 07:31:53,498 INFO L87 Difference]: Start difference. First operand 106 states and 138 transitions. Second operand has 16 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 8 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2023-02-17 07:31:54,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:31:54,757 INFO L93 Difference]: Finished difference Result 161 states and 210 transitions. [2023-02-17 07:31:54,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-17 07:31:54,758 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 8 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) Word has length 67 [2023-02-17 07:31:54,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:31:54,760 INFO L225 Difference]: With dead ends: 161 [2023-02-17 07:31:54,760 INFO L226 Difference]: Without dead ends: 123 [2023-02-17 07:31:54,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 115 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2023-02-17 07:31:54,761 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 24 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-17 07:31:54,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 103 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-02-17 07:31:54,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-02-17 07:31:54,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 101. [2023-02-17 07:31:54,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 66 states have internal predecessors, (72), 27 states have call successors, (27), 11 states have call predecessors, (27), 11 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2023-02-17 07:31:54,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 125 transitions. [2023-02-17 07:31:54,809 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 125 transitions. Word has length 67 [2023-02-17 07:31:54,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:31:54,810 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 125 transitions. [2023-02-17 07:31:54,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 8 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2023-02-17 07:31:54,810 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 125 transitions. [2023-02-17 07:31:54,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-02-17 07:31:54,812 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:31:54,812 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 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] [2023-02-17 07:31:54,821 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-02-17 07:31:55,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:31:55,019 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:31:55,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:31:55,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1728532070, now seen corresponding path program 1 times [2023-02-17 07:31:55,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:31:55,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909868866] [2023-02-17 07:31:55,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:31:55,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:31:55,028 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 07:31:55,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1339243331] [2023-02-17 07:31:55,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:31:55,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:31:55,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:31:55,030 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-02-17 07:31:55,032 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-02-17 07:31:55,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:31:55,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-17 07:31:55,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:31:55,136 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-02-17 07:31:55,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:31:55,251 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-02-17 07:31:55,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:31:55,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909868866] [2023-02-17 07:31:55,251 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 07:31:55,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339243331] [2023-02-17 07:31:55,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339243331] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:31:55,252 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 07:31:55,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-02-17 07:31:55,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543955787] [2023-02-17 07:31:55,252 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 07:31:55,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 07:31:55,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:31:55,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 07:31:55,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-17 07:31:55,254 INFO L87 Difference]: Start difference. First operand 101 states and 125 transitions. Second operand has 12 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2023-02-17 07:31:55,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:31:55,451 INFO L93 Difference]: Finished difference Result 120 states and 144 transitions. [2023-02-17 07:31:55,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 07:31:55,452 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 72 [2023-02-17 07:31:55,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:31:55,453 INFO L225 Difference]: With dead ends: 120 [2023-02-17 07:31:55,453 INFO L226 Difference]: Without dead ends: 93 [2023-02-17 07:31:55,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2023-02-17 07:31:55,454 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 10 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 07:31:55,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 187 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 07:31:55,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-17 07:31:55,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2023-02-17 07:31:55,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 61 states have internal predecessors, (65), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2023-02-17 07:31:55,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 110 transitions. [2023-02-17 07:31:55,475 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 110 transitions. Word has length 72 [2023-02-17 07:31:55,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:31:55,475 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 110 transitions. [2023-02-17 07:31:55,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2023-02-17 07:31:55,476 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 110 transitions. [2023-02-17 07:31:55,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-02-17 07:31:55,477 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:31:55,477 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:31:55,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-17 07:31:55,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:31:55,684 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:31:55,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:31:55,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1412721000, now seen corresponding path program 1 times [2023-02-17 07:31:55,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:31:55,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489756885] [2023-02-17 07:31:55,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:31:55,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:31:55,701 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 07:31:55,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [422873560] [2023-02-17 07:31:55,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:31:55,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:31:55,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:31:55,703 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-02-17 07:31:55,705 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-02-17 07:31:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:31:55,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 07:31:55,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:31:55,822 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2023-02-17 07:31:55,828 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 07:31:55,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:31:55,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489756885] [2023-02-17 07:31:55,829 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 07:31:55,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422873560] [2023-02-17 07:31:55,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422873560] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 07:31:55,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 07:31:55,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 07:31:55,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771606681] [2023-02-17 07:31:55,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 07:31:55,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 07:31:55,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:31:55,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 07:31:55,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-17 07:31:55,831 INFO L87 Difference]: Start difference. First operand 93 states and 110 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2023-02-17 07:31:55,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:31:55,961 INFO L93 Difference]: Finished difference Result 125 states and 151 transitions. [2023-02-17 07:31:55,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 07:31:55,973 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 86 [2023-02-17 07:31:55,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:31:55,974 INFO L225 Difference]: With dead ends: 125 [2023-02-17 07:31:55,974 INFO L226 Difference]: Without dead ends: 88 [2023-02-17 07:31:55,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 76 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-17 07:31:55,975 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 07:31:55,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 101 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 07:31:55,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-17 07:31:55,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 79. [2023-02-17 07:31:56,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 50 states have (on average 1.08) internal successors, (54), 52 states have internal predecessors, (54), 18 states have call successors, (18), 10 states have call predecessors, (18), 10 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2023-02-17 07:31:56,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2023-02-17 07:31:56,007 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 86 [2023-02-17 07:31:56,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:31:56,008 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2023-02-17 07:31:56,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2023-02-17 07:31:56,008 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2023-02-17 07:31:56,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-02-17 07:31:56,009 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:31:56,009 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:31:56,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-17 07:31:56,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:31:56,216 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:31:56,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:31:56,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1193302554, now seen corresponding path program 2 times [2023-02-17 07:31:56,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:31:56,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933189230] [2023-02-17 07:31:56,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:31:56,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:31:56,224 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 07:31:56,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [862674400] [2023-02-17 07:31:56,225 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 07:31:56,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:31:56,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:31:56,226 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-02-17 07:31:56,232 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-02-17 07:31:56,282 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 07:31:56,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 07:31:56,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 45 conjunts are in the unsatisfiable core [2023-02-17 07:31:56,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:31:56,378 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 28 proven. 58 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-02-17 07:31:56,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:32:03,511 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 28 proven. 53 refuted. 5 times theorem prover too weak. 276 trivial. 0 not checked. [2023-02-17 07:32:03,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:32:03,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933189230] [2023-02-17 07:32:03,511 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 07:32:03,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862674400] [2023-02-17 07:32:03,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862674400] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:32:03,512 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 07:32:03,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2023-02-17 07:32:03,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170141701] [2023-02-17 07:32:03,512 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 07:32:03,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-17 07:32:03,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:32:03,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-17 07:32:03,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=336, Unknown=2, NotChecked=0, Total=420 [2023-02-17 07:32:03,514 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 19 states have internal predecessors, (44), 11 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 9 states have call predecessors, (26), 9 states have call successors, (26) [2023-02-17 07:32:11,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 07:32:11,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:32:11,928 INFO L93 Difference]: Finished difference Result 159 states and 203 transitions. [2023-02-17 07:32:11,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-17 07:32:11,929 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 19 states have internal predecessors, (44), 11 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 9 states have call predecessors, (26), 9 states have call successors, (26) Word has length 86 [2023-02-17 07:32:11,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:32:11,931 INFO L225 Difference]: With dead ends: 159 [2023-02-17 07:32:11,931 INFO L226 Difference]: Without dead ends: 134 [2023-02-17 07:32:11,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 147 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=151, Invalid=549, Unknown=2, NotChecked=0, Total=702 [2023-02-17 07:32:11,932 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 82 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 126 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2023-02-17 07:32:11,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 184 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 936 Invalid, 1 Unknown, 0 Unchecked, 7.1s Time] [2023-02-17 07:32:11,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-02-17 07:32:12,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 130. [2023-02-17 07:32:12,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 80 states have (on average 1.1375) internal successors, (91), 86 states have internal predecessors, (91), 36 states have call successors, (36), 13 states have call predecessors, (36), 13 states have return successors, (35), 30 states have call predecessors, (35), 35 states have call successors, (35) [2023-02-17 07:32:12,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 162 transitions. [2023-02-17 07:32:12,015 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 162 transitions. Word has length 86 [2023-02-17 07:32:12,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:32:12,016 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 162 transitions. [2023-02-17 07:32:12,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 19 states have internal predecessors, (44), 11 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 9 states have call predecessors, (26), 9 states have call successors, (26) [2023-02-17 07:32:12,017 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 162 transitions. [2023-02-17 07:32:12,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-02-17 07:32:12,023 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:32:12,023 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:32:12,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-17 07:32:12,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:32:12,230 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:32:12,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:32:12,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1474759586, now seen corresponding path program 2 times [2023-02-17 07:32:12,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:32:12,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730867243] [2023-02-17 07:32:12,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:32:12,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:32:12,239 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 07:32:12,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [190883322] [2023-02-17 07:32:12,240 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 07:32:12,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:32:12,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:32:12,241 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-02-17 07:32:12,245 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-02-17 07:32:12,301 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 07:32:12,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 07:32:12,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 50 conjunts are in the unsatisfiable core [2023-02-17 07:32:12,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:32:12,391 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 38 proven. 62 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-02-17 07:32:12,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:32:14,784 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 38 proven. 62 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-02-17 07:32:14,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:32:14,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730867243] [2023-02-17 07:32:14,784 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 07:32:14,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190883322] [2023-02-17 07:32:14,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190883322] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:32:14,785 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 07:32:14,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2023-02-17 07:32:14,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119477613] [2023-02-17 07:32:14,785 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 07:32:14,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-17 07:32:14,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:32:14,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-17 07:32:14,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2023-02-17 07:32:14,787 INFO L87 Difference]: Start difference. First operand 130 states and 162 transitions. Second operand has 22 states, 20 states have (on average 2.3) internal successors, (46), 21 states have internal predecessors, (46), 13 states have call successors, (32), 3 states have call predecessors, (32), 2 states have return successors, (30), 10 states have call predecessors, (30), 11 states have call successors, (30) [2023-02-17 07:32:20,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 07:32:21,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:32:21,476 INFO L93 Difference]: Finished difference Result 187 states and 238 transitions. [2023-02-17 07:32:21,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-17 07:32:21,477 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.3) internal successors, (46), 21 states have internal predecessors, (46), 13 states have call successors, (32), 3 states have call predecessors, (32), 2 states have return successors, (30), 10 states have call predecessors, (30), 11 states have call successors, (30) Word has length 97 [2023-02-17 07:32:21,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:32:21,478 INFO L225 Difference]: With dead ends: 187 [2023-02-17 07:32:21,478 INFO L226 Difference]: Without dead ends: 142 [2023-02-17 07:32:21,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 167 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=199, Invalid=671, Unknown=0, NotChecked=0, Total=870 [2023-02-17 07:32:21,479 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 36 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2023-02-17 07:32:21,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 153 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2023-02-17 07:32:21,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-02-17 07:32:21,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 126. [2023-02-17 07:32:21,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 79 states have (on average 1.0886075949367089) internal successors, (86), 83 states have internal predecessors, (86), 31 states have call successors, (31), 15 states have call predecessors, (31), 15 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2023-02-17 07:32:21,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 147 transitions. [2023-02-17 07:32:21,557 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 147 transitions. Word has length 97 [2023-02-17 07:32:21,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:32:21,558 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 147 transitions. [2023-02-17 07:32:21,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.3) internal successors, (46), 21 states have internal predecessors, (46), 13 states have call successors, (32), 3 states have call predecessors, (32), 2 states have return successors, (30), 10 states have call predecessors, (30), 11 states have call successors, (30) [2023-02-17 07:32:21,558 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 147 transitions. [2023-02-17 07:32:21,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-02-17 07:32:21,559 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:32:21,559 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:32:21,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-17 07:32:21,767 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,SelfDestructingSolverStorable10 [2023-02-17 07:32:21,767 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:32:21,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:32:21,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1149721345, now seen corresponding path program 2 times [2023-02-17 07:32:21,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:32:21,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208342485] [2023-02-17 07:32:21,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:32:21,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:32:21,791 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 07:32:21,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2015222717] [2023-02-17 07:32:21,811 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 07:32:21,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:32:21,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:32:21,813 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-02-17 07:32:21,816 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-02-17 07:32:21,871 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 07:32:21,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 07:32:21,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 39 conjunts are in the unsatisfiable core [2023-02-17 07:32:21,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:32:21,929 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 34 proven. 71 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-02-17 07:32:21,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:32:22,265 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 34 proven. 71 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-02-17 07:32:22,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:32:22,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208342485] [2023-02-17 07:32:22,265 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 07:32:22,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015222717] [2023-02-17 07:32:22,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015222717] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:32:22,266 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 07:32:22,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2023-02-17 07:32:22,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461222518] [2023-02-17 07:32:22,266 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 07:32:22,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-17 07:32:22,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:32:22,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-17 07:32:22,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2023-02-17 07:32:22,268 INFO L87 Difference]: Start difference. First operand 126 states and 147 transitions. Second operand has 18 states, 16 states have (on average 2.875) internal successors, (46), 17 states have internal predecessors, (46), 10 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 10 states have call successors, (32) [2023-02-17 07:32:23,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:32:23,595 INFO L93 Difference]: Finished difference Result 150 states and 167 transitions. [2023-02-17 07:32:23,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-17 07:32:23,596 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.875) internal successors, (46), 17 states have internal predecessors, (46), 10 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 10 states have call successors, (32) Word has length 102 [2023-02-17 07:32:23,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:32:23,597 INFO L225 Difference]: With dead ends: 150 [2023-02-17 07:32:23,597 INFO L226 Difference]: Without dead ends: 110 [2023-02-17 07:32:23,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 183 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2023-02-17 07:32:23,598 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 20 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-17 07:32:23,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 165 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-02-17 07:32:23,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-02-17 07:32:23,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2023-02-17 07:32:23,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 71 states have (on average 1.0704225352112675) internal successors, (76), 74 states have internal predecessors, (76), 23 states have call successors, (23), 15 states have call predecessors, (23), 15 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2023-02-17 07:32:23,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2023-02-17 07:32:23,664 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 102 [2023-02-17 07:32:23,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:32:23,664 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2023-02-17 07:32:23,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.875) internal successors, (46), 17 states have internal predecessors, (46), 10 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 10 states have call successors, (32) [2023-02-17 07:32:23,666 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2023-02-17 07:32:23,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-02-17 07:32:23,667 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:32:23,667 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:32:23,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-17 07:32:23,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:32:23,874 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:32:23,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:32:23,874 INFO L85 PathProgramCache]: Analyzing trace with hash 289773103, now seen corresponding path program 2 times [2023-02-17 07:32:23,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:32:23,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133347268] [2023-02-17 07:32:23,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:32:23,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:32:23,896 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 07:32:23,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [252106419] [2023-02-17 07:32:23,897 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 07:32:23,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:32:23,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:32:23,898 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-02-17 07:32:23,923 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-02-17 07:32:23,975 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 07:32:23,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 07:32:23,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 54 conjunts are in the unsatisfiable core [2023-02-17 07:32:23,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:32:24,094 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 38 proven. 100 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-02-17 07:32:24,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:32:30,353 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 38 proven. 100 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-02-17 07:32:30,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:32:30,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133347268] [2023-02-17 07:32:30,354 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 07:32:30,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252106419] [2023-02-17 07:32:30,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252106419] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:32:30,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 07:32:30,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2023-02-17 07:32:30,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641350441] [2023-02-17 07:32:30,355 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 07:32:30,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-17 07:32:30,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:32:30,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-17 07:32:30,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2023-02-17 07:32:30,357 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand has 25 states, 25 states have (on average 2.16) internal successors, (54), 23 states have internal predecessors, (54), 15 states have call successors, (38), 3 states have call predecessors, (38), 2 states have return successors, (36), 13 states have call predecessors, (36), 13 states have call successors, (36) [2023-02-17 07:32:36,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 07:32:38,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 07:32:40,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 07:32:44,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 07:32:46,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 07:32:47,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 07:32:52,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 07:32:58,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 07:33:08,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 07:33:15,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 07:33:17,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 07:33:19,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:33:19,447 INFO L93 Difference]: Finished difference Result 217 states and 266 transitions. [2023-02-17 07:33:19,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-17 07:33:19,449 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.16) internal successors, (54), 23 states have internal predecessors, (54), 15 states have call successors, (38), 3 states have call predecessors, (38), 2 states have return successors, (36), 13 states have call predecessors, (36), 13 states have call successors, (36) Word has length 116 [2023-02-17 07:33:19,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:33:19,450 INFO L225 Difference]: With dead ends: 217 [2023-02-17 07:33:19,450 INFO L226 Difference]: Without dead ends: 194 [2023-02-17 07:33:19,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 204 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=266, Invalid=922, Unknown=2, NotChecked=0, Total=1190 [2023-02-17 07:33:19,452 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 85 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 147 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.6s IncrementalHoareTripleChecker+Time [2023-02-17 07:33:19,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 201 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 1021 Invalid, 7 Unknown, 0 Unchecked, 32.6s Time] [2023-02-17 07:33:19,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-02-17 07:33:19,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2023-02-17 07:33:19,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 120 states have (on average 1.125) internal successors, (135), 127 states have internal predecessors, (135), 49 states have call successors, (49), 21 states have call predecessors, (49), 21 states have return successors, (48), 42 states have call predecessors, (48), 48 states have call successors, (48) [2023-02-17 07:33:19,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 232 transitions. [2023-02-17 07:33:19,719 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 232 transitions. Word has length 116 [2023-02-17 07:33:19,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:33:19,720 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 232 transitions. [2023-02-17 07:33:19,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.16) internal successors, (54), 23 states have internal predecessors, (54), 15 states have call successors, (38), 3 states have call predecessors, (38), 2 states have return successors, (36), 13 states have call predecessors, (36), 13 states have call successors, (36) [2023-02-17 07:33:19,720 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 232 transitions. [2023-02-17 07:33:19,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-02-17 07:33:19,721 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:33:19,721 INFO L195 NwaCegarLoop]: trace histogram [20, 19, 19, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:33:19,728 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-02-17 07:33:19,928 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,SelfDestructingSolverStorable12 [2023-02-17 07:33:19,928 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:33:19,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:33:19,929 INFO L85 PathProgramCache]: Analyzing trace with hash -2143709678, now seen corresponding path program 3 times [2023-02-17 07:33:19,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:33:19,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658388789] [2023-02-17 07:33:19,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:33:19,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:33:19,937 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 07:33:19,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [381561685] [2023-02-17 07:33:19,937 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 07:33:19,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:33:19,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:33:19,938 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-02-17 07:33:19,942 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-02-17 07:33:20,003 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-17 07:33:20,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 07:33:20,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-17 07:33:20,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:33:20,189 INFO L134 CoverageAnalysis]: Checked inductivity of 776 backedges. 118 proven. 52 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2023-02-17 07:33:20,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:33:20,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:33:20,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658388789] [2023-02-17 07:33:20,404 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 07:33:20,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381561685] [2023-02-17 07:33:20,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381561685] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:33:20,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-17 07:33:20,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2023-02-17 07:33:20,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389668222] [2023-02-17 07:33:20,404 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-17 07:33:20,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-17 07:33:20,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:33:20,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-17 07:33:20,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-02-17 07:33:20,406 INFO L87 Difference]: Start difference. First operand 191 states and 232 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-02-17 07:33:20,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:33:20,847 INFO L93 Difference]: Finished difference Result 209 states and 246 transitions. [2023-02-17 07:33:20,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 07:33:20,848 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 121 [2023-02-17 07:33:20,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:33:20,850 INFO L225 Difference]: With dead ends: 209 [2023-02-17 07:33:20,851 INFO L226 Difference]: Without dead ends: 207 [2023-02-17 07:33:20,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2023-02-17 07:33:20,852 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 07:33:20,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 68 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 07:33:20,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2023-02-17 07:33:21,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2023-02-17 07:33:21,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 132 states have (on average 1.1136363636363635) internal successors, (147), 139 states have internal predecessors, (147), 49 states have call successors, (49), 25 states have call predecessors, (49), 25 states have return successors, (48), 42 states have call predecessors, (48), 48 states have call successors, (48) [2023-02-17 07:33:21,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 244 transitions. [2023-02-17 07:33:21,108 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 244 transitions. Word has length 121 [2023-02-17 07:33:21,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:33:21,108 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 244 transitions. [2023-02-17 07:33:21,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-02-17 07:33:21,109 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 244 transitions. [2023-02-17 07:33:21,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-02-17 07:33:21,110 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:33:21,110 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:33:21,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-02-17 07:33:21,316 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,SelfDestructingSolverStorable13 [2023-02-17 07:33:21,317 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:33:21,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:33:21,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1262824565, now seen corresponding path program 1 times [2023-02-17 07:33:21,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:33:21,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434063742] [2023-02-17 07:33:21,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:33:21,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:33:21,323 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 07:33:21,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [363861732] [2023-02-17 07:33:21,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:33:21,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:33:21,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:33:21,325 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-02-17 07:33:21,327 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-02-17 07:33:21,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:33:21,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 59 conjunts are in the unsatisfiable core [2023-02-17 07:33:21,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:33:21,552 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 92 proven. 113 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2023-02-17 07:33:21,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:33:23,583 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 92 proven. 113 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2023-02-17 07:33:23,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:33:23,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434063742] [2023-02-17 07:33:23,583 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 07:33:23,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363861732] [2023-02-17 07:33:23,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363861732] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:33:23,584 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 07:33:23,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 [2023-02-17 07:33:23,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735210020] [2023-02-17 07:33:23,584 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 07:33:23,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-17 07:33:23,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:33:23,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-17 07:33:23,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=601, Unknown=0, NotChecked=0, Total=756 [2023-02-17 07:33:23,586 INFO L87 Difference]: Start difference. First operand 207 states and 244 transitions. Second operand has 28 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 24 states have internal predecessors, (56), 17 states have call successors, (42), 3 states have call predecessors, (42), 2 states have return successors, (40), 16 states have call predecessors, (40), 15 states have call successors, (40) [2023-02-17 07:33:31,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 07:33:32,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:33:32,153 INFO L93 Difference]: Finished difference Result 304 states and 363 transitions. [2023-02-17 07:33:32,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-17 07:33:32,154 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 24 states have internal predecessors, (56), 17 states have call successors, (42), 3 states have call predecessors, (42), 2 states have return successors, (40), 16 states have call predecessors, (40), 15 states have call successors, (40) Word has length 127 [2023-02-17 07:33:32,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:33:32,156 INFO L225 Difference]: With dead ends: 304 [2023-02-17 07:33:32,156 INFO L226 Difference]: Without dead ends: 218 [2023-02-17 07:33:32,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 220 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=418, Invalid=1304, Unknown=0, NotChecked=0, Total=1722 [2023-02-17 07:33:32,157 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 70 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 156 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2023-02-17 07:33:32,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 200 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1030 Invalid, 1 Unknown, 0 Unchecked, 6.7s Time] [2023-02-17 07:33:32,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2023-02-17 07:33:32,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 200. [2023-02-17 07:33:32,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 130 states have (on average 1.0615384615384615) internal successors, (138), 137 states have internal predecessors, (138), 41 states have call successors, (41), 28 states have call predecessors, (41), 28 states have return successors, (41), 34 states have call predecessors, (41), 41 states have call successors, (41) [2023-02-17 07:33:32,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2023-02-17 07:33:32,333 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 127 [2023-02-17 07:33:32,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:33:32,333 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2023-02-17 07:33:32,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 24 states have internal predecessors, (56), 17 states have call successors, (42), 3 states have call predecessors, (42), 2 states have return successors, (40), 16 states have call predecessors, (40), 15 states have call successors, (40) [2023-02-17 07:33:32,334 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2023-02-17 07:33:32,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-02-17 07:33:32,335 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:33:32,335 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 21, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:33:32,341 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-02-17 07:33:32,539 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,SelfDestructingSolverStorable14 [2023-02-17 07:33:32,540 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:33:32,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:33:32,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1445521318, now seen corresponding path program 3 times [2023-02-17 07:33:32,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:33:32,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285575121] [2023-02-17 07:33:32,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:33:32,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:33:32,550 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 07:33:32,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [350762422] [2023-02-17 07:33:32,550 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 07:33:32,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:33:32,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:33:32,552 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-02-17 07:33:32,555 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-02-17 07:33:32,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-17 07:33:32,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 07:33:32,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-17 07:33:32,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:33:32,771 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 189 proven. 51 refuted. 0 times theorem prover too weak. 713 trivial. 0 not checked. [2023-02-17 07:33:32,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:33:32,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:33:32,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285575121] [2023-02-17 07:33:32,962 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 07:33:32,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350762422] [2023-02-17 07:33:32,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350762422] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:33:32,962 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-17 07:33:32,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2023-02-17 07:33:32,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584791266] [2023-02-17 07:33:32,962 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-17 07:33:32,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 07:33:32,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:33:32,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 07:33:32,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2023-02-17 07:33:32,963 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2023-02-17 07:33:33,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:33:33,242 INFO L93 Difference]: Finished difference Result 200 states and 220 transitions. [2023-02-17 07:33:33,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 07:33:33,243 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 133 [2023-02-17 07:33:33,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:33:33,243 INFO L225 Difference]: With dead ends: 200 [2023-02-17 07:33:33,243 INFO L226 Difference]: Without dead ends: 0 [2023-02-17 07:33:33,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 125 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2023-02-17 07:33:33,245 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 07:33:33,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 46 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 07:33:33,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-17 07:33:33,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-17 07:33:33,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-02-17 07:33:33,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-17 07:33:33,246 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 133 [2023-02-17 07:33:33,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:33:33,246 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-17 07:33:33,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2023-02-17 07:33:33,246 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-17 07:33:33,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-17 07:33:33,249 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-17 07:33:33,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-17 07:33:33,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-02-17 07:33:33,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-17 07:33:33,576 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 55) no Hoare annotation was computed. [2023-02-17 07:33:33,580 INFO L895 garLoopResultBuilder]: At program point L52-2(lines 44 56) the Hoare annotation is: (let ((.cse141 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse138 (div |ULTIMATE.start_main_~d~0#1| 2))) (let ((.cse253 (+ .cse138 1)) (.cse261 (+ .cse141 1)) (.cse140 (+ 1 .cse141)) (.cse238 (- .cse138))) (let ((.cse247 (+ (- 1) .cse238)) (.cse135 (+ |ULTIMATE.start_main_~q~0#1| .cse140)) (.cse129 (+ |ULTIMATE.start_main_~q~0#1| .cse141)) (.cse244 (mod |ULTIMATE.start_main_~d~0#1| 2)) (.cse221 (div .cse261 2)) (.cse222 (div |ULTIMATE.start_main_~p~0#1| 4)) (.cse131 (div .cse253 2)) (.cse132 (div |ULTIMATE.start_main_~d~0#1| 4))) (let ((.cse258 (+ .cse132 1)) (.cse134 (+ 1 .cse132)) (.cse128 (+ 1 .cse131)) (.cse255 (+ .cse131 1)) (.cse252 (+ .cse222 1)) (.cse260 (+ .cse221 1)) (.cse51 (- |ULTIMATE.start_main_~d~0#1|)) (.cse85 (= 1 |ULTIMATE.start_main_~p~0#1|)) (.cse74 (= 0 .cse244)) (.cse263 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse78 (= 0 (mod |ULTIMATE.start_main_~p~0#1| 2))) (.cse133 (+ |ULTIMATE.start_main_~r~0#1| .cse238)) (.cse262 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse265 (* .cse129 |ULTIMATE.start_main_~B~0#1|)) (.cse264 (* .cse135 |ULTIMATE.start_main_~B~0#1|)) (.cse130 (+ |ULTIMATE.start_main_~r~0#1| .cse247)) (.cse139 (+ 1 .cse138))) (let ((.cse88 (= 1 .cse141)) (.cse104 (= 1 .cse140)) (.cse121 (- .cse131)) (.cse97 (= 0 (mod .cse141 2))) (.cse248 (< .cse141 0)) (.cse117 (= 0 (mod .cse253 2))) (.cse249 (< .cse139 0)) (.cse250 (< .cse140 0)) (.cse101 (= 0 (mod .cse261 2))) (.cse114 (= |ULTIMATE.start_main_~A~0#1| (+ .cse264 .cse130))) (.cse111 (= |ULTIMATE.start_main_~A~0#1| (+ .cse265 .cse130))) (.cse75 (not .cse262)) (.cse112 (= |ULTIMATE.start_main_~A~0#1| (+ .cse265 .cse133))) (.cse69 (and .cse263 (not .cse78))) (.cse113 (= |ULTIMATE.start_main_~A~0#1| (+ .cse264 .cse133))) (.cse81 (not .cse263)) (.cse72 (and .cse262 (not .cse74))) (.cse63 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse110 (not .cse85)) (.cse212 (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~p~0#1|)) (.cse105 (+ |ULTIMATE.start_main_~r~0#1| .cse51)) (.cse107 (- .cse132)) (.cse95 (= 0 (mod .cse138 2))) (.cse251 (< .cse138 0)) (.cse226 (* 2 |ULTIMATE.start_main_~d~0#1|)) (.cse215 (div .cse260 2)) (.cse216 (div .cse261 4)) (.cse197 (div .cse252 2)) (.cse223 (+ 1 .cse222)) (.cse174 (= 0 (mod .cse222 2))) (.cse193 (div |ULTIMATE.start_main_~p~0#1| 8)) (.cse228 (* 2 |ULTIMATE.start_main_~p~0#1|)) (.cse254 (< .cse131 0)) (.cse171 (= 0 (mod .cse131 2))) (.cse156 (= 0 (mod .cse255 2))) (.cse256 (< .cse128 0)) (.cse257 (< .cse132 0)) (.cse205 (= 0 (mod .cse132 2))) (.cse259 (< .cse134 0)) (.cse199 (= 0 (mod .cse258 2))) (.cse220 (+ 1 .cse221))) (let ((.cse65 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse144 (* 2 1)) (.cse224 (< .cse221 0)) (.cse163 (= 0 (mod .cse221 2))) (.cse159 (= 0 (mod .cse260 2))) (.cse225 (< .cse220 0)) (.cse201 (and .cse259 (not .cse199))) (.cse200 (not .cse259)) (.cse210 (div .cse258 2)) (.cse204 (and .cse257 (not .cse205))) (.cse211 (div |ULTIMATE.start_main_~d~0#1| 8)) (.cse207 (not .cse257)) (.cse153 (not .cse256)) (.cse158 (and .cse256 (not .cse156))) (.cse188 (div .cse255 2)) (.cse169 (and .cse254 (not .cse171))) (.cse170 (not .cse254)) (.cse187 (div .cse253 4)) (.cse77 (div .cse228 4)) (.cse192 (+ 1 .cse193)) (.cse195 (< .cse222 0)) (.cse194 (not .cse174)) (.cse182 (= 0 (mod .cse252 2))) (.cse227 (< .cse223 0)) (.cse196 (+ 1 .cse197)) (.cse217 (+ 1 .cse216)) (.cse214 (+ 1 .cse215)) (.cse142 (+ |ULTIMATE.start_main_~q~0#1| (* 2 .cse228))) (.cse143 (+ |ULTIMATE.start_main_~r~0#1| (- (* 2 .cse226)))) (.cse137 (* |ULTIMATE.start_main_~B~0#1| 1)) (.cse173 (= 1 .cse222)) (.cse184 (= 1 .cse223)) (.cse151 (= 1 .cse220)) (.cse162 (= 1 .cse221)) (.cse90 (and (not .cse95) .cse251)) (.cse93 (not .cse251)) (.cse106 (+ (- 1) .cse107)) (.cse2 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse212 |ULTIMATE.start_main_~B~0#1|) .cse105))) (.cse3 (or .cse63 .cse110)) (.cse12 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse56 (or (and (or .cse112 .cse69) (or .cse78 .cse113 .cse81)) .cse72)) (.cse48 (or (and (or .cse78 .cse114 .cse81) (or .cse111 .cse69)) .cse74 .cse75)) (.cse13 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse7 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse9 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse14 (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|))) (.cse99 (and .cse250 (not .cse101))) (.cse229 (* (+ .cse135 .cse221) |ULTIMATE.start_main_~B~0#1|)) (.cse231 (* (+ .cse135 .cse220) |ULTIMATE.start_main_~B~0#1|)) (.cse103 (not .cse250)) (.cse115 (not .cse249)) (.cse118 (and (not .cse117) .cse249)) (.cse98 (not .cse248)) (.cse233 (* (+ .cse129 .cse223) |ULTIMATE.start_main_~B~0#1|)) (.cse89 (and .cse248 (not .cse97))) (.cse234 (* (+ .cse129 .cse222) |ULTIMATE.start_main_~B~0#1|)) (.cse120 (+ (- 1) .cse121)) (.cse241 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse139 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)) .cse74 .cse75) (or .cse72 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse138 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))))) (.cse239 (and (or .cse69 (not .cse88)) (or .cse78 (not .cse104) .cse81))) (.cse76 (+ |ULTIMATE.start_main_~q~0#1| .cse228)) (.cse82 (+ |ULTIMATE.start_main_~r~0#1| (- .cse226))) (.cse245 (div .cse51 (- 2))) (.cse235 (* (+ .cse212 .cse140) |ULTIMATE.start_main_~B~0#1|)) (.cse237 (* (+ .cse212 .cse141) |ULTIMATE.start_main_~B~0#1|))) (let ((.cse53 (+ |ULTIMATE.start_main_~q~0#1| (* |ULTIMATE.start_main_~p~0#1| (- 1)))) (.cse0 (<= 2 |ULTIMATE.start_main_~d~0#1|)) (.cse96 (* (+ .cse212 .cse223) |ULTIMATE.start_main_~B~0#1|)) (.cse91 (* (+ .cse212 .cse222) |ULTIMATE.start_main_~B~0#1|)) (.cse100 (* (+ .cse212 .cse221) |ULTIMATE.start_main_~B~0#1|)) (.cse102 (* (+ .cse212 .cse220) |ULTIMATE.start_main_~B~0#1|)) (.cse47 (or (let ((.cse246 (+ .cse105 .cse247))) (and (or .cse78 (= |ULTIMATE.start_main_~A~0#1| (+ .cse235 .cse246)) .cse81) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse237 .cse246)) .cse69))) .cse74 .cse75)) (.cse42 (<= 2 .cse245)) (.cse44 (>= |ULTIMATE.start_main_~r~0#1| .cse245)) (.cse30 (= |ULTIMATE.start_main_~A~0#1| (+ (* (+ .cse76 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~B~0#1|) (+ .cse82 .cse51)))) (.cse109 (or .cse85 .cse241 .cse239)) (.cse46 (= .cse244 0)) (.cse52 (or .cse74 (let ((.cse243 (+ .cse130 .cse120)) (.cse242 (+ .cse130 .cse121))) (and (or .cse78 (and (or .cse118 (and (or .cse99 (= |ULTIMATE.start_main_~A~0#1| (+ .cse229 .cse242))) (or .cse101 (= |ULTIMATE.start_main_~A~0#1| (+ .cse231 .cse242)) .cse103))) (or .cse115 .cse117 (and (or .cse99 (= |ULTIMATE.start_main_~A~0#1| (+ .cse229 .cse243))) (or .cse101 (= |ULTIMATE.start_main_~A~0#1| (+ .cse231 .cse243)) .cse103)))) .cse81) (or (and (or (and (or .cse89 (= |ULTIMATE.start_main_~A~0#1| (+ .cse234 .cse243))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse233 .cse243)) .cse97 .cse98)) .cse115 .cse117) (or .cse118 (and (or .cse97 .cse98 (= |ULTIMATE.start_main_~A~0#1| (+ .cse233 .cse242))) (or .cse89 (= |ULTIMATE.start_main_~A~0#1| (+ .cse234 .cse242)))))) .cse69))) .cse75)) (.cse43 (let ((.cse240 (or .cse241 .cse239))) (or (and .cse2 .cse240 .cse63 .cse12 .cse56 .cse48 .cse13 .cse7 .cse9 .cse14) (and .cse2 .cse3 .cse240 .cse12 .cse56 .cse48 .cse13 .cse7 .cse9 .cse14)))) (.cse16 (or (and (or .cse74 (= |ULTIMATE.start_main_~B~0#1| .cse139) .cse75) (or .cse72 (= |ULTIMATE.start_main_~B~0#1| .cse138))) .cse239)) (.cse108 (or (and (or .cse74 .cse75 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse139 .cse212) .cse105))) (or .cse72 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse138 .cse212) .cse105)))) .cse85 .cse239)) (.cse55 (or .cse72 (let ((.cse236 (+ .cse105 .cse238))) (and (or .cse78 .cse81 (= |ULTIMATE.start_main_~A~0#1| (+ .cse235 .cse236))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse237 .cse236)) .cse69))))) (.cse4 (or .cse110 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))) (.cse57 (or .cse72 (let ((.cse230 (+ .cse133 .cse107)) (.cse232 (+ .cse133 .cse106))) (and (or .cse78 (and (or .cse90 (and (or .cse99 (= |ULTIMATE.start_main_~A~0#1| (+ .cse229 .cse230))) (or .cse101 .cse103 (= |ULTIMATE.start_main_~A~0#1| (+ .cse231 .cse230))))) (or .cse93 (and (or .cse101 (= |ULTIMATE.start_main_~A~0#1| (+ .cse231 .cse232)) .cse103) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse229 .cse232)) .cse99)) .cse95)) .cse81) (or .cse69 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse233 .cse230)) .cse97 .cse98) (or .cse89 (= |ULTIMATE.start_main_~A~0#1| (+ .cse234 .cse230)))) .cse90) (or (and (or .cse97 .cse98 (= |ULTIMATE.start_main_~A~0#1| (+ .cse233 .cse232))) (or .cse89 (= |ULTIMATE.start_main_~A~0#1| (+ .cse234 .cse232)))) .cse93 .cse95))))))) (.cse136 (and (or .cse101 (not .cse151) .cse103) (or (not .cse162) .cse99))) (.cse127 (and (or .cse89 (not .cse173)) (or .cse97 .cse98 (not .cse184)))) (.cse122 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse137 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse86 (= 1 .cse228)) (.cse87 (= |ULTIMATE.start_main_~A~0#1| (+ (* (+ .cse142 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~B~0#1|) (+ .cse143 .cse51)))) (.cse154 (* (+ .cse135 .cse214) |ULTIMATE.start_main_~B~0#1|)) (.cse160 (* (+ .cse135 .cse215) |ULTIMATE.start_main_~B~0#1|)) (.cse167 (* (+ .cse135 .cse216) |ULTIMATE.start_main_~B~0#1|)) (.cse165 (* (+ .cse135 .cse217) |ULTIMATE.start_main_~B~0#1|)) (.cse183 (* (+ .cse129 .cse196) |ULTIMATE.start_main_~B~0#1|)) (.cse181 (not .cse227)) (.cse179 (* (+ .cse129 .cse197) |ULTIMATE.start_main_~B~0#1|)) (.cse180 (and (not .cse182) .cse227)) (.cse177 (* (+ .cse129 .cse193) |ULTIMATE.start_main_~B~0#1|)) (.cse178 (and .cse195 .cse194)) (.cse175 (* (+ .cse129 .cse192) |ULTIMATE.start_main_~B~0#1|)) (.cse176 (not .cse195)) (.cse84 (div .cse226 4)) (.cse80 (+ 1 .cse77)) (.cse123 (and (or (and (or .cse89 (not (<= 1 .cse222))) (or .cse97 .cse98 (not (<= 1 .cse223)))) .cse69) (or .cse78 .cse81 (and (or (not (<= 1 .cse220)) .cse101 .cse103) (or .cse99 (not (<= 1 .cse221))))))) (.cse124 (and (or .cse74 (and (or .cse118 (not (= .cse137 .cse131))) (or .cse115 .cse117 (not (= .cse137 .cse128)))) .cse75) (or .cse72 (and (or .cse93 (not (= .cse137 .cse134)) .cse95) (or .cse90 (not (= .cse137 .cse132))))))) (.cse191 (and (or .cse115 .cse117 (and (or (not (= .cse137 (+ 1 .cse188))) .cse153 .cse156) (or .cse158 (not (= .cse137 .cse188))))) (or .cse118 (and (or (not (= .cse137 .cse187)) .cse169) (or .cse170 (not (= .cse137 (+ 1 .cse187))) .cse171))))) (.cse189 (and (or (and (or .cse201 (not (= .cse137 .cse210))) (or .cse199 .cse200 (not (= .cse137 (+ 1 .cse210))))) .cse93 .cse95) (or .cse90 (and (or .cse204 (not (= .cse137 .cse211))) (or .cse205 (not (= .cse137 (+ 1 .cse211))) .cse207))))) (.cse152 (not .cse225)) (.cse161 (and .cse225 (not .cse159))) (.cse166 (and .cse224 (not .cse163))) (.cse164 (not .cse224)) (.cse148 (* (+ |ULTIMATE.start_main_~q~0#1| .cse223) |ULTIMATE.start_main_~B~0#1|)) (.cse145 (* (+ |ULTIMATE.start_main_~q~0#1| .cse222) |ULTIMATE.start_main_~B~0#1|)) (.cse150 (* (+ |ULTIMATE.start_main_~q~0#1| .cse221) |ULTIMATE.start_main_~B~0#1|)) (.cse149 (* (+ |ULTIMATE.start_main_~q~0#1| .cse220) |ULTIMATE.start_main_~B~0#1|)) (.cse45 (* 2 .cse144)) (.cse60 (* 2 .cse65)) (.cse59 (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|))) (let ((.cse1 (= |ULTIMATE.start_main_~d~0#1| .cse144)) (.cse8 (= |ULTIMATE.start_main_~p~0#1| .cse144)) (.cse11 (= |ULTIMATE.start_main_~d~0#1| .cse65)) (.cse10 (= .cse59 |ULTIMATE.start_main_~A~0#1|)) (.cse15 (= |ULTIMATE.start_main_~d~0#1| .cse60)) (.cse18 (= |ULTIMATE.start_main_~p~0#1| .cse45)) (.cse39 (or .cse74 (let ((.cse219 (+ |ULTIMATE.start_main_~r~0#1| .cse120)) (.cse218 (+ |ULTIMATE.start_main_~r~0#1| .cse121))) (and (or .cse88 (and (or .cse97 (and (or .cse118 (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse218))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse219)) .cse115 .cse117)) .cse98) (or .cse89 (and (or .cse118 (= |ULTIMATE.start_main_~A~0#1| (+ .cse145 .cse218))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse145 .cse219)) .cse115 .cse117)))) .cse69) (or .cse78 (and (or .cse99 (and (or .cse118 (= |ULTIMATE.start_main_~A~0#1| (+ .cse150 .cse218))) (or .cse115 (= |ULTIMATE.start_main_~A~0#1| (+ .cse150 .cse219)) .cse117))) (or .cse101 (and (or .cse115 .cse117 (= |ULTIMATE.start_main_~A~0#1| (+ .cse149 .cse219))) (or .cse118 (= |ULTIMATE.start_main_~A~0#1| (+ .cse149 .cse218)))) .cse103)) .cse104 .cse81))) .cse75)) (.cse33 (or .cse78 (let ((.cse213 (* .cse137 .cse135))) (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse213 .cse130)) .cse74 .cse191 .cse75) (or .cse189 .cse72 (= |ULTIMATE.start_main_~A~0#1| (+ .cse213 .cse133))))) .cse81 (and (or .cse101 .cse103 (and (or (not (<= 1 .cse214)) .cse152 .cse159) (or (not (<= 1 .cse215)) .cse161))) (or .cse99 (and (or .cse166 (not (<= 1 .cse216))) (or (not (<= 1 .cse217)) .cse163 .cse164)))))) (.cse21 (or .cse123 .cse124 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse137 .cse212) .cse105)))) (.cse35 (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse137 .cse76) .cse82)) (and (or .cse72 (not (= .cse137 .cse84))) (or .cse74 .cse75 (not (= .cse137 (+ 1 .cse84))))) (and (or .cse78 .cse81 (not (<= 1 .cse80))) (or (not (<= 1 .cse77)) .cse69)))) (.cse36 (or .cse72 (let ((.cse208 (- .cse211)) (.cse209 (- .cse210))) (let ((.cse198 (+ .cse133 (+ (- 1) .cse209))) (.cse202 (+ .cse133 .cse209)) (.cse206 (+ .cse133 (+ (- 1) .cse208))) (.cse203 (+ .cse133 .cse208))) (and (or (and (or .cse93 (and (or .cse101 .cse151 .cse103 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse160 .cse198)) .cse199 .cse200) (or .cse201 (= |ULTIMATE.start_main_~A~0#1| (+ .cse160 .cse202)))) .cse161) (or (and (or .cse199 (= |ULTIMATE.start_main_~A~0#1| (+ .cse154 .cse198)) .cse200) (or .cse201 (= |ULTIMATE.start_main_~A~0#1| (+ .cse154 .cse202)))) .cse152 .cse159))) (or .cse162 .cse99 (and (or .cse163 .cse164 (and (or .cse201 (= |ULTIMATE.start_main_~A~0#1| (+ .cse165 .cse202))) (or .cse199 .cse200 (= |ULTIMATE.start_main_~A~0#1| (+ .cse165 .cse198))))) (or (and (or .cse199 (= |ULTIMATE.start_main_~A~0#1| (+ .cse167 .cse198)) .cse200) (or .cse201 (= |ULTIMATE.start_main_~A~0#1| (+ .cse167 .cse202)))) .cse166)))) .cse95) (or .cse90 (and (or (and (or .cse152 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse154 .cse203)) .cse204) (or .cse205 (= |ULTIMATE.start_main_~A~0#1| (+ .cse154 .cse206)) .cse207)) .cse159) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse160 .cse203)) .cse204) (or .cse205 (= |ULTIMATE.start_main_~A~0#1| (+ .cse160 .cse206)) .cse207)) .cse161)) .cse101 .cse151 .cse103) (or .cse162 .cse99 (and (or (and (or .cse205 (= |ULTIMATE.start_main_~A~0#1| (+ .cse167 .cse206)) .cse207) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse167 .cse203)) .cse204)) .cse166) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse165 .cse203)) .cse204) (or .cse205 (= |ULTIMATE.start_main_~A~0#1| (+ .cse165 .cse206)) .cse207)) .cse163 .cse164)))))) .cse78 .cse81) (or (and (or (and (or .cse173 .cse89 (and (or (and (or .cse201 (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse202))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse198)) .cse199 .cse200)) .cse178) (or .cse174 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse175 .cse198)) .cse199 .cse200) (or .cse201 (= |ULTIMATE.start_main_~A~0#1| (+ .cse175 .cse202)))) .cse176))) (or .cse97 .cse98 (and (or .cse181 .cse182 (and (or .cse199 .cse200 (= |ULTIMATE.start_main_~A~0#1| (+ .cse183 .cse198))) (or .cse201 (= |ULTIMATE.start_main_~A~0#1| (+ .cse183 .cse202))))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse179 .cse198)) .cse199 .cse200) (or .cse201 (= |ULTIMATE.start_main_~A~0#1| (+ .cse179 .cse202)))) .cse180)) .cse184)) .cse93 .cse95) (or .cse90 (and (or .cse97 (and (or (and (or .cse205 (= |ULTIMATE.start_main_~A~0#1| (+ .cse183 .cse206)) .cse207) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse183 .cse203)) .cse204)) .cse181 .cse182) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse179 .cse206)) .cse205 .cse207) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse179 .cse203)) .cse204)) .cse180)) .cse98 .cse184) (or .cse173 .cse89 (and (or (and (or .cse205 (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse206)) .cse207) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse203)) .cse204)) .cse178) (or .cse174 (and (or .cse205 .cse207 (= |ULTIMATE.start_main_~A~0#1| (+ .cse175 .cse206))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse175 .cse203)) .cse204)) .cse176)))))) .cse69)))))) (.cse37 (or (let ((.cse190 (* .cse137 .cse129))) (and (or .cse189 (= |ULTIMATE.start_main_~A~0#1| (+ .cse190 .cse133)) .cse72) (or .cse74 (= |ULTIMATE.start_main_~A~0#1| (+ .cse190 .cse130)) .cse191 .cse75))) .cse69 (and (or .cse89 (and (or .cse174 (not (<= 1 .cse192)) .cse176) (or (not (<= 1 .cse193)) (and .cse194 .cse195)))) (or .cse97 .cse98 (and (or (not (<= 1 .cse196)) .cse182 .cse181) (or (not (<= 1 .cse197)) .cse180)))))) (.cse38 (or .cse74 (let ((.cse185 (- .cse188)) (.cse186 (- .cse187))) (let ((.cse172 (+ .cse130 (+ (- 1) .cse186))) (.cse168 (+ .cse130 .cse186)) (.cse157 (+ .cse130 .cse185)) (.cse155 (+ .cse130 (+ (- 1) .cse185)))) (and (or (and (or .cse115 .cse117 (and (or .cse101 .cse151 .cse103 (and (or .cse152 (and (or .cse153 (= |ULTIMATE.start_main_~A~0#1| (+ .cse154 .cse155)) .cse156) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse154 .cse157)) .cse158)) .cse159) (or (and (or .cse153 (= |ULTIMATE.start_main_~A~0#1| (+ .cse160 .cse155)) .cse156) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse160 .cse157)) .cse158)) .cse161))) (or .cse162 .cse99 (and (or .cse163 .cse164 (and (or .cse153 (= |ULTIMATE.start_main_~A~0#1| (+ .cse165 .cse155)) .cse156) (or .cse158 (= |ULTIMATE.start_main_~A~0#1| (+ .cse165 .cse157))))) (or .cse166 (and (or .cse153 (= |ULTIMATE.start_main_~A~0#1| (+ .cse167 .cse155)) .cse156) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse167 .cse157)) .cse158))))))) (or .cse118 (and (or .cse162 .cse99 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse167 .cse168)) .cse169) (or .cse170 .cse171 (= |ULTIMATE.start_main_~A~0#1| (+ .cse167 .cse172)))) .cse166) (or .cse163 (and (or .cse170 .cse171 (= |ULTIMATE.start_main_~A~0#1| (+ .cse165 .cse172))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse165 .cse168)) .cse169)) .cse164))) (or .cse101 .cse151 .cse103 (and (or .cse152 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse154 .cse168)) .cse169) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse154 .cse172)) .cse170 .cse171)) .cse159) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse160 .cse168)) .cse169) (or .cse170 .cse171 (= |ULTIMATE.start_main_~A~0#1| (+ .cse160 .cse172)))) .cse161)))))) .cse78 .cse81) (or (and (or .cse118 (and (or .cse173 .cse89 (and (or .cse174 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse175 .cse172)) .cse170 .cse171) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse175 .cse168)) .cse169)) .cse176) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse168)) .cse169) (or .cse170 .cse171 (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse172)))) .cse178))) (or (and (or (and (or .cse169 (= |ULTIMATE.start_main_~A~0#1| (+ .cse179 .cse168))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse179 .cse172)) .cse170 .cse171)) .cse180) (or .cse181 .cse182 (and (or .cse170 .cse171 (= |ULTIMATE.start_main_~A~0#1| (+ .cse183 .cse172))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse183 .cse168)) .cse169)))) .cse97 .cse98 .cse184))) (or .cse115 .cse117 (and (or (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse157)) .cse158) (or .cse153 (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse155)) .cse156)) .cse178) (or (and (or .cse153 (= |ULTIMATE.start_main_~A~0#1| (+ .cse175 .cse155)) .cse156) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse175 .cse157)) .cse158)) .cse174 .cse176)) .cse173 .cse89) (or .cse97 (and (or (and (or .cse158 (= |ULTIMATE.start_main_~A~0#1| (+ .cse179 .cse157))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse179 .cse155)) .cse153 .cse156)) .cse180) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse183 .cse157)) .cse158) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse183 .cse155)) .cse153 .cse156)) .cse181 .cse182)) .cse98 .cse184)))) .cse69)))) .cse75)) (.cse40 (or (let ((.cse146 (+ |ULTIMATE.start_main_~r~0#1| .cse106)) (.cse147 (+ |ULTIMATE.start_main_~r~0#1| .cse107))) (and (or .cse88 (and (or (and (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ .cse145 .cse146)) .cse95) (or .cse90 (= |ULTIMATE.start_main_~A~0#1| (+ .cse145 .cse147)))) .cse89) (or .cse97 (and (or .cse90 (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse147))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse146)) .cse93 .cse95)) .cse98)) .cse69) (or .cse78 .cse104 (and (or .cse101 .cse103 (and (or .cse90 (= |ULTIMATE.start_main_~A~0#1| (+ .cse149 .cse147))) (or .cse93 .cse95 (= |ULTIMATE.start_main_~A~0#1| (+ .cse149 .cse146))))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse150 .cse146)) .cse93 .cse95) (or .cse90 (= |ULTIMATE.start_main_~A~0#1| (+ .cse150 .cse147)))) .cse99)) .cse81))) .cse72)) (.cse54 (* .cse144 (- 1))) (.cse58 (or .cse86 .cse87 (not .cse12))) (.cse31 (= (+ |ULTIMATE.start_main_~q~0#1| (* .cse45 (- 1))) 0)) (.cse32 (= (+ |ULTIMATE.start_main_~r~0#1| .cse60) |ULTIMATE.start_main_~A~0#1|)) (.cse28 (or .cse9 (and (<= 1 |ULTIMATE.start_main_~d~0#1|) .cse9))) (.cse24 (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse137 .cse142) .cse143)) (not (= .cse137 |ULTIMATE.start_main_~d~0#1|)) (not (<= 1 |ULTIMATE.start_main_~p~0#1|)))) (.cse29 (or .cse122 (and (or (not (= .cse137 .cse138)) .cse72) (or .cse74 (not (= .cse137 .cse139)) .cse75)) (and (or (not (<= 1 .cse140)) .cse78 .cse81) (or (not (<= 1 .cse141)) .cse69)))) (.cse61 (or (and (or .cse72 (and (or .cse93 .cse95 (= |ULTIMATE.start_main_~B~0#1| .cse134)) (or .cse90 (= |ULTIMATE.start_main_~B~0#1| .cse132)))) (or .cse74 (and (or .cse118 (= |ULTIMATE.start_main_~B~0#1| .cse131)) (or (= |ULTIMATE.start_main_~B~0#1| .cse128) .cse115 .cse117)) .cse75)) (and (or .cse78 .cse81 .cse136) (or .cse127 .cse69)))) (.cse62 (let ((.cse125 (or .cse78 .cse104 (and (or .cse72 (and (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse134 .cse135) .cse133)) .cse95) (or .cse90 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse132 .cse135) .cse133))))) (or .cse74 (and (or .cse115 .cse117 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse128 .cse135) .cse130))) (or .cse118 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse131 .cse135) .cse130)))) .cse75)) .cse81 .cse136)) (.cse126 (or .cse88 .cse127 (and (or .cse74 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse128 .cse129) .cse130)) .cse115 .cse117) (or .cse118 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse131 .cse129) .cse130)))) .cse75) (or .cse72 (and (or .cse90 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse132 .cse129) .cse133))) (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse134 .cse129) .cse133)) .cse95)))) .cse69))) (or (and .cse47 .cse125 .cse42 .cse44 .cse30 .cse126 .cse109 .cse63 .cse48 .cse46 .cse9 .cse52 .cse2 .cse43 .cse16 .cse108 .cse55 .cse56 .cse4 .cse57) (and .cse47 .cse125 .cse42 .cse44 .cse30 .cse126 .cse109 .cse48 .cse46 .cse9 .cse52 .cse2 .cse3 .cse43 .cse16 .cse108 .cse55 .cse56 .cse4 .cse57)))) (.cse34 (or .cse122 .cse123 .cse124)) (.cse22 (or (let ((.cse119 (+ .cse105 .cse121)) (.cse116 (+ .cse105 .cse120))) (and (or .cse88 (and (or .cse97 (and (or .cse115 (= |ULTIMATE.start_main_~A~0#1| (+ .cse96 .cse116)) .cse117) (or .cse118 (= |ULTIMATE.start_main_~A~0#1| (+ .cse96 .cse119)))) .cse98) (or (and (or .cse115 .cse117 (= |ULTIMATE.start_main_~A~0#1| (+ .cse91 .cse116))) (or .cse118 (= |ULTIMATE.start_main_~A~0#1| (+ .cse91 .cse119)))) .cse89)) .cse69) (or .cse78 (and (or .cse99 (and (or .cse118 (= |ULTIMATE.start_main_~A~0#1| (+ .cse100 .cse119))) (or .cse115 (= |ULTIMATE.start_main_~A~0#1| (+ .cse100 .cse116)) .cse117))) (or .cse101 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse102 .cse119)) .cse118) (or .cse115 (= |ULTIMATE.start_main_~A~0#1| (+ .cse102 .cse116)) .cse117)) .cse103)) .cse104 .cse81))) .cse74 .cse75)) (.cse23 (or .cse85 (and (or (and (or .cse111 .cse74 .cse75) (or .cse112 .cse72)) .cse69) (or .cse78 (and (or .cse113 .cse72) (or .cse114 .cse74 .cse75)) .cse81)))) (.cse41 (or .cse63 .cse110 (not .cse14))) (.cse17 (or (and .cse0 .cse47 .cse2 .cse3 .cse30 .cse108 .cse109 .cse55 .cse56 .cse48 .cse4 .cse9) (and .cse0 .cse47 .cse2 .cse3 .cse30 .cse109 .cse55 .cse56 .cse48 .cse4 .cse9))) (.cse25 (or .cse72 (let ((.cse92 (+ .cse105 .cse107)) (.cse94 (+ .cse105 .cse106))) (and (or .cse88 .cse69 (and (or .cse89 (and (or .cse90 (= |ULTIMATE.start_main_~A~0#1| (+ .cse91 .cse92))) (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ .cse91 .cse94)) .cse95))) (or (and (or .cse93 .cse95 (= |ULTIMATE.start_main_~A~0#1| (+ .cse96 .cse94))) (or .cse90 (= |ULTIMATE.start_main_~A~0#1| (+ .cse96 .cse92)))) .cse97 .cse98))) (or .cse78 (and (or .cse99 (and (or .cse90 (= |ULTIMATE.start_main_~A~0#1| (+ .cse100 .cse92))) (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ .cse100 .cse94)) .cse95))) (or .cse101 (and (or .cse90 (= |ULTIMATE.start_main_~A~0#1| (+ .cse102 .cse92))) (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ .cse102 .cse94)) .cse95)) .cse103)) .cse104 .cse81))))) (.cse26 (or .cse86 .cse87)) (.cse27 (or (let ((.cse83 (- .cse84))) (let ((.cse73 (+ .cse82 (+ (- 1) .cse83))) (.cse71 (+ .cse82 .cse83))) (and (or .cse69 (let ((.cse70 (* (+ .cse76 .cse77) |ULTIMATE.start_main_~B~0#1|))) (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse70 .cse71)) .cse72) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse70 .cse73)) .cse74 .cse75)))) (or .cse78 (let ((.cse79 (* (+ .cse76 .cse80) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse74 (= |ULTIMATE.start_main_~A~0#1| (+ .cse79 .cse73)) .cse75) (or .cse72 (= |ULTIMATE.start_main_~A~0#1| (+ .cse79 .cse71))))) .cse81)))) .cse85)) (.cse19 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse20 (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|)) (.cse49 (- |ULTIMATE.start_main_~B~0#1|)) (.cse6 (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| .cse51))) (.cse5 (= .cse53 0)) (.cse50 (= |ULTIMATE.start_main_~d~0#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse12 .cse13 .cse7 .cse8 .cse14 .cse11) (and .cse15 .cse16 .cse4 .cse5 .cse7 .cse9 .cse17 .cse10 .cse14 .cse18) (and .cse19 .cse12 .cse20 .cse13 .cse7) (and .cse21 .cse22 .cse7 .cse23 .cse24 .cse9 .cse2 .cse25 .cse26 .cse27 .cse28 .cse14 .cse29) (and .cse12 .cse19 .cse20 .cse13 .cse7) (and .cse2 .cse3 .cse30 (= |ULTIMATE.start_main_~p~0#1| 2) .cse31 .cse32 .cse4 .cse7 .cse28 (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 2)) .cse9 .cse14) (and .cse33 .cse30 .cse34 .cse21 .cse22 .cse7 .cse23 .cse35 .cse36 .cse24 .cse37 .cse9 .cse2 .cse3 .cse25 .cse38 .cse26 .cse4 .cse27 .cse39 .cse14 .cse29 .cse40) (and .cse7 .cse28 .cse24 .cse9 .cse14 .cse29) (and .cse2 .cse25 .cse34 .cse22 .cse26 .cse27 .cse7 .cse23 .cse41 .cse9 .cse14) (and .cse2 .cse3 .cse30 .cse4 .cse7 .cse41 .cse9 .cse14) (and .cse15 .cse42 .cse43 .cse16 .cse44 .cse12 .cse4 .cse13 .cse7 (= |ULTIMATE.start_main_~d~0#1| .cse45) .cse46 .cse18) (and .cse47 .cse30 .cse19 .cse48 .cse7 (= |ULTIMATE.start_main_~r~0#1| (+ (+ |ULTIMATE.start_main_~A~0#1| (* |ULTIMATE.start_main_~B~0#1| (- 2))) .cse49)) .cse50 (= |ULTIMATE.start_main_~r~0#1| (+ (+ |ULTIMATE.start_main_~A~0#1| (- 2)) .cse51)) .cse52 .cse2 (= (+ .cse53 .cse54) 0) .cse55 .cse56 .cse20 .cse57 (= (+ |ULTIMATE.start_main_~q~0#1| (- 2)) 1)) (and .cse2 .cse3 .cse30 .cse58 .cse4 .cse7 .cse28 .cse23 .cse24 .cse9 .cse14 .cse29) (and .cse22 (= |ULTIMATE.start_main_~r~0#1| (+ (+ |ULTIMATE.start_main_~A~0#1| (* |ULTIMATE.start_main_~B~0#1| (- 4))) .cse49)) .cse7 .cse23 .cse36 (= (+ .cse59 .cse60) |ULTIMATE.start_main_~A~0#1|) .cse2 .cse25 .cse38 (<= |ULTIMATE.start_main_~p~0#1| 1) .cse26 .cse20 .cse27 (= (+ |ULTIMATE.start_main_~q~0#1| (- 4)) 1) .cse39 (= |ULTIMATE.start_main_~q~0#1| (+ 4 |ULTIMATE.start_main_~p~0#1|)) .cse14 .cse40) (and .cse12 .cse7 (or (and .cse34 .cse22 .cse61 .cse24 .cse62 .cse2 .cse3 .cse26 .cse27 .cse39 .cse33 .cse21 .cse12 .cse7 .cse23 .cse35 .cse36 .cse37 .cse9 .cse25 .cse16 .cse38 .cse4 .cse14 .cse29 .cse40) (and .cse34 .cse22 .cse61 .cse24 .cse62 .cse2 .cse26 .cse27 .cse39 .cse33 .cse63 .cse21 .cse12 .cse7 .cse23 .cse35 .cse36 .cse37 .cse9 .cse25 .cse16 .cse38 .cse4 .cse14 .cse29 .cse40)) .cse9 .cse14) (and .cse2 .cse26 .cse7 .cse41 .cse9 .cse14) (let ((.cse64 (+ |ULTIMATE.start_main_~A~0#1| (* |ULTIMATE.start_main_~r~0#1| (- 1))))) (and (= .cse64 .cse65) .cse19 .cse7 .cse28 (let ((.cse68 (= 0 (mod (+ |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) 2))) (.cse66 (div (+ |ULTIMATE.start_main_~A~0#1| (- |ULTIMATE.start_main_~r~0#1|)) 2)) (.cse67 (< .cse64 0))) (or (and (= |ULTIMATE.start_main_~d~0#1| .cse66) (or (not .cse67) .cse68)) (and (not .cse68) (= |ULTIMATE.start_main_~d~0#1| (+ 1 .cse66)) .cse67))) (= (+ |ULTIMATE.start_main_~q~0#1| .cse54) 0))) (and .cse7 .cse41 .cse9 .cse14) (and .cse2 .cse58 .cse7 .cse28 .cse23 .cse24 .cse9 .cse14 .cse29) (and .cse31 .cse19 .cse32 .cse20 .cse7 .cse28 .cse9) (and .cse2 .cse26 .cse7 .cse28 .cse24 .cse9 .cse14 .cse29) (and .cse16 .cse12 (= |ULTIMATE.start_main_~d~0#1| (* 2 .cse60)) .cse61 .cse4 .cse13 .cse7 .cse9 .cse62 .cse14 (= |ULTIMATE.start_main_~p~0#1| (* 2 .cse45))) (and .cse34 .cse22 .cse7 .cse23 .cse41 .cse9 .cse17 .cse2 .cse25 .cse16 .cse26 .cse4 .cse27 .cse14) (and .cse2 .cse56 .cse19 .cse48 .cse20 (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| .cse49)) .cse7 .cse6 .cse5 (= (+ |ULTIMATE.start_main_~q~0#1| (* 1 (- 1))) 0) .cse50)))))))))) [2023-02-17 07:33:33,581 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 13) no Hoare annotation was computed. [2023-02-17 07:33:33,585 INFO L895 garLoopResultBuilder]: At program point L44-1(lines 44 56) the Hoare annotation is: (let ((.cse78 (div |ULTIMATE.start_main_~d~0#1| 2)) (.cse81 (div |ULTIMATE.start_main_~p~0#1| 2))) (let ((.cse80 (+ 1 .cse81)) (.cse214 (- .cse78))) (let ((.cse218 (+ (- 1) .cse214)) (.cse33 (+ |ULTIMATE.start_main_~q~0#1| .cse80)) (.cse63 (+ |ULTIMATE.start_main_~q~0#1| .cse81))) (let ((.cse190 (- |ULTIMATE.start_main_~d~0#1|)) (.cse26 (= 0 (mod |ULTIMATE.start_main_~d~0#1| 2))) (.cse243 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse23 (= 0 (mod |ULTIMATE.start_main_~p~0#1| 2))) (.cse31 (+ |ULTIMATE.start_main_~r~0#1| .cse214)) (.cse242 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse245 (* .cse63 |ULTIMATE.start_main_~B~0#1|)) (.cse244 (* .cse33 |ULTIMATE.start_main_~B~0#1|)) (.cse25 (+ |ULTIMATE.start_main_~r~0#1| .cse218)) (.cse239 (+ .cse81 1))) (let ((.cse108 (div |ULTIMATE.start_main_~p~0#1| 4)) (.cse111 (div .cse239 2)) (.cse229 (+ .cse78 1)) (.cse133 (= 1 .cse81)) (.cse138 (= 1 .cse80)) (.cse79 (+ 1 .cse78)) (.cse187 (= |ULTIMATE.start_main_~A~0#1| (+ .cse244 .cse25))) (.cse184 (= |ULTIMATE.start_main_~A~0#1| (+ .cse245 .cse25))) (.cse28 (not .cse242)) (.cse185 (= |ULTIMATE.start_main_~A~0#1| (+ .cse245 .cse31))) (.cse59 (and .cse243 (not .cse23))) (.cse186 (= |ULTIMATE.start_main_~A~0#1| (+ .cse244 .cse31))) (.cse34 (not .cse243)) (.cse30 (and .cse242 (not .cse26))) (.cse52 (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~p~0#1|)) (.cse53 (+ |ULTIMATE.start_main_~r~0#1| .cse190)) (.cse152 (= 1 |ULTIMATE.start_main_~p~0#1|))) (let ((.cse233 (not (= 0 |ULTIMATE.start_main_~q~0#1|))) (.cse51 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse234 (not .cse152)) (.cse120 (- |ULTIMATE.start_main_~B~0#1|)) (.cse4 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse123 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse52 |ULTIMATE.start_main_~B~0#1|) .cse53))) (.cse196 (or (and (or .cse185 .cse59) (or .cse23 .cse186 .cse34)) .cse30)) (.cse197 (or (and (or .cse23 .cse187 .cse34) (or .cse184 .cse59)) .cse26 .cse28)) (.cse130 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse6 (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|))) (.cse198 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse79 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)) .cse26 .cse28) (or .cse30 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse78 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))))) (.cse199 (and (or .cse59 (not .cse133)) (or .cse23 (not .cse138) .cse34))) (.cse107 (div |ULTIMATE.start_main_~d~0#1| 4)) (.cse104 (div .cse229 2)) (.cse35 (= 0 (mod .cse239 2))) (.cse240 (< .cse80 0)) (.cse110 (+ 1 .cse111)) (.cse109 (+ 1 .cse108)) (.cse241 (< .cse81 0)) (.cse71 (= 0 (mod .cse81 2)))) (let ((.cse64 (and .cse241 (not .cse71))) (.cse163 (= 1 .cse108)) (.cse72 (not .cse241)) (.cse169 (= 1 .cse109)) (.cse153 (= 1 .cse110)) (.cse36 (not .cse240)) (.cse158 (= 1 .cse111)) (.cse42 (and .cse240 (not .cse35))) (.cse83 (= 0 (mod .cse229 2))) (.cse235 (< .cse79 0)) (.cse98 (= 0 (mod .cse78 2))) (.cse236 (< .cse78 0)) (.cse221 (* 2 |ULTIMATE.start_main_~p~0#1|)) (.cse228 (+ .cse104 1)) (.cse105 (+ 1 .cse104)) (.cse106 (+ 1 .cse107)) (.cse222 (+ .cse107 1)) (.cse238 (+ .cse108 1)) (.cse237 (+ .cse111 1)) (.cse232 (* 2 |ULTIMATE.start_main_~d~0#1|)) (.cse145 (- .cse104)) (.cse141 (- .cse107)) (.cse192 (or .cse198 .cse199)) (.cse8 (or (and (or .cse26 (= |ULTIMATE.start_main_~B~0#1| .cse79) .cse28) (or .cse30 (= |ULTIMATE.start_main_~B~0#1| .cse78))) .cse199)) (.cse194 (or (and .cse123 .cse196 .cse197 (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| .cse120)) .cse4 .cse130 (= (+ |ULTIMATE.start_main_~q~0#1| (* 1 (- 1))) 0) .cse6) (and .cse123 .cse130 .cse6) (and .cse123 .cse196 .cse197 .cse130 .cse6))) (.cse195 (or .cse233 .cse51 .cse234))) (let ((.cse12 (or (and .cse192 .cse8 .cse194 .cse195) (and .cse192 .cse8 .cse194 (<= 1 |ULTIMATE.start_main_~d~0#1|) .cse195))) (.cse142 (+ (- 1) .cse141)) (.cse146 (+ (- 1) .cse145)) (.cse118 (* 2 1)) (.cse1 (* 2 .cse232)) (.cse40 (div .cse237 2)) (.cse44 (div .cse239 4)) (.cse76 (div .cse238 2)) (.cse65 (= 0 (mod .cse108 2))) (.cse68 (div |ULTIMATE.start_main_~p~0#1| 8)) (.cse70 (< .cse108 0)) (.cse102 (= 0 (mod .cse107 2))) (.cse223 (< .cse107 0)) (.cse74 (= 0 (mod .cse238 2))) (.cse224 (< .cse109 0)) (.cse95 (= 0 (mod .cse222 2))) (.cse225 (< .cse106 0)) (.cse226 (< .cse111 0)) (.cse46 (= 0 (mod .cse111 2))) (.cse39 (= 0 (mod .cse237 2))) (.cse227 (< .cse110 0)) (.cse230 (< .cse105 0)) (.cse86 (= 0 (mod .cse228 2))) (.cse92 (= 0 (mod .cse104 2))) (.cse231 (< .cse104 0)) (.cse58 (div .cse221 4)) (.cse131 (= 1 .cse221)) (.cse54 (+ |ULTIMATE.start_main_~q~0#1| .cse221)) (.cse55 (+ |ULTIMATE.start_main_~r~0#1| (- .cse232))) (.cse97 (not .cse236)) (.cse99 (and (not .cse98) .cse236)) (.cse88 (and (not .cse83) .cse235)) (.cse82 (not .cse235)) (.cse220 (and (or .cse35 (not .cse153) .cse36) (or (not .cse158) .cse42))) (.cse219 (and (or .cse64 (not .cse163)) (or .cse71 .cse72 (not .cse169))))) (let ((.cse14 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse10 (or (and (or .cse30 (and (or .cse97 .cse98 (= |ULTIMATE.start_main_~B~0#1| .cse106)) (or .cse99 (= |ULTIMATE.start_main_~B~0#1| .cse107)))) (or .cse26 (and (or .cse88 (= |ULTIMATE.start_main_~B~0#1| .cse104)) (or (= |ULTIMATE.start_main_~B~0#1| .cse105) .cse82 .cse83)) .cse28)) (and (or .cse23 .cse34 .cse220) (or .cse219 .cse59)))) (.cse11 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse115 (or .cse233 .cse131 .cse234 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~d~0#1| .cse54) .cse55)))) (.cse57 (+ 1 .cse58)) (.cse56 (div .cse232 4)) (.cse91 (not .cse231)) (.cse90 (and .cse231 (not .cse92))) (.cse87 (and .cse230 (not .cse86))) (.cse85 (not .cse230)) (.cse89 (div .cse229 4)) (.cse84 (div .cse228 2)) (.cse38 (not .cse227)) (.cse41 (and .cse227 (not .cse39))) (.cse43 (and .cse226 (not .cse46))) (.cse47 (not .cse226)) (.cse96 (not .cse225)) (.cse93 (and .cse225 (not .cse95))) (.cse75 (not .cse224)) (.cse77 (and (not .cse74) .cse224)) (.cse103 (not .cse223)) (.cse100 (and .cse223 (not .cse102))) (.cse67 (not .cse70)) (.cse94 (div .cse222 2)) (.cse101 (div |ULTIMATE.start_main_~d~0#1| 8)) (.cse66 (+ 1 .cse68)) (.cse69 (not .cse65)) (.cse73 (+ 1 .cse76)) (.cse45 (+ 1 .cse44)) (.cse37 (+ 1 .cse40)) (.cse60 (+ |ULTIMATE.start_main_~q~0#1| (* 2 .cse221))) (.cse61 (+ |ULTIMATE.start_main_~r~0#1| (- .cse1))) (.cse19 (* .cse118 (- 1))) (.cse112 (or .cse23 .cse138 (and (or .cse30 (and (or .cse97 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse106 .cse33) .cse31)) .cse98) (or .cse99 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse107 .cse33) .cse31))))) (or .cse26 (and (or .cse82 .cse83 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse105 .cse33) .cse25))) (or .cse88 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse104 .cse33) .cse25)))) .cse28)) .cse34 .cse220)) (.cse113 (or .cse133 .cse219 (and (or .cse26 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse105 .cse63) .cse25)) .cse82 .cse83) (or .cse88 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse104 .cse63) .cse25)))) .cse28) (or .cse30 (and (or .cse99 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse107 .cse63) .cse31))) (or .cse97 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse106 .cse63) .cse31)) .cse98)))) .cse59)) (.cse116 (let ((.cse205 (* (+ .cse33 .cse111) |ULTIMATE.start_main_~B~0#1|)) (.cse207 (* (+ .cse33 .cse110) |ULTIMATE.start_main_~B~0#1|)) (.cse209 (* (+ .cse63 .cse109) |ULTIMATE.start_main_~B~0#1|)) (.cse210 (* (+ .cse63 .cse108) |ULTIMATE.start_main_~B~0#1|)) (.cse211 (* (+ .cse52 .cse80) |ULTIMATE.start_main_~B~0#1|)) (.cse213 (* (+ .cse52 .cse81) |ULTIMATE.start_main_~B~0#1|))) (let ((.cse200 (or (let ((.cse217 (+ .cse53 .cse218))) (and (or .cse23 (= |ULTIMATE.start_main_~A~0#1| (+ .cse211 .cse217)) .cse34) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse213 .cse217)) .cse59))) .cse26 .cse28)) (.cse201 (or .cse26 (let ((.cse216 (+ .cse25 .cse146)) (.cse215 (+ .cse25 .cse145))) (and (or .cse23 (and (or .cse88 (and (or .cse42 (= |ULTIMATE.start_main_~A~0#1| (+ .cse205 .cse215))) (or .cse35 (= |ULTIMATE.start_main_~A~0#1| (+ .cse207 .cse215)) .cse36))) (or .cse82 .cse83 (and (or .cse42 (= |ULTIMATE.start_main_~A~0#1| (+ .cse205 .cse216))) (or .cse35 (= |ULTIMATE.start_main_~A~0#1| (+ .cse207 .cse216)) .cse36)))) .cse34) (or (and (or (and (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ .cse210 .cse216))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse209 .cse216)) .cse71 .cse72)) .cse82 .cse83) (or .cse88 (and (or .cse71 .cse72 (= |ULTIMATE.start_main_~A~0#1| (+ .cse209 .cse215))) (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ .cse210 .cse215)))))) .cse59))) .cse28)) (.cse203 (or .cse30 (let ((.cse212 (+ .cse53 .cse214))) (and (or .cse23 .cse34 (= |ULTIMATE.start_main_~A~0#1| (+ .cse211 .cse212))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse213 .cse212)) .cse59))))) (.cse204 (or .cse30 (let ((.cse206 (+ .cse31 .cse141)) (.cse208 (+ .cse31 .cse142))) (and (or .cse23 (and (or .cse99 (and (or .cse42 (= |ULTIMATE.start_main_~A~0#1| (+ .cse205 .cse206))) (or .cse35 .cse36 (= |ULTIMATE.start_main_~A~0#1| (+ .cse207 .cse206))))) (or .cse97 (and (or .cse35 (= |ULTIMATE.start_main_~A~0#1| (+ .cse207 .cse208)) .cse36) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse205 .cse208)) .cse42)) .cse98)) .cse34) (or .cse59 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse209 .cse206)) .cse71 .cse72) (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ .cse210 .cse206)))) .cse99) (or (and (or .cse71 .cse72 (= |ULTIMATE.start_main_~A~0#1| (+ .cse209 .cse208))) (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ .cse210 .cse208)))) .cse97 .cse98))))))) (.cse202 (= |ULTIMATE.start_main_~A~0#1| (+ (* (+ .cse54 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~B~0#1|) (+ .cse55 .cse190))))) (or (and .cse12 .cse200 .cse201 .cse123 .cse202 .cse203 .cse196 .cse197 .cse204 .cse130) (and .cse12 .cse200 .cse201 .cse123 .cse202 .cse203 .cse196 .cse197 .cse4 .cse204 (= |ULTIMATE.start_main_~r~0#1| (+ (+ |ULTIMATE.start_main_~A~0#1| (* |ULTIMATE.start_main_~B~0#1| (- 2))) .cse120)) (= (+ |ULTIMATE.start_main_~q~0#1| (- 2)) 1)) (and .cse12 .cse123 .cse202 .cse130))))) (.cse117 (or (and (or .cse26 .cse28 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse79 .cse52) .cse53))) (or .cse30 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse78 .cse52) .cse53)))) .cse152 .cse199)) (.cse114 (or .cse152 .cse198 .cse199)) (.cse15 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse191 (+ |ULTIMATE.start_main_~q~0#1| (* |ULTIMATE.start_main_~p~0#1| (- 1)))) (.cse5 (= |ULTIMATE.start_main_~d~0#1| 1)) (.cse20 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse21 (= |ULTIMATE.start_main_~q~0#1| 0))) (let ((.cse22 (let ((.cse193 (or (and .cse123 .cse20 .cse196 .cse197 .cse21 .cse4 .cse130 .cse6) (and .cse123 .cse20 .cse21 .cse4 .cse130 .cse6)))) (or (and .cse192 .cse51 .cse193) (and .cse194 .cse15 (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| .cse190)) (= .cse191 0) .cse5) (and .cse192 .cse195 .cse193) (and .cse192 .cse194 .cse51)))) (.cse9 (or (and (= (+ .cse191 .cse19) 0) .cse116 .cse15 .cse5 (= |ULTIMATE.start_main_~r~0#1| (+ (+ |ULTIMATE.start_main_~A~0#1| (- 2)) .cse190))) (and .cse112 .cse113 .cse116 .cse117 .cse114 .cse51))) (.cse3 (let ((.cse137 (* (+ |ULTIMATE.start_main_~q~0#1| .cse109) |ULTIMATE.start_main_~B~0#1|)) (.cse134 (* (+ |ULTIMATE.start_main_~q~0#1| .cse108) |ULTIMATE.start_main_~B~0#1|)) (.cse140 (* (+ |ULTIMATE.start_main_~q~0#1| .cse111) |ULTIMATE.start_main_~B~0#1|)) (.cse139 (* (+ |ULTIMATE.start_main_~q~0#1| .cse110) |ULTIMATE.start_main_~B~0#1|)) (.cse132 (= |ULTIMATE.start_main_~A~0#1| (+ (* (+ .cse60 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~B~0#1|) (+ .cse61 .cse190)))) (.cse154 (* (+ .cse33 .cse37) |ULTIMATE.start_main_~B~0#1|)) (.cse157 (* (+ .cse33 .cse40) |ULTIMATE.start_main_~B~0#1|)) (.cse160 (* (+ .cse33 .cse44) |ULTIMATE.start_main_~B~0#1|)) (.cse159 (* (+ .cse33 .cse45) |ULTIMATE.start_main_~B~0#1|)) (.cse168 (* (+ .cse63 .cse73) |ULTIMATE.start_main_~B~0#1|)) (.cse167 (* (+ .cse63 .cse76) |ULTIMATE.start_main_~B~0#1|)) (.cse165 (* (+ .cse63 .cse68) |ULTIMATE.start_main_~B~0#1|)) (.cse166 (and .cse70 .cse69)) (.cse164 (* (+ .cse63 .cse66) |ULTIMATE.start_main_~B~0#1|)) (.cse175 (* (+ .cse52 .cse109) |ULTIMATE.start_main_~B~0#1|)) (.cse172 (* (+ .cse52 .cse108) |ULTIMATE.start_main_~B~0#1|)) (.cse176 (* (+ .cse52 .cse111) |ULTIMATE.start_main_~B~0#1|)) (.cse177 (* (+ .cse52 .cse110) |ULTIMATE.start_main_~B~0#1|))) (let ((.cse119 (or (let ((.cse189 (+ .cse53 .cse145)) (.cse188 (+ .cse53 .cse146))) (and (or .cse133 (and (or .cse71 (and (or .cse82 (= |ULTIMATE.start_main_~A~0#1| (+ .cse175 .cse188)) .cse83) (or .cse88 (= |ULTIMATE.start_main_~A~0#1| (+ .cse175 .cse189)))) .cse72) (or (and (or .cse82 .cse83 (= |ULTIMATE.start_main_~A~0#1| (+ .cse172 .cse188))) (or .cse88 (= |ULTIMATE.start_main_~A~0#1| (+ .cse172 .cse189)))) .cse64)) .cse59) (or .cse23 (and (or .cse42 (and (or .cse88 (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse189))) (or .cse82 (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse188)) .cse83))) (or .cse35 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse189)) .cse88) (or .cse82 (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse188)) .cse83)) .cse36)) .cse138 .cse34))) .cse26 .cse28)) (.cse121 (or .cse152 (and (or (and (or .cse184 .cse26 .cse28) (or .cse185 .cse30)) .cse59) (or .cse23 (and (or .cse186 .cse30) (or .cse187 .cse26 .cse28)) .cse34)))) (.cse122 (or .cse30 (let ((.cse182 (- .cse101)) (.cse183 (- .cse94))) (let ((.cse178 (+ .cse31 (+ (- 1) .cse183))) (.cse179 (+ .cse31 .cse183)) (.cse181 (+ .cse31 (+ (- 1) .cse182))) (.cse180 (+ .cse31 .cse182))) (and (or (and (or .cse97 (and (or .cse35 .cse153 .cse36 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse157 .cse178)) .cse95 .cse96) (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ .cse157 .cse179)))) .cse41) (or (and (or .cse95 (= |ULTIMATE.start_main_~A~0#1| (+ .cse154 .cse178)) .cse96) (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ .cse154 .cse179)))) .cse38 .cse39))) (or .cse158 .cse42 (and (or .cse46 .cse47 (and (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ .cse159 .cse179))) (or .cse95 .cse96 (= |ULTIMATE.start_main_~A~0#1| (+ .cse159 .cse178))))) (or (and (or .cse95 (= |ULTIMATE.start_main_~A~0#1| (+ .cse160 .cse178)) .cse96) (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ .cse160 .cse179)))) .cse43)))) .cse98) (or .cse99 (and (or (and (or .cse38 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse154 .cse180)) .cse100) (or .cse102 (= |ULTIMATE.start_main_~A~0#1| (+ .cse154 .cse181)) .cse103)) .cse39) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse157 .cse180)) .cse100) (or .cse102 (= |ULTIMATE.start_main_~A~0#1| (+ .cse157 .cse181)) .cse103)) .cse41)) .cse35 .cse153 .cse36) (or .cse158 .cse42 (and (or (and (or .cse102 (= |ULTIMATE.start_main_~A~0#1| (+ .cse160 .cse181)) .cse103) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse160 .cse180)) .cse100)) .cse43) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse159 .cse180)) .cse100) (or .cse102 (= |ULTIMATE.start_main_~A~0#1| (+ .cse159 .cse181)) .cse103)) .cse46 .cse47)))))) .cse23 .cse34) (or (and (or (and (or .cse163 .cse64 (and (or (and (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ .cse165 .cse179))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse165 .cse178)) .cse95 .cse96)) .cse166) (or .cse65 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse164 .cse178)) .cse95 .cse96) (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ .cse164 .cse179)))) .cse67))) (or .cse71 .cse72 (and (or .cse75 .cse74 (and (or .cse95 .cse96 (= |ULTIMATE.start_main_~A~0#1| (+ .cse168 .cse178))) (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ .cse168 .cse179))))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse167 .cse178)) .cse95 .cse96) (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ .cse167 .cse179)))) .cse77)) .cse169)) .cse97 .cse98) (or .cse99 (and (or .cse71 (and (or (and (or .cse102 (= |ULTIMATE.start_main_~A~0#1| (+ .cse168 .cse181)) .cse103) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse168 .cse180)) .cse100)) .cse75 .cse74) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse167 .cse181)) .cse102 .cse103) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse167 .cse180)) .cse100)) .cse77)) .cse72 .cse169) (or .cse163 .cse64 (and (or (and (or .cse102 (= |ULTIMATE.start_main_~A~0#1| (+ .cse165 .cse181)) .cse103) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse165 .cse180)) .cse100)) .cse166) (or .cse65 (and (or .cse102 .cse103 (= |ULTIMATE.start_main_~A~0#1| (+ .cse164 .cse181))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse164 .cse180)) .cse100)) .cse67)))))) .cse59)))))) (.cse124 (or .cse30 (let ((.cse173 (+ .cse53 .cse141)) (.cse174 (+ .cse53 .cse142))) (and (or .cse133 .cse59 (and (or .cse64 (and (or .cse99 (= |ULTIMATE.start_main_~A~0#1| (+ .cse172 .cse173))) (or .cse97 (= |ULTIMATE.start_main_~A~0#1| (+ .cse172 .cse174)) .cse98))) (or (and (or .cse97 .cse98 (= |ULTIMATE.start_main_~A~0#1| (+ .cse175 .cse174))) (or .cse99 (= |ULTIMATE.start_main_~A~0#1| (+ .cse175 .cse173)))) .cse71 .cse72))) (or .cse23 (and (or .cse42 (and (or .cse99 (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse173))) (or .cse97 (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse174)) .cse98))) (or .cse35 (and (or .cse99 (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse173))) (or .cse97 (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse174)) .cse98)) .cse36)) .cse138 .cse34))))) (.cse125 (or .cse26 (let ((.cse170 (- .cse84)) (.cse171 (- .cse89))) (let ((.cse162 (+ .cse25 (+ (- 1) .cse171))) (.cse161 (+ .cse25 .cse171)) (.cse156 (+ .cse25 .cse170)) (.cse155 (+ .cse25 (+ (- 1) .cse170)))) (and (or (and (or .cse82 .cse83 (and (or .cse35 .cse153 .cse36 (and (or .cse38 (and (or .cse85 (= |ULTIMATE.start_main_~A~0#1| (+ .cse154 .cse155)) .cse86) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse154 .cse156)) .cse87)) .cse39) (or (and (or .cse85 (= |ULTIMATE.start_main_~A~0#1| (+ .cse157 .cse155)) .cse86) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse157 .cse156)) .cse87)) .cse41))) (or .cse158 .cse42 (and (or .cse46 .cse47 (and (or .cse85 (= |ULTIMATE.start_main_~A~0#1| (+ .cse159 .cse155)) .cse86) (or .cse87 (= |ULTIMATE.start_main_~A~0#1| (+ .cse159 .cse156))))) (or .cse43 (and (or .cse85 (= |ULTIMATE.start_main_~A~0#1| (+ .cse160 .cse155)) .cse86) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse160 .cse156)) .cse87))))))) (or .cse88 (and (or .cse158 .cse42 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse160 .cse161)) .cse90) (or .cse91 .cse92 (= |ULTIMATE.start_main_~A~0#1| (+ .cse160 .cse162)))) .cse43) (or .cse46 (and (or .cse91 .cse92 (= |ULTIMATE.start_main_~A~0#1| (+ .cse159 .cse162))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse159 .cse161)) .cse90)) .cse47))) (or .cse35 .cse153 .cse36 (and (or .cse38 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse154 .cse161)) .cse90) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse154 .cse162)) .cse91 .cse92)) .cse39) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse157 .cse161)) .cse90) (or .cse91 .cse92 (= |ULTIMATE.start_main_~A~0#1| (+ .cse157 .cse162)))) .cse41)))))) .cse23 .cse34) (or (and (or .cse88 (and (or .cse163 .cse64 (and (or .cse65 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse164 .cse162)) .cse91 .cse92) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse164 .cse161)) .cse90)) .cse67) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse165 .cse161)) .cse90) (or .cse91 .cse92 (= |ULTIMATE.start_main_~A~0#1| (+ .cse165 .cse162)))) .cse166))) (or (and (or (and (or .cse90 (= |ULTIMATE.start_main_~A~0#1| (+ .cse167 .cse161))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse167 .cse162)) .cse91 .cse92)) .cse77) (or .cse75 .cse74 (and (or .cse91 .cse92 (= |ULTIMATE.start_main_~A~0#1| (+ .cse168 .cse162))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse168 .cse161)) .cse90)))) .cse71 .cse72 .cse169))) (or .cse82 .cse83 (and (or (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse165 .cse156)) .cse87) (or .cse85 (= |ULTIMATE.start_main_~A~0#1| (+ .cse165 .cse155)) .cse86)) .cse166) (or (and (or .cse85 (= |ULTIMATE.start_main_~A~0#1| (+ .cse164 .cse155)) .cse86) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse164 .cse156)) .cse87)) .cse65 .cse67)) .cse163 .cse64) (or .cse71 (and (or (and (or .cse87 (= |ULTIMATE.start_main_~A~0#1| (+ .cse167 .cse156))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse167 .cse155)) .cse85 .cse86)) .cse77) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse168 .cse156)) .cse87) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse168 .cse155)) .cse85 .cse86)) .cse75 .cse74)) .cse72 .cse169)))) .cse59)))) .cse28)) (.cse126 (or .cse131 .cse132)) (.cse127 (or (let ((.cse151 (- .cse56))) (let ((.cse149 (+ .cse55 (+ (- 1) .cse151))) (.cse148 (+ .cse55 .cse151))) (and (or .cse59 (let ((.cse147 (* (+ .cse54 .cse58) |ULTIMATE.start_main_~B~0#1|))) (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse147 .cse148)) .cse30) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse147 .cse149)) .cse26 .cse28)))) (or .cse23 (let ((.cse150 (* (+ .cse54 .cse57) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse26 (= |ULTIMATE.start_main_~A~0#1| (+ .cse150 .cse149)) .cse28) (or .cse30 (= |ULTIMATE.start_main_~A~0#1| (+ .cse150 .cse148))))) .cse34)))) .cse152)) (.cse128 (or .cse26 (let ((.cse144 (+ |ULTIMATE.start_main_~r~0#1| .cse146)) (.cse143 (+ |ULTIMATE.start_main_~r~0#1| .cse145))) (and (or .cse133 (and (or .cse71 (and (or .cse88 (= |ULTIMATE.start_main_~A~0#1| (+ .cse137 .cse143))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse137 .cse144)) .cse82 .cse83)) .cse72) (or .cse64 (and (or .cse88 (= |ULTIMATE.start_main_~A~0#1| (+ .cse134 .cse143))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse134 .cse144)) .cse82 .cse83)))) .cse59) (or .cse23 (and (or .cse42 (and (or .cse88 (= |ULTIMATE.start_main_~A~0#1| (+ .cse140 .cse143))) (or .cse82 (= |ULTIMATE.start_main_~A~0#1| (+ .cse140 .cse144)) .cse83))) (or .cse35 (and (or .cse82 .cse83 (= |ULTIMATE.start_main_~A~0#1| (+ .cse139 .cse144))) (or .cse88 (= |ULTIMATE.start_main_~A~0#1| (+ .cse139 .cse143)))) .cse36)) .cse138 .cse34))) .cse28)) (.cse129 (or (let ((.cse135 (+ |ULTIMATE.start_main_~r~0#1| .cse142)) (.cse136 (+ |ULTIMATE.start_main_~r~0#1| .cse141))) (and (or .cse133 (and (or (and (or .cse97 (= |ULTIMATE.start_main_~A~0#1| (+ .cse134 .cse135)) .cse98) (or .cse99 (= |ULTIMATE.start_main_~A~0#1| (+ .cse134 .cse136)))) .cse64) (or .cse71 (and (or .cse99 (= |ULTIMATE.start_main_~A~0#1| (+ .cse137 .cse136))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse137 .cse135)) .cse97 .cse98)) .cse72)) .cse59) (or .cse23 .cse138 (and (or .cse35 .cse36 (and (or .cse99 (= |ULTIMATE.start_main_~A~0#1| (+ .cse139 .cse136))) (or .cse97 .cse98 (= |ULTIMATE.start_main_~A~0#1| (+ .cse139 .cse135))))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse140 .cse135)) .cse97 .cse98) (or .cse99 (= |ULTIMATE.start_main_~A~0#1| (+ .cse140 .cse136)))) .cse42)) .cse34))) .cse30))) (or (and .cse112 .cse113 .cse114 .cse119 .cse10 (= |ULTIMATE.start_main_~r~0#1| (+ (+ |ULTIMATE.start_main_~A~0#1| (* |ULTIMATE.start_main_~B~0#1| (- 4))) .cse120)) .cse4 .cse121 .cse122 .cse11 .cse123 .cse124 .cse115 .cse8 .cse116 .cse117 .cse125 .cse126 .cse127 (= (+ |ULTIMATE.start_main_~q~0#1| (- 4)) 1) .cse128 .cse129) (and .cse112 .cse113 .cse114 .cse10 .cse121 .cse11 .cse130 .cse123 .cse115 .cse8 .cse116 .cse117 .cse126 .cse127) (and .cse112 .cse113 .cse114 .cse119 .cse10 .cse121 .cse11 .cse124 .cse115 .cse8 .cse116 .cse117 (or .cse131 .cse132 (not .cse20)) .cse127 .cse128 .cse129) (and .cse112 .cse113 .cse114 .cse119 .cse10 .cse121 .cse122 .cse11 .cse130 .cse123 .cse124 .cse115 .cse8 .cse116 .cse117 .cse125 .cse126 .cse127 .cse128 .cse129))))) (.cse7 (* 2 .cse14)) (.cse2 (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|))) (or (let ((.cse0 (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|))) (and (= (+ .cse0 .cse1) |ULTIMATE.start_main_~A~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 1) .cse2 .cse3 .cse4 (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~p~0#1|)) (= |ULTIMATE.start_main_~q~0#1| (+ 4 |ULTIMATE.start_main_~p~0#1|)) .cse5 .cse6 (= (+ .cse0 .cse7) |ULTIMATE.start_main_~A~0#1|))) (and .cse8 .cse9 .cse10 .cse11) (let ((.cse13 (+ |ULTIMATE.start_main_~A~0#1| (* |ULTIMATE.start_main_~r~0#1| (- 1))))) (and .cse12 (= .cse13 .cse14) .cse15 .cse4 (let ((.cse18 (= 0 (mod (+ |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) 2))) (.cse16 (div (+ |ULTIMATE.start_main_~A~0#1| (- |ULTIMATE.start_main_~r~0#1|)) 2)) (.cse17 (< .cse13 0))) (or (and (= |ULTIMATE.start_main_~d~0#1| .cse16) (or (not .cse17) .cse18)) (and (not .cse18) (= |ULTIMATE.start_main_~d~0#1| (+ 1 .cse16)) .cse17))) (= (+ |ULTIMATE.start_main_~q~0#1| .cse19) 0))) (and .cse20 .cse15 .cse2 .cse21 .cse4 .cse6) (and .cse15 .cse20 .cse2 .cse21 .cse4) (and .cse22 .cse15 .cse2 .cse4) (and .cse22 .cse8 .cse11) (and .cse15 .cse9 .cse2 .cse4) (let ((.cse32 (* |ULTIMATE.start_main_~B~0#1| 1))) (let ((.cse49 (and (or (and (or .cse64 (not (<= 1 .cse108))) (or .cse71 .cse72 (not (<= 1 .cse109)))) .cse59) (or .cse23 .cse34 (and (or (not (<= 1 .cse110)) .cse35 .cse36) (or .cse42 (not (<= 1 .cse111))))))) (.cse50 (and (or .cse26 (and (or .cse88 (not (= .cse32 .cse104))) (or .cse82 .cse83 (not (= .cse32 .cse105)))) .cse28) (or .cse30 (and (or .cse97 (not (= .cse32 .cse106)) .cse98) (or .cse99 (not (= .cse32 .cse107))))))) (.cse29 (and (or (and (or .cse93 (not (= .cse32 .cse94))) (or .cse95 .cse96 (not (= .cse32 (+ 1 .cse94))))) .cse97 .cse98) (or .cse99 (and (or .cse100 (not (= .cse32 .cse101))) (or .cse102 (not (= .cse32 (+ 1 .cse101))) .cse103))))) (.cse27 (and (or .cse82 .cse83 (and (or (not (= .cse32 (+ 1 .cse84))) .cse85 .cse86) (or .cse87 (not (= .cse32 .cse84))))) (or .cse88 (and (or (not (= .cse32 .cse89)) .cse90) (or .cse91 (not (= .cse32 (+ 1 .cse89))) .cse92))))) (.cse48 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse32 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)))) (and (or .cse23 (let ((.cse24 (* .cse32 .cse33))) (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse24 .cse25)) .cse26 .cse27 .cse28) (or .cse29 .cse30 (= |ULTIMATE.start_main_~A~0#1| (+ .cse24 .cse31))))) .cse34 (and (or .cse35 .cse36 (and (or (not (<= 1 .cse37)) .cse38 .cse39) (or (not (<= 1 .cse40)) .cse41))) (or .cse42 (and (or .cse43 (not (<= 1 .cse44))) (or (not (<= 1 .cse45)) .cse46 .cse47))))) (or .cse48 .cse49 .cse50) .cse51 (or .cse49 .cse50 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse32 .cse52) .cse53))) .cse3 .cse4 (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse32 .cse54) .cse55)) (and (or .cse30 (not (= .cse32 .cse56))) (or .cse26 .cse28 (not (= .cse32 (+ 1 .cse56))))) (and (or .cse23 .cse34 (not (<= 1 .cse57))) (or (not (<= 1 .cse58)) .cse59))) (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse32 .cse60) .cse61)) (not (= .cse32 |ULTIMATE.start_main_~d~0#1|)) (not (<= 1 |ULTIMATE.start_main_~p~0#1|))) (or (let ((.cse62 (* .cse32 .cse63))) (and (or .cse29 (= |ULTIMATE.start_main_~A~0#1| (+ .cse62 .cse31)) .cse30) (or .cse26 (= |ULTIMATE.start_main_~A~0#1| (+ .cse62 .cse25)) .cse27 .cse28))) .cse59 (and (or .cse64 (and (or .cse65 (not (<= 1 .cse66)) .cse67) (or (not (<= 1 .cse68)) (and .cse69 .cse70)))) (or .cse71 .cse72 (and (or (not (<= 1 .cse73)) .cse74 .cse75) (or (not (<= 1 .cse76)) .cse77))))) .cse6 (or .cse48 (and (or (not (= .cse32 .cse78)) .cse30) (or .cse26 (not (= .cse32 .cse79)) .cse28)) (and (or (not (<= 1 .cse80)) .cse23 .cse34) (or (not (<= 1 .cse81)) .cse59)))))) (and .cse112 .cse113 .cse114 .cse15 .cse10 .cse4 .cse11 .cse115 .cse8 .cse116 .cse117 (= (+ |ULTIMATE.start_main_~q~0#1| (* (* 2 .cse118) (- 1))) 0) (= (+ |ULTIMATE.start_main_~r~0#1| .cse7) |ULTIMATE.start_main_~A~0#1|) .cse2)))))))))))) [2023-02-17 07:33:33,585 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 22 61) the Hoare annotation is: true [2023-02-17 07:33:33,587 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (let ((.cse53 (div |ULTIMATE.start_main_~d~0#1| 2)) (.cse58 (div |ULTIMATE.start_main_~p~0#1| 2))) (let ((.cse57 (+ 1 .cse58)) (.cse220 (- .cse53))) (let ((.cse226 (+ (- 1) .cse220)) (.cse147 (+ |ULTIMATE.start_main_~q~0#1| .cse57)) (.cse112 (+ |ULTIMATE.start_main_~q~0#1| .cse58)) (.cse230 (mod |ULTIMATE.start_main_~d~0#1| 2)) (.cse186 (+ .cse58 1))) (let ((.cse172 (div .cse186 2)) (.cse169 (div |ULTIMATE.start_main_~p~0#1| 4)) (.cse178 (+ .cse53 1)) (.cse138 (= 1 |ULTIMATE.start_main_~p~0#1|)) (.cse162 (- |ULTIMATE.start_main_~d~0#1|)) (.cse54 (= 0 .cse230)) (.cse236 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse41 (= 0 (mod |ULTIMATE.start_main_~p~0#1| 2))) (.cse110 (+ |ULTIMATE.start_main_~r~0#1| .cse220)) (.cse235 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse238 (* .cse112 |ULTIMATE.start_main_~B~0#1|)) (.cse237 (* .cse147 |ULTIMATE.start_main_~B~0#1|)) (.cse96 (+ |ULTIMATE.start_main_~r~0#1| .cse226))) (let ((.cse29 (= 1 .cse58)) (.cse42 (= 1 .cse57)) (.cse142 (= |ULTIMATE.start_main_~A~0#1| (+ .cse237 .cse96))) (.cse139 (= |ULTIMATE.start_main_~A~0#1| (+ .cse238 .cse96))) (.cse56 (not .cse235)) (.cse140 (= |ULTIMATE.start_main_~A~0#1| (+ .cse238 .cse110))) (.cse40 (and .cse236 (not .cse41))) (.cse141 (= |ULTIMATE.start_main_~A~0#1| (+ .cse237 .cse110))) (.cse48 (not .cse236)) (.cse51 (and .cse235 (not .cse54))) (.cse145 (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~p~0#1|)) (.cse107 (+ |ULTIMATE.start_main_~r~0#1| .cse162)) (.cse0 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse27 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse229 (not .cse138)) (.cse168 (div |ULTIMATE.start_main_~d~0#1| 4)) (.cse165 (div .cse178 2)) (.cse170 (+ 1 .cse169)) (.cse233 (< .cse58 0)) (.cse37 (= 0 (mod .cse58 2))) (.cse55 (+ 1 .cse53)) (.cse43 (= 0 (mod .cse186 2))) (.cse234 (< .cse57 0)) (.cse171 (+ 1 .cse172))) (let ((.cse61 (= 1 .cse171)) (.cse44 (not .cse234)) (.cse72 (= 1 .cse172)) (.cse47 (and .cse234 (not .cse43))) (.cse60 (= 0 (mod .cse178 2))) (.cse227 (< .cse55 0)) (.cse33 (= 0 (mod .cse53 2))) (.cse228 (< .cse53 0)) (.cse173 (* 2 |ULTIMATE.start_main_~d~0#1|)) (.cse161 (* 2 |ULTIMATE.start_main_~p~0#1|)) (.cse36 (and .cse233 (not .cse37))) (.cse84 (= 1 .cse169)) (.cse39 (not .cse233)) (.cse95 (= 1 .cse170)) (.cse154 (- .cse165)) (.cse49 (- .cse168)) (.cse231 (div .cse162 (- 2))) (.cse13 (or .cse27 .cse229)) (.cse187 (or .cse0 (= (+ |ULTIMATE.start_main_~A~0#1| (* (- 1) |ULTIMATE.start_main_~r~0#1|)) 0))) (.cse12 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse145 |ULTIMATE.start_main_~B~0#1|) .cse107))) (.cse188 (= 0 |ULTIMATE.start_main_~q~0#1|)) (.cse209 (or (and (or .cse140 .cse40) (or .cse41 .cse141 .cse48)) .cse51)) (.cse205 (or (and (or .cse41 .cse142 .cse48) (or .cse139 .cse40)) .cse54 .cse56)) (.cse189 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse6 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse11 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse22 (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|))) (.cse224 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse55 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)) .cse54 .cse56) (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse53 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))))) (.cse221 (and (or .cse40 (not .cse29)) (or .cse41 (not .cse42) .cse48)))) (let ((.cse190 (* 2 1)) (.cse191 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse192 (let ((.cse232 (or .cse224 .cse221))) (or (and .cse187 .cse12 .cse13 .cse232 .cse188 .cse0 .cse209 .cse205 .cse189 .cse6 .cse11 .cse22) (and .cse187 .cse12 .cse232 .cse188 .cse27 .cse0 .cse209 .cse205 .cse189 .cse6 .cse11 .cse22)))) (.cse193 (<= 2 .cse231)) (.cse194 (>= |ULTIMATE.start_main_~r~0#1| .cse231)) (.cse196 (= .cse230 0)) (.cse16 (or (and (or .cse54 (= |ULTIMATE.start_main_~B~0#1| .cse55) .cse56) (or .cse51 (= |ULTIMATE.start_main_~B~0#1| .cse53))) .cse221)) (.cse19 (or .cse229 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))) (.cse50 (+ (- 1) .cse49)) (.cse155 (+ (- 1) .cse154)) (.cse199 (and (or .cse36 (not .cse84)) (or .cse37 .cse39 (not .cse95)))) (.cse133 (+ |ULTIMATE.start_main_~q~0#1| .cse161)) (.cse134 (+ |ULTIMATE.start_main_~r~0#1| (- .cse173))) (.cse30 (not .cse228)) (.cse167 (+ 1 .cse168)) (.cse34 (and (not .cse33) .cse228)) (.cse59 (not .cse227)) (.cse166 (+ 1 .cse165)) (.cse78 (and (not .cse60) .cse227)) (.cse198 (and (or .cse43 (not .cse61) .cse44) (or (not .cse72) .cse47)))) (let ((.cse14 (let ((.cse211 (* (+ .cse147 .cse172) |ULTIMATE.start_main_~B~0#1|)) (.cse213 (* (+ .cse147 .cse171) |ULTIMATE.start_main_~B~0#1|)) (.cse215 (* (+ .cse112 .cse170) |ULTIMATE.start_main_~B~0#1|)) (.cse216 (* (+ .cse112 .cse169) |ULTIMATE.start_main_~B~0#1|)) (.cse217 (* (+ .cse145 .cse57) |ULTIMATE.start_main_~B~0#1|)) (.cse219 (* (+ .cse145 .cse58) |ULTIMATE.start_main_~B~0#1|))) (let ((.cse200 (or (let ((.cse225 (+ .cse107 .cse226))) (and (or .cse41 (= |ULTIMATE.start_main_~A~0#1| (+ .cse217 .cse225)) .cse48) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse219 .cse225)) .cse40))) .cse54 .cse56)) (.cse201 (or .cse41 .cse42 (and (or .cse51 (and (or .cse30 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse167 .cse147) .cse110)) .cse33) (or .cse34 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse168 .cse147) .cse110))))) (or .cse54 (and (or .cse59 .cse60 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse166 .cse147) .cse96))) (or .cse78 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse165 .cse147) .cse96)))) .cse56)) .cse48 .cse198)) (.cse202 (= |ULTIMATE.start_main_~A~0#1| (+ (* (+ .cse133 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~B~0#1|) (+ .cse134 .cse162)))) (.cse203 (or .cse29 .cse199 (and (or .cse54 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse166 .cse112) .cse96)) .cse59 .cse60) (or .cse78 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse165 .cse112) .cse96)))) .cse56) (or .cse51 (and (or .cse34 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse168 .cse112) .cse110))) (or .cse30 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse167 .cse112) .cse110)) .cse33)))) .cse40)) (.cse204 (or .cse138 .cse224 .cse221)) (.cse206 (or .cse54 (let ((.cse223 (+ .cse96 .cse155)) (.cse222 (+ .cse96 .cse154))) (and (or .cse41 (and (or .cse78 (and (or .cse47 (= |ULTIMATE.start_main_~A~0#1| (+ .cse211 .cse222))) (or .cse43 (= |ULTIMATE.start_main_~A~0#1| (+ .cse213 .cse222)) .cse44))) (or .cse59 .cse60 (and (or .cse47 (= |ULTIMATE.start_main_~A~0#1| (+ .cse211 .cse223))) (or .cse43 (= |ULTIMATE.start_main_~A~0#1| (+ .cse213 .cse223)) .cse44)))) .cse48) (or (and (or (and (or .cse36 (= |ULTIMATE.start_main_~A~0#1| (+ .cse216 .cse223))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse215 .cse223)) .cse37 .cse39)) .cse59 .cse60) (or .cse78 (and (or .cse37 .cse39 (= |ULTIMATE.start_main_~A~0#1| (+ .cse215 .cse222))) (or .cse36 (= |ULTIMATE.start_main_~A~0#1| (+ .cse216 .cse222)))))) .cse40))) .cse56)) (.cse207 (or (and (or .cse54 .cse56 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse55 .cse145) .cse107))) (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse53 .cse145) .cse107)))) .cse138 .cse221)) (.cse208 (or .cse51 (let ((.cse218 (+ .cse107 .cse220))) (and (or .cse41 .cse48 (= |ULTIMATE.start_main_~A~0#1| (+ .cse217 .cse218))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse219 .cse218)) .cse40))))) (.cse210 (or .cse51 (let ((.cse212 (+ .cse110 .cse49)) (.cse214 (+ .cse110 .cse50))) (and (or .cse41 (and (or .cse34 (and (or .cse47 (= |ULTIMATE.start_main_~A~0#1| (+ .cse211 .cse212))) (or .cse43 .cse44 (= |ULTIMATE.start_main_~A~0#1| (+ .cse213 .cse212))))) (or .cse30 (and (or .cse43 (= |ULTIMATE.start_main_~A~0#1| (+ .cse213 .cse214)) .cse44) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse211 .cse214)) .cse47)) .cse33)) .cse48) (or .cse40 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse215 .cse212)) .cse37 .cse39) (or .cse36 (= |ULTIMATE.start_main_~A~0#1| (+ .cse216 .cse212)))) .cse34) (or (and (or .cse37 .cse39 (= |ULTIMATE.start_main_~A~0#1| (+ .cse215 .cse214))) (or .cse36 (= |ULTIMATE.start_main_~A~0#1| (+ .cse216 .cse214)))) .cse30 .cse33)))))))) (or (and .cse200 .cse201 .cse192 .cse193 .cse194 .cse202 .cse203 .cse204 .cse27 .cse205 .cse196 .cse11 .cse206 .cse12 .cse16 .cse207 .cse208 .cse209 .cse19 .cse210) (and .cse200 .cse201 .cse192 .cse193 .cse194 .cse202 .cse203 .cse204 .cse205 .cse196 .cse11 .cse206 .cse12 .cse13 .cse16 .cse207 .cse208 .cse209 .cse19 .cse210))))) (.cse197 (* 2 .cse191)) (.cse5 (or (and (or .cse51 (and (or .cse30 .cse33 (= |ULTIMATE.start_main_~B~0#1| .cse167)) (or .cse34 (= |ULTIMATE.start_main_~B~0#1| .cse168)))) (or .cse54 (and (or .cse78 (= |ULTIMATE.start_main_~B~0#1| .cse165)) (or (= |ULTIMATE.start_main_~B~0#1| .cse166) .cse59 .cse60)) .cse56)) (and (or .cse41 .cse48 .cse198) (or .cse199 .cse40)))) (.cse195 (* 2 .cse190))) (or (and .cse0 (let ((.cse183 (+ .cse168 1)) (.cse180 (+ .cse165 1)) (.cse177 (+ .cse169 1)) (.cse185 (+ .cse172 1))) (let ((.cse149 (div .cse185 2)) (.cse150 (div .cse186 4)) (.cse118 (div .cse177 2)) (.cse85 (= 0 (mod .cse169 2))) (.cse114 (div |ULTIMATE.start_main_~p~0#1| 8)) (.cse179 (< .cse165 0)) (.cse82 (= 0 (mod .cse165 2))) (.cse66 (= 0 (mod .cse180 2))) (.cse181 (< .cse166 0)) (.cse182 (< .cse168 0)) (.cse126 (= 0 (mod .cse168 2))) (.cse184 (< .cse167 0)) (.cse120 (= 0 (mod .cse183 2)))) (let ((.cse137 (div .cse161 4)) (.cse174 (< .cse172 0)) (.cse73 (= 0 (mod .cse172 2))) (.cse69 (= 0 (mod .cse185 2))) (.cse175 (< .cse171 0)) (.cse122 (and .cse184 (not .cse120))) (.cse121 (not .cse184)) (.cse131 (div .cse183 2)) (.cse125 (and .cse182 (not .cse126))) (.cse132 (div |ULTIMATE.start_main_~d~0#1| 8)) (.cse128 (not .cse182)) (.cse63 (not .cse181)) (.cse68 (and .cse181 (not .cse66))) (.cse100 (div .cse180 2)) (.cse80 (and .cse179 (not .cse82))) (.cse81 (not .cse179)) (.cse24 (* |ULTIMATE.start_main_~B~0#1| 1)) (.cse99 (div .cse178 4)) (.cse113 (+ 1 .cse114)) (.cse116 (< .cse169 0)) (.cse115 (not .cse85)) (.cse93 (= 0 (mod .cse177 2))) (.cse176 (< .cse170 0)) (.cse117 (+ 1 .cse118)) (.cse151 (+ 1 .cse150)) (.cse148 (+ 1 .cse149))) (let ((.cse64 (* (+ .cse147 .cse148) |ULTIMATE.start_main_~B~0#1|)) (.cse70 (* (+ .cse147 .cse149) |ULTIMATE.start_main_~B~0#1|)) (.cse77 (* (+ .cse147 .cse150) |ULTIMATE.start_main_~B~0#1|)) (.cse75 (* (+ .cse147 .cse151) |ULTIMATE.start_main_~B~0#1|)) (.cse94 (* (+ .cse112 .cse117) |ULTIMATE.start_main_~B~0#1|)) (.cse92 (not .cse176)) (.cse90 (* (+ .cse112 .cse118) |ULTIMATE.start_main_~B~0#1|)) (.cse91 (and (not .cse93) .cse176)) (.cse88 (* (+ .cse112 .cse114) |ULTIMATE.start_main_~B~0#1|)) (.cse89 (and .cse116 .cse115)) (.cse86 (* (+ .cse112 .cse113) |ULTIMATE.start_main_~B~0#1|)) (.cse87 (not .cse116)) (.cse111 (and (or .cse59 .cse60 (and (or (not (= .cse24 (+ 1 .cse100))) .cse63 .cse66) (or .cse68 (not (= .cse24 .cse100))))) (or .cse78 (and (or (not (= .cse24 .cse99)) .cse80) (or .cse81 (not (= .cse24 (+ 1 .cse99))) .cse82))))) (.cse108 (and (or (and (or .cse122 (not (= .cse24 .cse131))) (or .cse120 .cse121 (not (= .cse24 (+ 1 .cse131))))) .cse30 .cse33) (or .cse34 (and (or .cse125 (not (= .cse24 .cse132))) (or .cse126 (not (= .cse24 (+ 1 .cse132))) .cse128))))) (.cse62 (not .cse175)) (.cse71 (and .cse175 (not .cse69))) (.cse76 (and .cse174 (not .cse73))) (.cse74 (not .cse174)) (.cse38 (* (+ |ULTIMATE.start_main_~q~0#1| .cse170) |ULTIMATE.start_main_~B~0#1|)) (.cse31 (* (+ |ULTIMATE.start_main_~q~0#1| .cse169) |ULTIMATE.start_main_~B~0#1|)) (.cse46 (* (+ |ULTIMATE.start_main_~q~0#1| .cse172) |ULTIMATE.start_main_~B~0#1|)) (.cse45 (* (+ |ULTIMATE.start_main_~q~0#1| .cse171) |ULTIMATE.start_main_~B~0#1|)) (.cse136 (+ 1 .cse137)) (.cse135 (div .cse173 4)) (.cse25 (+ |ULTIMATE.start_main_~q~0#1| (* 2 .cse161))) (.cse26 (+ |ULTIMATE.start_main_~r~0#1| (- (* 2 .cse173)))) (.cse104 (* (+ .cse145 .cse170) |ULTIMATE.start_main_~B~0#1|)) (.cse101 (* (+ .cse145 .cse169) |ULTIMATE.start_main_~B~0#1|)) (.cse105 (* (+ .cse145 .cse172) |ULTIMATE.start_main_~B~0#1|)) (.cse106 (* (+ .cse145 .cse171) |ULTIMATE.start_main_~B~0#1|)) (.cse52 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse24 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse143 (and (or (and (or .cse36 (not (<= 1 .cse169))) (or .cse37 .cse39 (not (<= 1 .cse170)))) .cse40) (or .cse41 .cse48 (and (or (not (<= 1 .cse171)) .cse43 .cse44) (or .cse47 (not (<= 1 .cse172))))))) (.cse144 (and (or .cse54 (and (or .cse78 (not (= .cse24 .cse165))) (or .cse59 .cse60 (not (= .cse24 .cse166)))) .cse56) (or .cse51 (and (or .cse30 (not (= .cse24 .cse167)) .cse33) (or .cse34 (not (= .cse24 .cse168)))))))) (let ((.cse2 (or .cse52 .cse143 .cse144)) (.cse4 (or (let ((.cse164 (+ .cse107 .cse154)) (.cse163 (+ .cse107 .cse155))) (and (or .cse29 (and (or .cse37 (and (or .cse59 (= |ULTIMATE.start_main_~A~0#1| (+ .cse104 .cse163)) .cse60) (or .cse78 (= |ULTIMATE.start_main_~A~0#1| (+ .cse104 .cse164)))) .cse39) (or (and (or .cse59 .cse60 (= |ULTIMATE.start_main_~A~0#1| (+ .cse101 .cse163))) (or .cse78 (= |ULTIMATE.start_main_~A~0#1| (+ .cse101 .cse164)))) .cse36)) .cse40) (or .cse41 (and (or .cse47 (and (or .cse78 (= |ULTIMATE.start_main_~A~0#1| (+ .cse105 .cse164))) (or .cse59 (= |ULTIMATE.start_main_~A~0#1| (+ .cse105 .cse163)) .cse60))) (or .cse43 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse106 .cse164)) .cse78) (or .cse59 (= |ULTIMATE.start_main_~A~0#1| (+ .cse106 .cse163)) .cse60)) .cse44)) .cse42 .cse48))) .cse54 .cse56)) (.cse18 (or (= 1 .cse161) (= |ULTIMATE.start_main_~A~0#1| (+ (* (+ .cse25 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~B~0#1|) (+ .cse26 .cse162))))) (.cse20 (or (let ((.cse160 (- .cse135))) (let ((.cse158 (+ .cse134 (+ (- 1) .cse160))) (.cse157 (+ .cse134 .cse160))) (and (or .cse40 (let ((.cse156 (* (+ .cse133 .cse137) |ULTIMATE.start_main_~B~0#1|))) (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse156 .cse157)) .cse51) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse156 .cse158)) .cse54 .cse56)))) (or .cse41 (let ((.cse159 (* (+ .cse133 .cse136) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse54 (= |ULTIMATE.start_main_~A~0#1| (+ .cse159 .cse158)) .cse56) (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse159 .cse157))))) .cse48)))) .cse138)) (.cse21 (or .cse54 (let ((.cse153 (+ |ULTIMATE.start_main_~r~0#1| .cse155)) (.cse152 (+ |ULTIMATE.start_main_~r~0#1| .cse154))) (and (or .cse29 (and (or .cse37 (and (or .cse78 (= |ULTIMATE.start_main_~A~0#1| (+ .cse38 .cse152))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse38 .cse153)) .cse59 .cse60)) .cse39) (or .cse36 (and (or .cse78 (= |ULTIMATE.start_main_~A~0#1| (+ .cse31 .cse152))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse31 .cse153)) .cse59 .cse60)))) .cse40) (or .cse41 (and (or .cse47 (and (or .cse78 (= |ULTIMATE.start_main_~A~0#1| (+ .cse46 .cse152))) (or .cse59 (= |ULTIMATE.start_main_~A~0#1| (+ .cse46 .cse153)) .cse60))) (or .cse43 (and (or .cse59 .cse60 (= |ULTIMATE.start_main_~A~0#1| (+ .cse45 .cse153))) (or .cse78 (= |ULTIMATE.start_main_~A~0#1| (+ .cse45 .cse152)))) .cse44)) .cse42 .cse48))) .cse56)) (.cse1 (or .cse41 (let ((.cse146 (* .cse24 .cse147))) (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse146 .cse96)) .cse54 .cse111 .cse56) (or .cse108 .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse146 .cse110))))) .cse48 (and (or .cse43 .cse44 (and (or (not (<= 1 .cse148)) .cse62 .cse69) (or (not (<= 1 .cse149)) .cse71))) (or .cse47 (and (or .cse76 (not (<= 1 .cse150))) (or (not (<= 1 .cse151)) .cse73 .cse74)))))) (.cse3 (or .cse143 .cse144 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse24 .cse145) .cse107)))) (.cse7 (or .cse138 (and (or (and (or .cse139 .cse54 .cse56) (or .cse140 .cse51)) .cse40) (or .cse41 (and (or .cse141 .cse51) (or .cse142 .cse54 .cse56)) .cse48)))) (.cse8 (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse24 .cse133) .cse134)) (and (or .cse51 (not (= .cse24 .cse135))) (or .cse54 .cse56 (not (= .cse24 (+ 1 .cse135))))) (and (or .cse41 .cse48 (not (<= 1 .cse136))) (or (not (<= 1 .cse137)) .cse40)))) (.cse9 (or .cse51 (let ((.cse129 (- .cse132)) (.cse130 (- .cse131))) (let ((.cse119 (+ .cse110 (+ (- 1) .cse130))) (.cse123 (+ .cse110 .cse130)) (.cse127 (+ .cse110 (+ (- 1) .cse129))) (.cse124 (+ .cse110 .cse129))) (and (or (and (or .cse30 (and (or .cse43 .cse61 .cse44 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse70 .cse119)) .cse120 .cse121) (or .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ .cse70 .cse123)))) .cse71) (or (and (or .cse120 (= |ULTIMATE.start_main_~A~0#1| (+ .cse64 .cse119)) .cse121) (or .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ .cse64 .cse123)))) .cse62 .cse69))) (or .cse72 .cse47 (and (or .cse73 .cse74 (and (or .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ .cse75 .cse123))) (or .cse120 .cse121 (= |ULTIMATE.start_main_~A~0#1| (+ .cse75 .cse119))))) (or (and (or .cse120 (= |ULTIMATE.start_main_~A~0#1| (+ .cse77 .cse119)) .cse121) (or .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ .cse77 .cse123)))) .cse76)))) .cse33) (or .cse34 (and (or (and (or .cse62 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse64 .cse124)) .cse125) (or .cse126 (= |ULTIMATE.start_main_~A~0#1| (+ .cse64 .cse127)) .cse128)) .cse69) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse70 .cse124)) .cse125) (or .cse126 (= |ULTIMATE.start_main_~A~0#1| (+ .cse70 .cse127)) .cse128)) .cse71)) .cse43 .cse61 .cse44) (or .cse72 .cse47 (and (or (and (or .cse126 (= |ULTIMATE.start_main_~A~0#1| (+ .cse77 .cse127)) .cse128) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse77 .cse124)) .cse125)) .cse76) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse75 .cse124)) .cse125) (or .cse126 (= |ULTIMATE.start_main_~A~0#1| (+ .cse75 .cse127)) .cse128)) .cse73 .cse74)))))) .cse41 .cse48) (or (and (or (and (or .cse84 .cse36 (and (or (and (or .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ .cse88 .cse123))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse88 .cse119)) .cse120 .cse121)) .cse89) (or .cse85 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse86 .cse119)) .cse120 .cse121) (or .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ .cse86 .cse123)))) .cse87))) (or .cse37 .cse39 (and (or .cse92 .cse93 (and (or .cse120 .cse121 (= |ULTIMATE.start_main_~A~0#1| (+ .cse94 .cse119))) (or .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ .cse94 .cse123))))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse90 .cse119)) .cse120 .cse121) (or .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ .cse90 .cse123)))) .cse91)) .cse95)) .cse30 .cse33) (or .cse34 (and (or .cse37 (and (or (and (or .cse126 (= |ULTIMATE.start_main_~A~0#1| (+ .cse94 .cse127)) .cse128) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse94 .cse124)) .cse125)) .cse92 .cse93) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse90 .cse127)) .cse126 .cse128) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse90 .cse124)) .cse125)) .cse91)) .cse39 .cse95) (or .cse84 .cse36 (and (or (and (or .cse126 (= |ULTIMATE.start_main_~A~0#1| (+ .cse88 .cse127)) .cse128) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse88 .cse124)) .cse125)) .cse89) (or .cse85 (and (or .cse126 .cse128 (= |ULTIMATE.start_main_~A~0#1| (+ .cse86 .cse127))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse86 .cse124)) .cse125)) .cse87)))))) .cse40)))))) (.cse10 (or (let ((.cse109 (* .cse24 .cse112))) (and (or .cse108 (= |ULTIMATE.start_main_~A~0#1| (+ .cse109 .cse110)) .cse51) (or .cse54 (= |ULTIMATE.start_main_~A~0#1| (+ .cse109 .cse96)) .cse111 .cse56))) .cse40 (and (or .cse36 (and (or .cse85 (not (<= 1 .cse113)) .cse87) (or (not (<= 1 .cse114)) (and .cse115 .cse116)))) (or .cse37 .cse39 (and (or (not (<= 1 .cse117)) .cse93 .cse92) (or (not (<= 1 .cse118)) .cse91)))))) (.cse15 (or .cse51 (let ((.cse102 (+ .cse107 .cse49)) (.cse103 (+ .cse107 .cse50))) (and (or .cse29 .cse40 (and (or .cse36 (and (or .cse34 (= |ULTIMATE.start_main_~A~0#1| (+ .cse101 .cse102))) (or .cse30 (= |ULTIMATE.start_main_~A~0#1| (+ .cse101 .cse103)) .cse33))) (or (and (or .cse30 .cse33 (= |ULTIMATE.start_main_~A~0#1| (+ .cse104 .cse103))) (or .cse34 (= |ULTIMATE.start_main_~A~0#1| (+ .cse104 .cse102)))) .cse37 .cse39))) (or .cse41 (and (or .cse47 (and (or .cse34 (= |ULTIMATE.start_main_~A~0#1| (+ .cse105 .cse102))) (or .cse30 (= |ULTIMATE.start_main_~A~0#1| (+ .cse105 .cse103)) .cse33))) (or .cse43 (and (or .cse34 (= |ULTIMATE.start_main_~A~0#1| (+ .cse106 .cse102))) (or .cse30 (= |ULTIMATE.start_main_~A~0#1| (+ .cse106 .cse103)) .cse33)) .cse44)) .cse42 .cse48))))) (.cse17 (or .cse54 (let ((.cse97 (- .cse100)) (.cse98 (- .cse99))) (let ((.cse83 (+ .cse96 (+ (- 1) .cse98))) (.cse79 (+ .cse96 .cse98)) (.cse67 (+ .cse96 .cse97)) (.cse65 (+ .cse96 (+ (- 1) .cse97)))) (and (or (and (or .cse59 .cse60 (and (or .cse43 .cse61 .cse44 (and (or .cse62 (and (or .cse63 (= |ULTIMATE.start_main_~A~0#1| (+ .cse64 .cse65)) .cse66) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse64 .cse67)) .cse68)) .cse69) (or (and (or .cse63 (= |ULTIMATE.start_main_~A~0#1| (+ .cse70 .cse65)) .cse66) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse70 .cse67)) .cse68)) .cse71))) (or .cse72 .cse47 (and (or .cse73 .cse74 (and (or .cse63 (= |ULTIMATE.start_main_~A~0#1| (+ .cse75 .cse65)) .cse66) (or .cse68 (= |ULTIMATE.start_main_~A~0#1| (+ .cse75 .cse67))))) (or .cse76 (and (or .cse63 (= |ULTIMATE.start_main_~A~0#1| (+ .cse77 .cse65)) .cse66) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse77 .cse67)) .cse68))))))) (or .cse78 (and (or .cse72 .cse47 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse77 .cse79)) .cse80) (or .cse81 .cse82 (= |ULTIMATE.start_main_~A~0#1| (+ .cse77 .cse83)))) .cse76) (or .cse73 (and (or .cse81 .cse82 (= |ULTIMATE.start_main_~A~0#1| (+ .cse75 .cse83))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse75 .cse79)) .cse80)) .cse74))) (or .cse43 .cse61 .cse44 (and (or .cse62 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse64 .cse79)) .cse80) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse64 .cse83)) .cse81 .cse82)) .cse69) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse70 .cse79)) .cse80) (or .cse81 .cse82 (= |ULTIMATE.start_main_~A~0#1| (+ .cse70 .cse83)))) .cse71)))))) .cse41 .cse48) (or (and (or .cse78 (and (or .cse84 .cse36 (and (or .cse85 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse86 .cse83)) .cse81 .cse82) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse86 .cse79)) .cse80)) .cse87) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse88 .cse79)) .cse80) (or .cse81 .cse82 (= |ULTIMATE.start_main_~A~0#1| (+ .cse88 .cse83)))) .cse89))) (or (and (or (and (or .cse80 (= |ULTIMATE.start_main_~A~0#1| (+ .cse90 .cse79))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse90 .cse83)) .cse81 .cse82)) .cse91) (or .cse92 .cse93 (and (or .cse81 .cse82 (= |ULTIMATE.start_main_~A~0#1| (+ .cse94 .cse83))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse94 .cse79)) .cse80)))) .cse37 .cse39 .cse95))) (or .cse59 .cse60 (and (or (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse88 .cse67)) .cse68) (or .cse63 (= |ULTIMATE.start_main_~A~0#1| (+ .cse88 .cse65)) .cse66)) .cse89) (or (and (or .cse63 (= |ULTIMATE.start_main_~A~0#1| (+ .cse86 .cse65)) .cse66) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse86 .cse67)) .cse68)) .cse85 .cse87)) .cse84 .cse36) (or .cse37 (and (or (and (or .cse68 (= |ULTIMATE.start_main_~A~0#1| (+ .cse90 .cse67))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse90 .cse65)) .cse63 .cse66)) .cse91) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse94 .cse67)) .cse68) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse94 .cse65)) .cse63 .cse66)) .cse92 .cse93)) .cse39 .cse95)))) .cse40)))) .cse56)) (.cse28 (or .cse52 (and (or (not (= .cse24 .cse53)) .cse51) (or .cse54 (not (= .cse24 .cse55)) .cse56)) (and (or (not (<= 1 .cse57)) .cse41 .cse48) (or (not (<= 1 .cse58)) .cse40)))) (.cse23 (or (let ((.cse32 (+ |ULTIMATE.start_main_~r~0#1| .cse50)) (.cse35 (+ |ULTIMATE.start_main_~r~0#1| .cse49))) (and (or .cse29 (and (or (and (or .cse30 (= |ULTIMATE.start_main_~A~0#1| (+ .cse31 .cse32)) .cse33) (or .cse34 (= |ULTIMATE.start_main_~A~0#1| (+ .cse31 .cse35)))) .cse36) (or .cse37 (and (or .cse34 (= |ULTIMATE.start_main_~A~0#1| (+ .cse38 .cse35))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse38 .cse32)) .cse30 .cse33)) .cse39)) .cse40) (or .cse41 .cse42 (and (or .cse43 .cse44 (and (or .cse34 (= |ULTIMATE.start_main_~A~0#1| (+ .cse45 .cse35))) (or .cse30 .cse33 (= |ULTIMATE.start_main_~A~0#1| (+ .cse45 .cse32))))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse46 .cse32)) .cse30 .cse33) (or .cse34 (= |ULTIMATE.start_main_~A~0#1| (+ .cse46 .cse35)))) .cse47)) .cse48))) .cse51))) (or (and .cse1 .cse2 .cse3 .cse4 .cse0 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse2 .cse4 .cse5 (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse24 .cse25) .cse26)) (not (= .cse24 |ULTIMATE.start_main_~d~0#1|)) (not (<= 1 |ULTIMATE.start_main_~p~0#1|))) .cse12 .cse14 .cse18 .cse20 .cse21 .cse1 .cse27 .cse3 .cse0 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse16 .cse17 .cse19 .cse22 .cse28 .cse23) (and .cse2 .cse4 .cse5 .cse12 .cse13 .cse14 .cse18 .cse20 .cse21 .cse1 .cse3 .cse0 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse16 .cse17 .cse19 .cse22 .cse28 .cse23))))))) .cse6 .cse11 .cse22) (and .cse187 .cse188 (= |ULTIMATE.start_main_~p~0#1| 1) .cse0 (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|) .cse189 .cse6 (<= 1 |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~d~0#1| 1) .cse11 .cse22) (and (= |ULTIMATE.start_main_~d~0#1| .cse190) (<= 2 |ULTIMATE.start_main_~d~0#1|) .cse187 .cse188 .cse0 .cse189 .cse6 (= |ULTIMATE.start_main_~p~0#1| .cse190) .cse11 .cse22 (= |ULTIMATE.start_main_~d~0#1| .cse191)) (and .cse192 .cse193 .cse194 .cse0 .cse189 .cse6 (= |ULTIMATE.start_main_~d~0#1| .cse195) .cse196 .cse11 (= |ULTIMATE.start_main_~p~0#1| .cse195) (= |ULTIMATE.start_main_~d~0#1| .cse197) .cse16 .cse19 .cse22) (and .cse14 .cse16 .cse0 (= |ULTIMATE.start_main_~d~0#1| (* 2 .cse197)) .cse5 .cse19 .cse189 .cse6 .cse11 .cse22 (= |ULTIMATE.start_main_~p~0#1| (* 2 .cse195)))))))))))) [2023-02-17 07:33:33,588 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-17 07:33:33,588 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-17 07:33:33,590 INFO L895 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (let ((.cse141 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse138 (div |ULTIMATE.start_main_~d~0#1| 2))) (let ((.cse253 (+ .cse138 1)) (.cse261 (+ .cse141 1)) (.cse140 (+ 1 .cse141)) (.cse238 (- .cse138))) (let ((.cse247 (+ (- 1) .cse238)) (.cse135 (+ |ULTIMATE.start_main_~q~0#1| .cse140)) (.cse129 (+ |ULTIMATE.start_main_~q~0#1| .cse141)) (.cse244 (mod |ULTIMATE.start_main_~d~0#1| 2)) (.cse221 (div .cse261 2)) (.cse222 (div |ULTIMATE.start_main_~p~0#1| 4)) (.cse131 (div .cse253 2)) (.cse132 (div |ULTIMATE.start_main_~d~0#1| 4))) (let ((.cse258 (+ .cse132 1)) (.cse134 (+ 1 .cse132)) (.cse128 (+ 1 .cse131)) (.cse255 (+ .cse131 1)) (.cse252 (+ .cse222 1)) (.cse260 (+ .cse221 1)) (.cse51 (- |ULTIMATE.start_main_~d~0#1|)) (.cse85 (= 1 |ULTIMATE.start_main_~p~0#1|)) (.cse74 (= 0 .cse244)) (.cse263 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse78 (= 0 (mod |ULTIMATE.start_main_~p~0#1| 2))) (.cse133 (+ |ULTIMATE.start_main_~r~0#1| .cse238)) (.cse262 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse265 (* .cse129 |ULTIMATE.start_main_~B~0#1|)) (.cse264 (* .cse135 |ULTIMATE.start_main_~B~0#1|)) (.cse130 (+ |ULTIMATE.start_main_~r~0#1| .cse247)) (.cse139 (+ 1 .cse138))) (let ((.cse88 (= 1 .cse141)) (.cse104 (= 1 .cse140)) (.cse121 (- .cse131)) (.cse97 (= 0 (mod .cse141 2))) (.cse248 (< .cse141 0)) (.cse117 (= 0 (mod .cse253 2))) (.cse249 (< .cse139 0)) (.cse250 (< .cse140 0)) (.cse101 (= 0 (mod .cse261 2))) (.cse114 (= |ULTIMATE.start_main_~A~0#1| (+ .cse264 .cse130))) (.cse111 (= |ULTIMATE.start_main_~A~0#1| (+ .cse265 .cse130))) (.cse75 (not .cse262)) (.cse112 (= |ULTIMATE.start_main_~A~0#1| (+ .cse265 .cse133))) (.cse69 (and .cse263 (not .cse78))) (.cse113 (= |ULTIMATE.start_main_~A~0#1| (+ .cse264 .cse133))) (.cse81 (not .cse263)) (.cse72 (and .cse262 (not .cse74))) (.cse63 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse110 (not .cse85)) (.cse212 (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~p~0#1|)) (.cse105 (+ |ULTIMATE.start_main_~r~0#1| .cse51)) (.cse107 (- .cse132)) (.cse95 (= 0 (mod .cse138 2))) (.cse251 (< .cse138 0)) (.cse226 (* 2 |ULTIMATE.start_main_~d~0#1|)) (.cse215 (div .cse260 2)) (.cse216 (div .cse261 4)) (.cse197 (div .cse252 2)) (.cse223 (+ 1 .cse222)) (.cse174 (= 0 (mod .cse222 2))) (.cse193 (div |ULTIMATE.start_main_~p~0#1| 8)) (.cse228 (* 2 |ULTIMATE.start_main_~p~0#1|)) (.cse254 (< .cse131 0)) (.cse171 (= 0 (mod .cse131 2))) (.cse156 (= 0 (mod .cse255 2))) (.cse256 (< .cse128 0)) (.cse257 (< .cse132 0)) (.cse205 (= 0 (mod .cse132 2))) (.cse259 (< .cse134 0)) (.cse199 (= 0 (mod .cse258 2))) (.cse220 (+ 1 .cse221))) (let ((.cse65 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse144 (* 2 1)) (.cse224 (< .cse221 0)) (.cse163 (= 0 (mod .cse221 2))) (.cse159 (= 0 (mod .cse260 2))) (.cse225 (< .cse220 0)) (.cse201 (and .cse259 (not .cse199))) (.cse200 (not .cse259)) (.cse210 (div .cse258 2)) (.cse204 (and .cse257 (not .cse205))) (.cse211 (div |ULTIMATE.start_main_~d~0#1| 8)) (.cse207 (not .cse257)) (.cse153 (not .cse256)) (.cse158 (and .cse256 (not .cse156))) (.cse188 (div .cse255 2)) (.cse169 (and .cse254 (not .cse171))) (.cse170 (not .cse254)) (.cse187 (div .cse253 4)) (.cse77 (div .cse228 4)) (.cse192 (+ 1 .cse193)) (.cse195 (< .cse222 0)) (.cse194 (not .cse174)) (.cse182 (= 0 (mod .cse252 2))) (.cse227 (< .cse223 0)) (.cse196 (+ 1 .cse197)) (.cse217 (+ 1 .cse216)) (.cse214 (+ 1 .cse215)) (.cse142 (+ |ULTIMATE.start_main_~q~0#1| (* 2 .cse228))) (.cse143 (+ |ULTIMATE.start_main_~r~0#1| (- (* 2 .cse226)))) (.cse137 (* |ULTIMATE.start_main_~B~0#1| 1)) (.cse173 (= 1 .cse222)) (.cse184 (= 1 .cse223)) (.cse151 (= 1 .cse220)) (.cse162 (= 1 .cse221)) (.cse90 (and (not .cse95) .cse251)) (.cse93 (not .cse251)) (.cse106 (+ (- 1) .cse107)) (.cse8 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse212 |ULTIMATE.start_main_~B~0#1|) .cse105))) (.cse9 (or .cse63 .cse110)) (.cse1 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse56 (or (and (or .cse112 .cse69) (or .cse78 .cse113 .cse81)) .cse72)) (.cse48 (or (and (or .cse78 .cse114 .cse81) (or .cse111 .cse69)) .cse74 .cse75)) (.cse2 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse3 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse13 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse5 (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|))) (.cse99 (and .cse250 (not .cse101))) (.cse229 (* (+ .cse135 .cse221) |ULTIMATE.start_main_~B~0#1|)) (.cse231 (* (+ .cse135 .cse220) |ULTIMATE.start_main_~B~0#1|)) (.cse103 (not .cse250)) (.cse115 (not .cse249)) (.cse118 (and (not .cse117) .cse249)) (.cse98 (not .cse248)) (.cse233 (* (+ .cse129 .cse223) |ULTIMATE.start_main_~B~0#1|)) (.cse89 (and .cse248 (not .cse97))) (.cse234 (* (+ .cse129 .cse222) |ULTIMATE.start_main_~B~0#1|)) (.cse120 (+ (- 1) .cse121)) (.cse241 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse139 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)) .cse74 .cse75) (or .cse72 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse138 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))))) (.cse239 (and (or .cse69 (not .cse88)) (or .cse78 (not .cse104) .cse81))) (.cse76 (+ |ULTIMATE.start_main_~q~0#1| .cse228)) (.cse82 (+ |ULTIMATE.start_main_~r~0#1| (- .cse226))) (.cse245 (div .cse51 (- 2))) (.cse235 (* (+ .cse212 .cse140) |ULTIMATE.start_main_~B~0#1|)) (.cse237 (* (+ .cse212 .cse141) |ULTIMATE.start_main_~B~0#1|))) (let ((.cse53 (+ |ULTIMATE.start_main_~q~0#1| (* |ULTIMATE.start_main_~p~0#1| (- 1)))) (.cse7 (<= 2 |ULTIMATE.start_main_~d~0#1|)) (.cse96 (* (+ .cse212 .cse223) |ULTIMATE.start_main_~B~0#1|)) (.cse91 (* (+ .cse212 .cse222) |ULTIMATE.start_main_~B~0#1|)) (.cse100 (* (+ .cse212 .cse221) |ULTIMATE.start_main_~B~0#1|)) (.cse102 (* (+ .cse212 .cse220) |ULTIMATE.start_main_~B~0#1|)) (.cse47 (or (let ((.cse246 (+ .cse105 .cse247))) (and (or .cse78 (= |ULTIMATE.start_main_~A~0#1| (+ .cse235 .cse246)) .cse81) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse237 .cse246)) .cse69))) .cse74 .cse75)) (.cse42 (<= 2 .cse245)) (.cse44 (>= |ULTIMATE.start_main_~r~0#1| .cse245)) (.cse30 (= |ULTIMATE.start_main_~A~0#1| (+ (* (+ .cse76 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~B~0#1|) (+ .cse82 .cse51)))) (.cse109 (or .cse85 .cse241 .cse239)) (.cse46 (= .cse244 0)) (.cse52 (or .cse74 (let ((.cse243 (+ .cse130 .cse120)) (.cse242 (+ .cse130 .cse121))) (and (or .cse78 (and (or .cse118 (and (or .cse99 (= |ULTIMATE.start_main_~A~0#1| (+ .cse229 .cse242))) (or .cse101 (= |ULTIMATE.start_main_~A~0#1| (+ .cse231 .cse242)) .cse103))) (or .cse115 .cse117 (and (or .cse99 (= |ULTIMATE.start_main_~A~0#1| (+ .cse229 .cse243))) (or .cse101 (= |ULTIMATE.start_main_~A~0#1| (+ .cse231 .cse243)) .cse103)))) .cse81) (or (and (or (and (or .cse89 (= |ULTIMATE.start_main_~A~0#1| (+ .cse234 .cse243))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse233 .cse243)) .cse97 .cse98)) .cse115 .cse117) (or .cse118 (and (or .cse97 .cse98 (= |ULTIMATE.start_main_~A~0#1| (+ .cse233 .cse242))) (or .cse89 (= |ULTIMATE.start_main_~A~0#1| (+ .cse234 .cse242)))))) .cse69))) .cse75)) (.cse43 (let ((.cse240 (or .cse241 .cse239))) (or (and .cse8 .cse240 .cse63 .cse1 .cse56 .cse48 .cse2 .cse3 .cse13 .cse5) (and .cse8 .cse9 .cse240 .cse1 .cse56 .cse48 .cse2 .cse3 .cse13 .cse5)))) (.cse16 (or (and (or .cse74 (= |ULTIMATE.start_main_~B~0#1| .cse139) .cse75) (or .cse72 (= |ULTIMATE.start_main_~B~0#1| .cse138))) .cse239)) (.cse108 (or (and (or .cse74 .cse75 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse139 .cse212) .cse105))) (or .cse72 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse138 .cse212) .cse105)))) .cse85 .cse239)) (.cse55 (or .cse72 (let ((.cse236 (+ .cse105 .cse238))) (and (or .cse78 .cse81 (= |ULTIMATE.start_main_~A~0#1| (+ .cse235 .cse236))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse237 .cse236)) .cse69))))) (.cse10 (or .cse110 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))) (.cse57 (or .cse72 (let ((.cse230 (+ .cse133 .cse107)) (.cse232 (+ .cse133 .cse106))) (and (or .cse78 (and (or .cse90 (and (or .cse99 (= |ULTIMATE.start_main_~A~0#1| (+ .cse229 .cse230))) (or .cse101 .cse103 (= |ULTIMATE.start_main_~A~0#1| (+ .cse231 .cse230))))) (or .cse93 (and (or .cse101 (= |ULTIMATE.start_main_~A~0#1| (+ .cse231 .cse232)) .cse103) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse229 .cse232)) .cse99)) .cse95)) .cse81) (or .cse69 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse233 .cse230)) .cse97 .cse98) (or .cse89 (= |ULTIMATE.start_main_~A~0#1| (+ .cse234 .cse230)))) .cse90) (or (and (or .cse97 .cse98 (= |ULTIMATE.start_main_~A~0#1| (+ .cse233 .cse232))) (or .cse89 (= |ULTIMATE.start_main_~A~0#1| (+ .cse234 .cse232)))) .cse93 .cse95))))))) (.cse136 (and (or .cse101 (not .cse151) .cse103) (or (not .cse162) .cse99))) (.cse127 (and (or .cse89 (not .cse173)) (or .cse97 .cse98 (not .cse184)))) (.cse122 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse137 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse86 (= 1 .cse228)) (.cse87 (= |ULTIMATE.start_main_~A~0#1| (+ (* (+ .cse142 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~B~0#1|) (+ .cse143 .cse51)))) (.cse154 (* (+ .cse135 .cse214) |ULTIMATE.start_main_~B~0#1|)) (.cse160 (* (+ .cse135 .cse215) |ULTIMATE.start_main_~B~0#1|)) (.cse167 (* (+ .cse135 .cse216) |ULTIMATE.start_main_~B~0#1|)) (.cse165 (* (+ .cse135 .cse217) |ULTIMATE.start_main_~B~0#1|)) (.cse183 (* (+ .cse129 .cse196) |ULTIMATE.start_main_~B~0#1|)) (.cse181 (not .cse227)) (.cse179 (* (+ .cse129 .cse197) |ULTIMATE.start_main_~B~0#1|)) (.cse180 (and (not .cse182) .cse227)) (.cse177 (* (+ .cse129 .cse193) |ULTIMATE.start_main_~B~0#1|)) (.cse178 (and .cse195 .cse194)) (.cse175 (* (+ .cse129 .cse192) |ULTIMATE.start_main_~B~0#1|)) (.cse176 (not .cse195)) (.cse84 (div .cse226 4)) (.cse80 (+ 1 .cse77)) (.cse123 (and (or (and (or .cse89 (not (<= 1 .cse222))) (or .cse97 .cse98 (not (<= 1 .cse223)))) .cse69) (or .cse78 .cse81 (and (or (not (<= 1 .cse220)) .cse101 .cse103) (or .cse99 (not (<= 1 .cse221))))))) (.cse124 (and (or .cse74 (and (or .cse118 (not (= .cse137 .cse131))) (or .cse115 .cse117 (not (= .cse137 .cse128)))) .cse75) (or .cse72 (and (or .cse93 (not (= .cse137 .cse134)) .cse95) (or .cse90 (not (= .cse137 .cse132))))))) (.cse191 (and (or .cse115 .cse117 (and (or (not (= .cse137 (+ 1 .cse188))) .cse153 .cse156) (or .cse158 (not (= .cse137 .cse188))))) (or .cse118 (and (or (not (= .cse137 .cse187)) .cse169) (or .cse170 (not (= .cse137 (+ 1 .cse187))) .cse171))))) (.cse189 (and (or (and (or .cse201 (not (= .cse137 .cse210))) (or .cse199 .cse200 (not (= .cse137 (+ 1 .cse210))))) .cse93 .cse95) (or .cse90 (and (or .cse204 (not (= .cse137 .cse211))) (or .cse205 (not (= .cse137 (+ 1 .cse211))) .cse207))))) (.cse152 (not .cse225)) (.cse161 (and .cse225 (not .cse159))) (.cse166 (and .cse224 (not .cse163))) (.cse164 (not .cse224)) (.cse148 (* (+ |ULTIMATE.start_main_~q~0#1| .cse223) |ULTIMATE.start_main_~B~0#1|)) (.cse145 (* (+ |ULTIMATE.start_main_~q~0#1| .cse222) |ULTIMATE.start_main_~B~0#1|)) (.cse150 (* (+ |ULTIMATE.start_main_~q~0#1| .cse221) |ULTIMATE.start_main_~B~0#1|)) (.cse149 (* (+ |ULTIMATE.start_main_~q~0#1| .cse220) |ULTIMATE.start_main_~B~0#1|)) (.cse45 (* 2 .cse144)) (.cse60 (* 2 .cse65)) (.cse59 (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|))) (let ((.cse0 (= |ULTIMATE.start_main_~d~0#1| .cse144)) (.cse4 (= |ULTIMATE.start_main_~p~0#1| .cse144)) (.cse6 (= |ULTIMATE.start_main_~d~0#1| .cse65)) (.cse14 (= .cse59 |ULTIMATE.start_main_~A~0#1|)) (.cse15 (= |ULTIMATE.start_main_~d~0#1| .cse60)) (.cse18 (= |ULTIMATE.start_main_~p~0#1| .cse45)) (.cse39 (or .cse74 (let ((.cse219 (+ |ULTIMATE.start_main_~r~0#1| .cse120)) (.cse218 (+ |ULTIMATE.start_main_~r~0#1| .cse121))) (and (or .cse88 (and (or .cse97 (and (or .cse118 (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse218))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse219)) .cse115 .cse117)) .cse98) (or .cse89 (and (or .cse118 (= |ULTIMATE.start_main_~A~0#1| (+ .cse145 .cse218))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse145 .cse219)) .cse115 .cse117)))) .cse69) (or .cse78 (and (or .cse99 (and (or .cse118 (= |ULTIMATE.start_main_~A~0#1| (+ .cse150 .cse218))) (or .cse115 (= |ULTIMATE.start_main_~A~0#1| (+ .cse150 .cse219)) .cse117))) (or .cse101 (and (or .cse115 .cse117 (= |ULTIMATE.start_main_~A~0#1| (+ .cse149 .cse219))) (or .cse118 (= |ULTIMATE.start_main_~A~0#1| (+ .cse149 .cse218)))) .cse103)) .cse104 .cse81))) .cse75)) (.cse33 (or .cse78 (let ((.cse213 (* .cse137 .cse135))) (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse213 .cse130)) .cse74 .cse191 .cse75) (or .cse189 .cse72 (= |ULTIMATE.start_main_~A~0#1| (+ .cse213 .cse133))))) .cse81 (and (or .cse101 .cse103 (and (or (not (<= 1 .cse214)) .cse152 .cse159) (or (not (<= 1 .cse215)) .cse161))) (or .cse99 (and (or .cse166 (not (<= 1 .cse216))) (or (not (<= 1 .cse217)) .cse163 .cse164)))))) (.cse21 (or .cse123 .cse124 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse137 .cse212) .cse105)))) (.cse35 (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse137 .cse76) .cse82)) (and (or .cse72 (not (= .cse137 .cse84))) (or .cse74 .cse75 (not (= .cse137 (+ 1 .cse84))))) (and (or .cse78 .cse81 (not (<= 1 .cse80))) (or (not (<= 1 .cse77)) .cse69)))) (.cse36 (or .cse72 (let ((.cse208 (- .cse211)) (.cse209 (- .cse210))) (let ((.cse198 (+ .cse133 (+ (- 1) .cse209))) (.cse202 (+ .cse133 .cse209)) (.cse206 (+ .cse133 (+ (- 1) .cse208))) (.cse203 (+ .cse133 .cse208))) (and (or (and (or .cse93 (and (or .cse101 .cse151 .cse103 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse160 .cse198)) .cse199 .cse200) (or .cse201 (= |ULTIMATE.start_main_~A~0#1| (+ .cse160 .cse202)))) .cse161) (or (and (or .cse199 (= |ULTIMATE.start_main_~A~0#1| (+ .cse154 .cse198)) .cse200) (or .cse201 (= |ULTIMATE.start_main_~A~0#1| (+ .cse154 .cse202)))) .cse152 .cse159))) (or .cse162 .cse99 (and (or .cse163 .cse164 (and (or .cse201 (= |ULTIMATE.start_main_~A~0#1| (+ .cse165 .cse202))) (or .cse199 .cse200 (= |ULTIMATE.start_main_~A~0#1| (+ .cse165 .cse198))))) (or (and (or .cse199 (= |ULTIMATE.start_main_~A~0#1| (+ .cse167 .cse198)) .cse200) (or .cse201 (= |ULTIMATE.start_main_~A~0#1| (+ .cse167 .cse202)))) .cse166)))) .cse95) (or .cse90 (and (or (and (or .cse152 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse154 .cse203)) .cse204) (or .cse205 (= |ULTIMATE.start_main_~A~0#1| (+ .cse154 .cse206)) .cse207)) .cse159) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse160 .cse203)) .cse204) (or .cse205 (= |ULTIMATE.start_main_~A~0#1| (+ .cse160 .cse206)) .cse207)) .cse161)) .cse101 .cse151 .cse103) (or .cse162 .cse99 (and (or (and (or .cse205 (= |ULTIMATE.start_main_~A~0#1| (+ .cse167 .cse206)) .cse207) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse167 .cse203)) .cse204)) .cse166) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse165 .cse203)) .cse204) (or .cse205 (= |ULTIMATE.start_main_~A~0#1| (+ .cse165 .cse206)) .cse207)) .cse163 .cse164)))))) .cse78 .cse81) (or (and (or (and (or .cse173 .cse89 (and (or (and (or .cse201 (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse202))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse198)) .cse199 .cse200)) .cse178) (or .cse174 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse175 .cse198)) .cse199 .cse200) (or .cse201 (= |ULTIMATE.start_main_~A~0#1| (+ .cse175 .cse202)))) .cse176))) (or .cse97 .cse98 (and (or .cse181 .cse182 (and (or .cse199 .cse200 (= |ULTIMATE.start_main_~A~0#1| (+ .cse183 .cse198))) (or .cse201 (= |ULTIMATE.start_main_~A~0#1| (+ .cse183 .cse202))))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse179 .cse198)) .cse199 .cse200) (or .cse201 (= |ULTIMATE.start_main_~A~0#1| (+ .cse179 .cse202)))) .cse180)) .cse184)) .cse93 .cse95) (or .cse90 (and (or .cse97 (and (or (and (or .cse205 (= |ULTIMATE.start_main_~A~0#1| (+ .cse183 .cse206)) .cse207) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse183 .cse203)) .cse204)) .cse181 .cse182) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse179 .cse206)) .cse205 .cse207) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse179 .cse203)) .cse204)) .cse180)) .cse98 .cse184) (or .cse173 .cse89 (and (or (and (or .cse205 (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse206)) .cse207) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse203)) .cse204)) .cse178) (or .cse174 (and (or .cse205 .cse207 (= |ULTIMATE.start_main_~A~0#1| (+ .cse175 .cse206))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse175 .cse203)) .cse204)) .cse176)))))) .cse69)))))) (.cse37 (or (let ((.cse190 (* .cse137 .cse129))) (and (or .cse189 (= |ULTIMATE.start_main_~A~0#1| (+ .cse190 .cse133)) .cse72) (or .cse74 (= |ULTIMATE.start_main_~A~0#1| (+ .cse190 .cse130)) .cse191 .cse75))) .cse69 (and (or .cse89 (and (or .cse174 (not (<= 1 .cse192)) .cse176) (or (not (<= 1 .cse193)) (and .cse194 .cse195)))) (or .cse97 .cse98 (and (or (not (<= 1 .cse196)) .cse182 .cse181) (or (not (<= 1 .cse197)) .cse180)))))) (.cse38 (or .cse74 (let ((.cse185 (- .cse188)) (.cse186 (- .cse187))) (let ((.cse172 (+ .cse130 (+ (- 1) .cse186))) (.cse168 (+ .cse130 .cse186)) (.cse157 (+ .cse130 .cse185)) (.cse155 (+ .cse130 (+ (- 1) .cse185)))) (and (or (and (or .cse115 .cse117 (and (or .cse101 .cse151 .cse103 (and (or .cse152 (and (or .cse153 (= |ULTIMATE.start_main_~A~0#1| (+ .cse154 .cse155)) .cse156) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse154 .cse157)) .cse158)) .cse159) (or (and (or .cse153 (= |ULTIMATE.start_main_~A~0#1| (+ .cse160 .cse155)) .cse156) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse160 .cse157)) .cse158)) .cse161))) (or .cse162 .cse99 (and (or .cse163 .cse164 (and (or .cse153 (= |ULTIMATE.start_main_~A~0#1| (+ .cse165 .cse155)) .cse156) (or .cse158 (= |ULTIMATE.start_main_~A~0#1| (+ .cse165 .cse157))))) (or .cse166 (and (or .cse153 (= |ULTIMATE.start_main_~A~0#1| (+ .cse167 .cse155)) .cse156) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse167 .cse157)) .cse158))))))) (or .cse118 (and (or .cse162 .cse99 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse167 .cse168)) .cse169) (or .cse170 .cse171 (= |ULTIMATE.start_main_~A~0#1| (+ .cse167 .cse172)))) .cse166) (or .cse163 (and (or .cse170 .cse171 (= |ULTIMATE.start_main_~A~0#1| (+ .cse165 .cse172))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse165 .cse168)) .cse169)) .cse164))) (or .cse101 .cse151 .cse103 (and (or .cse152 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse154 .cse168)) .cse169) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse154 .cse172)) .cse170 .cse171)) .cse159) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse160 .cse168)) .cse169) (or .cse170 .cse171 (= |ULTIMATE.start_main_~A~0#1| (+ .cse160 .cse172)))) .cse161)))))) .cse78 .cse81) (or (and (or .cse118 (and (or .cse173 .cse89 (and (or .cse174 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse175 .cse172)) .cse170 .cse171) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse175 .cse168)) .cse169)) .cse176) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse168)) .cse169) (or .cse170 .cse171 (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse172)))) .cse178))) (or (and (or (and (or .cse169 (= |ULTIMATE.start_main_~A~0#1| (+ .cse179 .cse168))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse179 .cse172)) .cse170 .cse171)) .cse180) (or .cse181 .cse182 (and (or .cse170 .cse171 (= |ULTIMATE.start_main_~A~0#1| (+ .cse183 .cse172))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse183 .cse168)) .cse169)))) .cse97 .cse98 .cse184))) (or .cse115 .cse117 (and (or (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse157)) .cse158) (or .cse153 (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse155)) .cse156)) .cse178) (or (and (or .cse153 (= |ULTIMATE.start_main_~A~0#1| (+ .cse175 .cse155)) .cse156) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse175 .cse157)) .cse158)) .cse174 .cse176)) .cse173 .cse89) (or .cse97 (and (or (and (or .cse158 (= |ULTIMATE.start_main_~A~0#1| (+ .cse179 .cse157))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse179 .cse155)) .cse153 .cse156)) .cse180) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse183 .cse157)) .cse158) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse183 .cse155)) .cse153 .cse156)) .cse181 .cse182)) .cse98 .cse184)))) .cse69)))) .cse75)) (.cse40 (or (let ((.cse146 (+ |ULTIMATE.start_main_~r~0#1| .cse106)) (.cse147 (+ |ULTIMATE.start_main_~r~0#1| .cse107))) (and (or .cse88 (and (or (and (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ .cse145 .cse146)) .cse95) (or .cse90 (= |ULTIMATE.start_main_~A~0#1| (+ .cse145 .cse147)))) .cse89) (or .cse97 (and (or .cse90 (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse147))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse146)) .cse93 .cse95)) .cse98)) .cse69) (or .cse78 .cse104 (and (or .cse101 .cse103 (and (or .cse90 (= |ULTIMATE.start_main_~A~0#1| (+ .cse149 .cse147))) (or .cse93 .cse95 (= |ULTIMATE.start_main_~A~0#1| (+ .cse149 .cse146))))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse150 .cse146)) .cse93 .cse95) (or .cse90 (= |ULTIMATE.start_main_~A~0#1| (+ .cse150 .cse147)))) .cse99)) .cse81))) .cse72)) (.cse54 (* .cse144 (- 1))) (.cse58 (or .cse86 .cse87 (not .cse1))) (.cse31 (= (+ |ULTIMATE.start_main_~q~0#1| (* .cse45 (- 1))) 0)) (.cse32 (= (+ |ULTIMATE.start_main_~r~0#1| .cse60) |ULTIMATE.start_main_~A~0#1|)) (.cse28 (or .cse13 (and (<= 1 |ULTIMATE.start_main_~d~0#1|) .cse13))) (.cse24 (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse137 .cse142) .cse143)) (not (= .cse137 |ULTIMATE.start_main_~d~0#1|)) (not (<= 1 |ULTIMATE.start_main_~p~0#1|)))) (.cse29 (or .cse122 (and (or (not (= .cse137 .cse138)) .cse72) (or .cse74 (not (= .cse137 .cse139)) .cse75)) (and (or (not (<= 1 .cse140)) .cse78 .cse81) (or (not (<= 1 .cse141)) .cse69)))) (.cse61 (or (and (or .cse72 (and (or .cse93 .cse95 (= |ULTIMATE.start_main_~B~0#1| .cse134)) (or .cse90 (= |ULTIMATE.start_main_~B~0#1| .cse132)))) (or .cse74 (and (or .cse118 (= |ULTIMATE.start_main_~B~0#1| .cse131)) (or (= |ULTIMATE.start_main_~B~0#1| .cse128) .cse115 .cse117)) .cse75)) (and (or .cse78 .cse81 .cse136) (or .cse127 .cse69)))) (.cse62 (let ((.cse125 (or .cse78 .cse104 (and (or .cse72 (and (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse134 .cse135) .cse133)) .cse95) (or .cse90 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse132 .cse135) .cse133))))) (or .cse74 (and (or .cse115 .cse117 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse128 .cse135) .cse130))) (or .cse118 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse131 .cse135) .cse130)))) .cse75)) .cse81 .cse136)) (.cse126 (or .cse88 .cse127 (and (or .cse74 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse128 .cse129) .cse130)) .cse115 .cse117) (or .cse118 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse131 .cse129) .cse130)))) .cse75) (or .cse72 (and (or .cse90 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse132 .cse129) .cse133))) (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse134 .cse129) .cse133)) .cse95)))) .cse69))) (or (and .cse47 .cse125 .cse42 .cse44 .cse30 .cse126 .cse109 .cse63 .cse48 .cse46 .cse13 .cse52 .cse8 .cse43 .cse16 .cse108 .cse55 .cse56 .cse10 .cse57) (and .cse47 .cse125 .cse42 .cse44 .cse30 .cse126 .cse109 .cse48 .cse46 .cse13 .cse52 .cse8 .cse9 .cse43 .cse16 .cse108 .cse55 .cse56 .cse10 .cse57)))) (.cse34 (or .cse122 .cse123 .cse124)) (.cse22 (or (let ((.cse119 (+ .cse105 .cse121)) (.cse116 (+ .cse105 .cse120))) (and (or .cse88 (and (or .cse97 (and (or .cse115 (= |ULTIMATE.start_main_~A~0#1| (+ .cse96 .cse116)) .cse117) (or .cse118 (= |ULTIMATE.start_main_~A~0#1| (+ .cse96 .cse119)))) .cse98) (or (and (or .cse115 .cse117 (= |ULTIMATE.start_main_~A~0#1| (+ .cse91 .cse116))) (or .cse118 (= |ULTIMATE.start_main_~A~0#1| (+ .cse91 .cse119)))) .cse89)) .cse69) (or .cse78 (and (or .cse99 (and (or .cse118 (= |ULTIMATE.start_main_~A~0#1| (+ .cse100 .cse119))) (or .cse115 (= |ULTIMATE.start_main_~A~0#1| (+ .cse100 .cse116)) .cse117))) (or .cse101 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse102 .cse119)) .cse118) (or .cse115 (= |ULTIMATE.start_main_~A~0#1| (+ .cse102 .cse116)) .cse117)) .cse103)) .cse104 .cse81))) .cse74 .cse75)) (.cse23 (or .cse85 (and (or (and (or .cse111 .cse74 .cse75) (or .cse112 .cse72)) .cse69) (or .cse78 (and (or .cse113 .cse72) (or .cse114 .cse74 .cse75)) .cse81)))) (.cse41 (or .cse63 .cse110 (not .cse5))) (.cse17 (or (and .cse7 .cse47 .cse8 .cse9 .cse30 .cse108 .cse109 .cse55 .cse56 .cse48 .cse10 .cse13) (and .cse7 .cse47 .cse8 .cse9 .cse30 .cse109 .cse55 .cse56 .cse48 .cse10 .cse13))) (.cse25 (or .cse72 (let ((.cse92 (+ .cse105 .cse107)) (.cse94 (+ .cse105 .cse106))) (and (or .cse88 .cse69 (and (or .cse89 (and (or .cse90 (= |ULTIMATE.start_main_~A~0#1| (+ .cse91 .cse92))) (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ .cse91 .cse94)) .cse95))) (or (and (or .cse93 .cse95 (= |ULTIMATE.start_main_~A~0#1| (+ .cse96 .cse94))) (or .cse90 (= |ULTIMATE.start_main_~A~0#1| (+ .cse96 .cse92)))) .cse97 .cse98))) (or .cse78 (and (or .cse99 (and (or .cse90 (= |ULTIMATE.start_main_~A~0#1| (+ .cse100 .cse92))) (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ .cse100 .cse94)) .cse95))) (or .cse101 (and (or .cse90 (= |ULTIMATE.start_main_~A~0#1| (+ .cse102 .cse92))) (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ .cse102 .cse94)) .cse95)) .cse103)) .cse104 .cse81))))) (.cse26 (or .cse86 .cse87)) (.cse27 (or (let ((.cse83 (- .cse84))) (let ((.cse73 (+ .cse82 (+ (- 1) .cse83))) (.cse71 (+ .cse82 .cse83))) (and (or .cse69 (let ((.cse70 (* (+ .cse76 .cse77) |ULTIMATE.start_main_~B~0#1|))) (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse70 .cse71)) .cse72) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse70 .cse73)) .cse74 .cse75)))) (or .cse78 (let ((.cse79 (* (+ .cse76 .cse80) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse74 (= |ULTIMATE.start_main_~A~0#1| (+ .cse79 .cse73)) .cse75) (or .cse72 (= |ULTIMATE.start_main_~A~0#1| (+ .cse79 .cse71))))) .cse81)))) .cse85)) (.cse19 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse20 (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|)) (.cse49 (- |ULTIMATE.start_main_~B~0#1|)) (.cse12 (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| .cse51))) (.cse11 (= .cse53 0)) (.cse50 (= |ULTIMATE.start_main_~d~0#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse8 .cse9 .cse10 .cse11 .cse12 .cse3 .cse4 .cse13 .cse14 .cse6) (and .cse15 .cse16 .cse10 .cse11 .cse3 .cse13 .cse17 .cse14 .cse5 .cse18) (and .cse19 .cse1 .cse20 .cse2 .cse3) (and .cse21 .cse22 .cse3 .cse23 .cse24 .cse13 .cse8 .cse25 .cse26 .cse27 .cse28 .cse5 .cse29) (and .cse1 .cse19 .cse20 .cse2 .cse3) (and .cse8 .cse9 .cse30 (= |ULTIMATE.start_main_~p~0#1| 2) .cse31 .cse32 .cse10 .cse3 .cse28 (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 2)) .cse13 .cse5) (and .cse33 .cse30 .cse34 .cse21 .cse22 .cse3 .cse23 .cse35 .cse36 .cse24 .cse37 .cse13 .cse8 .cse9 .cse25 .cse38 .cse26 .cse10 .cse27 .cse39 .cse5 .cse29 .cse40) (and .cse3 .cse28 .cse24 .cse13 .cse5 .cse29) (and .cse8 .cse25 .cse34 .cse22 .cse26 .cse27 .cse3 .cse23 .cse41 .cse13 .cse5) (and .cse8 .cse9 .cse30 .cse10 .cse3 .cse41 .cse13 .cse5) (and .cse15 .cse42 .cse43 .cse16 .cse44 .cse1 .cse10 .cse2 .cse3 (= |ULTIMATE.start_main_~d~0#1| .cse45) .cse46 .cse18) (and .cse47 .cse30 .cse19 .cse48 .cse3 (= |ULTIMATE.start_main_~r~0#1| (+ (+ |ULTIMATE.start_main_~A~0#1| (* |ULTIMATE.start_main_~B~0#1| (- 2))) .cse49)) .cse50 (= |ULTIMATE.start_main_~r~0#1| (+ (+ |ULTIMATE.start_main_~A~0#1| (- 2)) .cse51)) .cse52 .cse8 (= (+ .cse53 .cse54) 0) .cse55 .cse56 .cse20 .cse57 (= (+ |ULTIMATE.start_main_~q~0#1| (- 2)) 1)) (and .cse8 .cse9 .cse30 .cse58 .cse10 .cse3 .cse28 .cse23 .cse24 .cse13 .cse5 .cse29) (and .cse22 (= |ULTIMATE.start_main_~r~0#1| (+ (+ |ULTIMATE.start_main_~A~0#1| (* |ULTIMATE.start_main_~B~0#1| (- 4))) .cse49)) .cse3 .cse23 .cse36 (= (+ .cse59 .cse60) |ULTIMATE.start_main_~A~0#1|) .cse8 .cse25 .cse38 (<= |ULTIMATE.start_main_~p~0#1| 1) .cse26 .cse20 .cse27 (= (+ |ULTIMATE.start_main_~q~0#1| (- 4)) 1) .cse39 (= |ULTIMATE.start_main_~q~0#1| (+ 4 |ULTIMATE.start_main_~p~0#1|)) .cse5 .cse40) (and .cse1 .cse3 (or (and .cse34 .cse22 .cse61 .cse24 .cse62 .cse8 .cse9 .cse26 .cse27 .cse39 .cse33 .cse21 .cse1 .cse3 .cse23 .cse35 .cse36 .cse37 .cse13 .cse25 .cse16 .cse38 .cse10 .cse5 .cse29 .cse40) (and .cse34 .cse22 .cse61 .cse24 .cse62 .cse8 .cse26 .cse27 .cse39 .cse33 .cse63 .cse21 .cse1 .cse3 .cse23 .cse35 .cse36 .cse37 .cse13 .cse25 .cse16 .cse38 .cse10 .cse5 .cse29 .cse40)) .cse13 .cse5) (and .cse8 .cse26 .cse3 .cse41 .cse13 .cse5) (and .cse3 .cse41 .cse13 .cse5) (let ((.cse64 (+ |ULTIMATE.start_main_~A~0#1| (* |ULTIMATE.start_main_~r~0#1| (- 1))))) (and (= .cse64 .cse65) .cse19 .cse3 .cse28 (let ((.cse68 (= 0 (mod (+ |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) 2))) (.cse66 (div (+ |ULTIMATE.start_main_~A~0#1| (- |ULTIMATE.start_main_~r~0#1|)) 2)) (.cse67 (< .cse64 0))) (or (and (= |ULTIMATE.start_main_~d~0#1| .cse66) (or (not .cse67) .cse68)) (and (not .cse68) (= |ULTIMATE.start_main_~d~0#1| (+ 1 .cse66)) .cse67))) (= (+ |ULTIMATE.start_main_~q~0#1| .cse54) 0))) (and .cse8 .cse58 .cse3 .cse28 .cse23 .cse24 .cse13 .cse5 .cse29) (and .cse31 .cse19 .cse32 .cse20 .cse3 .cse28 .cse13) (and .cse8 .cse26 .cse3 .cse28 .cse24 .cse13 .cse5 .cse29) (and .cse16 .cse1 (= |ULTIMATE.start_main_~d~0#1| (* 2 .cse60)) .cse61 .cse10 .cse2 .cse3 .cse13 .cse62 .cse5 (= |ULTIMATE.start_main_~p~0#1| (* 2 .cse45))) (and .cse34 .cse22 .cse3 .cse23 .cse41 .cse13 .cse17 .cse8 .cse25 .cse16 .cse26 .cse10 .cse27 .cse5) (and .cse8 .cse56 .cse19 .cse48 .cse20 (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| .cse49)) .cse3 .cse12 .cse11 (= (+ |ULTIMATE.start_main_~q~0#1| (* 1 (- 1))) 0) .cse50)))))))))) [2023-02-17 07:33:33,590 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2023-02-17 07:33:33,593 INFO L895 garLoopResultBuilder]: At program point L45-1(line 45) the Hoare annotation is: (let ((.cse204 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse201 (div |ULTIMATE.start_main_~d~0#1| 2))) (let ((.cse255 (+ .cse201 1)) (.cse203 (+ 1 .cse204)) (.cse233 (- .cse201)) (.cse267 (+ .cse204 1))) (let ((.cse229 (div .cse267 2)) (.cse226 (div |ULTIMATE.start_main_~p~0#1| 4)) (.cse237 (+ (- 1) .cse233)) (.cse197 (+ |ULTIMATE.start_main_~q~0#1| .cse203)) (.cse193 (+ |ULTIMATE.start_main_~q~0#1| .cse204)) (.cse248 (mod |ULTIMATE.start_main_~d~0#1| 2)) (.cse194 (div .cse255 2)) (.cse195 (div |ULTIMATE.start_main_~d~0#1| 4))) (let ((.cse260 (+ .cse195 1)) (.cse196 (+ 1 .cse195)) (.cse192 (+ 1 .cse194)) (.cse257 (+ .cse194 1)) (.cse64 (- |ULTIMATE.start_main_~d~0#1|)) (.cse116 (= 1 |ULTIMATE.start_main_~p~0#1|)) (.cse97 (= 0 .cse248)) (.cse264 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse86 (= 0 (mod |ULTIMATE.start_main_~p~0#1| 2))) (.cse176 (+ |ULTIMATE.start_main_~r~0#1| .cse233)) (.cse263 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse266 (* .cse193 |ULTIMATE.start_main_~B~0#1|)) (.cse265 (* .cse197 |ULTIMATE.start_main_~B~0#1|)) (.cse154 (+ |ULTIMATE.start_main_~r~0#1| .cse237)) (.cse202 (+ 1 .cse201)) (.cse254 (+ .cse226 1)) (.cse262 (+ .cse229 1))) (let ((.cse219 (div .cse262 2)) (.cse220 (div .cse267 4)) (.cse216 (div .cse254 2)) (.cse143 (= 0 (mod .cse226 2))) (.cse212 (div |ULTIMATE.start_main_~p~0#1| 8)) (.cse103 (- .cse194)) (.cse82 (= 0 (mod .cse204 2))) (.cse250 (< .cse204 0)) (.cse102 (= 0 (mod .cse255 2))) (.cse251 (< .cse202 0)) (.cse252 (< .cse203 0)) (.cse88 (= 0 (mod .cse267 2))) (.cse74 (= 1 .cse204)) (.cse87 (= 1 .cse203)) (.cse184 (= |ULTIMATE.start_main_~A~0#1| (+ .cse265 .cse154))) (.cse181 (= |ULTIMATE.start_main_~A~0#1| (+ .cse266 .cse154))) (.cse105 (not .cse263)) (.cse182 (= |ULTIMATE.start_main_~A~0#1| (+ .cse266 .cse176))) (.cse85 (and .cse264 (not .cse86))) (.cse183 (= |ULTIMATE.start_main_~A~0#1| (+ .cse265 .cse176))) (.cse93 (not .cse264)) (.cse96 (and .cse263 (not .cse97))) (.cse45 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse72 (not .cse116)) (.cse165 (+ |ULTIMATE.start_main_~r~0#1| .cse64)) (.cse94 (- .cse195)) (.cse78 (= 0 (mod .cse201 2))) (.cse253 (< .cse201 0)) (.cse207 (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~p~0#1|)) (.cse224 (* 2 |ULTIMATE.start_main_~d~0#1|)) (.cse227 (+ 1 .cse226)) (.cse238 (* 2 |ULTIMATE.start_main_~p~0#1|)) (.cse256 (< .cse194 0)) (.cse140 (= 0 (mod .cse194 2))) (.cse125 (= 0 (mod .cse257 2))) (.cse258 (< .cse192 0)) (.cse259 (< .cse195 0)) (.cse173 (= 0 (mod .cse195 2))) (.cse261 (< .cse196 0)) (.cse167 (= 0 (mod .cse260 2))) (.cse228 (+ 1 .cse229))) (let ((.cse222 (< .cse229 0)) (.cse132 (= 0 (mod .cse229 2))) (.cse128 (= 0 (mod .cse262 2))) (.cse223 (< .cse228 0)) (.cse169 (and .cse261 (not .cse167))) (.cse168 (not .cse261)) (.cse179 (div .cse260 2)) (.cse172 (and .cse259 (not .cse173))) (.cse180 (div |ULTIMATE.start_main_~d~0#1| 8)) (.cse175 (not .cse259)) (.cse122 (not .cse258)) (.cse127 (and .cse258 (not .cse125))) (.cse158 (div .cse257 2)) (.cse138 (and .cse256 (not .cse140))) (.cse139 (not .cse256)) (.cse157 (div .cse255 4)) (.cse110 (div .cse238 4)) (.cse151 (= 0 (mod .cse254 2))) (.cse225 (< .cse227 0)) (.cse109 (+ |ULTIMATE.start_main_~q~0#1| .cse238)) (.cse113 (+ |ULTIMATE.start_main_~r~0#1| (- .cse224))) (.cse230 (* (+ .cse207 .cse203) |ULTIMATE.start_main_~B~0#1|)) (.cse232 (* (+ .cse207 .cse204) |ULTIMATE.start_main_~B~0#1|)) (.cse73 (* 2 1)) (.cse47 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse200 (* |ULTIMATE.start_main_~B~0#1| 1)) (.cse59 (* 2 .cse224)) (.cse142 (= 1 .cse226)) (.cse153 (= 1 .cse227)) (.cse120 (= 1 .cse228)) (.cse131 (= 1 .cse229)) (.cse79 (and (not .cse78) .cse253)) (.cse75 (not .cse253)) (.cse95 (+ (- 1) .cse94)) (.cse0 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse207 |ULTIMATE.start_main_~B~0#1|) .cse165))) (.cse12 (or .cse45 .cse72)) (.cse18 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse68 (or (and (or .cse182 .cse85) (or .cse86 .cse183 .cse93)) .cse96)) (.cse63 (or (and (or .cse86 .cse184 .cse93) (or .cse181 .cse85)) .cse97 .cse105)) (.cse19 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse6 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse9 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse10 (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|))) (.cse234 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse202 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)) .cse97 .cse105) (or .cse96 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse201 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))))) (.cse235 (and (or .cse85 (not .cse74)) (or .cse86 (not .cse87) .cse93))) (.cse92 (and .cse252 (not .cse88))) (.cse239 (* (+ .cse197 .cse229) |ULTIMATE.start_main_~B~0#1|)) (.cse241 (* (+ .cse197 .cse228) |ULTIMATE.start_main_~B~0#1|)) (.cse89 (not .cse252)) (.cse101 (not .cse251)) (.cse98 (and (not .cse102) .cse251)) (.cse84 (not .cse250)) (.cse243 (* (+ .cse193 .cse227) |ULTIMATE.start_main_~B~0#1|)) (.cse81 (and .cse250 (not .cse82))) (.cse244 (* (+ .cse193 .cse226) |ULTIMATE.start_main_~B~0#1|)) (.cse104 (+ (- 1) .cse103)) (.cse249 (div .cse64 (- 2))) (.cse211 (+ 1 .cse212)) (.cse214 (< .cse226 0)) (.cse213 (not .cse143)) (.cse215 (+ 1 .cse216)) (.cse221 (+ 1 .cse220)) (.cse218 (+ 1 .cse219))) (let ((.cse66 (+ |ULTIMATE.start_main_~q~0#1| (* |ULTIMATE.start_main_~p~0#1| (- 1)))) (.cse83 (* (+ |ULTIMATE.start_main_~q~0#1| .cse227) |ULTIMATE.start_main_~B~0#1|)) (.cse76 (* (+ |ULTIMATE.start_main_~q~0#1| .cse226) |ULTIMATE.start_main_~B~0#1|)) (.cse91 (* (+ |ULTIMATE.start_main_~q~0#1| .cse229) |ULTIMATE.start_main_~B~0#1|)) (.cse90 (* (+ |ULTIMATE.start_main_~q~0#1| .cse228) |ULTIMATE.start_main_~B~0#1|)) (.cse71 (not (= 0 |ULTIMATE.start_main_~q~0#1|))) (.cse117 (= 1 .cse238)) (.cse123 (* (+ .cse197 .cse218) |ULTIMATE.start_main_~B~0#1|)) (.cse129 (* (+ .cse197 .cse219) |ULTIMATE.start_main_~B~0#1|)) (.cse136 (* (+ .cse197 .cse220) |ULTIMATE.start_main_~B~0#1|)) (.cse134 (* (+ .cse197 .cse221) |ULTIMATE.start_main_~B~0#1|)) (.cse152 (* (+ .cse193 .cse215) |ULTIMATE.start_main_~B~0#1|)) (.cse148 (* (+ .cse193 .cse216) |ULTIMATE.start_main_~B~0#1|)) (.cse146 (* (+ .cse193 .cse212) |ULTIMATE.start_main_~B~0#1|)) (.cse147 (and .cse214 .cse213)) (.cse144 (* (+ .cse193 .cse211) |ULTIMATE.start_main_~B~0#1|)) (.cse162 (* (+ .cse207 .cse227) |ULTIMATE.start_main_~B~0#1|)) (.cse159 (* (+ .cse207 .cse226) |ULTIMATE.start_main_~B~0#1|)) (.cse163 (* (+ .cse207 .cse229) |ULTIMATE.start_main_~B~0#1|)) (.cse164 (* (+ .cse207 .cse228) |ULTIMATE.start_main_~B~0#1|)) (.cse54 (<= 2 .cse249)) (.cse56 (>= |ULTIMATE.start_main_~r~0#1| .cse249)) (.cse57 (= .cse248 0)) (.cse65 (or .cse97 (let ((.cse247 (+ .cse154 .cse104)) (.cse246 (+ .cse154 .cse103))) (and (or .cse86 (and (or .cse98 (and (or .cse92 (= |ULTIMATE.start_main_~A~0#1| (+ .cse239 .cse246))) (or .cse88 (= |ULTIMATE.start_main_~A~0#1| (+ .cse241 .cse246)) .cse89))) (or .cse101 .cse102 (and (or .cse92 (= |ULTIMATE.start_main_~A~0#1| (+ .cse239 .cse247))) (or .cse88 (= |ULTIMATE.start_main_~A~0#1| (+ .cse241 .cse247)) .cse89)))) .cse93) (or (and (or (and (or .cse81 (= |ULTIMATE.start_main_~A~0#1| (+ .cse244 .cse247))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse243 .cse247)) .cse82 .cse84)) .cse101 .cse102) (or .cse98 (and (or .cse82 .cse84 (= |ULTIMATE.start_main_~A~0#1| (+ .cse243 .cse246))) (or .cse81 (= |ULTIMATE.start_main_~A~0#1| (+ .cse244 .cse246)))))) .cse85))) .cse105)) (.cse55 (let ((.cse245 (or .cse234 .cse235))) (or (and .cse0 .cse245 .cse45 .cse18 .cse68 .cse63 .cse19 .cse6 .cse9 .cse10) (and .cse0 .cse12 .cse245 .cse18 .cse68 .cse63 .cse19 .cse6 .cse9 .cse10)))) (.cse27 (or (and (or .cse97 (= |ULTIMATE.start_main_~B~0#1| .cse202) .cse105) (or .cse96 (= |ULTIMATE.start_main_~B~0#1| .cse201))) .cse235)) (.cse69 (or .cse96 (let ((.cse240 (+ .cse176 .cse94)) (.cse242 (+ .cse176 .cse95))) (and (or .cse86 (and (or .cse79 (and (or .cse92 (= |ULTIMATE.start_main_~A~0#1| (+ .cse239 .cse240))) (or .cse88 .cse89 (= |ULTIMATE.start_main_~A~0#1| (+ .cse241 .cse240))))) (or .cse75 (and (or .cse88 (= |ULTIMATE.start_main_~A~0#1| (+ .cse241 .cse242)) .cse89) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse239 .cse242)) .cse92)) .cse78)) .cse93) (or .cse85 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse243 .cse240)) .cse82 .cse84) (or .cse81 (= |ULTIMATE.start_main_~A~0#1| (+ .cse244 .cse240)))) .cse79) (or (and (or .cse82 .cse84 (= |ULTIMATE.start_main_~A~0#1| (+ .cse243 .cse242))) (or .cse81 (= |ULTIMATE.start_main_~A~0#1| (+ .cse244 .cse242)))) .cse75 .cse78))))))) (.cse198 (and (or .cse88 (not .cse120) .cse89) (or (not .cse131) .cse92))) (.cse191 (and (or .cse81 (not .cse142)) (or .cse82 .cse84 (not .cse153)))) (.cse118 (+ |ULTIMATE.start_main_~q~0#1| (* 2 .cse238))) (.cse119 (+ |ULTIMATE.start_main_~r~0#1| (- .cse59))) (.cse199 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse200 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse52 (* 2 .cse47)) (.cse53 (* 2 .cse73)) (.cse190 (or (and (or .cse97 .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse202 .cse207) .cse165))) (or .cse96 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse201 .cse207) .cse165)))) .cse116 .cse235)) (.cse22 (<= 2 |ULTIMATE.start_main_~d~0#1|)) (.cse62 (or (let ((.cse236 (+ .cse165 .cse237))) (and (or .cse86 (= |ULTIMATE.start_main_~A~0#1| (+ .cse230 .cse236)) .cse93) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse232 .cse236)) .cse85))) .cse97 .cse105)) (.cse13 (= |ULTIMATE.start_main_~A~0#1| (+ (* (+ .cse109 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~B~0#1|) (+ .cse113 .cse64)))) (.cse189 (or .cse116 .cse234 .cse235)) (.cse67 (or .cse96 (let ((.cse231 (+ .cse165 .cse233))) (and (or .cse86 .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ .cse230 .cse231))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse232 .cse231)) .cse85))))) (.cse16 (or .cse72 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))) (.cse205 (and (or (and (or .cse81 (not (<= 1 .cse226))) (or .cse82 .cse84 (not (<= 1 .cse227)))) .cse85) (or .cse86 .cse93 (and (or (not (<= 1 .cse228)) .cse88 .cse89) (or .cse92 (not (<= 1 .cse229))))))) (.cse206 (and (or .cse97 (and (or .cse98 (not (= .cse200 .cse194))) (or .cse101 .cse102 (not (= .cse200 .cse192)))) .cse105) (or .cse96 (and (or .cse75 (not (= .cse200 .cse196)) .cse78) (or .cse79 (not (= .cse200 .cse195))))))) (.cse145 (not .cse214)) (.cse150 (not .cse225)) (.cse149 (and (not .cse151) .cse225)) (.cse115 (div .cse224 4)) (.cse112 (+ 1 .cse110)) (.cse210 (and (or .cse101 .cse102 (and (or (not (= .cse200 (+ 1 .cse158))) .cse122 .cse125) (or .cse127 (not (= .cse200 .cse158))))) (or .cse98 (and (or (not (= .cse200 .cse157)) .cse138) (or .cse139 (not (= .cse200 (+ 1 .cse157))) .cse140))))) (.cse208 (and (or (and (or .cse169 (not (= .cse200 .cse179))) (or .cse167 .cse168 (not (= .cse200 (+ 1 .cse179))))) .cse75 .cse78) (or .cse79 (and (or .cse172 (not (= .cse200 .cse180))) (or .cse173 (not (= .cse200 (+ 1 .cse180))) .cse175))))) (.cse121 (not .cse223)) (.cse130 (and .cse223 (not .cse128))) (.cse135 (and .cse222 (not .cse132))) (.cse133 (not .cse222)) (.cse58 (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|))) (let ((.cse17 (= |ULTIMATE.start_main_~d~0#1| .cse73)) (.cse20 (= |ULTIMATE.start_main_~p~0#1| .cse73)) (.cse21 (= |ULTIMATE.start_main_~d~0#1| .cse47)) (.cse25 (= .cse58 |ULTIMATE.start_main_~A~0#1|)) (.cse32 (or .cse86 (let ((.cse217 (* .cse200 .cse197))) (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse217 .cse154)) .cse97 .cse210 .cse105) (or .cse208 .cse96 (= |ULTIMATE.start_main_~A~0#1| (+ .cse217 .cse176))))) .cse93 (and (or .cse88 .cse89 (and (or (not (<= 1 .cse218)) .cse121 .cse128) (or (not (<= 1 .cse219)) .cse130))) (or .cse92 (and (or .cse135 (not (<= 1 .cse220))) (or (not (<= 1 .cse221)) .cse132 .cse133)))))) (.cse35 (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse200 .cse109) .cse113)) (and (or .cse96 (not (= .cse200 .cse115))) (or .cse97 .cse105 (not (= .cse200 (+ 1 .cse115))))) (and (or .cse86 .cse93 (not (<= 1 .cse112))) (or (not (<= 1 .cse110)) .cse85)))) (.cse37 (or (let ((.cse209 (* .cse200 .cse193))) (and (or .cse208 (= |ULTIMATE.start_main_~A~0#1| (+ .cse209 .cse176)) .cse96) (or .cse97 (= |ULTIMATE.start_main_~A~0#1| (+ .cse209 .cse154)) .cse210 .cse105))) .cse85 (and (or .cse81 (and (or .cse143 (not (<= 1 .cse211)) .cse145) (or (not (<= 1 .cse212)) (and .cse213 .cse214)))) (or .cse82 .cse84 (and (or (not (<= 1 .cse215)) .cse151 .cse150) (or (not (<= 1 .cse216)) .cse149)))))) (.cse33 (or .cse205 .cse206 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse200 .cse207) .cse165)))) (.cse42 (or .cse45 .cse72 (not .cse10))) (.cse28 (or (and .cse22 .cse62 .cse0 .cse12 .cse13 .cse190 .cse189 .cse67 .cse68 .cse63 .cse16 .cse9) (and .cse22 .cse62 .cse0 .cse12 .cse13 .cse189 .cse67 .cse68 .cse63 .cse16 .cse9))) (.cse14 (= (+ |ULTIMATE.start_main_~q~0#1| (* .cse53 (- 1))) 0)) (.cse15 (= (+ |ULTIMATE.start_main_~r~0#1| .cse52) |ULTIMATE.start_main_~A~0#1|)) (.cse2 (or .cse199 .cse205 .cse206)) (.cse8 (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse200 .cse118) .cse119)) (not (= .cse200 |ULTIMATE.start_main_~d~0#1|)) (not (<= 1 |ULTIMATE.start_main_~p~0#1|)))) (.cse11 (or .cse199 (and (or (not (= .cse200 .cse201)) .cse96) (or .cse97 (not (= .cse200 .cse202)) .cse105)) (and (or (not (<= 1 .cse203)) .cse86 .cse93) (or (not (<= 1 .cse204)) .cse85)))) (.cse43 (or (and (or .cse96 (and (or .cse75 .cse78 (= |ULTIMATE.start_main_~B~0#1| .cse196)) (or .cse79 (= |ULTIMATE.start_main_~B~0#1| .cse195)))) (or .cse97 (and (or .cse98 (= |ULTIMATE.start_main_~B~0#1| .cse194)) (or (= |ULTIMATE.start_main_~B~0#1| .cse192) .cse101 .cse102)) .cse105)) (and (or .cse86 .cse93 .cse198) (or .cse191 .cse85)))) (.cse44 (let ((.cse187 (or .cse86 .cse87 (and (or .cse96 (and (or .cse75 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse196 .cse197) .cse176)) .cse78) (or .cse79 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse195 .cse197) .cse176))))) (or .cse97 (and (or .cse101 .cse102 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse192 .cse197) .cse154))) (or .cse98 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse194 .cse197) .cse154)))) .cse105)) .cse93 .cse198)) (.cse188 (or .cse74 .cse191 (and (or .cse97 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse192 .cse193) .cse154)) .cse101 .cse102) (or .cse98 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse194 .cse193) .cse154)))) .cse105) (or .cse96 (and (or .cse79 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse195 .cse193) .cse176))) (or .cse75 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse196 .cse193) .cse176)) .cse78)))) .cse85))) (or (and .cse62 .cse187 .cse54 .cse56 .cse13 .cse188 .cse189 .cse45 .cse63 .cse57 .cse9 .cse65 .cse0 .cse55 .cse27 .cse190 .cse67 .cse68 .cse16 .cse69) (and .cse62 .cse187 .cse54 .cse56 .cse13 .cse188 .cse189 .cse63 .cse57 .cse9 .cse65 .cse0 .cse12 .cse55 .cse27 .cse190 .cse67 .cse68 .cse16 .cse69)))) (.cse26 (= |ULTIMATE.start_main_~d~0#1| .cse52)) (.cse29 (= |ULTIMATE.start_main_~p~0#1| .cse53)) (.cse34 (or (let ((.cse186 (+ .cse165 .cse103)) (.cse185 (+ .cse165 .cse104))) (and (or .cse74 (and (or .cse82 (and (or .cse101 (= |ULTIMATE.start_main_~A~0#1| (+ .cse162 .cse185)) .cse102) (or .cse98 (= |ULTIMATE.start_main_~A~0#1| (+ .cse162 .cse186)))) .cse84) (or (and (or .cse101 .cse102 (= |ULTIMATE.start_main_~A~0#1| (+ .cse159 .cse185))) (or .cse98 (= |ULTIMATE.start_main_~A~0#1| (+ .cse159 .cse186)))) .cse81)) .cse85) (or .cse86 (and (or .cse92 (and (or .cse98 (= |ULTIMATE.start_main_~A~0#1| (+ .cse163 .cse186))) (or .cse101 (= |ULTIMATE.start_main_~A~0#1| (+ .cse163 .cse185)) .cse102))) (or .cse88 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse164 .cse186)) .cse98) (or .cse101 (= |ULTIMATE.start_main_~A~0#1| (+ .cse164 .cse185)) .cse102)) .cse89)) .cse87 .cse93))) .cse97 .cse105)) (.cse7 (or .cse116 (and (or (and (or .cse181 .cse97 .cse105) (or .cse182 .cse96)) .cse85) (or .cse86 (and (or .cse183 .cse96) (or .cse184 .cse97 .cse105)) .cse93)))) (.cse36 (or .cse96 (let ((.cse177 (- .cse180)) (.cse178 (- .cse179))) (let ((.cse166 (+ .cse176 (+ (- 1) .cse178))) (.cse170 (+ .cse176 .cse178)) (.cse174 (+ .cse176 (+ (- 1) .cse177))) (.cse171 (+ .cse176 .cse177))) (and (or (and (or .cse75 (and (or .cse88 .cse120 .cse89 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse129 .cse166)) .cse167 .cse168) (or .cse169 (= |ULTIMATE.start_main_~A~0#1| (+ .cse129 .cse170)))) .cse130) (or (and (or .cse167 (= |ULTIMATE.start_main_~A~0#1| (+ .cse123 .cse166)) .cse168) (or .cse169 (= |ULTIMATE.start_main_~A~0#1| (+ .cse123 .cse170)))) .cse121 .cse128))) (or .cse131 .cse92 (and (or .cse132 .cse133 (and (or .cse169 (= |ULTIMATE.start_main_~A~0#1| (+ .cse134 .cse170))) (or .cse167 .cse168 (= |ULTIMATE.start_main_~A~0#1| (+ .cse134 .cse166))))) (or (and (or .cse167 (= |ULTIMATE.start_main_~A~0#1| (+ .cse136 .cse166)) .cse168) (or .cse169 (= |ULTIMATE.start_main_~A~0#1| (+ .cse136 .cse170)))) .cse135)))) .cse78) (or .cse79 (and (or (and (or .cse121 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse123 .cse171)) .cse172) (or .cse173 (= |ULTIMATE.start_main_~A~0#1| (+ .cse123 .cse174)) .cse175)) .cse128) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse129 .cse171)) .cse172) (or .cse173 (= |ULTIMATE.start_main_~A~0#1| (+ .cse129 .cse174)) .cse175)) .cse130)) .cse88 .cse120 .cse89) (or .cse131 .cse92 (and (or (and (or .cse173 (= |ULTIMATE.start_main_~A~0#1| (+ .cse136 .cse174)) .cse175) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse136 .cse171)) .cse172)) .cse135) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse134 .cse171)) .cse172) (or .cse173 (= |ULTIMATE.start_main_~A~0#1| (+ .cse134 .cse174)) .cse175)) .cse132 .cse133)))))) .cse86 .cse93) (or (and (or (and (or .cse142 .cse81 (and (or (and (or .cse169 (= |ULTIMATE.start_main_~A~0#1| (+ .cse146 .cse170))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse146 .cse166)) .cse167 .cse168)) .cse147) (or .cse143 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse144 .cse166)) .cse167 .cse168) (or .cse169 (= |ULTIMATE.start_main_~A~0#1| (+ .cse144 .cse170)))) .cse145))) (or .cse82 .cse84 (and (or .cse150 .cse151 (and (or .cse167 .cse168 (= |ULTIMATE.start_main_~A~0#1| (+ .cse152 .cse166))) (or .cse169 (= |ULTIMATE.start_main_~A~0#1| (+ .cse152 .cse170))))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse166)) .cse167 .cse168) (or .cse169 (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse170)))) .cse149)) .cse153)) .cse75 .cse78) (or .cse79 (and (or .cse82 (and (or (and (or .cse173 (= |ULTIMATE.start_main_~A~0#1| (+ .cse152 .cse174)) .cse175) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse152 .cse171)) .cse172)) .cse150 .cse151) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse174)) .cse173 .cse175) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse171)) .cse172)) .cse149)) .cse84 .cse153) (or .cse142 .cse81 (and (or (and (or .cse173 (= |ULTIMATE.start_main_~A~0#1| (+ .cse146 .cse174)) .cse175) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse146 .cse171)) .cse172)) .cse147) (or .cse143 (and (or .cse173 .cse175 (= |ULTIMATE.start_main_~A~0#1| (+ .cse144 .cse174))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse144 .cse171)) .cse172)) .cse145)))))) .cse85)))))) (.cse38 (or .cse96 (let ((.cse160 (+ .cse165 .cse94)) (.cse161 (+ .cse165 .cse95))) (and (or .cse74 .cse85 (and (or .cse81 (and (or .cse79 (= |ULTIMATE.start_main_~A~0#1| (+ .cse159 .cse160))) (or .cse75 (= |ULTIMATE.start_main_~A~0#1| (+ .cse159 .cse161)) .cse78))) (or (and (or .cse75 .cse78 (= |ULTIMATE.start_main_~A~0#1| (+ .cse162 .cse161))) (or .cse79 (= |ULTIMATE.start_main_~A~0#1| (+ .cse162 .cse160)))) .cse82 .cse84))) (or .cse86 (and (or .cse92 (and (or .cse79 (= |ULTIMATE.start_main_~A~0#1| (+ .cse163 .cse160))) (or .cse75 (= |ULTIMATE.start_main_~A~0#1| (+ .cse163 .cse161)) .cse78))) (or .cse88 (and (or .cse79 (= |ULTIMATE.start_main_~A~0#1| (+ .cse164 .cse160))) (or .cse75 (= |ULTIMATE.start_main_~A~0#1| (+ .cse164 .cse161)) .cse78)) .cse89)) .cse87 .cse93))))) (.cse1 (or .cse71 .cse117 .cse72 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~d~0#1| .cse109) .cse113)))) (.cse39 (or .cse97 (let ((.cse155 (- .cse158)) (.cse156 (- .cse157))) (let ((.cse141 (+ .cse154 (+ (- 1) .cse156))) (.cse137 (+ .cse154 .cse156)) (.cse126 (+ .cse154 .cse155)) (.cse124 (+ .cse154 (+ (- 1) .cse155)))) (and (or (and (or .cse101 .cse102 (and (or .cse88 .cse120 .cse89 (and (or .cse121 (and (or .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ .cse123 .cse124)) .cse125) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse123 .cse126)) .cse127)) .cse128) (or (and (or .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ .cse129 .cse124)) .cse125) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse129 .cse126)) .cse127)) .cse130))) (or .cse131 .cse92 (and (or .cse132 .cse133 (and (or .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ .cse134 .cse124)) .cse125) (or .cse127 (= |ULTIMATE.start_main_~A~0#1| (+ .cse134 .cse126))))) (or .cse135 (and (or .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ .cse136 .cse124)) .cse125) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse136 .cse126)) .cse127))))))) (or .cse98 (and (or .cse131 .cse92 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse136 .cse137)) .cse138) (or .cse139 .cse140 (= |ULTIMATE.start_main_~A~0#1| (+ .cse136 .cse141)))) .cse135) (or .cse132 (and (or .cse139 .cse140 (= |ULTIMATE.start_main_~A~0#1| (+ .cse134 .cse141))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse134 .cse137)) .cse138)) .cse133))) (or .cse88 .cse120 .cse89 (and (or .cse121 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse123 .cse137)) .cse138) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse123 .cse141)) .cse139 .cse140)) .cse128) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse129 .cse137)) .cse138) (or .cse139 .cse140 (= |ULTIMATE.start_main_~A~0#1| (+ .cse129 .cse141)))) .cse130)))))) .cse86 .cse93) (or (and (or .cse98 (and (or .cse142 .cse81 (and (or .cse143 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse144 .cse141)) .cse139 .cse140) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse144 .cse137)) .cse138)) .cse145) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse146 .cse137)) .cse138) (or .cse139 .cse140 (= |ULTIMATE.start_main_~A~0#1| (+ .cse146 .cse141)))) .cse147))) (or (and (or (and (or .cse138 (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse137))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse141)) .cse139 .cse140)) .cse149) (or .cse150 .cse151 (and (or .cse139 .cse140 (= |ULTIMATE.start_main_~A~0#1| (+ .cse152 .cse141))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse152 .cse137)) .cse138)))) .cse82 .cse84 .cse153))) (or .cse101 .cse102 (and (or (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse146 .cse126)) .cse127) (or .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ .cse146 .cse124)) .cse125)) .cse147) (or (and (or .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ .cse144 .cse124)) .cse125) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse144 .cse126)) .cse127)) .cse143 .cse145)) .cse142 .cse81) (or .cse82 (and (or (and (or .cse127 (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse126))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse124)) .cse122 .cse125)) .cse149) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse152 .cse126)) .cse127) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse152 .cse124)) .cse122 .cse125)) .cse150 .cse151)) .cse84 .cse153)))) .cse85)))) .cse105)) (.cse3 (or .cse117 (= |ULTIMATE.start_main_~A~0#1| (+ (* (+ .cse118 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~B~0#1|) (+ .cse119 .cse64))))) (.cse5 (or (let ((.cse114 (- .cse115))) (let ((.cse108 (+ .cse113 (+ (- 1) .cse114))) (.cse107 (+ .cse113 .cse114))) (and (or .cse85 (let ((.cse106 (* (+ .cse109 .cse110) |ULTIMATE.start_main_~B~0#1|))) (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse106 .cse107)) .cse96) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse106 .cse108)) .cse97 .cse105)))) (or .cse86 (let ((.cse111 (* (+ .cse109 .cse112) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse97 (= |ULTIMATE.start_main_~A~0#1| (+ .cse111 .cse108)) .cse105) (or .cse96 (= |ULTIMATE.start_main_~A~0#1| (+ .cse111 .cse107))))) .cse93)))) .cse116)) (.cse40 (or .cse97 (let ((.cse100 (+ |ULTIMATE.start_main_~r~0#1| .cse104)) (.cse99 (+ |ULTIMATE.start_main_~r~0#1| .cse103))) (and (or .cse74 (and (or .cse82 (and (or .cse98 (= |ULTIMATE.start_main_~A~0#1| (+ .cse83 .cse99))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse83 .cse100)) .cse101 .cse102)) .cse84) (or .cse81 (and (or .cse98 (= |ULTIMATE.start_main_~A~0#1| (+ .cse76 .cse99))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse76 .cse100)) .cse101 .cse102)))) .cse85) (or .cse86 (and (or .cse92 (and (or .cse98 (= |ULTIMATE.start_main_~A~0#1| (+ .cse91 .cse99))) (or .cse101 (= |ULTIMATE.start_main_~A~0#1| (+ .cse91 .cse100)) .cse102))) (or .cse88 (and (or .cse101 .cse102 (= |ULTIMATE.start_main_~A~0#1| (+ .cse90 .cse100))) (or .cse98 (= |ULTIMATE.start_main_~A~0#1| (+ .cse90 .cse99)))) .cse89)) .cse87 .cse93))) .cse105)) (.cse41 (or (let ((.cse77 (+ |ULTIMATE.start_main_~r~0#1| .cse95)) (.cse80 (+ |ULTIMATE.start_main_~r~0#1| .cse94))) (and (or .cse74 (and (or (and (or .cse75 (= |ULTIMATE.start_main_~A~0#1| (+ .cse76 .cse77)) .cse78) (or .cse79 (= |ULTIMATE.start_main_~A~0#1| (+ .cse76 .cse80)))) .cse81) (or .cse82 (and (or .cse79 (= |ULTIMATE.start_main_~A~0#1| (+ .cse83 .cse80))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse83 .cse77)) .cse75 .cse78)) .cse84)) .cse85) (or .cse86 .cse87 (and (or .cse88 .cse89 (and (or .cse79 (= |ULTIMATE.start_main_~A~0#1| (+ .cse90 .cse80))) (or .cse75 .cse78 (= |ULTIMATE.start_main_~A~0#1| (+ .cse90 .cse77))))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse91 .cse77)) .cse75 .cse78) (or .cse79 (= |ULTIMATE.start_main_~A~0#1| (+ .cse91 .cse80)))) .cse92)) .cse93))) .cse96)) (.cse51 (* .cse73 (- 1))) (.cse4 (let ((.cse70 (or .cse71 .cse45 .cse72))) (or (and .cse70 .cse9) (and (<= 1 |ULTIMATE.start_main_~d~0#1|) .cse70 .cse9)))) (.cse30 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse31 (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|)) (.cse60 (- |ULTIMATE.start_main_~B~0#1|)) (.cse24 (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| .cse64))) (.cse23 (= .cse66 0)) (.cse61 (= |ULTIMATE.start_main_~d~0#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse13 (= |ULTIMATE.start_main_~p~0#1| 2) .cse14 .cse4 .cse15 .cse16 .cse6 (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 2)) .cse9 .cse10) (and .cse17 .cse18 .cse19 .cse6 .cse20 .cse10 .cse21) (and .cse22 .cse17 .cse0 .cse12 .cse16 .cse23 .cse24 .cse6 .cse20 .cse9 .cse25 .cse21) (and .cse26 .cse27 .cse16 .cse23 .cse6 .cse9 .cse28 .cse25 .cse10 .cse29) (and .cse30 .cse18 .cse31 .cse19 .cse6) (and .cse32 .cse13 .cse2 .cse33 .cse34 .cse6 .cse7 .cse35 .cse36 .cse8 .cse37 .cse9 .cse0 .cse12 .cse38 .cse39 .cse3 .cse4 .cse16 .cse5 .cse40 .cse10 .cse11 .cse41) (and (or (and .cse1 .cse2 .cse4 .cse6 .cse42 .cse9 .cse10 .cse11) (and .cse1 .cse2 .cse4 .cse6 .cse8 .cse9 .cse10 .cse11)) .cse6 .cse9 .cse10) (and .cse0 .cse12 .cse13 .cse2 .cse4 .cse16 .cse6 .cse42 .cse9 .cse10 .cse11) (and .cse18 .cse6 (or (and .cse2 .cse34 .cse43 .cse8 .cse44 .cse0 .cse12 .cse3 .cse5 .cse40 .cse32 .cse33 .cse18 .cse6 .cse7 .cse35 .cse36 .cse37 .cse9 .cse38 .cse27 .cse39 .cse16 .cse10 .cse11 .cse41) (and .cse2 .cse34 .cse43 .cse8 .cse44 .cse0 .cse3 .cse5 .cse40 .cse32 .cse45 .cse33 .cse18 .cse6 .cse7 .cse35 .cse36 .cse37 .cse9 .cse38 .cse27 .cse39 .cse16 .cse10 .cse11 .cse41)) .cse9 .cse10) (and .cse18 .cse30 .cse31 .cse19 .cse6) (and .cse6 (or (and .cse1 .cse2 .cse4 .cse6 .cse7 .cse40 .cse42 .cse9 .cse10 .cse11 .cse41) (and .cse1 .cse2 .cse33 .cse4 .cse6 .cse7 .cse40 .cse8 .cse9 .cse10 .cse11 .cse41)) .cse9 .cse10) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse42 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10 .cse11)) .cse6 .cse9 .cse10) (and .cse27 .cse2 .cse16 .cse6 .cse7 .cse40 .cse42 .cse9 .cse28 .cse10 .cse11 .cse41) (let ((.cse46 (+ |ULTIMATE.start_main_~A~0#1| (* |ULTIMATE.start_main_~r~0#1| (- 1))))) (and (= .cse46 .cse47) .cse30 .cse4 .cse6 (let ((.cse50 (= 0 (mod (+ |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) 2))) (.cse48 (div (+ |ULTIMATE.start_main_~A~0#1| (- |ULTIMATE.start_main_~r~0#1|)) 2)) (.cse49 (< .cse46 0))) (or (and (= |ULTIMATE.start_main_~d~0#1| .cse48) (or (not .cse49) .cse50)) (and (not .cse50) (= |ULTIMATE.start_main_~d~0#1| (+ 1 .cse48)) .cse49))) (= (+ |ULTIMATE.start_main_~q~0#1| .cse51) 0))) (and .cse1 .cse14 .cse30 .cse4 .cse15 .cse31 .cse6 .cse9) (and .cse13 .cse2 .cse6 .cse7 .cse8 .cse9 .cse0 .cse12 .cse3 .cse4 .cse16 .cse5 .cse10 .cse11) (and .cse27 .cse18 (= |ULTIMATE.start_main_~d~0#1| (* 2 .cse52)) .cse43 .cse16 .cse19 .cse6 .cse9 .cse44 .cse10 (= |ULTIMATE.start_main_~p~0#1| (* 2 .cse53))) (and .cse26 .cse54 .cse55 .cse27 .cse56 .cse18 .cse16 .cse19 .cse6 (= |ULTIMATE.start_main_~d~0#1| .cse53) .cse57 .cse29) (and (= (+ .cse58 .cse59) |ULTIMATE.start_main_~A~0#1|) .cse34 (= |ULTIMATE.start_main_~r~0#1| (+ (+ |ULTIMATE.start_main_~A~0#1| (* |ULTIMATE.start_main_~B~0#1| (- 4))) .cse60)) .cse6 (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~p~0#1|)) .cse7 .cse36 .cse9 .cse61 (= (+ .cse58 .cse52) |ULTIMATE.start_main_~A~0#1|) .cse0 .cse38 .cse1 .cse39 (<= |ULTIMATE.start_main_~p~0#1| 1) .cse3 .cse4 .cse31 .cse5 (= (+ |ULTIMATE.start_main_~q~0#1| (- 4)) 1) .cse40 (= |ULTIMATE.start_main_~q~0#1| (+ 4 |ULTIMATE.start_main_~p~0#1|)) .cse10 .cse41) (and .cse62 .cse13 .cse30 .cse63 .cse6 (= |ULTIMATE.start_main_~r~0#1| (+ (+ |ULTIMATE.start_main_~A~0#1| (* |ULTIMATE.start_main_~B~0#1| (- 2))) .cse60)) .cse61 (= |ULTIMATE.start_main_~r~0#1| (+ (+ |ULTIMATE.start_main_~A~0#1| (- 2)) .cse64)) .cse65 .cse0 (= (+ .cse66 .cse51) 0) .cse67 .cse68 .cse4 .cse31 .cse69 (= (+ |ULTIMATE.start_main_~q~0#1| (- 2)) 1)) (and .cse0 .cse68 .cse30 .cse63 .cse31 (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| .cse60)) .cse6 .cse24 .cse23 .cse9 (= (+ |ULTIMATE.start_main_~q~0#1| (* 1 (- 1))) 0) .cse61)))))))))) [2023-02-17 07:33:33,593 INFO L899 garLoopResultBuilder]: For program point L37(lines 34 42) no Hoare annotation was computed. [2023-02-17 07:33:33,594 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-17 07:33:33,595 INFO L895 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (let ((.cse84 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse44 (div |ULTIMATE.start_main_~d~0#1| 2))) (let ((.cse78 (- .cse44)) (.cse85 (+ 1 .cse84))) (let ((.cse20 (= 0 (mod |ULTIMATE.start_main_~d~0#1| 2))) (.cse100 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse51 (- |ULTIMATE.start_main_~d~0#1|)) (.cse35 (+ |ULTIMATE.start_main_~q~0#1| .cse85)) (.cse101 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse27 (= 0 (mod |ULTIMATE.start_main_~p~0#1| 2))) (.cse39 (+ |ULTIMATE.start_main_~q~0#1| .cse84)) (.cse83 (+ (- 1) .cse78))) (let ((.cse38 (= 1 .cse84)) (.cse34 (= 1 .cse85)) (.cse37 (+ |ULTIMATE.start_main_~r~0#1| .cse83)) (.cse97 (* .cse39 |ULTIMATE.start_main_~B~0#1|)) (.cse31 (and .cse101 (not .cse27))) (.cse96 (* .cse35 |ULTIMATE.start_main_~B~0#1|)) (.cse36 (+ |ULTIMATE.start_main_~r~0#1| .cse78)) (.cse28 (not .cse101)) (.cse54 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse9 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse11 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse3 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse42 (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~p~0#1|)) (.cse43 (+ |ULTIMATE.start_main_~r~0#1| .cse51)) (.cse41 (+ 1 .cse44)) (.cse26 (not .cse100)) (.cse14 (and .cse100 (not .cse20))) (.cse99 (+ .cse84 1))) (let ((.cse65 (= 0 (mod .cse99 2))) (.cse92 (< .cse85 0)) (.cse89 (div .cse99 2)) (.cse86 (div |ULTIMATE.start_main_~p~0#1| 4)) (.cse93 (< .cse84 0)) (.cse70 (= 0 (mod .cse84 2))) (.cse47 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse41 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)) .cse20 .cse26) (or .cse14 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse44 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))))) (.cse48 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse2 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse49 (+ |ULTIMATE.start_main_~q~0#1| (* |ULTIMATE.start_main_~p~0#1| (- 1)))) (.cse50 (= |ULTIMATE.start_main_~d~0#1| 1)) (.cse52 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse42 |ULTIMATE.start_main_~B~0#1|) .cse43))) (.cse8 (let ((.cse98 (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|)))) (or (and .cse54 .cse98) (and .cse9 .cse11 .cse3 .cse98)))) (.cse58 (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse97 .cse36)) .cse31) (or .cse27 (= |ULTIMATE.start_main_~A~0#1| (+ .cse96 .cse36)) .cse28)) .cse14)) (.cse59 (or (and (or .cse27 (= |ULTIMATE.start_main_~A~0#1| (+ .cse96 .cse37)) .cse28) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse97 .cse37)) .cse31)) .cse20 .cse26)) (.cse61 (- |ULTIMATE.start_main_~B~0#1|)) (.cse46 (and (or .cse31 (not .cse38)) (or .cse27 (not .cse34) .cse28))) (.cse94 (+ .cse44 1))) (let ((.cse25 (= 0 (mod .cse94 2))) (.cse90 (< .cse41 0)) (.cse16 (= 0 (mod .cse44 2))) (.cse91 (< .cse44 0)) (.cse13 (or (and (or .cse20 (= |ULTIMATE.start_main_~B~0#1| .cse41) .cse26) (or .cse14 (= |ULTIMATE.start_main_~B~0#1| .cse44))) .cse46)) (.cse12 (let ((.cse95 (or (and .cse52 .cse8 .cse54) (and .cse52 .cse8 .cse58 .cse59 .cse54) (and .cse52 .cse8 .cse58 .cse59 (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| .cse61)) .cse3 (= (+ |ULTIMATE.start_main_~q~0#1| (* 1 (- 1))) 0))))) (or (and (or .cse47 .cse46) .cse48 .cse95) (and .cse2 (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| .cse51)) (= .cse49 0) .cse50 .cse95)))) (.cse19 (div |ULTIMATE.start_main_~d~0#1| 4)) (.cse22 (div .cse94 2)) (.cse72 (and .cse93 (not .cse70))) (.cse71 (not .cse93)) (.cse87 (+ 1 .cse86)) (.cse88 (+ 1 .cse89)) (.cse66 (not .cse92)) (.cse62 (and .cse92 (not .cse65)))) (let ((.cse29 (and (or .cse65 (not (= 1 .cse88)) .cse66) (or (not (= 1 .cse89)) .cse62))) (.cse30 (and (or .cse72 (not (= 1 .cse86))) (or .cse70 .cse71 (not (= 1 .cse87))))) (.cse23 (+ 1 .cse22)) (.cse17 (+ 1 .cse19)) (.cse7 (* (* 2 1) (- 1))) (.cse0 (or (and .cse13 .cse12 (<= 1 |ULTIMATE.start_main_~d~0#1|)) (and .cse13 .cse12))) (.cse18 (and (not .cse16) .cse91)) (.cse15 (not .cse91)) (.cse24 (not .cse90)) (.cse21 (and (not .cse25) .cse90))) (let ((.cse10 (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|)) (.cse32 (let ((.cse40 (let ((.cse63 (* (+ .cse35 .cse89) |ULTIMATE.start_main_~B~0#1|)) (.cse67 (* (+ .cse35 .cse88) |ULTIMATE.start_main_~B~0#1|)) (.cse69 (* (+ .cse39 .cse87) |ULTIMATE.start_main_~B~0#1|)) (.cse73 (* (+ .cse39 .cse86) |ULTIMATE.start_main_~B~0#1|)) (.cse75 (* (+ .cse42 .cse85) |ULTIMATE.start_main_~B~0#1|)) (.cse77 (* (+ .cse42 .cse84) |ULTIMATE.start_main_~B~0#1|))) (let ((.cse55 (or (let ((.cse82 (+ .cse43 .cse83))) (and (or .cse27 (= |ULTIMATE.start_main_~A~0#1| (+ .cse75 .cse82)) .cse28) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse77 .cse82)) .cse31))) .cse20 .cse26)) (.cse56 (or .cse20 (let ((.cse81 (- .cse22))) (let ((.cse80 (+ .cse37 (+ (- 1) .cse81))) (.cse79 (+ .cse37 .cse81))) (and (or .cse27 (and (or .cse21 (and (or .cse62 (= |ULTIMATE.start_main_~A~0#1| (+ .cse63 .cse79))) (or .cse65 (= |ULTIMATE.start_main_~A~0#1| (+ .cse67 .cse79)) .cse66))) (or .cse24 .cse25 (and (or .cse62 (= |ULTIMATE.start_main_~A~0#1| (+ .cse63 .cse80))) (or .cse65 (= |ULTIMATE.start_main_~A~0#1| (+ .cse67 .cse80)) .cse66)))) .cse28) (or (and (or (and (or .cse72 (= |ULTIMATE.start_main_~A~0#1| (+ .cse73 .cse80))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse69 .cse80)) .cse70 .cse71)) .cse24 .cse25) (or .cse21 (and (or .cse70 .cse71 (= |ULTIMATE.start_main_~A~0#1| (+ .cse69 .cse79))) (or .cse72 (= |ULTIMATE.start_main_~A~0#1| (+ .cse73 .cse79)))))) .cse31)))) .cse26)) (.cse53 (= |ULTIMATE.start_main_~A~0#1| (+ (* (+ (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~B~0#1|) (+ (+ |ULTIMATE.start_main_~r~0#1| (- (* 2 |ULTIMATE.start_main_~d~0#1|))) .cse51)))) (.cse57 (or .cse14 (let ((.cse76 (+ .cse43 .cse78))) (and (or .cse27 .cse28 (= |ULTIMATE.start_main_~A~0#1| (+ .cse75 .cse76))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse77 .cse76)) .cse31))))) (.cse60 (or .cse14 (let ((.cse74 (- .cse19))) (let ((.cse64 (+ .cse36 .cse74)) (.cse68 (+ .cse36 (+ (- 1) .cse74)))) (and (or .cse27 (and (or .cse18 (and (or .cse62 (= |ULTIMATE.start_main_~A~0#1| (+ .cse63 .cse64))) (or .cse65 .cse66 (= |ULTIMATE.start_main_~A~0#1| (+ .cse67 .cse64))))) (or .cse15 (and (or .cse65 (= |ULTIMATE.start_main_~A~0#1| (+ .cse67 .cse68)) .cse66) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse63 .cse68)) .cse62)) .cse16)) .cse28) (or .cse31 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse69 .cse64)) .cse70 .cse71) (or .cse72 (= |ULTIMATE.start_main_~A~0#1| (+ .cse73 .cse64)))) .cse18) (or (and (or .cse70 .cse71 (= |ULTIMATE.start_main_~A~0#1| (+ .cse69 .cse68))) (or .cse72 (= |ULTIMATE.start_main_~A~0#1| (+ .cse73 .cse68)))) .cse15 .cse16))))))))) (or (and .cse52 .cse0 .cse53 .cse54) (and .cse55 .cse56 .cse52 .cse0 .cse53 .cse57 .cse58 .cse59 .cse3 .cse60 (= |ULTIMATE.start_main_~r~0#1| (+ (+ |ULTIMATE.start_main_~A~0#1| (* |ULTIMATE.start_main_~B~0#1| (- 2))) .cse61)) (= (+ |ULTIMATE.start_main_~q~0#1| (- 2)) 1)) (and .cse55 .cse56 .cse52 .cse0 .cse53 .cse57 .cse58 .cse59 .cse60 .cse54)))))) (or (let ((.cse45 (= 1 |ULTIMATE.start_main_~p~0#1|))) (and (or .cse27 .cse34 (and (or .cse14 (and (or .cse15 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse17 .cse35) .cse36)) .cse16) (or .cse18 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse19 .cse35) .cse36))))) (or .cse20 (and (or .cse24 .cse25 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse23 .cse35) .cse37))) (or .cse21 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse22 .cse35) .cse37)))) .cse26)) .cse28 .cse29) (or .cse38 .cse30 (and (or .cse20 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse23 .cse39) .cse37)) .cse24 .cse25) (or .cse21 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse22 .cse39) .cse37)))) .cse26) (or .cse14 (and (or .cse18 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse19 .cse39) .cse36))) (or .cse15 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse17 .cse39) .cse36)) .cse16)))) .cse31) .cse40 (or (and (or .cse20 .cse26 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse41 .cse42) .cse43))) (or .cse14 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse44 .cse42) .cse43)))) .cse45 .cse46) (or .cse45 .cse47 .cse46) .cse48)) (and (= (+ .cse49 .cse7) 0) .cse40 .cse2 .cse50 (= |ULTIMATE.start_main_~r~0#1| (+ (+ |ULTIMATE.start_main_~A~0#1| (- 2)) .cse51)))))) (.cse33 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))) (or (let ((.cse1 (+ |ULTIMATE.start_main_~A~0#1| (* |ULTIMATE.start_main_~r~0#1| (- 1))))) (and .cse0 (= .cse1 (* 2 |ULTIMATE.start_main_~B~0#1|)) .cse2 .cse3 (let ((.cse6 (= 0 (mod (+ |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) 2))) (.cse4 (div (+ |ULTIMATE.start_main_~A~0#1| (- |ULTIMATE.start_main_~r~0#1|)) 2)) (.cse5 (< .cse1 0))) (or (and (= |ULTIMATE.start_main_~d~0#1| .cse4) (or (not .cse5) .cse6)) (and (not .cse6) (= |ULTIMATE.start_main_~d~0#1| (+ 1 .cse4)) .cse5))) (= (+ |ULTIMATE.start_main_~q~0#1| .cse7) 0))) (and .cse8 .cse2 .cse9 .cse10 .cse11 .cse3) (and .cse2 .cse10 .cse12 .cse3) (and .cse13 (or (and (or .cse14 (and (or .cse15 .cse16 (= |ULTIMATE.start_main_~B~0#1| .cse17)) (or .cse18 (= |ULTIMATE.start_main_~B~0#1| .cse19)))) (or .cse20 (and (or .cse21 (= |ULTIMATE.start_main_~B~0#1| .cse22)) (or (= |ULTIMATE.start_main_~B~0#1| .cse23) .cse24 .cse25)) .cse26)) (and (or .cse27 .cse28 .cse29) (or .cse30 .cse31))) .cse32 .cse33) (and .cse2 .cse10 .cse11 .cse3) (and .cse2 .cse10 .cse3 .cse32) (and .cse13 .cse12 .cse33)))))))))) [2023-02-17 07:33:33,595 INFO L899 garLoopResultBuilder]: For program point L46(lines 44 56) no Hoare annotation was computed. [2023-02-17 07:33:33,595 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-17 07:33:33,598 INFO L895 garLoopResultBuilder]: At program point L34-2(lines 34 42) the Hoare annotation is: (let ((.cse56 (div |ULTIMATE.start_main_~d~0#1| 2)) (.cse61 (div |ULTIMATE.start_main_~p~0#1| 2))) (let ((.cse60 (+ 1 .cse61)) (.cse220 (- .cse56))) (let ((.cse226 (+ (- 1) .cse220)) (.cse150 (+ |ULTIMATE.start_main_~q~0#1| .cse60)) (.cse115 (+ |ULTIMATE.start_main_~q~0#1| .cse61)) (.cse230 (mod |ULTIMATE.start_main_~d~0#1| 2)) (.cse189 (+ .cse61 1))) (let ((.cse175 (div .cse189 2)) (.cse172 (div |ULTIMATE.start_main_~p~0#1| 4)) (.cse181 (+ .cse56 1)) (.cse141 (= 1 |ULTIMATE.start_main_~p~0#1|)) (.cse165 (- |ULTIMATE.start_main_~d~0#1|)) (.cse57 (= 0 .cse230)) (.cse236 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse44 (= 0 (mod |ULTIMATE.start_main_~p~0#1| 2))) (.cse113 (+ |ULTIMATE.start_main_~r~0#1| .cse220)) (.cse235 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse238 (* .cse115 |ULTIMATE.start_main_~B~0#1|)) (.cse237 (* .cse150 |ULTIMATE.start_main_~B~0#1|)) (.cse99 (+ |ULTIMATE.start_main_~r~0#1| .cse226))) (let ((.cse32 (= 1 .cse61)) (.cse45 (= 1 .cse60)) (.cse145 (= |ULTIMATE.start_main_~A~0#1| (+ .cse237 .cse99))) (.cse142 (= |ULTIMATE.start_main_~A~0#1| (+ .cse238 .cse99))) (.cse59 (not .cse235)) (.cse143 (= |ULTIMATE.start_main_~A~0#1| (+ .cse238 .cse113))) (.cse43 (and .cse236 (not .cse44))) (.cse144 (= |ULTIMATE.start_main_~A~0#1| (+ .cse237 .cse113))) (.cse51 (not .cse236)) (.cse54 (and .cse235 (not .cse57))) (.cse148 (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~p~0#1|)) (.cse110 (+ |ULTIMATE.start_main_~r~0#1| .cse165)) (.cse2 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse30 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse229 (not .cse141)) (.cse171 (div |ULTIMATE.start_main_~d~0#1| 4)) (.cse168 (div .cse181 2)) (.cse173 (+ 1 .cse172)) (.cse233 (< .cse61 0)) (.cse40 (= 0 (mod .cse61 2))) (.cse58 (+ 1 .cse56)) (.cse46 (= 0 (mod .cse189 2))) (.cse234 (< .cse60 0)) (.cse174 (+ 1 .cse175))) (let ((.cse64 (= 1 .cse174)) (.cse47 (not .cse234)) (.cse75 (= 1 .cse175)) (.cse50 (and .cse234 (not .cse46))) (.cse63 (= 0 (mod .cse181 2))) (.cse227 (< .cse58 0)) (.cse36 (= 0 (mod .cse56 2))) (.cse228 (< .cse56 0)) (.cse176 (* 2 |ULTIMATE.start_main_~d~0#1|)) (.cse164 (* 2 |ULTIMATE.start_main_~p~0#1|)) (.cse39 (and .cse233 (not .cse40))) (.cse87 (= 1 .cse172)) (.cse42 (not .cse233)) (.cse98 (= 1 .cse173)) (.cse157 (- .cse168)) (.cse52 (- .cse171)) (.cse231 (div .cse165 (- 2))) (.cse17 (or .cse30 .cse229)) (.cse0 (or .cse2 (= (+ |ULTIMATE.start_main_~A~0#1| (* (- 1) |ULTIMATE.start_main_~r~0#1|)) 0))) (.cse16 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse148 |ULTIMATE.start_main_~B~0#1|) .cse110))) (.cse1 (= 0 |ULTIMATE.start_main_~q~0#1|)) (.cse209 (or (and (or .cse143 .cse43) (or .cse44 .cse144 .cse51)) .cse54)) (.cse205 (or (and (or .cse44 .cse145 .cse51) (or .cse142 .cse43)) .cse57 .cse59)) (.cse3 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse4 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse5 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse6 (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|))) (.cse224 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse58 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)) .cse57 .cse59) (or .cse54 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse56 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))))) (.cse221 (and (or .cse43 (not .cse32)) (or .cse44 (not .cse45) .cse51)))) (let ((.cse190 (* 2 1)) (.cse191 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse192 (let ((.cse232 (or .cse224 .cse221))) (or (and .cse0 .cse16 .cse17 .cse232 .cse1 .cse2 .cse209 .cse205 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse16 .cse232 .cse1 .cse30 .cse2 .cse209 .cse205 .cse3 .cse4 .cse5 .cse6)))) (.cse193 (<= 2 .cse231)) (.cse194 (>= |ULTIMATE.start_main_~r~0#1| .cse231)) (.cse196 (= .cse230 0)) (.cse20 (or (and (or .cse57 (= |ULTIMATE.start_main_~B~0#1| .cse58) .cse59) (or .cse54 (= |ULTIMATE.start_main_~B~0#1| .cse56))) .cse221)) (.cse23 (or .cse229 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))) (.cse53 (+ (- 1) .cse52)) (.cse158 (+ (- 1) .cse157)) (.cse199 (and (or .cse39 (not .cse87)) (or .cse40 .cse42 (not .cse98)))) (.cse136 (+ |ULTIMATE.start_main_~q~0#1| .cse164)) (.cse137 (+ |ULTIMATE.start_main_~r~0#1| (- .cse176))) (.cse33 (not .cse228)) (.cse170 (+ 1 .cse171)) (.cse37 (and (not .cse36) .cse228)) (.cse62 (not .cse227)) (.cse169 (+ 1 .cse168)) (.cse81 (and (not .cse63) .cse227)) (.cse198 (and (or .cse46 (not .cse64) .cse47) (or (not .cse75) .cse50)))) (let ((.cse18 (let ((.cse211 (* (+ .cse150 .cse175) |ULTIMATE.start_main_~B~0#1|)) (.cse213 (* (+ .cse150 .cse174) |ULTIMATE.start_main_~B~0#1|)) (.cse215 (* (+ .cse115 .cse173) |ULTIMATE.start_main_~B~0#1|)) (.cse216 (* (+ .cse115 .cse172) |ULTIMATE.start_main_~B~0#1|)) (.cse217 (* (+ .cse148 .cse60) |ULTIMATE.start_main_~B~0#1|)) (.cse219 (* (+ .cse148 .cse61) |ULTIMATE.start_main_~B~0#1|))) (let ((.cse200 (or (let ((.cse225 (+ .cse110 .cse226))) (and (or .cse44 (= |ULTIMATE.start_main_~A~0#1| (+ .cse217 .cse225)) .cse51) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse219 .cse225)) .cse43))) .cse57 .cse59)) (.cse201 (or .cse44 .cse45 (and (or .cse54 (and (or .cse33 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse170 .cse150) .cse113)) .cse36) (or .cse37 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse171 .cse150) .cse113))))) (or .cse57 (and (or .cse62 .cse63 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse169 .cse150) .cse99))) (or .cse81 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse168 .cse150) .cse99)))) .cse59)) .cse51 .cse198)) (.cse202 (= |ULTIMATE.start_main_~A~0#1| (+ (* (+ .cse136 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~B~0#1|) (+ .cse137 .cse165)))) (.cse203 (or .cse32 .cse199 (and (or .cse57 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse169 .cse115) .cse99)) .cse62 .cse63) (or .cse81 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse168 .cse115) .cse99)))) .cse59) (or .cse54 (and (or .cse37 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse171 .cse115) .cse113))) (or .cse33 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse170 .cse115) .cse113)) .cse36)))) .cse43)) (.cse204 (or .cse141 .cse224 .cse221)) (.cse206 (or .cse57 (let ((.cse223 (+ .cse99 .cse158)) (.cse222 (+ .cse99 .cse157))) (and (or .cse44 (and (or .cse81 (and (or .cse50 (= |ULTIMATE.start_main_~A~0#1| (+ .cse211 .cse222))) (or .cse46 (= |ULTIMATE.start_main_~A~0#1| (+ .cse213 .cse222)) .cse47))) (or .cse62 .cse63 (and (or .cse50 (= |ULTIMATE.start_main_~A~0#1| (+ .cse211 .cse223))) (or .cse46 (= |ULTIMATE.start_main_~A~0#1| (+ .cse213 .cse223)) .cse47)))) .cse51) (or (and (or (and (or .cse39 (= |ULTIMATE.start_main_~A~0#1| (+ .cse216 .cse223))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse215 .cse223)) .cse40 .cse42)) .cse62 .cse63) (or .cse81 (and (or .cse40 .cse42 (= |ULTIMATE.start_main_~A~0#1| (+ .cse215 .cse222))) (or .cse39 (= |ULTIMATE.start_main_~A~0#1| (+ .cse216 .cse222)))))) .cse43))) .cse59)) (.cse207 (or (and (or .cse57 .cse59 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse58 .cse148) .cse110))) (or .cse54 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse56 .cse148) .cse110)))) .cse141 .cse221)) (.cse208 (or .cse54 (let ((.cse218 (+ .cse110 .cse220))) (and (or .cse44 .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse217 .cse218))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse219 .cse218)) .cse43))))) (.cse210 (or .cse54 (let ((.cse212 (+ .cse113 .cse52)) (.cse214 (+ .cse113 .cse53))) (and (or .cse44 (and (or .cse37 (and (or .cse50 (= |ULTIMATE.start_main_~A~0#1| (+ .cse211 .cse212))) (or .cse46 .cse47 (= |ULTIMATE.start_main_~A~0#1| (+ .cse213 .cse212))))) (or .cse33 (and (or .cse46 (= |ULTIMATE.start_main_~A~0#1| (+ .cse213 .cse214)) .cse47) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse211 .cse214)) .cse50)) .cse36)) .cse51) (or .cse43 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse215 .cse212)) .cse40 .cse42) (or .cse39 (= |ULTIMATE.start_main_~A~0#1| (+ .cse216 .cse212)))) .cse37) (or (and (or .cse40 .cse42 (= |ULTIMATE.start_main_~A~0#1| (+ .cse215 .cse214))) (or .cse39 (= |ULTIMATE.start_main_~A~0#1| (+ .cse216 .cse214)))) .cse33 .cse36)))))))) (or (and .cse200 .cse201 .cse192 .cse193 .cse194 .cse202 .cse203 .cse204 .cse30 .cse205 .cse196 .cse5 .cse206 .cse16 .cse20 .cse207 .cse208 .cse209 .cse23 .cse210) (and .cse200 .cse201 .cse192 .cse193 .cse194 .cse202 .cse203 .cse204 .cse205 .cse196 .cse5 .cse206 .cse16 .cse17 .cse20 .cse207 .cse208 .cse209 .cse23 .cse210))))) (.cse197 (* 2 .cse191)) (.cse11 (or (and (or .cse54 (and (or .cse33 .cse36 (= |ULTIMATE.start_main_~B~0#1| .cse170)) (or .cse37 (= |ULTIMATE.start_main_~B~0#1| .cse171)))) (or .cse57 (and (or .cse81 (= |ULTIMATE.start_main_~B~0#1| .cse168)) (or (= |ULTIMATE.start_main_~B~0#1| .cse169) .cse62 .cse63)) .cse59)) (and (or .cse44 .cse51 .cse198) (or .cse199 .cse43)))) (.cse195 (* 2 .cse190))) (or (and .cse0 .cse1 (= |ULTIMATE.start_main_~p~0#1| 1) .cse2 (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|) .cse3 .cse4 (<= 1 |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~d~0#1| 1) .cse5 .cse6) (and .cse2 (let ((.cse186 (+ .cse171 1)) (.cse183 (+ .cse168 1)) (.cse180 (+ .cse172 1)) (.cse188 (+ .cse175 1))) (let ((.cse152 (div .cse188 2)) (.cse153 (div .cse189 4)) (.cse121 (div .cse180 2)) (.cse88 (= 0 (mod .cse172 2))) (.cse117 (div |ULTIMATE.start_main_~p~0#1| 8)) (.cse182 (< .cse168 0)) (.cse85 (= 0 (mod .cse168 2))) (.cse69 (= 0 (mod .cse183 2))) (.cse184 (< .cse169 0)) (.cse185 (< .cse171 0)) (.cse129 (= 0 (mod .cse171 2))) (.cse187 (< .cse170 0)) (.cse123 (= 0 (mod .cse186 2)))) (let ((.cse140 (div .cse164 4)) (.cse177 (< .cse175 0)) (.cse76 (= 0 (mod .cse175 2))) (.cse72 (= 0 (mod .cse188 2))) (.cse178 (< .cse174 0)) (.cse125 (and .cse187 (not .cse123))) (.cse124 (not .cse187)) (.cse134 (div .cse186 2)) (.cse128 (and .cse185 (not .cse129))) (.cse135 (div |ULTIMATE.start_main_~d~0#1| 8)) (.cse131 (not .cse185)) (.cse66 (not .cse184)) (.cse71 (and .cse184 (not .cse69))) (.cse103 (div .cse183 2)) (.cse83 (and .cse182 (not .cse85))) (.cse84 (not .cse182)) (.cse27 (* |ULTIMATE.start_main_~B~0#1| 1)) (.cse102 (div .cse181 4)) (.cse116 (+ 1 .cse117)) (.cse119 (< .cse172 0)) (.cse118 (not .cse88)) (.cse96 (= 0 (mod .cse180 2))) (.cse179 (< .cse173 0)) (.cse120 (+ 1 .cse121)) (.cse154 (+ 1 .cse153)) (.cse151 (+ 1 .cse152))) (let ((.cse67 (* (+ .cse150 .cse151) |ULTIMATE.start_main_~B~0#1|)) (.cse73 (* (+ .cse150 .cse152) |ULTIMATE.start_main_~B~0#1|)) (.cse80 (* (+ .cse150 .cse153) |ULTIMATE.start_main_~B~0#1|)) (.cse78 (* (+ .cse150 .cse154) |ULTIMATE.start_main_~B~0#1|)) (.cse97 (* (+ .cse115 .cse120) |ULTIMATE.start_main_~B~0#1|)) (.cse95 (not .cse179)) (.cse93 (* (+ .cse115 .cse121) |ULTIMATE.start_main_~B~0#1|)) (.cse94 (and (not .cse96) .cse179)) (.cse91 (* (+ .cse115 .cse117) |ULTIMATE.start_main_~B~0#1|)) (.cse92 (and .cse119 .cse118)) (.cse89 (* (+ .cse115 .cse116) |ULTIMATE.start_main_~B~0#1|)) (.cse90 (not .cse119)) (.cse114 (and (or .cse62 .cse63 (and (or (not (= .cse27 (+ 1 .cse103))) .cse66 .cse69) (or .cse71 (not (= .cse27 .cse103))))) (or .cse81 (and (or (not (= .cse27 .cse102)) .cse83) (or .cse84 (not (= .cse27 (+ 1 .cse102))) .cse85))))) (.cse111 (and (or (and (or .cse125 (not (= .cse27 .cse134))) (or .cse123 .cse124 (not (= .cse27 (+ 1 .cse134))))) .cse33 .cse36) (or .cse37 (and (or .cse128 (not (= .cse27 .cse135))) (or .cse129 (not (= .cse27 (+ 1 .cse135))) .cse131))))) (.cse65 (not .cse178)) (.cse74 (and .cse178 (not .cse72))) (.cse79 (and .cse177 (not .cse76))) (.cse77 (not .cse177)) (.cse41 (* (+ |ULTIMATE.start_main_~q~0#1| .cse173) |ULTIMATE.start_main_~B~0#1|)) (.cse34 (* (+ |ULTIMATE.start_main_~q~0#1| .cse172) |ULTIMATE.start_main_~B~0#1|)) (.cse49 (* (+ |ULTIMATE.start_main_~q~0#1| .cse175) |ULTIMATE.start_main_~B~0#1|)) (.cse48 (* (+ |ULTIMATE.start_main_~q~0#1| .cse174) |ULTIMATE.start_main_~B~0#1|)) (.cse139 (+ 1 .cse140)) (.cse138 (div .cse176 4)) (.cse28 (+ |ULTIMATE.start_main_~q~0#1| (* 2 .cse164))) (.cse29 (+ |ULTIMATE.start_main_~r~0#1| (- (* 2 .cse176)))) (.cse107 (* (+ .cse148 .cse173) |ULTIMATE.start_main_~B~0#1|)) (.cse104 (* (+ .cse148 .cse172) |ULTIMATE.start_main_~B~0#1|)) (.cse108 (* (+ .cse148 .cse175) |ULTIMATE.start_main_~B~0#1|)) (.cse109 (* (+ .cse148 .cse174) |ULTIMATE.start_main_~B~0#1|)) (.cse55 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse27 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse146 (and (or (and (or .cse39 (not (<= 1 .cse172))) (or .cse40 .cse42 (not (<= 1 .cse173)))) .cse43) (or .cse44 .cse51 (and (or (not (<= 1 .cse174)) .cse46 .cse47) (or .cse50 (not (<= 1 .cse175))))))) (.cse147 (and (or .cse57 (and (or .cse81 (not (= .cse27 .cse168))) (or .cse62 .cse63 (not (= .cse27 .cse169)))) .cse59) (or .cse54 (and (or .cse33 (not (= .cse27 .cse170)) .cse36) (or .cse37 (not (= .cse27 .cse171)))))))) (let ((.cse8 (or .cse55 .cse146 .cse147)) (.cse10 (or (let ((.cse167 (+ .cse110 .cse157)) (.cse166 (+ .cse110 .cse158))) (and (or .cse32 (and (or .cse40 (and (or .cse62 (= |ULTIMATE.start_main_~A~0#1| (+ .cse107 .cse166)) .cse63) (or .cse81 (= |ULTIMATE.start_main_~A~0#1| (+ .cse107 .cse167)))) .cse42) (or (and (or .cse62 .cse63 (= |ULTIMATE.start_main_~A~0#1| (+ .cse104 .cse166))) (or .cse81 (= |ULTIMATE.start_main_~A~0#1| (+ .cse104 .cse167)))) .cse39)) .cse43) (or .cse44 (and (or .cse50 (and (or .cse81 (= |ULTIMATE.start_main_~A~0#1| (+ .cse108 .cse167))) (or .cse62 (= |ULTIMATE.start_main_~A~0#1| (+ .cse108 .cse166)) .cse63))) (or .cse46 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse109 .cse167)) .cse81) (or .cse62 (= |ULTIMATE.start_main_~A~0#1| (+ .cse109 .cse166)) .cse63)) .cse47)) .cse45 .cse51))) .cse57 .cse59)) (.cse22 (or (= 1 .cse164) (= |ULTIMATE.start_main_~A~0#1| (+ (* (+ .cse28 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~B~0#1|) (+ .cse29 .cse165))))) (.cse24 (or (let ((.cse163 (- .cse138))) (let ((.cse161 (+ .cse137 (+ (- 1) .cse163))) (.cse160 (+ .cse137 .cse163))) (and (or .cse43 (let ((.cse159 (* (+ .cse136 .cse140) |ULTIMATE.start_main_~B~0#1|))) (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse159 .cse160)) .cse54) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse159 .cse161)) .cse57 .cse59)))) (or .cse44 (let ((.cse162 (* (+ .cse136 .cse139) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse57 (= |ULTIMATE.start_main_~A~0#1| (+ .cse162 .cse161)) .cse59) (or .cse54 (= |ULTIMATE.start_main_~A~0#1| (+ .cse162 .cse160))))) .cse51)))) .cse141)) (.cse25 (or .cse57 (let ((.cse156 (+ |ULTIMATE.start_main_~r~0#1| .cse158)) (.cse155 (+ |ULTIMATE.start_main_~r~0#1| .cse157))) (and (or .cse32 (and (or .cse40 (and (or .cse81 (= |ULTIMATE.start_main_~A~0#1| (+ .cse41 .cse155))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse41 .cse156)) .cse62 .cse63)) .cse42) (or .cse39 (and (or .cse81 (= |ULTIMATE.start_main_~A~0#1| (+ .cse34 .cse155))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse34 .cse156)) .cse62 .cse63)))) .cse43) (or .cse44 (and (or .cse50 (and (or .cse81 (= |ULTIMATE.start_main_~A~0#1| (+ .cse49 .cse155))) (or .cse62 (= |ULTIMATE.start_main_~A~0#1| (+ .cse49 .cse156)) .cse63))) (or .cse46 (and (or .cse62 .cse63 (= |ULTIMATE.start_main_~A~0#1| (+ .cse48 .cse156))) (or .cse81 (= |ULTIMATE.start_main_~A~0#1| (+ .cse48 .cse155)))) .cse47)) .cse45 .cse51))) .cse59)) (.cse7 (or .cse44 (let ((.cse149 (* .cse27 .cse150))) (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse149 .cse99)) .cse57 .cse114 .cse59) (or .cse111 .cse54 (= |ULTIMATE.start_main_~A~0#1| (+ .cse149 .cse113))))) .cse51 (and (or .cse46 .cse47 (and (or (not (<= 1 .cse151)) .cse65 .cse72) (or (not (<= 1 .cse152)) .cse74))) (or .cse50 (and (or .cse79 (not (<= 1 .cse153))) (or (not (<= 1 .cse154)) .cse76 .cse77)))))) (.cse9 (or .cse146 .cse147 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse27 .cse148) .cse110)))) (.cse12 (or .cse141 (and (or (and (or .cse142 .cse57 .cse59) (or .cse143 .cse54)) .cse43) (or .cse44 (and (or .cse144 .cse54) (or .cse145 .cse57 .cse59)) .cse51)))) (.cse13 (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse27 .cse136) .cse137)) (and (or .cse54 (not (= .cse27 .cse138))) (or .cse57 .cse59 (not (= .cse27 (+ 1 .cse138))))) (and (or .cse44 .cse51 (not (<= 1 .cse139))) (or (not (<= 1 .cse140)) .cse43)))) (.cse14 (or .cse54 (let ((.cse132 (- .cse135)) (.cse133 (- .cse134))) (let ((.cse122 (+ .cse113 (+ (- 1) .cse133))) (.cse126 (+ .cse113 .cse133)) (.cse130 (+ .cse113 (+ (- 1) .cse132))) (.cse127 (+ .cse113 .cse132))) (and (or (and (or .cse33 (and (or .cse46 .cse64 .cse47 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse73 .cse122)) .cse123 .cse124) (or .cse125 (= |ULTIMATE.start_main_~A~0#1| (+ .cse73 .cse126)))) .cse74) (or (and (or .cse123 (= |ULTIMATE.start_main_~A~0#1| (+ .cse67 .cse122)) .cse124) (or .cse125 (= |ULTIMATE.start_main_~A~0#1| (+ .cse67 .cse126)))) .cse65 .cse72))) (or .cse75 .cse50 (and (or .cse76 .cse77 (and (or .cse125 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse126))) (or .cse123 .cse124 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse122))))) (or (and (or .cse123 (= |ULTIMATE.start_main_~A~0#1| (+ .cse80 .cse122)) .cse124) (or .cse125 (= |ULTIMATE.start_main_~A~0#1| (+ .cse80 .cse126)))) .cse79)))) .cse36) (or .cse37 (and (or (and (or .cse65 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse67 .cse127)) .cse128) (or .cse129 (= |ULTIMATE.start_main_~A~0#1| (+ .cse67 .cse130)) .cse131)) .cse72) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse73 .cse127)) .cse128) (or .cse129 (= |ULTIMATE.start_main_~A~0#1| (+ .cse73 .cse130)) .cse131)) .cse74)) .cse46 .cse64 .cse47) (or .cse75 .cse50 (and (or (and (or .cse129 (= |ULTIMATE.start_main_~A~0#1| (+ .cse80 .cse130)) .cse131) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse80 .cse127)) .cse128)) .cse79) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse127)) .cse128) (or .cse129 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse130)) .cse131)) .cse76 .cse77)))))) .cse44 .cse51) (or (and (or (and (or .cse87 .cse39 (and (or (and (or .cse125 (= |ULTIMATE.start_main_~A~0#1| (+ .cse91 .cse126))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse91 .cse122)) .cse123 .cse124)) .cse92) (or .cse88 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse89 .cse122)) .cse123 .cse124) (or .cse125 (= |ULTIMATE.start_main_~A~0#1| (+ .cse89 .cse126)))) .cse90))) (or .cse40 .cse42 (and (or .cse95 .cse96 (and (or .cse123 .cse124 (= |ULTIMATE.start_main_~A~0#1| (+ .cse97 .cse122))) (or .cse125 (= |ULTIMATE.start_main_~A~0#1| (+ .cse97 .cse126))))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse93 .cse122)) .cse123 .cse124) (or .cse125 (= |ULTIMATE.start_main_~A~0#1| (+ .cse93 .cse126)))) .cse94)) .cse98)) .cse33 .cse36) (or .cse37 (and (or .cse40 (and (or (and (or .cse129 (= |ULTIMATE.start_main_~A~0#1| (+ .cse97 .cse130)) .cse131) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse97 .cse127)) .cse128)) .cse95 .cse96) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse93 .cse130)) .cse129 .cse131) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse93 .cse127)) .cse128)) .cse94)) .cse42 .cse98) (or .cse87 .cse39 (and (or (and (or .cse129 (= |ULTIMATE.start_main_~A~0#1| (+ .cse91 .cse130)) .cse131) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse91 .cse127)) .cse128)) .cse92) (or .cse88 (and (or .cse129 .cse131 (= |ULTIMATE.start_main_~A~0#1| (+ .cse89 .cse130))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse89 .cse127)) .cse128)) .cse90)))))) .cse43)))))) (.cse15 (or (let ((.cse112 (* .cse27 .cse115))) (and (or .cse111 (= |ULTIMATE.start_main_~A~0#1| (+ .cse112 .cse113)) .cse54) (or .cse57 (= |ULTIMATE.start_main_~A~0#1| (+ .cse112 .cse99)) .cse114 .cse59))) .cse43 (and (or .cse39 (and (or .cse88 (not (<= 1 .cse116)) .cse90) (or (not (<= 1 .cse117)) (and .cse118 .cse119)))) (or .cse40 .cse42 (and (or (not (<= 1 .cse120)) .cse96 .cse95) (or (not (<= 1 .cse121)) .cse94)))))) (.cse19 (or .cse54 (let ((.cse105 (+ .cse110 .cse52)) (.cse106 (+ .cse110 .cse53))) (and (or .cse32 .cse43 (and (or .cse39 (and (or .cse37 (= |ULTIMATE.start_main_~A~0#1| (+ .cse104 .cse105))) (or .cse33 (= |ULTIMATE.start_main_~A~0#1| (+ .cse104 .cse106)) .cse36))) (or (and (or .cse33 .cse36 (= |ULTIMATE.start_main_~A~0#1| (+ .cse107 .cse106))) (or .cse37 (= |ULTIMATE.start_main_~A~0#1| (+ .cse107 .cse105)))) .cse40 .cse42))) (or .cse44 (and (or .cse50 (and (or .cse37 (= |ULTIMATE.start_main_~A~0#1| (+ .cse108 .cse105))) (or .cse33 (= |ULTIMATE.start_main_~A~0#1| (+ .cse108 .cse106)) .cse36))) (or .cse46 (and (or .cse37 (= |ULTIMATE.start_main_~A~0#1| (+ .cse109 .cse105))) (or .cse33 (= |ULTIMATE.start_main_~A~0#1| (+ .cse109 .cse106)) .cse36)) .cse47)) .cse45 .cse51))))) (.cse21 (or .cse57 (let ((.cse100 (- .cse103)) (.cse101 (- .cse102))) (let ((.cse86 (+ .cse99 (+ (- 1) .cse101))) (.cse82 (+ .cse99 .cse101)) (.cse70 (+ .cse99 .cse100)) (.cse68 (+ .cse99 (+ (- 1) .cse100)))) (and (or (and (or .cse62 .cse63 (and (or .cse46 .cse64 .cse47 (and (or .cse65 (and (or .cse66 (= |ULTIMATE.start_main_~A~0#1| (+ .cse67 .cse68)) .cse69) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse67 .cse70)) .cse71)) .cse72) (or (and (or .cse66 (= |ULTIMATE.start_main_~A~0#1| (+ .cse73 .cse68)) .cse69) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse73 .cse70)) .cse71)) .cse74))) (or .cse75 .cse50 (and (or .cse76 .cse77 (and (or .cse66 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse68)) .cse69) (or .cse71 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse70))))) (or .cse79 (and (or .cse66 (= |ULTIMATE.start_main_~A~0#1| (+ .cse80 .cse68)) .cse69) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse80 .cse70)) .cse71))))))) (or .cse81 (and (or .cse75 .cse50 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse80 .cse82)) .cse83) (or .cse84 .cse85 (= |ULTIMATE.start_main_~A~0#1| (+ .cse80 .cse86)))) .cse79) (or .cse76 (and (or .cse84 .cse85 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse86))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse82)) .cse83)) .cse77))) (or .cse46 .cse64 .cse47 (and (or .cse65 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse67 .cse82)) .cse83) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse67 .cse86)) .cse84 .cse85)) .cse72) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse73 .cse82)) .cse83) (or .cse84 .cse85 (= |ULTIMATE.start_main_~A~0#1| (+ .cse73 .cse86)))) .cse74)))))) .cse44 .cse51) (or (and (or .cse81 (and (or .cse87 .cse39 (and (or .cse88 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse89 .cse86)) .cse84 .cse85) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse89 .cse82)) .cse83)) .cse90) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse91 .cse82)) .cse83) (or .cse84 .cse85 (= |ULTIMATE.start_main_~A~0#1| (+ .cse91 .cse86)))) .cse92))) (or (and (or (and (or .cse83 (= |ULTIMATE.start_main_~A~0#1| (+ .cse93 .cse82))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse93 .cse86)) .cse84 .cse85)) .cse94) (or .cse95 .cse96 (and (or .cse84 .cse85 (= |ULTIMATE.start_main_~A~0#1| (+ .cse97 .cse86))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse97 .cse82)) .cse83)))) .cse40 .cse42 .cse98))) (or .cse62 .cse63 (and (or (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse91 .cse70)) .cse71) (or .cse66 (= |ULTIMATE.start_main_~A~0#1| (+ .cse91 .cse68)) .cse69)) .cse92) (or (and (or .cse66 (= |ULTIMATE.start_main_~A~0#1| (+ .cse89 .cse68)) .cse69) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse89 .cse70)) .cse71)) .cse88 .cse90)) .cse87 .cse39) (or .cse40 (and (or (and (or .cse71 (= |ULTIMATE.start_main_~A~0#1| (+ .cse93 .cse70))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse93 .cse68)) .cse66 .cse69)) .cse94) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse97 .cse70)) .cse71) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse97 .cse68)) .cse66 .cse69)) .cse95 .cse96)) .cse42 .cse98)))) .cse43)))) .cse59)) (.cse31 (or .cse55 (and (or (not (= .cse27 .cse56)) .cse54) (or .cse57 (not (= .cse27 .cse58)) .cse59)) (and (or (not (<= 1 .cse60)) .cse44 .cse51) (or (not (<= 1 .cse61)) .cse43)))) (.cse26 (or (let ((.cse35 (+ |ULTIMATE.start_main_~r~0#1| .cse53)) (.cse38 (+ |ULTIMATE.start_main_~r~0#1| .cse52))) (and (or .cse32 (and (or (and (or .cse33 (= |ULTIMATE.start_main_~A~0#1| (+ .cse34 .cse35)) .cse36) (or .cse37 (= |ULTIMATE.start_main_~A~0#1| (+ .cse34 .cse38)))) .cse39) (or .cse40 (and (or .cse37 (= |ULTIMATE.start_main_~A~0#1| (+ .cse41 .cse38))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse41 .cse35)) .cse33 .cse36)) .cse42)) .cse43) (or .cse44 .cse45 (and (or .cse46 .cse47 (and (or .cse37 (= |ULTIMATE.start_main_~A~0#1| (+ .cse48 .cse38))) (or .cse33 .cse36 (= |ULTIMATE.start_main_~A~0#1| (+ .cse48 .cse35))))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse49 .cse35)) .cse33 .cse36) (or .cse37 (= |ULTIMATE.start_main_~A~0#1| (+ .cse49 .cse38)))) .cse50)) .cse51))) .cse54))) (or (and .cse7 .cse8 .cse9 .cse10 .cse2 .cse11 .cse4 .cse12 .cse13 .cse14 .cse15 .cse5 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse6 .cse26) (and .cse8 .cse10 .cse11 (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse27 .cse28) .cse29)) (not (= .cse27 |ULTIMATE.start_main_~d~0#1|)) (not (<= 1 |ULTIMATE.start_main_~p~0#1|))) .cse16 .cse18 .cse22 .cse24 .cse25 .cse7 .cse30 .cse9 .cse2 .cse4 .cse12 .cse13 .cse14 .cse15 .cse5 .cse19 .cse20 .cse21 .cse23 .cse6 .cse31 .cse26) (and .cse8 .cse10 .cse11 .cse16 .cse17 .cse18 .cse22 .cse24 .cse25 .cse7 .cse9 .cse2 .cse4 .cse12 .cse13 .cse14 .cse15 .cse5 .cse19 .cse20 .cse21 .cse23 .cse6 .cse31 .cse26))))))) .cse4 .cse5 .cse6) (and (= |ULTIMATE.start_main_~d~0#1| .cse190) (<= 2 |ULTIMATE.start_main_~d~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_main_~p~0#1| .cse190) .cse5 .cse6 (= |ULTIMATE.start_main_~d~0#1| .cse191)) (and .cse192 .cse193 .cse194 .cse2 .cse3 .cse4 (= |ULTIMATE.start_main_~d~0#1| .cse195) .cse196 .cse5 (= |ULTIMATE.start_main_~p~0#1| .cse195) (= |ULTIMATE.start_main_~d~0#1| .cse197) .cse20 .cse23 .cse6) (and .cse18 .cse20 .cse2 (= |ULTIMATE.start_main_~d~0#1| (* 2 .cse197)) .cse11 .cse23 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_main_~p~0#1| (* 2 .cse195)))))))))))) [2023-02-17 07:33:33,598 INFO L899 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2023-02-17 07:33:33,600 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse56 (div |ULTIMATE.start_main_~d~0#1| 2)) (.cse61 (div |ULTIMATE.start_main_~p~0#1| 2))) (let ((.cse60 (+ 1 .cse61)) (.cse220 (- .cse56))) (let ((.cse226 (+ (- 1) .cse220)) (.cse150 (+ |ULTIMATE.start_main_~q~0#1| .cse60)) (.cse115 (+ |ULTIMATE.start_main_~q~0#1| .cse61)) (.cse230 (mod |ULTIMATE.start_main_~d~0#1| 2)) (.cse189 (+ .cse61 1))) (let ((.cse175 (div .cse189 2)) (.cse172 (div |ULTIMATE.start_main_~p~0#1| 4)) (.cse181 (+ .cse56 1)) (.cse141 (= 1 |ULTIMATE.start_main_~p~0#1|)) (.cse165 (- |ULTIMATE.start_main_~d~0#1|)) (.cse57 (= 0 .cse230)) (.cse236 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse44 (= 0 (mod |ULTIMATE.start_main_~p~0#1| 2))) (.cse113 (+ |ULTIMATE.start_main_~r~0#1| .cse220)) (.cse235 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse238 (* .cse115 |ULTIMATE.start_main_~B~0#1|)) (.cse237 (* .cse150 |ULTIMATE.start_main_~B~0#1|)) (.cse99 (+ |ULTIMATE.start_main_~r~0#1| .cse226))) (let ((.cse32 (= 1 .cse61)) (.cse45 (= 1 .cse60)) (.cse145 (= |ULTIMATE.start_main_~A~0#1| (+ .cse237 .cse99))) (.cse142 (= |ULTIMATE.start_main_~A~0#1| (+ .cse238 .cse99))) (.cse59 (not .cse235)) (.cse143 (= |ULTIMATE.start_main_~A~0#1| (+ .cse238 .cse113))) (.cse43 (and .cse236 (not .cse44))) (.cse144 (= |ULTIMATE.start_main_~A~0#1| (+ .cse237 .cse113))) (.cse51 (not .cse236)) (.cse54 (and .cse235 (not .cse57))) (.cse148 (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~p~0#1|)) (.cse110 (+ |ULTIMATE.start_main_~r~0#1| .cse165)) (.cse2 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse30 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse229 (not .cse141)) (.cse171 (div |ULTIMATE.start_main_~d~0#1| 4)) (.cse168 (div .cse181 2)) (.cse173 (+ 1 .cse172)) (.cse233 (< .cse61 0)) (.cse40 (= 0 (mod .cse61 2))) (.cse58 (+ 1 .cse56)) (.cse46 (= 0 (mod .cse189 2))) (.cse234 (< .cse60 0)) (.cse174 (+ 1 .cse175))) (let ((.cse64 (= 1 .cse174)) (.cse47 (not .cse234)) (.cse75 (= 1 .cse175)) (.cse50 (and .cse234 (not .cse46))) (.cse63 (= 0 (mod .cse181 2))) (.cse227 (< .cse58 0)) (.cse36 (= 0 (mod .cse56 2))) (.cse228 (< .cse56 0)) (.cse176 (* 2 |ULTIMATE.start_main_~d~0#1|)) (.cse164 (* 2 |ULTIMATE.start_main_~p~0#1|)) (.cse39 (and .cse233 (not .cse40))) (.cse87 (= 1 .cse172)) (.cse42 (not .cse233)) (.cse98 (= 1 .cse173)) (.cse157 (- .cse168)) (.cse52 (- .cse171)) (.cse231 (div .cse165 (- 2))) (.cse17 (or .cse30 .cse229)) (.cse0 (or .cse2 (= (+ |ULTIMATE.start_main_~A~0#1| (* (- 1) |ULTIMATE.start_main_~r~0#1|)) 0))) (.cse16 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse148 |ULTIMATE.start_main_~B~0#1|) .cse110))) (.cse1 (= 0 |ULTIMATE.start_main_~q~0#1|)) (.cse209 (or (and (or .cse143 .cse43) (or .cse44 .cse144 .cse51)) .cse54)) (.cse205 (or (and (or .cse44 .cse145 .cse51) (or .cse142 .cse43)) .cse57 .cse59)) (.cse3 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse4 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse5 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse6 (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|))) (.cse224 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse58 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)) .cse57 .cse59) (or .cse54 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse56 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))))) (.cse221 (and (or .cse43 (not .cse32)) (or .cse44 (not .cse45) .cse51)))) (let ((.cse190 (* 2 1)) (.cse191 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse192 (let ((.cse232 (or .cse224 .cse221))) (or (and .cse0 .cse16 .cse17 .cse232 .cse1 .cse2 .cse209 .cse205 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse16 .cse232 .cse1 .cse30 .cse2 .cse209 .cse205 .cse3 .cse4 .cse5 .cse6)))) (.cse193 (<= 2 .cse231)) (.cse194 (>= |ULTIMATE.start_main_~r~0#1| .cse231)) (.cse196 (= .cse230 0)) (.cse20 (or (and (or .cse57 (= |ULTIMATE.start_main_~B~0#1| .cse58) .cse59) (or .cse54 (= |ULTIMATE.start_main_~B~0#1| .cse56))) .cse221)) (.cse23 (or .cse229 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))) (.cse53 (+ (- 1) .cse52)) (.cse158 (+ (- 1) .cse157)) (.cse199 (and (or .cse39 (not .cse87)) (or .cse40 .cse42 (not .cse98)))) (.cse136 (+ |ULTIMATE.start_main_~q~0#1| .cse164)) (.cse137 (+ |ULTIMATE.start_main_~r~0#1| (- .cse176))) (.cse33 (not .cse228)) (.cse170 (+ 1 .cse171)) (.cse37 (and (not .cse36) .cse228)) (.cse62 (not .cse227)) (.cse169 (+ 1 .cse168)) (.cse81 (and (not .cse63) .cse227)) (.cse198 (and (or .cse46 (not .cse64) .cse47) (or (not .cse75) .cse50)))) (let ((.cse18 (let ((.cse211 (* (+ .cse150 .cse175) |ULTIMATE.start_main_~B~0#1|)) (.cse213 (* (+ .cse150 .cse174) |ULTIMATE.start_main_~B~0#1|)) (.cse215 (* (+ .cse115 .cse173) |ULTIMATE.start_main_~B~0#1|)) (.cse216 (* (+ .cse115 .cse172) |ULTIMATE.start_main_~B~0#1|)) (.cse217 (* (+ .cse148 .cse60) |ULTIMATE.start_main_~B~0#1|)) (.cse219 (* (+ .cse148 .cse61) |ULTIMATE.start_main_~B~0#1|))) (let ((.cse200 (or (let ((.cse225 (+ .cse110 .cse226))) (and (or .cse44 (= |ULTIMATE.start_main_~A~0#1| (+ .cse217 .cse225)) .cse51) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse219 .cse225)) .cse43))) .cse57 .cse59)) (.cse201 (or .cse44 .cse45 (and (or .cse54 (and (or .cse33 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse170 .cse150) .cse113)) .cse36) (or .cse37 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse171 .cse150) .cse113))))) (or .cse57 (and (or .cse62 .cse63 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse169 .cse150) .cse99))) (or .cse81 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse168 .cse150) .cse99)))) .cse59)) .cse51 .cse198)) (.cse202 (= |ULTIMATE.start_main_~A~0#1| (+ (* (+ .cse136 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~B~0#1|) (+ .cse137 .cse165)))) (.cse203 (or .cse32 .cse199 (and (or .cse57 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse169 .cse115) .cse99)) .cse62 .cse63) (or .cse81 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse168 .cse115) .cse99)))) .cse59) (or .cse54 (and (or .cse37 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse171 .cse115) .cse113))) (or .cse33 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse170 .cse115) .cse113)) .cse36)))) .cse43)) (.cse204 (or .cse141 .cse224 .cse221)) (.cse206 (or .cse57 (let ((.cse223 (+ .cse99 .cse158)) (.cse222 (+ .cse99 .cse157))) (and (or .cse44 (and (or .cse81 (and (or .cse50 (= |ULTIMATE.start_main_~A~0#1| (+ .cse211 .cse222))) (or .cse46 (= |ULTIMATE.start_main_~A~0#1| (+ .cse213 .cse222)) .cse47))) (or .cse62 .cse63 (and (or .cse50 (= |ULTIMATE.start_main_~A~0#1| (+ .cse211 .cse223))) (or .cse46 (= |ULTIMATE.start_main_~A~0#1| (+ .cse213 .cse223)) .cse47)))) .cse51) (or (and (or (and (or .cse39 (= |ULTIMATE.start_main_~A~0#1| (+ .cse216 .cse223))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse215 .cse223)) .cse40 .cse42)) .cse62 .cse63) (or .cse81 (and (or .cse40 .cse42 (= |ULTIMATE.start_main_~A~0#1| (+ .cse215 .cse222))) (or .cse39 (= |ULTIMATE.start_main_~A~0#1| (+ .cse216 .cse222)))))) .cse43))) .cse59)) (.cse207 (or (and (or .cse57 .cse59 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse58 .cse148) .cse110))) (or .cse54 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse56 .cse148) .cse110)))) .cse141 .cse221)) (.cse208 (or .cse54 (let ((.cse218 (+ .cse110 .cse220))) (and (or .cse44 .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse217 .cse218))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse219 .cse218)) .cse43))))) (.cse210 (or .cse54 (let ((.cse212 (+ .cse113 .cse52)) (.cse214 (+ .cse113 .cse53))) (and (or .cse44 (and (or .cse37 (and (or .cse50 (= |ULTIMATE.start_main_~A~0#1| (+ .cse211 .cse212))) (or .cse46 .cse47 (= |ULTIMATE.start_main_~A~0#1| (+ .cse213 .cse212))))) (or .cse33 (and (or .cse46 (= |ULTIMATE.start_main_~A~0#1| (+ .cse213 .cse214)) .cse47) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse211 .cse214)) .cse50)) .cse36)) .cse51) (or .cse43 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse215 .cse212)) .cse40 .cse42) (or .cse39 (= |ULTIMATE.start_main_~A~0#1| (+ .cse216 .cse212)))) .cse37) (or (and (or .cse40 .cse42 (= |ULTIMATE.start_main_~A~0#1| (+ .cse215 .cse214))) (or .cse39 (= |ULTIMATE.start_main_~A~0#1| (+ .cse216 .cse214)))) .cse33 .cse36)))))))) (or (and .cse200 .cse201 .cse192 .cse193 .cse194 .cse202 .cse203 .cse204 .cse30 .cse205 .cse196 .cse5 .cse206 .cse16 .cse20 .cse207 .cse208 .cse209 .cse23 .cse210) (and .cse200 .cse201 .cse192 .cse193 .cse194 .cse202 .cse203 .cse204 .cse205 .cse196 .cse5 .cse206 .cse16 .cse17 .cse20 .cse207 .cse208 .cse209 .cse23 .cse210))))) (.cse197 (* 2 .cse191)) (.cse11 (or (and (or .cse54 (and (or .cse33 .cse36 (= |ULTIMATE.start_main_~B~0#1| .cse170)) (or .cse37 (= |ULTIMATE.start_main_~B~0#1| .cse171)))) (or .cse57 (and (or .cse81 (= |ULTIMATE.start_main_~B~0#1| .cse168)) (or (= |ULTIMATE.start_main_~B~0#1| .cse169) .cse62 .cse63)) .cse59)) (and (or .cse44 .cse51 .cse198) (or .cse199 .cse43)))) (.cse195 (* 2 .cse190))) (or (and .cse0 .cse1 (= |ULTIMATE.start_main_~p~0#1| 1) .cse2 (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|) .cse3 .cse4 (<= 1 |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~d~0#1| 1) .cse5 .cse6) (and .cse2 (let ((.cse186 (+ .cse171 1)) (.cse183 (+ .cse168 1)) (.cse180 (+ .cse172 1)) (.cse188 (+ .cse175 1))) (let ((.cse152 (div .cse188 2)) (.cse153 (div .cse189 4)) (.cse121 (div .cse180 2)) (.cse88 (= 0 (mod .cse172 2))) (.cse117 (div |ULTIMATE.start_main_~p~0#1| 8)) (.cse182 (< .cse168 0)) (.cse85 (= 0 (mod .cse168 2))) (.cse69 (= 0 (mod .cse183 2))) (.cse184 (< .cse169 0)) (.cse185 (< .cse171 0)) (.cse129 (= 0 (mod .cse171 2))) (.cse187 (< .cse170 0)) (.cse123 (= 0 (mod .cse186 2)))) (let ((.cse140 (div .cse164 4)) (.cse177 (< .cse175 0)) (.cse76 (= 0 (mod .cse175 2))) (.cse72 (= 0 (mod .cse188 2))) (.cse178 (< .cse174 0)) (.cse125 (and .cse187 (not .cse123))) (.cse124 (not .cse187)) (.cse134 (div .cse186 2)) (.cse128 (and .cse185 (not .cse129))) (.cse135 (div |ULTIMATE.start_main_~d~0#1| 8)) (.cse131 (not .cse185)) (.cse66 (not .cse184)) (.cse71 (and .cse184 (not .cse69))) (.cse103 (div .cse183 2)) (.cse83 (and .cse182 (not .cse85))) (.cse84 (not .cse182)) (.cse27 (* |ULTIMATE.start_main_~B~0#1| 1)) (.cse102 (div .cse181 4)) (.cse116 (+ 1 .cse117)) (.cse119 (< .cse172 0)) (.cse118 (not .cse88)) (.cse96 (= 0 (mod .cse180 2))) (.cse179 (< .cse173 0)) (.cse120 (+ 1 .cse121)) (.cse154 (+ 1 .cse153)) (.cse151 (+ 1 .cse152))) (let ((.cse67 (* (+ .cse150 .cse151) |ULTIMATE.start_main_~B~0#1|)) (.cse73 (* (+ .cse150 .cse152) |ULTIMATE.start_main_~B~0#1|)) (.cse80 (* (+ .cse150 .cse153) |ULTIMATE.start_main_~B~0#1|)) (.cse78 (* (+ .cse150 .cse154) |ULTIMATE.start_main_~B~0#1|)) (.cse97 (* (+ .cse115 .cse120) |ULTIMATE.start_main_~B~0#1|)) (.cse95 (not .cse179)) (.cse93 (* (+ .cse115 .cse121) |ULTIMATE.start_main_~B~0#1|)) (.cse94 (and (not .cse96) .cse179)) (.cse91 (* (+ .cse115 .cse117) |ULTIMATE.start_main_~B~0#1|)) (.cse92 (and .cse119 .cse118)) (.cse89 (* (+ .cse115 .cse116) |ULTIMATE.start_main_~B~0#1|)) (.cse90 (not .cse119)) (.cse114 (and (or .cse62 .cse63 (and (or (not (= .cse27 (+ 1 .cse103))) .cse66 .cse69) (or .cse71 (not (= .cse27 .cse103))))) (or .cse81 (and (or (not (= .cse27 .cse102)) .cse83) (or .cse84 (not (= .cse27 (+ 1 .cse102))) .cse85))))) (.cse111 (and (or (and (or .cse125 (not (= .cse27 .cse134))) (or .cse123 .cse124 (not (= .cse27 (+ 1 .cse134))))) .cse33 .cse36) (or .cse37 (and (or .cse128 (not (= .cse27 .cse135))) (or .cse129 (not (= .cse27 (+ 1 .cse135))) .cse131))))) (.cse65 (not .cse178)) (.cse74 (and .cse178 (not .cse72))) (.cse79 (and .cse177 (not .cse76))) (.cse77 (not .cse177)) (.cse41 (* (+ |ULTIMATE.start_main_~q~0#1| .cse173) |ULTIMATE.start_main_~B~0#1|)) (.cse34 (* (+ |ULTIMATE.start_main_~q~0#1| .cse172) |ULTIMATE.start_main_~B~0#1|)) (.cse49 (* (+ |ULTIMATE.start_main_~q~0#1| .cse175) |ULTIMATE.start_main_~B~0#1|)) (.cse48 (* (+ |ULTIMATE.start_main_~q~0#1| .cse174) |ULTIMATE.start_main_~B~0#1|)) (.cse139 (+ 1 .cse140)) (.cse138 (div .cse176 4)) (.cse28 (+ |ULTIMATE.start_main_~q~0#1| (* 2 .cse164))) (.cse29 (+ |ULTIMATE.start_main_~r~0#1| (- (* 2 .cse176)))) (.cse107 (* (+ .cse148 .cse173) |ULTIMATE.start_main_~B~0#1|)) (.cse104 (* (+ .cse148 .cse172) |ULTIMATE.start_main_~B~0#1|)) (.cse108 (* (+ .cse148 .cse175) |ULTIMATE.start_main_~B~0#1|)) (.cse109 (* (+ .cse148 .cse174) |ULTIMATE.start_main_~B~0#1|)) (.cse55 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse27 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse146 (and (or (and (or .cse39 (not (<= 1 .cse172))) (or .cse40 .cse42 (not (<= 1 .cse173)))) .cse43) (or .cse44 .cse51 (and (or (not (<= 1 .cse174)) .cse46 .cse47) (or .cse50 (not (<= 1 .cse175))))))) (.cse147 (and (or .cse57 (and (or .cse81 (not (= .cse27 .cse168))) (or .cse62 .cse63 (not (= .cse27 .cse169)))) .cse59) (or .cse54 (and (or .cse33 (not (= .cse27 .cse170)) .cse36) (or .cse37 (not (= .cse27 .cse171)))))))) (let ((.cse8 (or .cse55 .cse146 .cse147)) (.cse10 (or (let ((.cse167 (+ .cse110 .cse157)) (.cse166 (+ .cse110 .cse158))) (and (or .cse32 (and (or .cse40 (and (or .cse62 (= |ULTIMATE.start_main_~A~0#1| (+ .cse107 .cse166)) .cse63) (or .cse81 (= |ULTIMATE.start_main_~A~0#1| (+ .cse107 .cse167)))) .cse42) (or (and (or .cse62 .cse63 (= |ULTIMATE.start_main_~A~0#1| (+ .cse104 .cse166))) (or .cse81 (= |ULTIMATE.start_main_~A~0#1| (+ .cse104 .cse167)))) .cse39)) .cse43) (or .cse44 (and (or .cse50 (and (or .cse81 (= |ULTIMATE.start_main_~A~0#1| (+ .cse108 .cse167))) (or .cse62 (= |ULTIMATE.start_main_~A~0#1| (+ .cse108 .cse166)) .cse63))) (or .cse46 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse109 .cse167)) .cse81) (or .cse62 (= |ULTIMATE.start_main_~A~0#1| (+ .cse109 .cse166)) .cse63)) .cse47)) .cse45 .cse51))) .cse57 .cse59)) (.cse22 (or (= 1 .cse164) (= |ULTIMATE.start_main_~A~0#1| (+ (* (+ .cse28 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~B~0#1|) (+ .cse29 .cse165))))) (.cse24 (or (let ((.cse163 (- .cse138))) (let ((.cse161 (+ .cse137 (+ (- 1) .cse163))) (.cse160 (+ .cse137 .cse163))) (and (or .cse43 (let ((.cse159 (* (+ .cse136 .cse140) |ULTIMATE.start_main_~B~0#1|))) (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse159 .cse160)) .cse54) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse159 .cse161)) .cse57 .cse59)))) (or .cse44 (let ((.cse162 (* (+ .cse136 .cse139) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse57 (= |ULTIMATE.start_main_~A~0#1| (+ .cse162 .cse161)) .cse59) (or .cse54 (= |ULTIMATE.start_main_~A~0#1| (+ .cse162 .cse160))))) .cse51)))) .cse141)) (.cse25 (or .cse57 (let ((.cse156 (+ |ULTIMATE.start_main_~r~0#1| .cse158)) (.cse155 (+ |ULTIMATE.start_main_~r~0#1| .cse157))) (and (or .cse32 (and (or .cse40 (and (or .cse81 (= |ULTIMATE.start_main_~A~0#1| (+ .cse41 .cse155))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse41 .cse156)) .cse62 .cse63)) .cse42) (or .cse39 (and (or .cse81 (= |ULTIMATE.start_main_~A~0#1| (+ .cse34 .cse155))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse34 .cse156)) .cse62 .cse63)))) .cse43) (or .cse44 (and (or .cse50 (and (or .cse81 (= |ULTIMATE.start_main_~A~0#1| (+ .cse49 .cse155))) (or .cse62 (= |ULTIMATE.start_main_~A~0#1| (+ .cse49 .cse156)) .cse63))) (or .cse46 (and (or .cse62 .cse63 (= |ULTIMATE.start_main_~A~0#1| (+ .cse48 .cse156))) (or .cse81 (= |ULTIMATE.start_main_~A~0#1| (+ .cse48 .cse155)))) .cse47)) .cse45 .cse51))) .cse59)) (.cse7 (or .cse44 (let ((.cse149 (* .cse27 .cse150))) (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse149 .cse99)) .cse57 .cse114 .cse59) (or .cse111 .cse54 (= |ULTIMATE.start_main_~A~0#1| (+ .cse149 .cse113))))) .cse51 (and (or .cse46 .cse47 (and (or (not (<= 1 .cse151)) .cse65 .cse72) (or (not (<= 1 .cse152)) .cse74))) (or .cse50 (and (or .cse79 (not (<= 1 .cse153))) (or (not (<= 1 .cse154)) .cse76 .cse77)))))) (.cse9 (or .cse146 .cse147 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse27 .cse148) .cse110)))) (.cse12 (or .cse141 (and (or (and (or .cse142 .cse57 .cse59) (or .cse143 .cse54)) .cse43) (or .cse44 (and (or .cse144 .cse54) (or .cse145 .cse57 .cse59)) .cse51)))) (.cse13 (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse27 .cse136) .cse137)) (and (or .cse54 (not (= .cse27 .cse138))) (or .cse57 .cse59 (not (= .cse27 (+ 1 .cse138))))) (and (or .cse44 .cse51 (not (<= 1 .cse139))) (or (not (<= 1 .cse140)) .cse43)))) (.cse14 (or .cse54 (let ((.cse132 (- .cse135)) (.cse133 (- .cse134))) (let ((.cse122 (+ .cse113 (+ (- 1) .cse133))) (.cse126 (+ .cse113 .cse133)) (.cse130 (+ .cse113 (+ (- 1) .cse132))) (.cse127 (+ .cse113 .cse132))) (and (or (and (or .cse33 (and (or .cse46 .cse64 .cse47 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse73 .cse122)) .cse123 .cse124) (or .cse125 (= |ULTIMATE.start_main_~A~0#1| (+ .cse73 .cse126)))) .cse74) (or (and (or .cse123 (= |ULTIMATE.start_main_~A~0#1| (+ .cse67 .cse122)) .cse124) (or .cse125 (= |ULTIMATE.start_main_~A~0#1| (+ .cse67 .cse126)))) .cse65 .cse72))) (or .cse75 .cse50 (and (or .cse76 .cse77 (and (or .cse125 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse126))) (or .cse123 .cse124 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse122))))) (or (and (or .cse123 (= |ULTIMATE.start_main_~A~0#1| (+ .cse80 .cse122)) .cse124) (or .cse125 (= |ULTIMATE.start_main_~A~0#1| (+ .cse80 .cse126)))) .cse79)))) .cse36) (or .cse37 (and (or (and (or .cse65 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse67 .cse127)) .cse128) (or .cse129 (= |ULTIMATE.start_main_~A~0#1| (+ .cse67 .cse130)) .cse131)) .cse72) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse73 .cse127)) .cse128) (or .cse129 (= |ULTIMATE.start_main_~A~0#1| (+ .cse73 .cse130)) .cse131)) .cse74)) .cse46 .cse64 .cse47) (or .cse75 .cse50 (and (or (and (or .cse129 (= |ULTIMATE.start_main_~A~0#1| (+ .cse80 .cse130)) .cse131) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse80 .cse127)) .cse128)) .cse79) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse127)) .cse128) (or .cse129 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse130)) .cse131)) .cse76 .cse77)))))) .cse44 .cse51) (or (and (or (and (or .cse87 .cse39 (and (or (and (or .cse125 (= |ULTIMATE.start_main_~A~0#1| (+ .cse91 .cse126))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse91 .cse122)) .cse123 .cse124)) .cse92) (or .cse88 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse89 .cse122)) .cse123 .cse124) (or .cse125 (= |ULTIMATE.start_main_~A~0#1| (+ .cse89 .cse126)))) .cse90))) (or .cse40 .cse42 (and (or .cse95 .cse96 (and (or .cse123 .cse124 (= |ULTIMATE.start_main_~A~0#1| (+ .cse97 .cse122))) (or .cse125 (= |ULTIMATE.start_main_~A~0#1| (+ .cse97 .cse126))))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse93 .cse122)) .cse123 .cse124) (or .cse125 (= |ULTIMATE.start_main_~A~0#1| (+ .cse93 .cse126)))) .cse94)) .cse98)) .cse33 .cse36) (or .cse37 (and (or .cse40 (and (or (and (or .cse129 (= |ULTIMATE.start_main_~A~0#1| (+ .cse97 .cse130)) .cse131) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse97 .cse127)) .cse128)) .cse95 .cse96) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse93 .cse130)) .cse129 .cse131) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse93 .cse127)) .cse128)) .cse94)) .cse42 .cse98) (or .cse87 .cse39 (and (or (and (or .cse129 (= |ULTIMATE.start_main_~A~0#1| (+ .cse91 .cse130)) .cse131) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse91 .cse127)) .cse128)) .cse92) (or .cse88 (and (or .cse129 .cse131 (= |ULTIMATE.start_main_~A~0#1| (+ .cse89 .cse130))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse89 .cse127)) .cse128)) .cse90)))))) .cse43)))))) (.cse15 (or (let ((.cse112 (* .cse27 .cse115))) (and (or .cse111 (= |ULTIMATE.start_main_~A~0#1| (+ .cse112 .cse113)) .cse54) (or .cse57 (= |ULTIMATE.start_main_~A~0#1| (+ .cse112 .cse99)) .cse114 .cse59))) .cse43 (and (or .cse39 (and (or .cse88 (not (<= 1 .cse116)) .cse90) (or (not (<= 1 .cse117)) (and .cse118 .cse119)))) (or .cse40 .cse42 (and (or (not (<= 1 .cse120)) .cse96 .cse95) (or (not (<= 1 .cse121)) .cse94)))))) (.cse19 (or .cse54 (let ((.cse105 (+ .cse110 .cse52)) (.cse106 (+ .cse110 .cse53))) (and (or .cse32 .cse43 (and (or .cse39 (and (or .cse37 (= |ULTIMATE.start_main_~A~0#1| (+ .cse104 .cse105))) (or .cse33 (= |ULTIMATE.start_main_~A~0#1| (+ .cse104 .cse106)) .cse36))) (or (and (or .cse33 .cse36 (= |ULTIMATE.start_main_~A~0#1| (+ .cse107 .cse106))) (or .cse37 (= |ULTIMATE.start_main_~A~0#1| (+ .cse107 .cse105)))) .cse40 .cse42))) (or .cse44 (and (or .cse50 (and (or .cse37 (= |ULTIMATE.start_main_~A~0#1| (+ .cse108 .cse105))) (or .cse33 (= |ULTIMATE.start_main_~A~0#1| (+ .cse108 .cse106)) .cse36))) (or .cse46 (and (or .cse37 (= |ULTIMATE.start_main_~A~0#1| (+ .cse109 .cse105))) (or .cse33 (= |ULTIMATE.start_main_~A~0#1| (+ .cse109 .cse106)) .cse36)) .cse47)) .cse45 .cse51))))) (.cse21 (or .cse57 (let ((.cse100 (- .cse103)) (.cse101 (- .cse102))) (let ((.cse86 (+ .cse99 (+ (- 1) .cse101))) (.cse82 (+ .cse99 .cse101)) (.cse70 (+ .cse99 .cse100)) (.cse68 (+ .cse99 (+ (- 1) .cse100)))) (and (or (and (or .cse62 .cse63 (and (or .cse46 .cse64 .cse47 (and (or .cse65 (and (or .cse66 (= |ULTIMATE.start_main_~A~0#1| (+ .cse67 .cse68)) .cse69) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse67 .cse70)) .cse71)) .cse72) (or (and (or .cse66 (= |ULTIMATE.start_main_~A~0#1| (+ .cse73 .cse68)) .cse69) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse73 .cse70)) .cse71)) .cse74))) (or .cse75 .cse50 (and (or .cse76 .cse77 (and (or .cse66 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse68)) .cse69) (or .cse71 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse70))))) (or .cse79 (and (or .cse66 (= |ULTIMATE.start_main_~A~0#1| (+ .cse80 .cse68)) .cse69) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse80 .cse70)) .cse71))))))) (or .cse81 (and (or .cse75 .cse50 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse80 .cse82)) .cse83) (or .cse84 .cse85 (= |ULTIMATE.start_main_~A~0#1| (+ .cse80 .cse86)))) .cse79) (or .cse76 (and (or .cse84 .cse85 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse86))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse82)) .cse83)) .cse77))) (or .cse46 .cse64 .cse47 (and (or .cse65 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse67 .cse82)) .cse83) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse67 .cse86)) .cse84 .cse85)) .cse72) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse73 .cse82)) .cse83) (or .cse84 .cse85 (= |ULTIMATE.start_main_~A~0#1| (+ .cse73 .cse86)))) .cse74)))))) .cse44 .cse51) (or (and (or .cse81 (and (or .cse87 .cse39 (and (or .cse88 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse89 .cse86)) .cse84 .cse85) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse89 .cse82)) .cse83)) .cse90) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse91 .cse82)) .cse83) (or .cse84 .cse85 (= |ULTIMATE.start_main_~A~0#1| (+ .cse91 .cse86)))) .cse92))) (or (and (or (and (or .cse83 (= |ULTIMATE.start_main_~A~0#1| (+ .cse93 .cse82))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse93 .cse86)) .cse84 .cse85)) .cse94) (or .cse95 .cse96 (and (or .cse84 .cse85 (= |ULTIMATE.start_main_~A~0#1| (+ .cse97 .cse86))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse97 .cse82)) .cse83)))) .cse40 .cse42 .cse98))) (or .cse62 .cse63 (and (or (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse91 .cse70)) .cse71) (or .cse66 (= |ULTIMATE.start_main_~A~0#1| (+ .cse91 .cse68)) .cse69)) .cse92) (or (and (or .cse66 (= |ULTIMATE.start_main_~A~0#1| (+ .cse89 .cse68)) .cse69) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse89 .cse70)) .cse71)) .cse88 .cse90)) .cse87 .cse39) (or .cse40 (and (or (and (or .cse71 (= |ULTIMATE.start_main_~A~0#1| (+ .cse93 .cse70))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse93 .cse68)) .cse66 .cse69)) .cse94) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse97 .cse70)) .cse71) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse97 .cse68)) .cse66 .cse69)) .cse95 .cse96)) .cse42 .cse98)))) .cse43)))) .cse59)) (.cse31 (or .cse55 (and (or (not (= .cse27 .cse56)) .cse54) (or .cse57 (not (= .cse27 .cse58)) .cse59)) (and (or (not (<= 1 .cse60)) .cse44 .cse51) (or (not (<= 1 .cse61)) .cse43)))) (.cse26 (or (let ((.cse35 (+ |ULTIMATE.start_main_~r~0#1| .cse53)) (.cse38 (+ |ULTIMATE.start_main_~r~0#1| .cse52))) (and (or .cse32 (and (or (and (or .cse33 (= |ULTIMATE.start_main_~A~0#1| (+ .cse34 .cse35)) .cse36) (or .cse37 (= |ULTIMATE.start_main_~A~0#1| (+ .cse34 .cse38)))) .cse39) (or .cse40 (and (or .cse37 (= |ULTIMATE.start_main_~A~0#1| (+ .cse41 .cse38))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse41 .cse35)) .cse33 .cse36)) .cse42)) .cse43) (or .cse44 .cse45 (and (or .cse46 .cse47 (and (or .cse37 (= |ULTIMATE.start_main_~A~0#1| (+ .cse48 .cse38))) (or .cse33 .cse36 (= |ULTIMATE.start_main_~A~0#1| (+ .cse48 .cse35))))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse49 .cse35)) .cse33 .cse36) (or .cse37 (= |ULTIMATE.start_main_~A~0#1| (+ .cse49 .cse38)))) .cse50)) .cse51))) .cse54))) (or (and .cse7 .cse8 .cse9 .cse10 .cse2 .cse11 .cse4 .cse12 .cse13 .cse14 .cse15 .cse5 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse6 .cse26) (and .cse8 .cse10 .cse11 (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse27 .cse28) .cse29)) (not (= .cse27 |ULTIMATE.start_main_~d~0#1|)) (not (<= 1 |ULTIMATE.start_main_~p~0#1|))) .cse16 .cse18 .cse22 .cse24 .cse25 .cse7 .cse30 .cse9 .cse2 .cse4 .cse12 .cse13 .cse14 .cse15 .cse5 .cse19 .cse20 .cse21 .cse23 .cse6 .cse31 .cse26) (and .cse8 .cse10 .cse11 .cse16 .cse17 .cse18 .cse22 .cse24 .cse25 .cse7 .cse9 .cse2 .cse4 .cse12 .cse13 .cse14 .cse15 .cse5 .cse19 .cse20 .cse21 .cse23 .cse6 .cse31 .cse26))))))) .cse4 .cse5 .cse6) (and (= |ULTIMATE.start_main_~d~0#1| .cse190) (<= 2 |ULTIMATE.start_main_~d~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_main_~p~0#1| .cse190) .cse5 .cse6 (= |ULTIMATE.start_main_~d~0#1| .cse191)) (and .cse192 .cse193 .cse194 .cse2 .cse3 .cse4 (= |ULTIMATE.start_main_~d~0#1| .cse195) .cse196 .cse5 (= |ULTIMATE.start_main_~p~0#1| .cse195) (= |ULTIMATE.start_main_~d~0#1| .cse197) .cse20 .cse23 .cse6) (and .cse18 .cse20 .cse2 (= |ULTIMATE.start_main_~d~0#1| (* 2 .cse197)) .cse11 .cse23 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_main_~p~0#1| (* 2 .cse195)))))))))))) [2023-02-17 07:33:33,603 INFO L895 garLoopResultBuilder]: At program point L35-1(line 35) the Hoare annotation is: (let ((.cse56 (div |ULTIMATE.start_main_~d~0#1| 2)) (.cse61 (div |ULTIMATE.start_main_~p~0#1| 2))) (let ((.cse60 (+ 1 .cse61)) (.cse220 (- .cse56))) (let ((.cse226 (+ (- 1) .cse220)) (.cse150 (+ |ULTIMATE.start_main_~q~0#1| .cse60)) (.cse115 (+ |ULTIMATE.start_main_~q~0#1| .cse61)) (.cse230 (mod |ULTIMATE.start_main_~d~0#1| 2)) (.cse189 (+ .cse61 1))) (let ((.cse175 (div .cse189 2)) (.cse172 (div |ULTIMATE.start_main_~p~0#1| 4)) (.cse181 (+ .cse56 1)) (.cse141 (= 1 |ULTIMATE.start_main_~p~0#1|)) (.cse165 (- |ULTIMATE.start_main_~d~0#1|)) (.cse57 (= 0 .cse230)) (.cse236 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse44 (= 0 (mod |ULTIMATE.start_main_~p~0#1| 2))) (.cse113 (+ |ULTIMATE.start_main_~r~0#1| .cse220)) (.cse235 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse238 (* .cse115 |ULTIMATE.start_main_~B~0#1|)) (.cse237 (* .cse150 |ULTIMATE.start_main_~B~0#1|)) (.cse99 (+ |ULTIMATE.start_main_~r~0#1| .cse226))) (let ((.cse32 (= 1 .cse61)) (.cse45 (= 1 .cse60)) (.cse145 (= |ULTIMATE.start_main_~A~0#1| (+ .cse237 .cse99))) (.cse142 (= |ULTIMATE.start_main_~A~0#1| (+ .cse238 .cse99))) (.cse59 (not .cse235)) (.cse143 (= |ULTIMATE.start_main_~A~0#1| (+ .cse238 .cse113))) (.cse43 (and .cse236 (not .cse44))) (.cse144 (= |ULTIMATE.start_main_~A~0#1| (+ .cse237 .cse113))) (.cse51 (not .cse236)) (.cse54 (and .cse235 (not .cse57))) (.cse148 (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~p~0#1|)) (.cse110 (+ |ULTIMATE.start_main_~r~0#1| .cse165)) (.cse2 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse30 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse229 (not .cse141)) (.cse171 (div |ULTIMATE.start_main_~d~0#1| 4)) (.cse168 (div .cse181 2)) (.cse173 (+ 1 .cse172)) (.cse233 (< .cse61 0)) (.cse40 (= 0 (mod .cse61 2))) (.cse58 (+ 1 .cse56)) (.cse46 (= 0 (mod .cse189 2))) (.cse234 (< .cse60 0)) (.cse174 (+ 1 .cse175))) (let ((.cse64 (= 1 .cse174)) (.cse47 (not .cse234)) (.cse75 (= 1 .cse175)) (.cse50 (and .cse234 (not .cse46))) (.cse63 (= 0 (mod .cse181 2))) (.cse227 (< .cse58 0)) (.cse36 (= 0 (mod .cse56 2))) (.cse228 (< .cse56 0)) (.cse176 (* 2 |ULTIMATE.start_main_~d~0#1|)) (.cse164 (* 2 |ULTIMATE.start_main_~p~0#1|)) (.cse39 (and .cse233 (not .cse40))) (.cse87 (= 1 .cse172)) (.cse42 (not .cse233)) (.cse98 (= 1 .cse173)) (.cse157 (- .cse168)) (.cse52 (- .cse171)) (.cse231 (div .cse165 (- 2))) (.cse17 (or .cse30 .cse229)) (.cse0 (or .cse2 (= (+ |ULTIMATE.start_main_~A~0#1| (* (- 1) |ULTIMATE.start_main_~r~0#1|)) 0))) (.cse16 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse148 |ULTIMATE.start_main_~B~0#1|) .cse110))) (.cse1 (= 0 |ULTIMATE.start_main_~q~0#1|)) (.cse209 (or (and (or .cse143 .cse43) (or .cse44 .cse144 .cse51)) .cse54)) (.cse205 (or (and (or .cse44 .cse145 .cse51) (or .cse142 .cse43)) .cse57 .cse59)) (.cse3 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse4 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse5 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse6 (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|))) (.cse224 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse58 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)) .cse57 .cse59) (or .cse54 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse56 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))))) (.cse221 (and (or .cse43 (not .cse32)) (or .cse44 (not .cse45) .cse51)))) (let ((.cse190 (* 2 1)) (.cse191 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse192 (let ((.cse232 (or .cse224 .cse221))) (or (and .cse0 .cse16 .cse17 .cse232 .cse1 .cse2 .cse209 .cse205 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse16 .cse232 .cse1 .cse30 .cse2 .cse209 .cse205 .cse3 .cse4 .cse5 .cse6)))) (.cse193 (<= 2 .cse231)) (.cse194 (>= |ULTIMATE.start_main_~r~0#1| .cse231)) (.cse196 (= .cse230 0)) (.cse20 (or (and (or .cse57 (= |ULTIMATE.start_main_~B~0#1| .cse58) .cse59) (or .cse54 (= |ULTIMATE.start_main_~B~0#1| .cse56))) .cse221)) (.cse23 (or .cse229 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))) (.cse53 (+ (- 1) .cse52)) (.cse158 (+ (- 1) .cse157)) (.cse199 (and (or .cse39 (not .cse87)) (or .cse40 .cse42 (not .cse98)))) (.cse136 (+ |ULTIMATE.start_main_~q~0#1| .cse164)) (.cse137 (+ |ULTIMATE.start_main_~r~0#1| (- .cse176))) (.cse33 (not .cse228)) (.cse170 (+ 1 .cse171)) (.cse37 (and (not .cse36) .cse228)) (.cse62 (not .cse227)) (.cse169 (+ 1 .cse168)) (.cse81 (and (not .cse63) .cse227)) (.cse198 (and (or .cse46 (not .cse64) .cse47) (or (not .cse75) .cse50)))) (let ((.cse18 (let ((.cse211 (* (+ .cse150 .cse175) |ULTIMATE.start_main_~B~0#1|)) (.cse213 (* (+ .cse150 .cse174) |ULTIMATE.start_main_~B~0#1|)) (.cse215 (* (+ .cse115 .cse173) |ULTIMATE.start_main_~B~0#1|)) (.cse216 (* (+ .cse115 .cse172) |ULTIMATE.start_main_~B~0#1|)) (.cse217 (* (+ .cse148 .cse60) |ULTIMATE.start_main_~B~0#1|)) (.cse219 (* (+ .cse148 .cse61) |ULTIMATE.start_main_~B~0#1|))) (let ((.cse200 (or (let ((.cse225 (+ .cse110 .cse226))) (and (or .cse44 (= |ULTIMATE.start_main_~A~0#1| (+ .cse217 .cse225)) .cse51) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse219 .cse225)) .cse43))) .cse57 .cse59)) (.cse201 (or .cse44 .cse45 (and (or .cse54 (and (or .cse33 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse170 .cse150) .cse113)) .cse36) (or .cse37 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse171 .cse150) .cse113))))) (or .cse57 (and (or .cse62 .cse63 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse169 .cse150) .cse99))) (or .cse81 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse168 .cse150) .cse99)))) .cse59)) .cse51 .cse198)) (.cse202 (= |ULTIMATE.start_main_~A~0#1| (+ (* (+ .cse136 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~B~0#1|) (+ .cse137 .cse165)))) (.cse203 (or .cse32 .cse199 (and (or .cse57 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse169 .cse115) .cse99)) .cse62 .cse63) (or .cse81 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse168 .cse115) .cse99)))) .cse59) (or .cse54 (and (or .cse37 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse171 .cse115) .cse113))) (or .cse33 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse170 .cse115) .cse113)) .cse36)))) .cse43)) (.cse204 (or .cse141 .cse224 .cse221)) (.cse206 (or .cse57 (let ((.cse223 (+ .cse99 .cse158)) (.cse222 (+ .cse99 .cse157))) (and (or .cse44 (and (or .cse81 (and (or .cse50 (= |ULTIMATE.start_main_~A~0#1| (+ .cse211 .cse222))) (or .cse46 (= |ULTIMATE.start_main_~A~0#1| (+ .cse213 .cse222)) .cse47))) (or .cse62 .cse63 (and (or .cse50 (= |ULTIMATE.start_main_~A~0#1| (+ .cse211 .cse223))) (or .cse46 (= |ULTIMATE.start_main_~A~0#1| (+ .cse213 .cse223)) .cse47)))) .cse51) (or (and (or (and (or .cse39 (= |ULTIMATE.start_main_~A~0#1| (+ .cse216 .cse223))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse215 .cse223)) .cse40 .cse42)) .cse62 .cse63) (or .cse81 (and (or .cse40 .cse42 (= |ULTIMATE.start_main_~A~0#1| (+ .cse215 .cse222))) (or .cse39 (= |ULTIMATE.start_main_~A~0#1| (+ .cse216 .cse222)))))) .cse43))) .cse59)) (.cse207 (or (and (or .cse57 .cse59 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse58 .cse148) .cse110))) (or .cse54 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse56 .cse148) .cse110)))) .cse141 .cse221)) (.cse208 (or .cse54 (let ((.cse218 (+ .cse110 .cse220))) (and (or .cse44 .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse217 .cse218))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse219 .cse218)) .cse43))))) (.cse210 (or .cse54 (let ((.cse212 (+ .cse113 .cse52)) (.cse214 (+ .cse113 .cse53))) (and (or .cse44 (and (or .cse37 (and (or .cse50 (= |ULTIMATE.start_main_~A~0#1| (+ .cse211 .cse212))) (or .cse46 .cse47 (= |ULTIMATE.start_main_~A~0#1| (+ .cse213 .cse212))))) (or .cse33 (and (or .cse46 (= |ULTIMATE.start_main_~A~0#1| (+ .cse213 .cse214)) .cse47) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse211 .cse214)) .cse50)) .cse36)) .cse51) (or .cse43 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse215 .cse212)) .cse40 .cse42) (or .cse39 (= |ULTIMATE.start_main_~A~0#1| (+ .cse216 .cse212)))) .cse37) (or (and (or .cse40 .cse42 (= |ULTIMATE.start_main_~A~0#1| (+ .cse215 .cse214))) (or .cse39 (= |ULTIMATE.start_main_~A~0#1| (+ .cse216 .cse214)))) .cse33 .cse36)))))))) (or (and .cse200 .cse201 .cse192 .cse193 .cse194 .cse202 .cse203 .cse204 .cse30 .cse205 .cse196 .cse5 .cse206 .cse16 .cse20 .cse207 .cse208 .cse209 .cse23 .cse210) (and .cse200 .cse201 .cse192 .cse193 .cse194 .cse202 .cse203 .cse204 .cse205 .cse196 .cse5 .cse206 .cse16 .cse17 .cse20 .cse207 .cse208 .cse209 .cse23 .cse210))))) (.cse197 (* 2 .cse191)) (.cse11 (or (and (or .cse54 (and (or .cse33 .cse36 (= |ULTIMATE.start_main_~B~0#1| .cse170)) (or .cse37 (= |ULTIMATE.start_main_~B~0#1| .cse171)))) (or .cse57 (and (or .cse81 (= |ULTIMATE.start_main_~B~0#1| .cse168)) (or (= |ULTIMATE.start_main_~B~0#1| .cse169) .cse62 .cse63)) .cse59)) (and (or .cse44 .cse51 .cse198) (or .cse199 .cse43)))) (.cse195 (* 2 .cse190))) (or (and .cse0 .cse1 (= |ULTIMATE.start_main_~p~0#1| 1) .cse2 (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|) .cse3 .cse4 (<= 1 |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~d~0#1| 1) .cse5 .cse6) (and .cse2 (let ((.cse186 (+ .cse171 1)) (.cse183 (+ .cse168 1)) (.cse180 (+ .cse172 1)) (.cse188 (+ .cse175 1))) (let ((.cse152 (div .cse188 2)) (.cse153 (div .cse189 4)) (.cse121 (div .cse180 2)) (.cse88 (= 0 (mod .cse172 2))) (.cse117 (div |ULTIMATE.start_main_~p~0#1| 8)) (.cse182 (< .cse168 0)) (.cse85 (= 0 (mod .cse168 2))) (.cse69 (= 0 (mod .cse183 2))) (.cse184 (< .cse169 0)) (.cse185 (< .cse171 0)) (.cse129 (= 0 (mod .cse171 2))) (.cse187 (< .cse170 0)) (.cse123 (= 0 (mod .cse186 2)))) (let ((.cse140 (div .cse164 4)) (.cse177 (< .cse175 0)) (.cse76 (= 0 (mod .cse175 2))) (.cse72 (= 0 (mod .cse188 2))) (.cse178 (< .cse174 0)) (.cse125 (and .cse187 (not .cse123))) (.cse124 (not .cse187)) (.cse134 (div .cse186 2)) (.cse128 (and .cse185 (not .cse129))) (.cse135 (div |ULTIMATE.start_main_~d~0#1| 8)) (.cse131 (not .cse185)) (.cse66 (not .cse184)) (.cse71 (and .cse184 (not .cse69))) (.cse103 (div .cse183 2)) (.cse83 (and .cse182 (not .cse85))) (.cse84 (not .cse182)) (.cse27 (* |ULTIMATE.start_main_~B~0#1| 1)) (.cse102 (div .cse181 4)) (.cse116 (+ 1 .cse117)) (.cse119 (< .cse172 0)) (.cse118 (not .cse88)) (.cse96 (= 0 (mod .cse180 2))) (.cse179 (< .cse173 0)) (.cse120 (+ 1 .cse121)) (.cse154 (+ 1 .cse153)) (.cse151 (+ 1 .cse152))) (let ((.cse67 (* (+ .cse150 .cse151) |ULTIMATE.start_main_~B~0#1|)) (.cse73 (* (+ .cse150 .cse152) |ULTIMATE.start_main_~B~0#1|)) (.cse80 (* (+ .cse150 .cse153) |ULTIMATE.start_main_~B~0#1|)) (.cse78 (* (+ .cse150 .cse154) |ULTIMATE.start_main_~B~0#1|)) (.cse97 (* (+ .cse115 .cse120) |ULTIMATE.start_main_~B~0#1|)) (.cse95 (not .cse179)) (.cse93 (* (+ .cse115 .cse121) |ULTIMATE.start_main_~B~0#1|)) (.cse94 (and (not .cse96) .cse179)) (.cse91 (* (+ .cse115 .cse117) |ULTIMATE.start_main_~B~0#1|)) (.cse92 (and .cse119 .cse118)) (.cse89 (* (+ .cse115 .cse116) |ULTIMATE.start_main_~B~0#1|)) (.cse90 (not .cse119)) (.cse114 (and (or .cse62 .cse63 (and (or (not (= .cse27 (+ 1 .cse103))) .cse66 .cse69) (or .cse71 (not (= .cse27 .cse103))))) (or .cse81 (and (or (not (= .cse27 .cse102)) .cse83) (or .cse84 (not (= .cse27 (+ 1 .cse102))) .cse85))))) (.cse111 (and (or (and (or .cse125 (not (= .cse27 .cse134))) (or .cse123 .cse124 (not (= .cse27 (+ 1 .cse134))))) .cse33 .cse36) (or .cse37 (and (or .cse128 (not (= .cse27 .cse135))) (or .cse129 (not (= .cse27 (+ 1 .cse135))) .cse131))))) (.cse65 (not .cse178)) (.cse74 (and .cse178 (not .cse72))) (.cse79 (and .cse177 (not .cse76))) (.cse77 (not .cse177)) (.cse41 (* (+ |ULTIMATE.start_main_~q~0#1| .cse173) |ULTIMATE.start_main_~B~0#1|)) (.cse34 (* (+ |ULTIMATE.start_main_~q~0#1| .cse172) |ULTIMATE.start_main_~B~0#1|)) (.cse49 (* (+ |ULTIMATE.start_main_~q~0#1| .cse175) |ULTIMATE.start_main_~B~0#1|)) (.cse48 (* (+ |ULTIMATE.start_main_~q~0#1| .cse174) |ULTIMATE.start_main_~B~0#1|)) (.cse139 (+ 1 .cse140)) (.cse138 (div .cse176 4)) (.cse28 (+ |ULTIMATE.start_main_~q~0#1| (* 2 .cse164))) (.cse29 (+ |ULTIMATE.start_main_~r~0#1| (- (* 2 .cse176)))) (.cse107 (* (+ .cse148 .cse173) |ULTIMATE.start_main_~B~0#1|)) (.cse104 (* (+ .cse148 .cse172) |ULTIMATE.start_main_~B~0#1|)) (.cse108 (* (+ .cse148 .cse175) |ULTIMATE.start_main_~B~0#1|)) (.cse109 (* (+ .cse148 .cse174) |ULTIMATE.start_main_~B~0#1|)) (.cse55 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse27 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse146 (and (or (and (or .cse39 (not (<= 1 .cse172))) (or .cse40 .cse42 (not (<= 1 .cse173)))) .cse43) (or .cse44 .cse51 (and (or (not (<= 1 .cse174)) .cse46 .cse47) (or .cse50 (not (<= 1 .cse175))))))) (.cse147 (and (or .cse57 (and (or .cse81 (not (= .cse27 .cse168))) (or .cse62 .cse63 (not (= .cse27 .cse169)))) .cse59) (or .cse54 (and (or .cse33 (not (= .cse27 .cse170)) .cse36) (or .cse37 (not (= .cse27 .cse171)))))))) (let ((.cse8 (or .cse55 .cse146 .cse147)) (.cse10 (or (let ((.cse167 (+ .cse110 .cse157)) (.cse166 (+ .cse110 .cse158))) (and (or .cse32 (and (or .cse40 (and (or .cse62 (= |ULTIMATE.start_main_~A~0#1| (+ .cse107 .cse166)) .cse63) (or .cse81 (= |ULTIMATE.start_main_~A~0#1| (+ .cse107 .cse167)))) .cse42) (or (and (or .cse62 .cse63 (= |ULTIMATE.start_main_~A~0#1| (+ .cse104 .cse166))) (or .cse81 (= |ULTIMATE.start_main_~A~0#1| (+ .cse104 .cse167)))) .cse39)) .cse43) (or .cse44 (and (or .cse50 (and (or .cse81 (= |ULTIMATE.start_main_~A~0#1| (+ .cse108 .cse167))) (or .cse62 (= |ULTIMATE.start_main_~A~0#1| (+ .cse108 .cse166)) .cse63))) (or .cse46 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse109 .cse167)) .cse81) (or .cse62 (= |ULTIMATE.start_main_~A~0#1| (+ .cse109 .cse166)) .cse63)) .cse47)) .cse45 .cse51))) .cse57 .cse59)) (.cse22 (or (= 1 .cse164) (= |ULTIMATE.start_main_~A~0#1| (+ (* (+ .cse28 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~B~0#1|) (+ .cse29 .cse165))))) (.cse24 (or (let ((.cse163 (- .cse138))) (let ((.cse161 (+ .cse137 (+ (- 1) .cse163))) (.cse160 (+ .cse137 .cse163))) (and (or .cse43 (let ((.cse159 (* (+ .cse136 .cse140) |ULTIMATE.start_main_~B~0#1|))) (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse159 .cse160)) .cse54) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse159 .cse161)) .cse57 .cse59)))) (or .cse44 (let ((.cse162 (* (+ .cse136 .cse139) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse57 (= |ULTIMATE.start_main_~A~0#1| (+ .cse162 .cse161)) .cse59) (or .cse54 (= |ULTIMATE.start_main_~A~0#1| (+ .cse162 .cse160))))) .cse51)))) .cse141)) (.cse25 (or .cse57 (let ((.cse156 (+ |ULTIMATE.start_main_~r~0#1| .cse158)) (.cse155 (+ |ULTIMATE.start_main_~r~0#1| .cse157))) (and (or .cse32 (and (or .cse40 (and (or .cse81 (= |ULTIMATE.start_main_~A~0#1| (+ .cse41 .cse155))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse41 .cse156)) .cse62 .cse63)) .cse42) (or .cse39 (and (or .cse81 (= |ULTIMATE.start_main_~A~0#1| (+ .cse34 .cse155))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse34 .cse156)) .cse62 .cse63)))) .cse43) (or .cse44 (and (or .cse50 (and (or .cse81 (= |ULTIMATE.start_main_~A~0#1| (+ .cse49 .cse155))) (or .cse62 (= |ULTIMATE.start_main_~A~0#1| (+ .cse49 .cse156)) .cse63))) (or .cse46 (and (or .cse62 .cse63 (= |ULTIMATE.start_main_~A~0#1| (+ .cse48 .cse156))) (or .cse81 (= |ULTIMATE.start_main_~A~0#1| (+ .cse48 .cse155)))) .cse47)) .cse45 .cse51))) .cse59)) (.cse7 (or .cse44 (let ((.cse149 (* .cse27 .cse150))) (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse149 .cse99)) .cse57 .cse114 .cse59) (or .cse111 .cse54 (= |ULTIMATE.start_main_~A~0#1| (+ .cse149 .cse113))))) .cse51 (and (or .cse46 .cse47 (and (or (not (<= 1 .cse151)) .cse65 .cse72) (or (not (<= 1 .cse152)) .cse74))) (or .cse50 (and (or .cse79 (not (<= 1 .cse153))) (or (not (<= 1 .cse154)) .cse76 .cse77)))))) (.cse9 (or .cse146 .cse147 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse27 .cse148) .cse110)))) (.cse12 (or .cse141 (and (or (and (or .cse142 .cse57 .cse59) (or .cse143 .cse54)) .cse43) (or .cse44 (and (or .cse144 .cse54) (or .cse145 .cse57 .cse59)) .cse51)))) (.cse13 (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse27 .cse136) .cse137)) (and (or .cse54 (not (= .cse27 .cse138))) (or .cse57 .cse59 (not (= .cse27 (+ 1 .cse138))))) (and (or .cse44 .cse51 (not (<= 1 .cse139))) (or (not (<= 1 .cse140)) .cse43)))) (.cse14 (or .cse54 (let ((.cse132 (- .cse135)) (.cse133 (- .cse134))) (let ((.cse122 (+ .cse113 (+ (- 1) .cse133))) (.cse126 (+ .cse113 .cse133)) (.cse130 (+ .cse113 (+ (- 1) .cse132))) (.cse127 (+ .cse113 .cse132))) (and (or (and (or .cse33 (and (or .cse46 .cse64 .cse47 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse73 .cse122)) .cse123 .cse124) (or .cse125 (= |ULTIMATE.start_main_~A~0#1| (+ .cse73 .cse126)))) .cse74) (or (and (or .cse123 (= |ULTIMATE.start_main_~A~0#1| (+ .cse67 .cse122)) .cse124) (or .cse125 (= |ULTIMATE.start_main_~A~0#1| (+ .cse67 .cse126)))) .cse65 .cse72))) (or .cse75 .cse50 (and (or .cse76 .cse77 (and (or .cse125 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse126))) (or .cse123 .cse124 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse122))))) (or (and (or .cse123 (= |ULTIMATE.start_main_~A~0#1| (+ .cse80 .cse122)) .cse124) (or .cse125 (= |ULTIMATE.start_main_~A~0#1| (+ .cse80 .cse126)))) .cse79)))) .cse36) (or .cse37 (and (or (and (or .cse65 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse67 .cse127)) .cse128) (or .cse129 (= |ULTIMATE.start_main_~A~0#1| (+ .cse67 .cse130)) .cse131)) .cse72) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse73 .cse127)) .cse128) (or .cse129 (= |ULTIMATE.start_main_~A~0#1| (+ .cse73 .cse130)) .cse131)) .cse74)) .cse46 .cse64 .cse47) (or .cse75 .cse50 (and (or (and (or .cse129 (= |ULTIMATE.start_main_~A~0#1| (+ .cse80 .cse130)) .cse131) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse80 .cse127)) .cse128)) .cse79) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse127)) .cse128) (or .cse129 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse130)) .cse131)) .cse76 .cse77)))))) .cse44 .cse51) (or (and (or (and (or .cse87 .cse39 (and (or (and (or .cse125 (= |ULTIMATE.start_main_~A~0#1| (+ .cse91 .cse126))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse91 .cse122)) .cse123 .cse124)) .cse92) (or .cse88 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse89 .cse122)) .cse123 .cse124) (or .cse125 (= |ULTIMATE.start_main_~A~0#1| (+ .cse89 .cse126)))) .cse90))) (or .cse40 .cse42 (and (or .cse95 .cse96 (and (or .cse123 .cse124 (= |ULTIMATE.start_main_~A~0#1| (+ .cse97 .cse122))) (or .cse125 (= |ULTIMATE.start_main_~A~0#1| (+ .cse97 .cse126))))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse93 .cse122)) .cse123 .cse124) (or .cse125 (= |ULTIMATE.start_main_~A~0#1| (+ .cse93 .cse126)))) .cse94)) .cse98)) .cse33 .cse36) (or .cse37 (and (or .cse40 (and (or (and (or .cse129 (= |ULTIMATE.start_main_~A~0#1| (+ .cse97 .cse130)) .cse131) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse97 .cse127)) .cse128)) .cse95 .cse96) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse93 .cse130)) .cse129 .cse131) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse93 .cse127)) .cse128)) .cse94)) .cse42 .cse98) (or .cse87 .cse39 (and (or (and (or .cse129 (= |ULTIMATE.start_main_~A~0#1| (+ .cse91 .cse130)) .cse131) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse91 .cse127)) .cse128)) .cse92) (or .cse88 (and (or .cse129 .cse131 (= |ULTIMATE.start_main_~A~0#1| (+ .cse89 .cse130))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse89 .cse127)) .cse128)) .cse90)))))) .cse43)))))) (.cse15 (or (let ((.cse112 (* .cse27 .cse115))) (and (or .cse111 (= |ULTIMATE.start_main_~A~0#1| (+ .cse112 .cse113)) .cse54) (or .cse57 (= |ULTIMATE.start_main_~A~0#1| (+ .cse112 .cse99)) .cse114 .cse59))) .cse43 (and (or .cse39 (and (or .cse88 (not (<= 1 .cse116)) .cse90) (or (not (<= 1 .cse117)) (and .cse118 .cse119)))) (or .cse40 .cse42 (and (or (not (<= 1 .cse120)) .cse96 .cse95) (or (not (<= 1 .cse121)) .cse94)))))) (.cse19 (or .cse54 (let ((.cse105 (+ .cse110 .cse52)) (.cse106 (+ .cse110 .cse53))) (and (or .cse32 .cse43 (and (or .cse39 (and (or .cse37 (= |ULTIMATE.start_main_~A~0#1| (+ .cse104 .cse105))) (or .cse33 (= |ULTIMATE.start_main_~A~0#1| (+ .cse104 .cse106)) .cse36))) (or (and (or .cse33 .cse36 (= |ULTIMATE.start_main_~A~0#1| (+ .cse107 .cse106))) (or .cse37 (= |ULTIMATE.start_main_~A~0#1| (+ .cse107 .cse105)))) .cse40 .cse42))) (or .cse44 (and (or .cse50 (and (or .cse37 (= |ULTIMATE.start_main_~A~0#1| (+ .cse108 .cse105))) (or .cse33 (= |ULTIMATE.start_main_~A~0#1| (+ .cse108 .cse106)) .cse36))) (or .cse46 (and (or .cse37 (= |ULTIMATE.start_main_~A~0#1| (+ .cse109 .cse105))) (or .cse33 (= |ULTIMATE.start_main_~A~0#1| (+ .cse109 .cse106)) .cse36)) .cse47)) .cse45 .cse51))))) (.cse21 (or .cse57 (let ((.cse100 (- .cse103)) (.cse101 (- .cse102))) (let ((.cse86 (+ .cse99 (+ (- 1) .cse101))) (.cse82 (+ .cse99 .cse101)) (.cse70 (+ .cse99 .cse100)) (.cse68 (+ .cse99 (+ (- 1) .cse100)))) (and (or (and (or .cse62 .cse63 (and (or .cse46 .cse64 .cse47 (and (or .cse65 (and (or .cse66 (= |ULTIMATE.start_main_~A~0#1| (+ .cse67 .cse68)) .cse69) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse67 .cse70)) .cse71)) .cse72) (or (and (or .cse66 (= |ULTIMATE.start_main_~A~0#1| (+ .cse73 .cse68)) .cse69) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse73 .cse70)) .cse71)) .cse74))) (or .cse75 .cse50 (and (or .cse76 .cse77 (and (or .cse66 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse68)) .cse69) (or .cse71 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse70))))) (or .cse79 (and (or .cse66 (= |ULTIMATE.start_main_~A~0#1| (+ .cse80 .cse68)) .cse69) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse80 .cse70)) .cse71))))))) (or .cse81 (and (or .cse75 .cse50 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse80 .cse82)) .cse83) (or .cse84 .cse85 (= |ULTIMATE.start_main_~A~0#1| (+ .cse80 .cse86)))) .cse79) (or .cse76 (and (or .cse84 .cse85 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse86))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse82)) .cse83)) .cse77))) (or .cse46 .cse64 .cse47 (and (or .cse65 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse67 .cse82)) .cse83) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse67 .cse86)) .cse84 .cse85)) .cse72) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse73 .cse82)) .cse83) (or .cse84 .cse85 (= |ULTIMATE.start_main_~A~0#1| (+ .cse73 .cse86)))) .cse74)))))) .cse44 .cse51) (or (and (or .cse81 (and (or .cse87 .cse39 (and (or .cse88 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse89 .cse86)) .cse84 .cse85) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse89 .cse82)) .cse83)) .cse90) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse91 .cse82)) .cse83) (or .cse84 .cse85 (= |ULTIMATE.start_main_~A~0#1| (+ .cse91 .cse86)))) .cse92))) (or (and (or (and (or .cse83 (= |ULTIMATE.start_main_~A~0#1| (+ .cse93 .cse82))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse93 .cse86)) .cse84 .cse85)) .cse94) (or .cse95 .cse96 (and (or .cse84 .cse85 (= |ULTIMATE.start_main_~A~0#1| (+ .cse97 .cse86))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse97 .cse82)) .cse83)))) .cse40 .cse42 .cse98))) (or .cse62 .cse63 (and (or (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse91 .cse70)) .cse71) (or .cse66 (= |ULTIMATE.start_main_~A~0#1| (+ .cse91 .cse68)) .cse69)) .cse92) (or (and (or .cse66 (= |ULTIMATE.start_main_~A~0#1| (+ .cse89 .cse68)) .cse69) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse89 .cse70)) .cse71)) .cse88 .cse90)) .cse87 .cse39) (or .cse40 (and (or (and (or .cse71 (= |ULTIMATE.start_main_~A~0#1| (+ .cse93 .cse70))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse93 .cse68)) .cse66 .cse69)) .cse94) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse97 .cse70)) .cse71) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse97 .cse68)) .cse66 .cse69)) .cse95 .cse96)) .cse42 .cse98)))) .cse43)))) .cse59)) (.cse31 (or .cse55 (and (or (not (= .cse27 .cse56)) .cse54) (or .cse57 (not (= .cse27 .cse58)) .cse59)) (and (or (not (<= 1 .cse60)) .cse44 .cse51) (or (not (<= 1 .cse61)) .cse43)))) (.cse26 (or (let ((.cse35 (+ |ULTIMATE.start_main_~r~0#1| .cse53)) (.cse38 (+ |ULTIMATE.start_main_~r~0#1| .cse52))) (and (or .cse32 (and (or (and (or .cse33 (= |ULTIMATE.start_main_~A~0#1| (+ .cse34 .cse35)) .cse36) (or .cse37 (= |ULTIMATE.start_main_~A~0#1| (+ .cse34 .cse38)))) .cse39) (or .cse40 (and (or .cse37 (= |ULTIMATE.start_main_~A~0#1| (+ .cse41 .cse38))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse41 .cse35)) .cse33 .cse36)) .cse42)) .cse43) (or .cse44 .cse45 (and (or .cse46 .cse47 (and (or .cse37 (= |ULTIMATE.start_main_~A~0#1| (+ .cse48 .cse38))) (or .cse33 .cse36 (= |ULTIMATE.start_main_~A~0#1| (+ .cse48 .cse35))))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse49 .cse35)) .cse33 .cse36) (or .cse37 (= |ULTIMATE.start_main_~A~0#1| (+ .cse49 .cse38)))) .cse50)) .cse51))) .cse54))) (or (and .cse7 .cse8 .cse9 .cse10 .cse2 .cse11 .cse4 .cse12 .cse13 .cse14 .cse15 .cse5 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse6 .cse26) (and .cse8 .cse10 .cse11 (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse27 .cse28) .cse29)) (not (= .cse27 |ULTIMATE.start_main_~d~0#1|)) (not (<= 1 |ULTIMATE.start_main_~p~0#1|))) .cse16 .cse18 .cse22 .cse24 .cse25 .cse7 .cse30 .cse9 .cse2 .cse4 .cse12 .cse13 .cse14 .cse15 .cse5 .cse19 .cse20 .cse21 .cse23 .cse6 .cse31 .cse26) (and .cse8 .cse10 .cse11 .cse16 .cse17 .cse18 .cse22 .cse24 .cse25 .cse7 .cse9 .cse2 .cse4 .cse12 .cse13 .cse14 .cse15 .cse5 .cse19 .cse20 .cse21 .cse23 .cse6 .cse31 .cse26))))))) .cse4 .cse5 .cse6) (and (= |ULTIMATE.start_main_~d~0#1| .cse190) (<= 2 |ULTIMATE.start_main_~d~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_main_~p~0#1| .cse190) .cse5 .cse6 (= |ULTIMATE.start_main_~d~0#1| .cse191)) (and .cse192 .cse193 .cse194 .cse2 .cse3 .cse4 (= |ULTIMATE.start_main_~d~0#1| .cse195) .cse196 .cse5 (= |ULTIMATE.start_main_~p~0#1| .cse195) (= |ULTIMATE.start_main_~d~0#1| .cse197) .cse20 .cse23 .cse6) (and .cse18 .cse20 .cse2 (= |ULTIMATE.start_main_~d~0#1| (* 2 .cse197)) .cse11 .cse23 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_main_~p~0#1| (* 2 .cse195)))))))))))) [2023-02-17 07:33:33,603 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2023-02-17 07:33:33,603 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2023-02-17 07:33:33,603 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2023-02-17 07:33:33,603 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2023-02-17 07:33:33,603 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 14 20) the Hoare annotation is: true [2023-02-17 07:33:33,603 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2023-02-17 07:33:33,605 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-17 07:33:33,607 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 07:33:33,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 07:33:33 BoogieIcfgContainer [2023-02-17 07:33:33,866 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 07:33:33,866 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 07:33:33,866 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 07:33:33,867 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 07:33:33,867 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 07:31:49" (3/4) ... [2023-02-17 07:33:33,870 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-17 07:33:33,875 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-17 07:33:33,880 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2023-02-17 07:33:33,880 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-02-17 07:33:33,881 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-02-17 07:33:33,881 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-17 07:33:33,881 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-17 07:33:33,980 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 07:33:33,981 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 07:33:33,981 INFO L158 Benchmark]: Toolchain (without parser) took 105135.15ms. Allocated memory was 148.9MB in the beginning and 314.6MB in the end (delta: 165.7MB). Free memory was 118.1MB in the beginning and 242.7MB in the end (delta: -124.6MB). Peak memory consumption was 39.9MB. Max. memory is 16.1GB. [2023-02-17 07:33:33,981 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 148.9MB. Free memory is still 91.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 07:33:33,982 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.50ms. Allocated memory is still 148.9MB. Free memory was 117.5MB in the beginning and 107.1MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 07:33:33,982 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.59ms. Allocated memory is still 148.9MB. Free memory was 107.1MB in the beginning and 105.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 07:33:33,982 INFO L158 Benchmark]: Boogie Preprocessor took 30.33ms. Allocated memory is still 148.9MB. Free memory was 105.6MB in the beginning and 104.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 07:33:33,982 INFO L158 Benchmark]: RCFGBuilder took 288.48ms. Allocated memory is still 148.9MB. Free memory was 104.4MB in the beginning and 94.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 07:33:33,983 INFO L158 Benchmark]: TraceAbstraction took 104437.29ms. Allocated memory was 148.9MB in the beginning and 314.6MB in the end (delta: 165.7MB). Free memory was 93.1MB in the beginning and 252.0MB in the end (delta: -158.9MB). Peak memory consumption was 167.8MB. Max. memory is 16.1GB. [2023-02-17 07:33:33,983 INFO L158 Benchmark]: Witness Printer took 114.35ms. Allocated memory is still 314.6MB. Free memory was 252.0MB in the beginning and 242.7MB in the end (delta: 9.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-02-17 07:33:33,988 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 148.9MB. Free memory is still 91.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.50ms. Allocated memory is still 148.9MB. Free memory was 117.5MB in the beginning and 107.1MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.59ms. Allocated memory is still 148.9MB. Free memory was 107.1MB in the beginning and 105.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.33ms. Allocated memory is still 148.9MB. Free memory was 105.6MB in the beginning and 104.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 288.48ms. Allocated memory is still 148.9MB. Free memory was 104.4MB in the beginning and 94.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 104437.29ms. Allocated memory was 148.9MB in the beginning and 314.6MB in the end (delta: 165.7MB). Free memory was 93.1MB in the beginning and 252.0MB in the end (delta: -158.9MB). Peak memory consumption was 167.8MB. Max. memory is 16.1GB. * Witness Printer took 114.35ms. Allocated memory is still 314.6MB. Free memory was 252.0MB in the beginning and 242.7MB in the end (delta: 9.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 104.1s, OverallIterations: 16, TraceHistogramMax: 22, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 77.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 9 mSolverCounterUnknown, 543 SdHoareTripleChecker+Valid, 55.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 487 mSDsluCounter, 1853 SdHoareTripleChecker+Invalid, 54.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1387 mSDsCounter, 742 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6164 IncrementalHoareTripleChecker+Invalid, 6915 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 742 mSolverCounterUnsat, 466 mSDtfsCounter, 6164 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1958 GetRequests, 1656 SyntacticMatches, 40 SemanticMatches, 262 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 33.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=207occurred in iteration=14, InterpolantAutomatonStates: 186, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 92 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 172 PreInvPairs, 282 NumberOfFragments, 562390 HoareAnnotationTreeSize, 172 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 20.9s InterpolantComputationTime, 1140 NumberOfCodeBlocks, 1001 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1882 ConstructedInterpolants, 1 QuantifiedInterpolants, 99337 SizeOfPredicates, 67 NumberOfNonLiveVariables, 2549 ConjunctsInSsa, 443 ConjunctsInUnsatCore, 26 InterpolantComputations, 4 PerfectInterpolantSequences, 8124/9207 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((2 <= d && d == 2 * 1) && A == (q + p) * B + (r + -d)) && (A == d * q + r || !(1 == p))) && (!(1 == p) || B == d)) && q + p * -1 == 0) && r == A + -d) && B == 1) && p == 2 * 1) && A == q * B + r) && r + d == A) && d == 2 * B) || ((((((d == 2 * 1 && r == A) && q == 0) && B == 1) && p == 2 * 1) && d == B * p) && d == 2 * B)) || (((((((((d == 2 * (2 * B) && ((((0 == d % 2 || B == 1 + d / 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || B == d / 2)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && (!(1 == p) || B == d)) && q + p * -1 == 0) && B == 1) && A == q * B + r) && ((((((((((((2 <= d && (((((0 == p % 2 || A == (q + p + (1 + p / 2)) * B + (r + -d + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p + p / 2) * B + (r + -d + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && A == (q + p) * B + (r + -d)) && (A == d * q + r || !(1 == p))) && A == (q + 2 * p + p) * B + (r + -(2 * d) + -d)) && (((((0 == d % 2 || !(d < 0)) || A == (1 + d / 2) * (q + p) + (r + -d)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * (q + p) + (r + -d))) || 1 == p) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && ((1 == p || (((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r))) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || !(p < 0)) || A == (q + p + (1 + p / 2)) * B + (r + -d + -(d / 2))) && (A == (q + p + p / 2) * B + (r + -d + -(d / 2)) || (p < 0 && !(0 == p % 2)))))) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && (!(1 == p) || B == d)) && A == q * B + r) || ((((((((((2 <= d && (((((0 == p % 2 || A == (q + p + (1 + p / 2)) * B + (r + -d + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p + p / 2) * B + (r + -d + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && A == (q + p) * B + (r + -d)) && (A == d * q + r || !(1 == p))) && A == (q + 2 * p + p) * B + (r + -(2 * d) + -d)) && ((1 == p || (((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r))) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || !(p < 0)) || A == (q + p + (1 + p / 2)) * B + (r + -d + -(d / 2))) && (A == (q + p + p / 2) * B + (r + -d + -(d / 2)) || (p < 0 && !(0 == p % 2)))))) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && (!(1 == p) || B == d)) && A == q * B + r))) && r + d == A) && d == B * p) && p == 2 * (2 * 1))) || ((((p == 1 && r == A) && d == B) && q == 0) && B == 1)) || (((((((((((((((((((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 <= p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 <= 1 + p / 4))) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || !(p < 0)) || (((!(1 <= 1 + (p / 2 + 1) / 2) || 0 == (p / 2 + 1) % 2) || !(1 + p / 2 < 0)) && ((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || !(1 <= (p / 2 + 1) / 2))))) || (((0 == d % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || !(B * 1 == (d / 2 + 1) / 2)) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || !(B * 1 == 1 + (d / 2 + 1) / 2)))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || !(B * 1 == 1 + d / 4)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || !(B * 1 == d / 4)))))) || A == B * 1 * (q + p) + (r + -d)) && (((((1 == p / 2 || (((0 == p / 2 % 2 || (((!(1 + d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + -((d / 2 + 1) / 2))))) || !(p / 2 < 0)) && ((((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (q + p + p / 4) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + -((d / 2 + 1) / 2)))) || (p / 2 < 0 && !(0 == p / 2 % 2))))) || (p < 0 && !(0 == p % 2))) && (((0 == p % 2 || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + -((d / 2 + 1) / 2))) && ((!(1 + d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2))) && ((0 == (p / 2 + 1) % 2 || ((A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + -((d / 2 + 1) / 2)) || (!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0)) && ((!(1 + d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2))) || !(1 + p / 2 < 0)))) || 1 == 1 + p / 2) || !(p < 0))) || 0 == d % 2) || !(d < 0))) && B == 1) && (1 == p || (((((A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)) && (A == (q + p / 2) * B + (r + -(d / 2)) || (d < 0 && !(0 == d % 2)))) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || ((A == (q + (1 + p / 2)) * B + (r + -(d / 2)) || (d < 0 && !(0 == d % 2))) && ((A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)))) || !(p < 0))))) && ((A == B * 1 * (q + 2 * (2 * p)) + (r + -(2 * (2 * d))) || !(B * 1 == d)) || !(1 <= p))) && A == q * B + r) && A == (q + p) * B + (r + -d)) && ((d < 0 && !(0 == d % 2)) || (((1 == p / 2 || (p < 0 && !(0 == p % 2))) || (((p / 2 < 0 && !(0 == p / 2 % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) && (((((!(d / 2 < 0) || 0 == d / 2 % 2) || A == (q + p + (1 + p / 4)) * B + (r + -d + (-1 + -(d / 4)))) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + -(d / 4)))) || 0 == p / 2 % 2) || !(p / 2 < 0)))) && (((0 == p % 2 || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) && ((0 == (p / 2 + 1) % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) || !(1 + p / 2 < 0)))) || 1 == 1 + p / 2) || !(p < 0))))) && (1 == 2 * p || A == (q + 2 * (2 * p) + p) * B + (r + -(2 * (2 * d)) + -d))) && ((((p < 0 && !(0 == p % 2)) || ((A == (q + 2 * p + 2 * p / 4) * B + (r + -(2 * d) + -(2 * d / 4)) || (d < 0 && !(0 == d % 2))) && ((A == (q + 2 * p + 2 * p / 4) * B + (r + -(2 * d) + (-1 + -(2 * d / 4))) || 0 == d % 2) || !(d < 0)))) && ((0 == p % 2 || (((0 == d % 2 || A == (q + 2 * p + (1 + 2 * p / 4)) * B + (r + -(2 * d) + (-1 + -(2 * d / 4)))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == (q + 2 * p + (1 + 2 * p / 4)) * B + (r + -(2 * d) + -(2 * d / 4))))) || !(p < 0))) || 1 == p)) && (A == q * B + r || (1 <= d && A == q * B + r))) && d == B * p) && ((A == B * 1 * q + r || ((!(B * 1 == d / 2) || (d < 0 && !(0 == d % 2))) && ((0 == d % 2 || !(B * 1 == 1 + d / 2)) || !(d < 0)))) || (((!(1 <= 1 + p / 2) || 0 == p % 2) || !(p < 0)) && (!(1 <= p / 2) || (p < 0 && !(0 == p % 2))))))) || ((((r == A && p == 1) && d == B) && q == 0) && B == 1)) || (((((((((((A == (q + p) * B + (r + -d) && (A == d * q + r || !(1 == p))) && A == (q + 2 * p + p) * B + (r + -(2 * d) + -d)) && p == 2) && q + 2 * (2 * 1) * -1 == 0) && r + 2 * (2 * B) == A) && (!(1 == p) || B == d)) && B == 1) && (A == q * B + r || (1 <= d && A == q * B + r))) && d == B * 2) && A == q * B + r) && d == B * p)) || (((((((((((((((((((((((((0 == p % 2 || ((((A == B * 1 * (q + (1 + p / 2)) + (r + (-1 + -(d / 2))) || 0 == d % 2) || (((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((!(B * 1 == 1 + ((d / 2 + 1) / 2 + 1) / 2) || !(1 + (d / 2 + 1) / 2 < 0)) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && ((1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || ((!(B * 1 == (d / 2 + 1) / 4) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((!((d / 2 + 1) / 2 < 0) || !(B * 1 == 1 + (d / 2 + 1) / 4)) || 0 == (d / 2 + 1) / 2 % 2))))) || !(d < 0)) && ((((((((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || !(B * 1 == (d / 4 + 1) / 2)) && ((0 == (d / 4 + 1) % 2 || !(1 + d / 4 < 0)) || !(B * 1 == 1 + (d / 4 + 1) / 2))) || !(d / 2 < 0)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || (((d / 4 < 0 && !(0 == d / 4 % 2)) || !(B * 1 == d / 8)) && ((0 == d / 4 % 2 || !(B * 1 == 1 + d / 8)) || !(d / 4 < 0))))) || (d < 0 && !(0 == d % 2))) || A == B * 1 * (q + (1 + p / 2)) + (r + -(d / 2))))) || !(p < 0)) || (((0 == (p / 2 + 1) % 2 || !(1 + p / 2 < 0)) || (((!(1 <= 1 + ((p / 2 + 1) / 2 + 1) / 2) || !(1 + (p / 2 + 1) / 2 < 0)) || 0 == ((p / 2 + 1) / 2 + 1) % 2) && (!(1 <= ((p / 2 + 1) / 2 + 1) / 2) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2))))) && ((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || ((((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2)) || !(1 <= (p / 2 + 1) / 4)) && ((!(1 <= 1 + (p / 2 + 1) / 4) || 0 == (p / 2 + 1) / 2 % 2) || !((p / 2 + 1) / 2 < 0)))))) && A == (q + 2 * p + p) * B + (r + -(2 * d) + -d)) && ((A == B * 1 * q + r || (((((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 <= p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 <= 1 + p / 4))) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || !(p < 0)) || (((!(1 <= 1 + (p / 2 + 1) / 2) || 0 == (p / 2 + 1) % 2) || !(1 + p / 2 < 0)) && ((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || !(1 <= (p / 2 + 1) / 2)))))) || (((0 == d % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || !(B * 1 == (d / 2 + 1) / 2)) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || !(B * 1 == 1 + (d / 2 + 1) / 2)))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || !(B * 1 == 1 + d / 4)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || !(B * 1 == d / 4))))))) && (((((((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 <= p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 <= 1 + p / 4))) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || !(p < 0)) || (((!(1 <= 1 + (p / 2 + 1) / 2) || 0 == (p / 2 + 1) % 2) || !(1 + p / 2 < 0)) && ((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || !(1 <= (p / 2 + 1) / 2))))) || (((0 == d % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || !(B * 1 == (d / 2 + 1) / 2)) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || !(B * 1 == 1 + (d / 2 + 1) / 2)))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || !(B * 1 == 1 + d / 4)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || !(B * 1 == d / 4)))))) || A == B * 1 * (q + p) + (r + -d))) && (((((1 == p / 2 || (((0 == p / 2 % 2 || (((!(1 + d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + -((d / 2 + 1) / 2))))) || !(p / 2 < 0)) && ((((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (q + p + p / 4) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + -((d / 2 + 1) / 2)))) || (p / 2 < 0 && !(0 == p / 2 % 2))))) || (p < 0 && !(0 == p % 2))) && (((0 == p % 2 || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + -((d / 2 + 1) / 2))) && ((!(1 + d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2))) && ((0 == (p / 2 + 1) % 2 || ((A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + -((d / 2 + 1) / 2)) || (!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0)) && ((!(1 + d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2))) || !(1 + p / 2 < 0)))) || 1 == 1 + p / 2) || !(p < 0))) || 0 == d % 2) || !(d < 0))) && B == 1) && (1 == p || (((((A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)) && (A == (q + p / 2) * B + (r + -(d / 2)) || (d < 0 && !(0 == d % 2)))) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || ((A == (q + (1 + p / 2)) * B + (r + -(d / 2)) || (d < 0 && !(0 == d % 2))) && ((A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)))) || !(p < 0))))) && ((A == B * 1 * (q + 2 * p) + (r + -(2 * d)) || (((d < 0 && !(0 == d % 2)) || !(B * 1 == 2 * d / 4)) && ((0 == d % 2 || !(d < 0)) || !(B * 1 == 1 + 2 * d / 4)))) || (((0 == p % 2 || !(p < 0)) || !(1 <= 1 + 2 * p / 4)) && (!(1 <= 2 * p / 4) || (p < 0 && !(0 == p % 2)))))) && ((d < 0 && !(0 == d % 2)) || ((((((!(d / 2 < 0) || ((((0 == (p / 2 + 1) % 2 || 1 == 1 + (p / 2 + 1) / 2) || !(1 + p / 2 < 0)) || (((((A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2))) || 0 == (d / 4 + 1) % 2) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + -(d / 2) + -((d / 4 + 1) / 2)))) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2))) && (((((0 == (d / 4 + 1) % 2 || A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2)))) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + -(d / 2) + -((d / 4 + 1) / 2)))) || !(1 + (p / 2 + 1) / 2 < 0)) || 0 == ((p / 2 + 1) / 2 + 1) % 2))) && ((1 == (p / 2 + 1) / 2 || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))) || (((0 == (p / 2 + 1) / 2 % 2 || !((p / 2 + 1) / 2 < 0)) || (((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + -(d / 2) + -((d / 4 + 1) / 2))) && ((0 == (d / 4 + 1) % 2 || !(1 + d / 4 < 0)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2)))))) && ((((0 == (d / 4 + 1) % 2 || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2)))) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + -(d / 2) + -((d / 4 + 1) / 2)))) || ((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2))))))) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || (((((((!(1 + (p / 2 + 1) / 2 < 0) || ((A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2))) && ((0 == d / 4 % 2 || A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0)))) || 0 == ((p / 2 + 1) / 2 + 1) % 2) && (((A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2))) && ((0 == d / 4 % 2 || A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0))) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2)))) || 0 == (p / 2 + 1) % 2) || 1 == 1 + (p / 2 + 1) / 2) || !(1 + p / 2 < 0)) && ((1 == (p / 2 + 1) / 2 || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))) || (((((0 == d / 4 % 2 || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0)) && (A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2)))) || ((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2))) && ((((A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2))) && ((0 == d / 4 % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0))) || 0 == (p / 2 + 1) / 2 % 2) || !((p / 2 + 1) / 2 < 0))))))) || 0 == p % 2) || !(p < 0)) && (((((((1 == p / 4 || (p / 2 < 0 && !(0 == p / 2 % 2))) || (((((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + p / 2 + p / 8) * B + (r + -(d / 2) + -((d / 4 + 1) / 2))) && ((A == (q + p / 2 + p / 8) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2))) || 0 == (d / 4 + 1) % 2) || !(1 + d / 4 < 0))) || (p / 4 < 0 && !(0 == p / 4 % 2))) && ((0 == p / 4 % 2 || (((A == (q + p / 2 + (1 + p / 8)) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2))) || 0 == (d / 4 + 1) % 2) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + p / 2 + (1 + p / 8)) * B + (r + -(d / 2) + -((d / 4 + 1) / 2))))) || !(p / 4 < 0)))) && (((0 == p / 2 % 2 || !(p / 2 < 0)) || (((!(1 + p / 4 < 0) || 0 == (p / 4 + 1) % 2) || (((0 == (d / 4 + 1) % 2 || !(1 + d / 4 < 0)) || A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2)))) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + -(d / 2) + -((d / 4 + 1) / 2))))) && ((((A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2))) || 0 == (d / 4 + 1) % 2) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + -(d / 2) + -((d / 4 + 1) / 2)))) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0)))) || 1 == 1 + p / 4)) || !(d / 2 < 0)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || ((((0 == p / 2 % 2 || ((((((0 == d / 4 % 2 || A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0)) && (A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2)))) || !(1 + p / 4 < 0)) || 0 == (p / 4 + 1) % 2) && ((((A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + -(d / 2) + (-1 + -(d / 8))) || 0 == d / 4 % 2) || !(d / 4 < 0)) && (A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2)))) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0)))) || !(p / 2 < 0)) || 1 == 1 + p / 4) && ((1 == p / 4 || (p / 2 < 0 && !(0 == p / 2 % 2))) || (((((0 == d / 4 % 2 || A == (q + p / 2 + p / 8) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0)) && (A == (q + p / 2 + p / 8) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2)))) || (p / 4 < 0 && !(0 == p / 4 % 2))) && ((0 == p / 4 % 2 || (((0 == d / 4 % 2 || !(d / 4 < 0)) || A == (q + p / 2 + (1 + p / 8)) * B + (r + -(d / 2) + (-1 + -(d / 8)))) && (A == (q + p / 2 + (1 + p / 8)) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2))))) || !(p / 4 < 0))))))) || (p < 0 && !(0 == p % 2)))))) && ((A == B * 1 * (q + 2 * (2 * p)) + (r + -(2 * (2 * d))) || !(B * 1 == d)) || !(1 <= p))) && (((((((((((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || !(B * 1 == (d / 4 + 1) / 2)) && ((0 == (d / 4 + 1) % 2 || !(1 + d / 4 < 0)) || !(B * 1 == 1 + (d / 4 + 1) / 2))) || !(d / 2 < 0)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || (((d / 4 < 0 && !(0 == d / 4 % 2)) || !(B * 1 == d / 8)) && ((0 == d / 4 % 2 || !(B * 1 == 1 + d / 8)) || !(d / 4 < 0))))) || A == B * 1 * (q + p / 2) + (r + -(d / 2))) || (d < 0 && !(0 == d % 2))) && (((0 == d % 2 || A == B * 1 * (q + p / 2) + (r + (-1 + -(d / 2)))) || (((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((!(B * 1 == 1 + ((d / 2 + 1) / 2 + 1) / 2) || !(1 + (d / 2 + 1) / 2 < 0)) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && ((1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || ((!(B * 1 == (d / 2 + 1) / 4) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((!((d / 2 + 1) / 2 < 0) || !(B * 1 == 1 + (d / 2 + 1) / 4)) || 0 == (d / 2 + 1) / 2 % 2))))) || !(d < 0))) || (p < 0 && !(0 == p % 2))) || (((p / 2 < 0 && !(0 == p / 2 % 2)) || (((0 == p / 4 % 2 || !(1 <= 1 + p / 8)) || !(p / 4 < 0)) && (!(1 <= p / 8) || (!(0 == p / 4 % 2) && p / 4 < 0)))) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || (((!(1 <= 1 + (p / 4 + 1) / 2) || 0 == (p / 4 + 1) % 2) || !(1 + p / 4 < 0)) && (!(1 <= (p / 4 + 1) / 2) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0))))))) && A == q * B + r) && A == (q + p) * B + (r + -d)) && (A == d * q + r || !(1 == p))) && ((d < 0 && !(0 == d % 2)) || (((1 == p / 2 || (p < 0 && !(0 == p % 2))) || (((p / 2 < 0 && !(0 == p / 2 % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) && (((((!(d / 2 < 0) || 0 == d / 2 % 2) || A == (q + p + (1 + p / 4)) * B + (r + -d + (-1 + -(d / 4)))) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + -(d / 4)))) || 0 == p / 2 % 2) || !(p / 2 < 0)))) && (((0 == p % 2 || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) && ((0 == (p / 2 + 1) % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) || !(1 + p / 2 < 0)))) || 1 == 1 + p / 2) || !(p < 0))))) && ((0 == d % 2 || ((((((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || ((((0 == (p / 2 + 1) % 2 || 1 == 1 + (p / 2 + 1) / 2) || !(1 + p / 2 < 0)) || (((!(1 + (p / 2 + 1) / 2 < 0) || (((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && (A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2))))) || 0 == ((p / 2 + 1) / 2 + 1) % 2) && ((((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && (A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)))) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2))))) && ((1 == (p / 2 + 1) / 2 || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))) || (((0 == (p / 2 + 1) / 2 % 2 || !((p / 2 + 1) / 2 < 0)) || (((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && ((1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2))))) && (((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2)) || (((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && (A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2))))))))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((1 == (p / 2 + 1) / 2 || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))) || ((((A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))))) || ((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2))) && ((0 == (p / 2 + 1) / 2 % 2 || (((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)))) && (A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))))) || !((p / 2 + 1) / 2 < 0)))) && (((0 == (p / 2 + 1) % 2 || 1 == 1 + (p / 2 + 1) / 2) || !(1 + p / 2 < 0)) || (((!(1 + (p / 2 + 1) / 2 < 0) || ((A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))) || !((d / 2 + 1) / 2 < 0)) || 0 == (d / 2 + 1) / 2 % 2))) || 0 == ((p / 2 + 1) / 2 + 1) % 2) && (((A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))))) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2)))))))) || 0 == p % 2) || !(p < 0)) && ((((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((1 == p / 4 || (p / 2 < 0 && !(0 == p / 2 % 2))) || (((0 == p / 4 % 2 || (((A == (q + p / 2 + (1 + p / 8)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))) || !((d / 2 + 1) / 2 < 0)) || 0 == (d / 2 + 1) / 2 % 2) && (A == (q + p / 2 + (1 + p / 8)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))))) || !(p / 4 < 0)) && (((A == (q + p / 2 + p / 8) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + p / 2 + p / 8) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))))) || (p / 4 < 0 && !(0 == p / 4 % 2))))) && (((((((((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2)) || A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4))) && ((A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))) || !((d / 2 + 1) / 2 < 0)) || 0 == (d / 2 + 1) / 2 % 2)) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0)) && ((!(1 + p / 4 < 0) || 0 == (p / 4 + 1) % 2) || (((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)))) && (A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2)))))) || 0 == p / 2 % 2) || !(p / 2 < 0)) || 1 == 1 + p / 4))) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((((((A == (q + p / 2 + p / 8) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2))) && ((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + p / 2 + p / 8) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2)) || (p / 4 < 0 && !(0 == p / 4 % 2))) && (((((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + p / 2 + (1 + p / 8)) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && (A == (q + p / 2 + (1 + p / 8)) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)))) || 0 == p / 4 % 2) || !(p / 4 < 0))) || 1 == p / 4) || (p / 2 < 0 && !(0 == p / 2 % 2))) && (((0 == p / 2 % 2 || (((((1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)) || A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2))) && ((A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2))) || !(1 + (d / 2 + 1) / 2 < 0)) || 0 == ((d / 2 + 1) / 2 + 1) % 2)) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0)) && ((((A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2))) && ((A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2))) || !(1 + (d / 2 + 1) / 2 < 0)) || 0 == ((d / 2 + 1) / 2 + 1) % 2)) || !(1 + p / 4 < 0)) || 0 == (p / 4 + 1) % 2))) || !(p / 2 < 0)) || 1 == 1 + p / 4)))) || (p < 0 && !(0 == p % 2))))) || !(d < 0))) && (1 == 2 * p || A == (q + 2 * (2 * p) + p) * B + (r + -(2 * (2 * d)) + -d))) && (!(1 == p) || B == d)) && ((((p < 0 && !(0 == p % 2)) || ((A == (q + 2 * p + 2 * p / 4) * B + (r + -(2 * d) + -(2 * d / 4)) || (d < 0 && !(0 == d % 2))) && ((A == (q + 2 * p + 2 * p / 4) * B + (r + -(2 * d) + (-1 + -(2 * d / 4))) || 0 == d % 2) || !(d < 0)))) && ((0 == p % 2 || (((0 == d % 2 || A == (q + 2 * p + (1 + 2 * p / 4)) * B + (r + -(2 * d) + (-1 + -(2 * d / 4)))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == (q + 2 * p + (1 + 2 * p / 4)) * B + (r + -(2 * d) + -(2 * d / 4))))) || !(p < 0))) || 1 == p)) && ((0 == d % 2 || (((1 == p / 2 || (((0 == p / 2 % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + (1 + p / 4)) * B + (r + -((d / 2 + 1) / 2))) && ((A == (q + (1 + p / 4)) * B + (r + (-1 + -((d / 2 + 1) / 2))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2))) || !(p / 2 < 0)) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p / 4) * B + (r + -((d / 2 + 1) / 2))) && ((A == (q + p / 4) * B + (r + (-1 + -((d / 2 + 1) / 2))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2))))) || (p < 0 && !(0 == p % 2))) && (((0 == p % 2 || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + (p / 2 + 1) / 2) * B + (r + -((d / 2 + 1) / 2))) && ((!(1 + d / 2 < 0) || A == (q + (p / 2 + 1) / 2) * B + (r + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2))) && ((0 == (p / 2 + 1) % 2 || (((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (q + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -((d / 2 + 1) / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + (1 + (p / 2 + 1) / 2)) * B + (r + -((d / 2 + 1) / 2))))) || !(1 + p / 2 < 0)))) || 1 == 1 + p / 2) || !(p < 0)))) || !(d < 0))) && d == B * p) && ((A == B * 1 * q + r || ((!(B * 1 == d / 2) || (d < 0 && !(0 == d % 2))) && ((0 == d % 2 || !(B * 1 == 1 + d / 2)) || !(d < 0)))) || (((!(1 <= 1 + p / 2) || 0 == p % 2) || !(p < 0)) && (!(1 <= p / 2) || (p < 0 && !(0 == p % 2)))))) && ((((1 == p / 2 || (((((!(d / 2 < 0) || A == (q + p / 4) * B + (r + (-1 + -(d / 4)))) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p / 4) * B + (r + -(d / 4)))) || (p / 2 < 0 && !(0 == p / 2 % 2))) && ((0 == p / 2 % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + (1 + p / 4)) * B + (r + -(d / 4))) && ((A == (q + (1 + p / 4)) * B + (r + (-1 + -(d / 4))) || !(d / 2 < 0)) || 0 == d / 2 % 2))) || !(p / 2 < 0)))) || (p < 0 && !(0 == p % 2))) && (((0 == p % 2 || 1 == 1 + p / 2) || (((0 == (p / 2 + 1) % 2 || !(1 + p / 2 < 0)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 4))) && ((!(d / 2 < 0) || 0 == d / 2 % 2) || A == (q + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 4)))))) && ((((A == (q + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 4))) || !(d / 2 < 0)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + (p / 2 + 1) / 2) * B + (r + -(d / 4)))) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))))) || !(p < 0))) || (d < 0 && !(0 == d % 2))))) || (((((B == 1 && (A == q * B + r || (1 <= d && A == q * B + r))) && ((A == B * 1 * (q + 2 * (2 * p)) + (r + -(2 * (2 * d))) || !(B * 1 == d)) || !(1 <= p))) && A == q * B + r) && d == B * p) && ((A == B * 1 * q + r || ((!(B * 1 == d / 2) || (d < 0 && !(0 == d % 2))) && ((0 == d % 2 || !(B * 1 == 1 + d / 2)) || !(d < 0)))) || (((!(1 <= 1 + p / 2) || 0 == p % 2) || !(p < 0)) && (!(1 <= p / 2) || (p < 0 && !(0 == p % 2))))))) || ((((((((((A == (q + p) * B + (r + -d) && ((d < 0 && !(0 == d % 2)) || (((1 == p / 2 || (p < 0 && !(0 == p % 2))) || (((p / 2 < 0 && !(0 == p / 2 % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) && (((((!(d / 2 < 0) || 0 == d / 2 % 2) || A == (q + p + (1 + p / 4)) * B + (r + -d + (-1 + -(d / 4)))) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + -(d / 4)))) || 0 == p / 2 % 2) || !(p / 2 < 0)))) && (((0 == p % 2 || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) && ((0 == (p / 2 + 1) % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) || !(1 + p / 2 < 0)))) || 1 == 1 + p / 2) || !(p < 0))))) && ((A == B * 1 * q + r || (((((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 <= p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 <= 1 + p / 4))) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || !(p < 0)) || (((!(1 <= 1 + (p / 2 + 1) / 2) || 0 == (p / 2 + 1) % 2) || !(1 + p / 2 < 0)) && ((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || !(1 <= (p / 2 + 1) / 2)))))) || (((0 == d % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || !(B * 1 == (d / 2 + 1) / 2)) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || !(B * 1 == 1 + (d / 2 + 1) / 2)))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || !(B * 1 == 1 + d / 4)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || !(B * 1 == d / 4))))))) && (((((1 == p / 2 || (((0 == p / 2 % 2 || (((!(1 + d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + -((d / 2 + 1) / 2))))) || !(p / 2 < 0)) && ((((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (q + p + p / 4) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + -((d / 2 + 1) / 2)))) || (p / 2 < 0 && !(0 == p / 2 % 2))))) || (p < 0 && !(0 == p % 2))) && (((0 == p % 2 || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + -((d / 2 + 1) / 2))) && ((!(1 + d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2))) && ((0 == (p / 2 + 1) % 2 || ((A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + -((d / 2 + 1) / 2)) || (!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0)) && ((!(1 + d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2))) || !(1 + p / 2 < 0)))) || 1 == 1 + p / 2) || !(p < 0))) || 0 == d % 2) || !(d < 0))) && (1 == 2 * p || A == (q + 2 * (2 * p) + p) * B + (r + -(2 * (2 * d)) + -d))) && ((((p < 0 && !(0 == p % 2)) || ((A == (q + 2 * p + 2 * p / 4) * B + (r + -(2 * d) + -(2 * d / 4)) || (d < 0 && !(0 == d % 2))) && ((A == (q + 2 * p + 2 * p / 4) * B + (r + -(2 * d) + (-1 + -(2 * d / 4))) || 0 == d % 2) || !(d < 0)))) && ((0 == p % 2 || (((0 == d % 2 || A == (q + 2 * p + (1 + 2 * p / 4)) * B + (r + -(2 * d) + (-1 + -(2 * d / 4)))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == (q + 2 * p + (1 + 2 * p / 4)) * B + (r + -(2 * d) + -(2 * d / 4))))) || !(p < 0))) || 1 == p)) && B == 1) && (1 == p || (((((A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)) && (A == (q + p / 2) * B + (r + -(d / 2)) || (d < 0 && !(0 == d % 2)))) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || ((A == (q + (1 + p / 2)) * B + (r + -(d / 2)) || (d < 0 && !(0 == d % 2))) && ((A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)))) || !(p < 0))))) && ((A == d * q + r || !(1 == p)) || !(d == B * p))) && A == q * B + r) && d == B * p)) || (((((((A == (q + p) * B + (r + -d) && (A == d * q + r || !(1 == p))) && A == (q + 2 * p + p) * B + (r + -(2 * d) + -d)) && (!(1 == p) || B == d)) && B == 1) && ((A == d * q + r || !(1 == p)) || !(d == B * p))) && A == q * B + r) && d == B * p)) || (((((((((((d == 2 * (2 * B) && 2 <= -d / -2) && ((((((((((A == (q + p) * B + (r + -d) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && A == d * q + r) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p) || (((((((((A == (q + p) * B + (r + -d) && (A == d * q + r || !(1 == p))) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p))) && ((((0 == d % 2 || B == 1 + d / 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || B == d / 2)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && r >= -d / -2) && r == A) && (!(1 == p) || B == d)) && q == 0) && B == 1) && d == 2 * (2 * 1)) && d % 2 == 0) && p == 2 * (2 * 1))) || ((((((((((((((((((((0 == p % 2 || A == (q + p + (1 + p / 2)) * B + (r + -d + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p + p / 2) * B + (r + -d + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0)) && A == (q + 2 * p + p) * B + (r + -(2 * d) + -d)) && p == 1) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && B == 1) && r == A + B * -2 + -B) && d == 1) && r == A + -2 + -d) && ((0 == d % 2 || (((0 == p % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) || !(1 + p / 2 < 0)))) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) || !(1 + p / 2 < 0)))))) || !(p < 0)) && (((((((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || 0 == p / 2 % 2) || !(p / 2 < 0))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2)))))) || (p < 0 && !(0 == p % 2))))) || !(d < 0))) && A == (q + p) * B + (r + -d)) && q + p * -1 + 2 * 1 * -1 == 0) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || !(p < 0)) || A == (q + p + (1 + p / 2)) * B + (r + -d + -(d / 2))) && (A == (q + p + p / 2) * B + (r + -d + -(d / 2)) || (p < 0 && !(0 == p % 2)))))) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && d == B) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + -(d / 4))) && ((0 == (p / 2 + 1) % 2 || !(1 + p / 2 < 0)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + -(d / 4))))) && ((!(d / 2 < 0) || (((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) || !(1 + p / 2 < 0)) && (A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + (-1 + -(d / 4))) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))))) || 0 == d / 2 % 2))) || !(p < 0)) && ((p < 0 && !(0 == p % 2)) || (((((A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + -(d / 4)) || 0 == p / 2 % 2) || !(p / 2 < 0)) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + -(d / 4)))) || (!(0 == d / 2 % 2) && d / 2 < 0)) && (((((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + (-1 + -(d / 4))))) || !(d / 2 < 0)) || 0 == d / 2 % 2)))))) && q + -2 == 1)) || (((((((((((A == (q + p) * B + (r + -d) && (A == d * q + r || !(1 == p))) && A == (q + 2 * p + p) * B + (r + -(2 * d) + -d)) && ((1 == 2 * p || A == (q + 2 * (2 * p) + p) * B + (r + -(2 * (2 * d)) + -d)) || !(r == A))) && (!(1 == p) || B == d)) && B == 1) && (A == q * B + r || (1 <= d && A == q * B + r))) && (1 == p || (((((A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)) && (A == (q + p / 2) * B + (r + -(d / 2)) || (d < 0 && !(0 == d % 2)))) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || ((A == (q + (1 + p / 2)) * B + (r + -(d / 2)) || (d < 0 && !(0 == d % 2))) && ((A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)))) || !(p < 0))))) && ((A == B * 1 * (q + 2 * (2 * p)) + (r + -(2 * (2 * d))) || !(B * 1 == d)) || !(1 <= p))) && A == q * B + r) && d == B * p) && ((A == B * 1 * q + r || ((!(B * 1 == d / 2) || (d < 0 && !(0 == d % 2))) && ((0 == d % 2 || !(B * 1 == 1 + d / 2)) || !(d < 0)))) || (((!(1 <= 1 + p / 2) || 0 == p % 2) || !(p < 0)) && (!(1 <= p / 2) || (p < 0 && !(0 == p % 2))))))) || ((((((((((((((((((((((1 == p / 2 || (((0 == p / 2 % 2 || (((!(1 + d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + -((d / 2 + 1) / 2))))) || !(p / 2 < 0)) && ((((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (q + p + p / 4) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + -((d / 2 + 1) / 2)))) || (p / 2 < 0 && !(0 == p / 2 % 2))))) || (p < 0 && !(0 == p % 2))) && (((0 == p % 2 || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + -((d / 2 + 1) / 2))) && ((!(1 + d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2))) && ((0 == (p / 2 + 1) % 2 || ((A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + -((d / 2 + 1) / 2)) || (!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0)) && ((!(1 + d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2))) || !(1 + p / 2 < 0)))) || 1 == 1 + p / 2) || !(p < 0))) || 0 == d % 2) || !(d < 0)) && r == A + B * -4 + -B) && B == 1) && (1 == p || (((((A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)) && (A == (q + p / 2) * B + (r + -(d / 2)) || (d < 0 && !(0 == d % 2)))) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || ((A == (q + (1 + p / 2)) * B + (r + -(d / 2)) || (d < 0 && !(0 == d % 2))) && ((A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)))) || !(p < 0))))) && ((d < 0 && !(0 == d % 2)) || ((((((!(d / 2 < 0) || ((((0 == (p / 2 + 1) % 2 || 1 == 1 + (p / 2 + 1) / 2) || !(1 + p / 2 < 0)) || (((((A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2))) || 0 == (d / 4 + 1) % 2) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + -(d / 2) + -((d / 4 + 1) / 2)))) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2))) && (((((0 == (d / 4 + 1) % 2 || A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2)))) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + -(d / 2) + -((d / 4 + 1) / 2)))) || !(1 + (p / 2 + 1) / 2 < 0)) || 0 == ((p / 2 + 1) / 2 + 1) % 2))) && ((1 == (p / 2 + 1) / 2 || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))) || (((0 == (p / 2 + 1) / 2 % 2 || !((p / 2 + 1) / 2 < 0)) || (((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + -(d / 2) + -((d / 4 + 1) / 2))) && ((0 == (d / 4 + 1) % 2 || !(1 + d / 4 < 0)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2)))))) && ((((0 == (d / 4 + 1) % 2 || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2)))) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + -(d / 2) + -((d / 4 + 1) / 2)))) || ((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2))))))) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || (((((((!(1 + (p / 2 + 1) / 2 < 0) || ((A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2))) && ((0 == d / 4 % 2 || A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0)))) || 0 == ((p / 2 + 1) / 2 + 1) % 2) && (((A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2))) && ((0 == d / 4 % 2 || A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0))) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2)))) || 0 == (p / 2 + 1) % 2) || 1 == 1 + (p / 2 + 1) / 2) || !(1 + p / 2 < 0)) && ((1 == (p / 2 + 1) / 2 || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))) || (((((0 == d / 4 % 2 || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0)) && (A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2)))) || ((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2))) && ((((A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2))) && ((0 == d / 4 % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0))) || 0 == (p / 2 + 1) / 2 % 2) || !((p / 2 + 1) / 2 < 0))))))) || 0 == p % 2) || !(p < 0)) && (((((((1 == p / 4 || (p / 2 < 0 && !(0 == p / 2 % 2))) || (((((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + p / 2 + p / 8) * B + (r + -(d / 2) + -((d / 4 + 1) / 2))) && ((A == (q + p / 2 + p / 8) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2))) || 0 == (d / 4 + 1) % 2) || !(1 + d / 4 < 0))) || (p / 4 < 0 && !(0 == p / 4 % 2))) && ((0 == p / 4 % 2 || (((A == (q + p / 2 + (1 + p / 8)) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2))) || 0 == (d / 4 + 1) % 2) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + p / 2 + (1 + p / 8)) * B + (r + -(d / 2) + -((d / 4 + 1) / 2))))) || !(p / 4 < 0)))) && (((0 == p / 2 % 2 || !(p / 2 < 0)) || (((!(1 + p / 4 < 0) || 0 == (p / 4 + 1) % 2) || (((0 == (d / 4 + 1) % 2 || !(1 + d / 4 < 0)) || A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2)))) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + -(d / 2) + -((d / 4 + 1) / 2))))) && ((((A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2))) || 0 == (d / 4 + 1) % 2) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + -(d / 2) + -((d / 4 + 1) / 2)))) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0)))) || 1 == 1 + p / 4)) || !(d / 2 < 0)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || ((((0 == p / 2 % 2 || ((((((0 == d / 4 % 2 || A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0)) && (A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2)))) || !(1 + p / 4 < 0)) || 0 == (p / 4 + 1) % 2) && ((((A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + -(d / 2) + (-1 + -(d / 8))) || 0 == d / 4 % 2) || !(d / 4 < 0)) && (A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2)))) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0)))) || !(p / 2 < 0)) || 1 == 1 + p / 4) && ((1 == p / 4 || (p / 2 < 0 && !(0 == p / 2 % 2))) || (((((0 == d / 4 % 2 || A == (q + p / 2 + p / 8) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0)) && (A == (q + p / 2 + p / 8) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2)))) || (p / 4 < 0 && !(0 == p / 4 % 2))) && ((0 == p / 4 % 2 || (((0 == d / 4 % 2 || !(d / 4 < 0)) || A == (q + p / 2 + (1 + p / 8)) * B + (r + -(d / 2) + (-1 + -(d / 8)))) && (A == (q + p / 2 + (1 + p / 8)) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2))))) || !(p / 4 < 0))))))) || (p < 0 && !(0 == p % 2)))))) && r + d + 2 * (2 * B) == A) && A == (q + p) * B + (r + -d)) && ((d < 0 && !(0 == d % 2)) || (((1 == p / 2 || (p < 0 && !(0 == p % 2))) || (((p / 2 < 0 && !(0 == p / 2 % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) && (((((!(d / 2 < 0) || 0 == d / 2 % 2) || A == (q + p + (1 + p / 4)) * B + (r + -d + (-1 + -(d / 4)))) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + -(d / 4)))) || 0 == p / 2 % 2) || !(p / 2 < 0)))) && (((0 == p % 2 || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) && ((0 == (p / 2 + 1) % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) || !(1 + p / 2 < 0)))) || 1 == 1 + p / 2) || !(p < 0))))) && ((0 == d % 2 || ((((((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || ((((0 == (p / 2 + 1) % 2 || 1 == 1 + (p / 2 + 1) / 2) || !(1 + p / 2 < 0)) || (((!(1 + (p / 2 + 1) / 2 < 0) || (((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && (A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2))))) || 0 == ((p / 2 + 1) / 2 + 1) % 2) && ((((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && (A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)))) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2))))) && ((1 == (p / 2 + 1) / 2 || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))) || (((0 == (p / 2 + 1) / 2 % 2 || !((p / 2 + 1) / 2 < 0)) || (((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && ((1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2))))) && (((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2)) || (((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && (A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2))))))))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((1 == (p / 2 + 1) / 2 || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))) || ((((A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))))) || ((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2))) && ((0 == (p / 2 + 1) / 2 % 2 || (((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)))) && (A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))))) || !((p / 2 + 1) / 2 < 0)))) && (((0 == (p / 2 + 1) % 2 || 1 == 1 + (p / 2 + 1) / 2) || !(1 + p / 2 < 0)) || (((!(1 + (p / 2 + 1) / 2 < 0) || ((A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))) || !((d / 2 + 1) / 2 < 0)) || 0 == (d / 2 + 1) / 2 % 2))) || 0 == ((p / 2 + 1) / 2 + 1) % 2) && (((A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))))) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2)))))))) || 0 == p % 2) || !(p < 0)) && ((((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((1 == p / 4 || (p / 2 < 0 && !(0 == p / 2 % 2))) || (((0 == p / 4 % 2 || (((A == (q + p / 2 + (1 + p / 8)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))) || !((d / 2 + 1) / 2 < 0)) || 0 == (d / 2 + 1) / 2 % 2) && (A == (q + p / 2 + (1 + p / 8)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))))) || !(p / 4 < 0)) && (((A == (q + p / 2 + p / 8) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + p / 2 + p / 8) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))))) || (p / 4 < 0 && !(0 == p / 4 % 2))))) && (((((((((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2)) || A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4))) && ((A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))) || !((d / 2 + 1) / 2 < 0)) || 0 == (d / 2 + 1) / 2 % 2)) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0)) && ((!(1 + p / 4 < 0) || 0 == (p / 4 + 1) % 2) || (((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)))) && (A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2)))))) || 0 == p / 2 % 2) || !(p / 2 < 0)) || 1 == 1 + p / 4))) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((((((A == (q + p / 2 + p / 8) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2))) && ((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + p / 2 + p / 8) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2)) || (p / 4 < 0 && !(0 == p / 4 % 2))) && (((((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + p / 2 + (1 + p / 8)) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && (A == (q + p / 2 + (1 + p / 8)) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)))) || 0 == p / 4 % 2) || !(p / 4 < 0))) || 1 == p / 4) || (p / 2 < 0 && !(0 == p / 2 % 2))) && (((0 == p / 2 % 2 || (((((1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)) || A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2))) && ((A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2))) || !(1 + (d / 2 + 1) / 2 < 0)) || 0 == ((d / 2 + 1) / 2 + 1) % 2)) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0)) && ((((A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2))) && ((A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2))) || !(1 + (d / 2 + 1) / 2 < 0)) || 0 == ((d / 2 + 1) / 2 + 1) % 2)) || !(1 + p / 4 < 0)) || 0 == (p / 4 + 1) % 2))) || !(p / 2 < 0)) || 1 == 1 + p / 4)))) || (p < 0 && !(0 == p % 2))))) || !(d < 0))) && p <= 1) && (1 == 2 * p || A == (q + 2 * (2 * p) + p) * B + (r + -(2 * (2 * d)) + -d))) && d == B) && ((((p < 0 && !(0 == p % 2)) || ((A == (q + 2 * p + 2 * p / 4) * B + (r + -(2 * d) + -(2 * d / 4)) || (d < 0 && !(0 == d % 2))) && ((A == (q + 2 * p + 2 * p / 4) * B + (r + -(2 * d) + (-1 + -(2 * d / 4))) || 0 == d % 2) || !(d < 0)))) && ((0 == p % 2 || (((0 == d % 2 || A == (q + 2 * p + (1 + 2 * p / 4)) * B + (r + -(2 * d) + (-1 + -(2 * d / 4)))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == (q + 2 * p + (1 + 2 * p / 4)) * B + (r + -(2 * d) + -(2 * d / 4))))) || !(p < 0))) || 1 == p)) && q + -4 == 1) && ((0 == d % 2 || (((1 == p / 2 || (((0 == p / 2 % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + (1 + p / 4)) * B + (r + -((d / 2 + 1) / 2))) && ((A == (q + (1 + p / 4)) * B + (r + (-1 + -((d / 2 + 1) / 2))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2))) || !(p / 2 < 0)) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p / 4) * B + (r + -((d / 2 + 1) / 2))) && ((A == (q + p / 4) * B + (r + (-1 + -((d / 2 + 1) / 2))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2))))) || (p < 0 && !(0 == p % 2))) && (((0 == p % 2 || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + (p / 2 + 1) / 2) * B + (r + -((d / 2 + 1) / 2))) && ((!(1 + d / 2 < 0) || A == (q + (p / 2 + 1) / 2) * B + (r + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2))) && ((0 == (p / 2 + 1) % 2 || (((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (q + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -((d / 2 + 1) / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + (1 + (p / 2 + 1) / 2)) * B + (r + -((d / 2 + 1) / 2))))) || !(1 + p / 2 < 0)))) || 1 == 1 + p / 2) || !(p < 0)))) || !(d < 0))) && q == 4 + p) && d == B * p) && ((((1 == p / 2 || (((((!(d / 2 < 0) || A == (q + p / 4) * B + (r + (-1 + -(d / 4)))) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p / 4) * B + (r + -(d / 4)))) || (p / 2 < 0 && !(0 == p / 2 % 2))) && ((0 == p / 2 % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + (1 + p / 4)) * B + (r + -(d / 4))) && ((A == (q + (1 + p / 4)) * B + (r + (-1 + -(d / 4))) || !(d / 2 < 0)) || 0 == d / 2 % 2))) || !(p / 2 < 0)))) || (p < 0 && !(0 == p % 2))) && (((0 == p % 2 || 1 == 1 + p / 2) || (((0 == (p / 2 + 1) % 2 || !(1 + p / 2 < 0)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 4))) && ((!(d / 2 < 0) || 0 == d / 2 % 2) || A == (q + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 4)))))) && ((((A == (q + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 4))) || !(d / 2 < 0)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + (p / 2 + 1) / 2) * B + (r + -(d / 4)))) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))))) || !(p < 0))) || (d < 0 && !(0 == d % 2))))) || ((((r == A && B == 1) && ((((((((((((((((((((((((((((A == B * 1 * q + r || (((((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 <= p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 <= 1 + p / 4))) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || !(p < 0)) || (((!(1 <= 1 + (p / 2 + 1) / 2) || 0 == (p / 2 + 1) % 2) || !(1 + p / 2 < 0)) && ((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || !(1 <= (p / 2 + 1) / 2)))))) || (((0 == d % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || !(B * 1 == (d / 2 + 1) / 2)) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || !(B * 1 == 1 + (d / 2 + 1) / 2)))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || !(B * 1 == 1 + d / 4)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || !(B * 1 == d / 4)))))) && (((((1 == p / 2 || (((0 == p / 2 % 2 || (((!(1 + d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + -((d / 2 + 1) / 2))))) || !(p / 2 < 0)) && ((((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (q + p + p / 4) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + -((d / 2 + 1) / 2)))) || (p / 2 < 0 && !(0 == p / 2 % 2))))) || (p < 0 && !(0 == p % 2))) && (((0 == p % 2 || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + -((d / 2 + 1) / 2))) && ((!(1 + d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2))) && ((0 == (p / 2 + 1) % 2 || ((A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + -((d / 2 + 1) / 2)) || (!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0)) && ((!(1 + d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2))) || !(1 + p / 2 < 0)))) || 1 == 1 + p / 2) || !(p < 0))) || 0 == d % 2) || !(d < 0))) && ((((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || 0 == d / 2 % 2) || B == 1 + d / 4) && ((!(0 == d / 2 % 2) && d / 2 < 0) || B == d / 4))) && ((0 == d % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || B == (d / 2 + 1) / 2) && ((B == 1 + (d / 2 + 1) / 2 || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2))) || !(d < 0))) || (((0 == p % 2 || !(p < 0)) || (((0 == (p / 2 + 1) % 2 || !(1 == 1 + (p / 2 + 1) / 2)) || !(1 + p / 2 < 0)) && (!(1 == (p / 2 + 1) / 2) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))))) && ((((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 == p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 == 1 + p / 4))) || (p < 0 && !(0 == p % 2)))))) && ((A == B * 1 * (q + 2 * (2 * p)) + (r + -(2 * (2 * d))) || !(B * 1 == d)) || !(1 <= p))) && (((((((((((((((((((((((((0 == p % 2 || A == (q + p + (1 + p / 2)) * B + (r + -d + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p + p / 2) * B + (r + -d + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0)) && ((((0 == p % 2 || 1 == 1 + p / 2) || (((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || A == (1 + d / 4) * (q + (1 + p / 2)) + (r + -(d / 2))) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == d / 4 * (q + (1 + p / 2)) + (r + -(d / 2))))) && ((0 == d % 2 || (((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (1 + (d / 2 + 1) / 2) * (q + (1 + p / 2)) + (r + (-1 + -(d / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (d / 2 + 1) / 2 * (q + (1 + p / 2)) + (r + (-1 + -(d / 2)))))) || !(d < 0)))) || !(p < 0)) || (((0 == (p / 2 + 1) % 2 || !(1 == 1 + (p / 2 + 1) / 2)) || !(1 + p / 2 < 0)) && (!(1 == (p / 2 + 1) / 2) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)))))) && 2 <= -d / -2) && r >= -d / -2) && A == (q + 2 * p + p) * B + (r + -(2 * d) + -d)) && (((1 == p / 2 || (((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 == p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 == 1 + p / 4)))) || (((0 == d % 2 || (((A == (1 + (d / 2 + 1) / 2) * (q + p / 2) + (r + (-1 + -(d / 2))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (d / 2 + 1) / 2 * (q + p / 2) + (r + (-1 + -(d / 2)))))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == d / 4 * (q + p / 2) + (r + -(d / 2))) && ((!(d / 2 < 0) || A == (1 + d / 4) * (q + p / 2) + (r + -(d / 2))) || 0 == d / 2 % 2))))) || (p < 0 && !(0 == p % 2)))) && ((1 == p || (((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r))) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && A == d * q + r) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && d % 2 == 0) && A == q * B + r) && ((0 == d % 2 || (((0 == p % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) || !(1 + p / 2 < 0)))) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) || !(1 + p / 2 < 0)))))) || !(p < 0)) && (((((((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || 0 == p / 2 % 2) || !(p / 2 < 0))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2)))))) || (p < 0 && !(0 == p % 2))))) || !(d < 0))) && A == (q + p) * B + (r + -d)) && ((((((((((A == (q + p) * B + (r + -d) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && A == d * q + r) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p) || (((((((((A == (q + p) * B + (r + -d) && (A == d * q + r || !(1 == p))) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p))) && ((((0 == d % 2 || B == 1 + d / 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || B == d / 2)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && (((((0 == d % 2 || !(d < 0)) || A == (1 + d / 2) * (q + p) + (r + -d)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * (q + p) + (r + -d))) || 1 == p) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || !(p < 0)) || A == (q + p + (1 + p / 2)) * B + (r + -d + -(d / 2))) && (A == (q + p + p / 2) * B + (r + -d + -(d / 2)) || (p < 0 && !(0 == p % 2)))))) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (!(1 == p) || B == d)) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + -(d / 4))) && ((0 == (p / 2 + 1) % 2 || !(1 + p / 2 < 0)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + -(d / 4))))) && ((!(d / 2 < 0) || (((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) || !(1 + p / 2 < 0)) && (A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + (-1 + -(d / 4))) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))))) || 0 == d / 2 % 2))) || !(p < 0)) && ((p < 0 && !(0 == p % 2)) || (((((A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + -(d / 4)) || 0 == p / 2 % 2) || !(p / 2 < 0)) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + -(d / 4)))) || (!(0 == d / 2 % 2) && d / 2 < 0)) && (((((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + (-1 + -(d / 4))))) || !(d / 2 < 0)) || 0 == d / 2 % 2)))))) || ((((((((((((((((((((((((0 == p % 2 || A == (q + p + (1 + p / 2)) * B + (r + -d + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p + p / 2) * B + (r + -d + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0)) && ((((0 == p % 2 || 1 == 1 + p / 2) || (((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || A == (1 + d / 4) * (q + (1 + p / 2)) + (r + -(d / 2))) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == d / 4 * (q + (1 + p / 2)) + (r + -(d / 2))))) && ((0 == d % 2 || (((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (1 + (d / 2 + 1) / 2) * (q + (1 + p / 2)) + (r + (-1 + -(d / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (d / 2 + 1) / 2 * (q + (1 + p / 2)) + (r + (-1 + -(d / 2)))))) || !(d < 0)))) || !(p < 0)) || (((0 == (p / 2 + 1) % 2 || !(1 == 1 + (p / 2 + 1) / 2)) || !(1 + p / 2 < 0)) && (!(1 == (p / 2 + 1) / 2) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)))))) && 2 <= -d / -2) && r >= -d / -2) && A == (q + 2 * p + p) * B + (r + -(2 * d) + -d)) && (((1 == p / 2 || (((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 == p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 == 1 + p / 4)))) || (((0 == d % 2 || (((A == (1 + (d / 2 + 1) / 2) * (q + p / 2) + (r + (-1 + -(d / 2))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (d / 2 + 1) / 2 * (q + p / 2) + (r + (-1 + -(d / 2)))))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == d / 4 * (q + p / 2) + (r + -(d / 2))) && ((!(d / 2 < 0) || A == (1 + d / 4) * (q + p / 2) + (r + -(d / 2))) || 0 == d / 2 % 2))))) || (p < 0 && !(0 == p % 2)))) && ((1 == p || (((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r))) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && d % 2 == 0) && A == q * B + r) && ((0 == d % 2 || (((0 == p % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) || !(1 + p / 2 < 0)))) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) || !(1 + p / 2 < 0)))))) || !(p < 0)) && (((((((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || 0 == p / 2 % 2) || !(p / 2 < 0))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2)))))) || (p < 0 && !(0 == p % 2))))) || !(d < 0))) && A == (q + p) * B + (r + -d)) && (A == d * q + r || !(1 == p))) && ((((((((((A == (q + p) * B + (r + -d) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && A == d * q + r) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p) || (((((((((A == (q + p) * B + (r + -d) && (A == d * q + r || !(1 == p))) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p))) && ((((0 == d % 2 || B == 1 + d / 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || B == d / 2)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && (((((0 == d % 2 || !(d < 0)) || A == (1 + d / 2) * (q + p) + (r + -d)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * (q + p) + (r + -d))) || 1 == p) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || !(p < 0)) || A == (q + p + (1 + p / 2)) * B + (r + -d + -(d / 2))) && (A == (q + p + p / 2) * B + (r + -d + -(d / 2)) || (p < 0 && !(0 == p % 2)))))) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (!(1 == p) || B == d)) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + -(d / 4))) && ((0 == (p / 2 + 1) % 2 || !(1 + p / 2 < 0)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + -(d / 4))))) && ((!(d / 2 < 0) || (((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) || !(1 + p / 2 < 0)) && (A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + (-1 + -(d / 4))) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))))) || 0 == d / 2 % 2))) || !(p < 0)) && ((p < 0 && !(0 == p % 2)) || (((((A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + -(d / 4)) || 0 == p / 2 % 2) || !(p / 2 < 0)) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + -(d / 4)))) || (!(0 == d / 2 % 2) && d / 2 < 0)) && (((((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + (-1 + -(d / 4))))) || !(d / 2 < 0)) || 0 == d / 2 % 2)))))))) && A == (q + p) * B + (r + -d)) && (A == d * q + r || !(1 == p))) && (1 == 2 * p || A == (q + 2 * (2 * p) + p) * B + (r + -(2 * (2 * d)) + -d))) && ((((p < 0 && !(0 == p % 2)) || ((A == (q + 2 * p + 2 * p / 4) * B + (r + -(2 * d) + -(2 * d / 4)) || (d < 0 && !(0 == d % 2))) && ((A == (q + 2 * p + 2 * p / 4) * B + (r + -(2 * d) + (-1 + -(2 * d / 4))) || 0 == d % 2) || !(d < 0)))) && ((0 == p % 2 || (((0 == d % 2 || A == (q + 2 * p + (1 + 2 * p / 4)) * B + (r + -(2 * d) + (-1 + -(2 * d / 4)))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == (q + 2 * p + (1 + 2 * p / 4)) * B + (r + -(2 * d) + -(2 * d / 4))))) || !(p < 0))) || 1 == p)) && ((0 == d % 2 || (((1 == p / 2 || (((0 == p / 2 % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + (1 + p / 4)) * B + (r + -((d / 2 + 1) / 2))) && ((A == (q + (1 + p / 4)) * B + (r + (-1 + -((d / 2 + 1) / 2))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2))) || !(p / 2 < 0)) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p / 4) * B + (r + -((d / 2 + 1) / 2))) && ((A == (q + p / 4) * B + (r + (-1 + -((d / 2 + 1) / 2))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2))))) || (p < 0 && !(0 == p % 2))) && (((0 == p % 2 || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + (p / 2 + 1) / 2) * B + (r + -((d / 2 + 1) / 2))) && ((!(1 + d / 2 < 0) || A == (q + (p / 2 + 1) / 2) * B + (r + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2))) && ((0 == (p / 2 + 1) % 2 || (((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (q + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -((d / 2 + 1) / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + (1 + (p / 2 + 1) / 2)) * B + (r + -((d / 2 + 1) / 2))))) || !(1 + p / 2 < 0)))) || 1 == 1 + p / 2) || !(p < 0)))) || !(d < 0))) && (((0 == p % 2 || ((((A == B * 1 * (q + (1 + p / 2)) + (r + (-1 + -(d / 2))) || 0 == d % 2) || (((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((!(B * 1 == 1 + ((d / 2 + 1) / 2 + 1) / 2) || !(1 + (d / 2 + 1) / 2 < 0)) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && ((1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || ((!(B * 1 == (d / 2 + 1) / 4) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((!((d / 2 + 1) / 2 < 0) || !(B * 1 == 1 + (d / 2 + 1) / 4)) || 0 == (d / 2 + 1) / 2 % 2))))) || !(d < 0)) && ((((((((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || !(B * 1 == (d / 4 + 1) / 2)) && ((0 == (d / 4 + 1) % 2 || !(1 + d / 4 < 0)) || !(B * 1 == 1 + (d / 4 + 1) / 2))) || !(d / 2 < 0)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || (((d / 4 < 0 && !(0 == d / 4 % 2)) || !(B * 1 == d / 8)) && ((0 == d / 4 % 2 || !(B * 1 == 1 + d / 8)) || !(d / 4 < 0))))) || (d < 0 && !(0 == d % 2))) || A == B * 1 * (q + (1 + p / 2)) + (r + -(d / 2))))) || !(p < 0)) || (((0 == (p / 2 + 1) % 2 || !(1 + p / 2 < 0)) || (((!(1 <= 1 + ((p / 2 + 1) / 2 + 1) / 2) || !(1 + (p / 2 + 1) / 2 < 0)) || 0 == ((p / 2 + 1) / 2 + 1) % 2) && (!(1 <= ((p / 2 + 1) / 2 + 1) / 2) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2))))) && ((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || ((((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2)) || !(1 <= (p / 2 + 1) / 4)) && ((!(1 <= 1 + (p / 2 + 1) / 4) || 0 == (p / 2 + 1) / 2 % 2) || !((p / 2 + 1) / 2 < 0))))))) && (((((((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 <= p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 <= 1 + p / 4))) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || !(p < 0)) || (((!(1 <= 1 + (p / 2 + 1) / 2) || 0 == (p / 2 + 1) % 2) || !(1 + p / 2 < 0)) && ((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || !(1 <= (p / 2 + 1) / 2))))) || (((0 == d % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || !(B * 1 == (d / 2 + 1) / 2)) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || !(B * 1 == 1 + (d / 2 + 1) / 2)))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || !(B * 1 == 1 + d / 4)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || !(B * 1 == d / 4)))))) || A == B * 1 * (q + p) + (r + -d))) && r == A) && B == 1) && (1 == p || (((((A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)) && (A == (q + p / 2) * B + (r + -(d / 2)) || (d < 0 && !(0 == d % 2)))) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || ((A == (q + (1 + p / 2)) * B + (r + -(d / 2)) || (d < 0 && !(0 == d % 2))) && ((A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)))) || !(p < 0))))) && ((A == B * 1 * (q + 2 * p) + (r + -(2 * d)) || (((d < 0 && !(0 == d % 2)) || !(B * 1 == 2 * d / 4)) && ((0 == d % 2 || !(d < 0)) || !(B * 1 == 1 + 2 * d / 4)))) || (((0 == p % 2 || !(p < 0)) || !(1 <= 1 + 2 * p / 4)) && (!(1 <= 2 * p / 4) || (p < 0 && !(0 == p % 2)))))) && ((d < 0 && !(0 == d % 2)) || ((((((!(d / 2 < 0) || ((((0 == (p / 2 + 1) % 2 || 1 == 1 + (p / 2 + 1) / 2) || !(1 + p / 2 < 0)) || (((((A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2))) || 0 == (d / 4 + 1) % 2) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + -(d / 2) + -((d / 4 + 1) / 2)))) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2))) && (((((0 == (d / 4 + 1) % 2 || A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2)))) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + -(d / 2) + -((d / 4 + 1) / 2)))) || !(1 + (p / 2 + 1) / 2 < 0)) || 0 == ((p / 2 + 1) / 2 + 1) % 2))) && ((1 == (p / 2 + 1) / 2 || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))) || (((0 == (p / 2 + 1) / 2 % 2 || !((p / 2 + 1) / 2 < 0)) || (((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + -(d / 2) + -((d / 4 + 1) / 2))) && ((0 == (d / 4 + 1) % 2 || !(1 + d / 4 < 0)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2)))))) && ((((0 == (d / 4 + 1) % 2 || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2)))) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + -(d / 2) + -((d / 4 + 1) / 2)))) || ((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2))))))) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || (((((((!(1 + (p / 2 + 1) / 2 < 0) || ((A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2))) && ((0 == d / 4 % 2 || A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0)))) || 0 == ((p / 2 + 1) / 2 + 1) % 2) && (((A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2))) && ((0 == d / 4 % 2 || A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0))) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2)))) || 0 == (p / 2 + 1) % 2) || 1 == 1 + (p / 2 + 1) / 2) || !(1 + p / 2 < 0)) && ((1 == (p / 2 + 1) / 2 || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))) || (((((0 == d / 4 % 2 || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0)) && (A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2)))) || ((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2))) && ((((A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2))) && ((0 == d / 4 % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0))) || 0 == (p / 2 + 1) / 2 % 2) || !((p / 2 + 1) / 2 < 0))))))) || 0 == p % 2) || !(p < 0)) && (((((((1 == p / 4 || (p / 2 < 0 && !(0 == p / 2 % 2))) || (((((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + p / 2 + p / 8) * B + (r + -(d / 2) + -((d / 4 + 1) / 2))) && ((A == (q + p / 2 + p / 8) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2))) || 0 == (d / 4 + 1) % 2) || !(1 + d / 4 < 0))) || (p / 4 < 0 && !(0 == p / 4 % 2))) && ((0 == p / 4 % 2 || (((A == (q + p / 2 + (1 + p / 8)) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2))) || 0 == (d / 4 + 1) % 2) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + p / 2 + (1 + p / 8)) * B + (r + -(d / 2) + -((d / 4 + 1) / 2))))) || !(p / 4 < 0)))) && (((0 == p / 2 % 2 || !(p / 2 < 0)) || (((!(1 + p / 4 < 0) || 0 == (p / 4 + 1) % 2) || (((0 == (d / 4 + 1) % 2 || !(1 + d / 4 < 0)) || A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2)))) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + -(d / 2) + -((d / 4 + 1) / 2))))) && ((((A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2))) || 0 == (d / 4 + 1) % 2) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + -(d / 2) + -((d / 4 + 1) / 2)))) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0)))) || 1 == 1 + p / 4)) || !(d / 2 < 0)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || ((((0 == p / 2 % 2 || ((((((0 == d / 4 % 2 || A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0)) && (A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2)))) || !(1 + p / 4 < 0)) || 0 == (p / 4 + 1) % 2) && ((((A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + -(d / 2) + (-1 + -(d / 8))) || 0 == d / 4 % 2) || !(d / 4 < 0)) && (A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2)))) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0)))) || !(p / 2 < 0)) || 1 == 1 + p / 4) && ((1 == p / 4 || (p / 2 < 0 && !(0 == p / 2 % 2))) || (((((0 == d / 4 % 2 || A == (q + p / 2 + p / 8) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0)) && (A == (q + p / 2 + p / 8) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2)))) || (p / 4 < 0 && !(0 == p / 4 % 2))) && ((0 == p / 4 % 2 || (((0 == d / 4 % 2 || !(d / 4 < 0)) || A == (q + p / 2 + (1 + p / 8)) * B + (r + -(d / 2) + (-1 + -(d / 8)))) && (A == (q + p / 2 + (1 + p / 8)) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2))))) || !(p / 4 < 0))))))) || (p < 0 && !(0 == p % 2)))))) && (((((((((((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || !(B * 1 == (d / 4 + 1) / 2)) && ((0 == (d / 4 + 1) % 2 || !(1 + d / 4 < 0)) || !(B * 1 == 1 + (d / 4 + 1) / 2))) || !(d / 2 < 0)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || (((d / 4 < 0 && !(0 == d / 4 % 2)) || !(B * 1 == d / 8)) && ((0 == d / 4 % 2 || !(B * 1 == 1 + d / 8)) || !(d / 4 < 0))))) || A == B * 1 * (q + p / 2) + (r + -(d / 2))) || (d < 0 && !(0 == d % 2))) && (((0 == d % 2 || A == B * 1 * (q + p / 2) + (r + (-1 + -(d / 2)))) || (((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((!(B * 1 == 1 + ((d / 2 + 1) / 2 + 1) / 2) || !(1 + (d / 2 + 1) / 2 < 0)) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && ((1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || ((!(B * 1 == (d / 2 + 1) / 4) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((!((d / 2 + 1) / 2 < 0) || !(B * 1 == 1 + (d / 2 + 1) / 4)) || 0 == (d / 2 + 1) / 2 % 2))))) || !(d < 0))) || (p < 0 && !(0 == p % 2))) || (((p / 2 < 0 && !(0 == p / 2 % 2)) || (((0 == p / 4 % 2 || !(1 <= 1 + p / 8)) || !(p / 4 < 0)) && (!(1 <= p / 8) || (!(0 == p / 4 % 2) && p / 4 < 0)))) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || (((!(1 <= 1 + (p / 4 + 1) / 2) || 0 == (p / 4 + 1) % 2) || !(1 + p / 4 < 0)) && (!(1 <= (p / 4 + 1) / 2) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0))))))) && A == q * B + r) && ((d < 0 && !(0 == d % 2)) || (((1 == p / 2 || (p < 0 && !(0 == p % 2))) || (((p / 2 < 0 && !(0 == p / 2 % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) && (((((!(d / 2 < 0) || 0 == d / 2 % 2) || A == (q + p + (1 + p / 4)) * B + (r + -d + (-1 + -(d / 4)))) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + -(d / 4)))) || 0 == p / 2 % 2) || !(p / 2 < 0)))) && (((0 == p % 2 || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) && ((0 == (p / 2 + 1) % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) || !(1 + p / 2 < 0)))) || 1 == 1 + p / 2) || !(p < 0))))) && ((((0 == d % 2 || B == 1 + d / 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || B == d / 2)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && ((0 == d % 2 || ((((((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || ((((0 == (p / 2 + 1) % 2 || 1 == 1 + (p / 2 + 1) / 2) || !(1 + p / 2 < 0)) || (((!(1 + (p / 2 + 1) / 2 < 0) || (((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && (A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2))))) || 0 == ((p / 2 + 1) / 2 + 1) % 2) && ((((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && (A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)))) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2))))) && ((1 == (p / 2 + 1) / 2 || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))) || (((0 == (p / 2 + 1) / 2 % 2 || !((p / 2 + 1) / 2 < 0)) || (((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && ((1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2))))) && (((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2)) || (((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && (A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2))))))))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((1 == (p / 2 + 1) / 2 || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))) || ((((A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))))) || ((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2))) && ((0 == (p / 2 + 1) / 2 % 2 || (((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)))) && (A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))))) || !((p / 2 + 1) / 2 < 0)))) && (((0 == (p / 2 + 1) % 2 || 1 == 1 + (p / 2 + 1) / 2) || !(1 + p / 2 < 0)) || (((!(1 + (p / 2 + 1) / 2 < 0) || ((A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))) || !((d / 2 + 1) / 2 < 0)) || 0 == (d / 2 + 1) / 2 % 2))) || 0 == ((p / 2 + 1) / 2 + 1) % 2) && (((A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))))) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2)))))))) || 0 == p % 2) || !(p < 0)) && ((((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((1 == p / 4 || (p / 2 < 0 && !(0 == p / 2 % 2))) || (((0 == p / 4 % 2 || (((A == (q + p / 2 + (1 + p / 8)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))) || !((d / 2 + 1) / 2 < 0)) || 0 == (d / 2 + 1) / 2 % 2) && (A == (q + p / 2 + (1 + p / 8)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))))) || !(p / 4 < 0)) && (((A == (q + p / 2 + p / 8) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + p / 2 + p / 8) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))))) || (p / 4 < 0 && !(0 == p / 4 % 2))))) && (((((((((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2)) || A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4))) && ((A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))) || !((d / 2 + 1) / 2 < 0)) || 0 == (d / 2 + 1) / 2 % 2)) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0)) && ((!(1 + p / 4 < 0) || 0 == (p / 4 + 1) % 2) || (((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)))) && (A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2)))))) || 0 == p / 2 % 2) || !(p / 2 < 0)) || 1 == 1 + p / 4))) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((((((A == (q + p / 2 + p / 8) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2))) && ((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + p / 2 + p / 8) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2)) || (p / 4 < 0 && !(0 == p / 4 % 2))) && (((((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + p / 2 + (1 + p / 8)) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && (A == (q + p / 2 + (1 + p / 8)) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)))) || 0 == p / 4 % 2) || !(p / 4 < 0))) || 1 == p / 4) || (p / 2 < 0 && !(0 == p / 2 % 2))) && (((0 == p / 2 % 2 || (((((1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)) || A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2))) && ((A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2))) || !(1 + (d / 2 + 1) / 2 < 0)) || 0 == ((d / 2 + 1) / 2 + 1) % 2)) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0)) && ((((A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2))) && ((A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2))) || !(1 + (d / 2 + 1) / 2 < 0)) || 0 == ((d / 2 + 1) / 2 + 1) % 2)) || !(1 + p / 4 < 0)) || 0 == (p / 4 + 1) % 2))) || !(p / 2 < 0)) || 1 == 1 + p / 4)))) || (p < 0 && !(0 == p % 2))))) || !(d < 0))) && (!(1 == p) || B == d)) && d == B * p) && ((A == B * 1 * q + r || ((!(B * 1 == d / 2) || (d < 0 && !(0 == d % 2))) && ((0 == d % 2 || !(B * 1 == 1 + d / 2)) || !(d < 0)))) || (((!(1 <= 1 + p / 2) || 0 == p % 2) || !(p < 0)) && (!(1 <= p / 2) || (p < 0 && !(0 == p % 2)))))) && ((((1 == p / 2 || (((((!(d / 2 < 0) || A == (q + p / 4) * B + (r + (-1 + -(d / 4)))) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p / 4) * B + (r + -(d / 4)))) || (p / 2 < 0 && !(0 == p / 2 % 2))) && ((0 == p / 2 % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + (1 + p / 4)) * B + (r + -(d / 4))) && ((A == (q + (1 + p / 4)) * B + (r + (-1 + -(d / 4))) || !(d / 2 < 0)) || 0 == d / 2 % 2))) || !(p / 2 < 0)))) || (p < 0 && !(0 == p % 2))) && (((0 == p % 2 || 1 == 1 + p / 2) || (((0 == (p / 2 + 1) % 2 || !(1 + p / 2 < 0)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 4))) && ((!(d / 2 < 0) || 0 == d / 2 % 2) || A == (q + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 4)))))) && ((((A == (q + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 4))) || !(d / 2 < 0)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + (p / 2 + 1) / 2) * B + (r + -(d / 4)))) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) || (((((((((((((((((((((((((((A == B * 1 * q + r || (((((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 <= p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 <= 1 + p / 4))) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || !(p < 0)) || (((!(1 <= 1 + (p / 2 + 1) / 2) || 0 == (p / 2 + 1) % 2) || !(1 + p / 2 < 0)) && ((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || !(1 <= (p / 2 + 1) / 2)))))) || (((0 == d % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || !(B * 1 == (d / 2 + 1) / 2)) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || !(B * 1 == 1 + (d / 2 + 1) / 2)))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || !(B * 1 == 1 + d / 4)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || !(B * 1 == d / 4)))))) && (((((1 == p / 2 || (((0 == p / 2 % 2 || (((!(1 + d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + -((d / 2 + 1) / 2))))) || !(p / 2 < 0)) && ((((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (q + p + p / 4) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + -((d / 2 + 1) / 2)))) || (p / 2 < 0 && !(0 == p / 2 % 2))))) || (p < 0 && !(0 == p % 2))) && (((0 == p % 2 || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + -((d / 2 + 1) / 2))) && ((!(1 + d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2))) && ((0 == (p / 2 + 1) % 2 || ((A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + -((d / 2 + 1) / 2)) || (!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0)) && ((!(1 + d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2))) || !(1 + p / 2 < 0)))) || 1 == 1 + p / 2) || !(p < 0))) || 0 == d % 2) || !(d < 0))) && ((((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || 0 == d / 2 % 2) || B == 1 + d / 4) && ((!(0 == d / 2 % 2) && d / 2 < 0) || B == d / 4))) && ((0 == d % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || B == (d / 2 + 1) / 2) && ((B == 1 + (d / 2 + 1) / 2 || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2))) || !(d < 0))) || (((0 == p % 2 || !(p < 0)) || (((0 == (p / 2 + 1) % 2 || !(1 == 1 + (p / 2 + 1) / 2)) || !(1 + p / 2 < 0)) && (!(1 == (p / 2 + 1) / 2) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))))) && ((((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 == p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 == 1 + p / 4))) || (p < 0 && !(0 == p % 2)))))) && ((A == B * 1 * (q + 2 * (2 * p)) + (r + -(2 * (2 * d))) || !(B * 1 == d)) || !(1 <= p))) && (((((((((((((((((((((((((0 == p % 2 || A == (q + p + (1 + p / 2)) * B + (r + -d + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p + p / 2) * B + (r + -d + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0)) && ((((0 == p % 2 || 1 == 1 + p / 2) || (((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || A == (1 + d / 4) * (q + (1 + p / 2)) + (r + -(d / 2))) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == d / 4 * (q + (1 + p / 2)) + (r + -(d / 2))))) && ((0 == d % 2 || (((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (1 + (d / 2 + 1) / 2) * (q + (1 + p / 2)) + (r + (-1 + -(d / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (d / 2 + 1) / 2 * (q + (1 + p / 2)) + (r + (-1 + -(d / 2)))))) || !(d < 0)))) || !(p < 0)) || (((0 == (p / 2 + 1) % 2 || !(1 == 1 + (p / 2 + 1) / 2)) || !(1 + p / 2 < 0)) && (!(1 == (p / 2 + 1) / 2) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)))))) && 2 <= -d / -2) && r >= -d / -2) && A == (q + 2 * p + p) * B + (r + -(2 * d) + -d)) && (((1 == p / 2 || (((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 == p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 == 1 + p / 4)))) || (((0 == d % 2 || (((A == (1 + (d / 2 + 1) / 2) * (q + p / 2) + (r + (-1 + -(d / 2))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (d / 2 + 1) / 2 * (q + p / 2) + (r + (-1 + -(d / 2)))))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == d / 4 * (q + p / 2) + (r + -(d / 2))) && ((!(d / 2 < 0) || A == (1 + d / 4) * (q + p / 2) + (r + -(d / 2))) || 0 == d / 2 % 2))))) || (p < 0 && !(0 == p % 2)))) && ((1 == p || (((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r))) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && A == d * q + r) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && d % 2 == 0) && A == q * B + r) && ((0 == d % 2 || (((0 == p % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) || !(1 + p / 2 < 0)))) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) || !(1 + p / 2 < 0)))))) || !(p < 0)) && (((((((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || 0 == p / 2 % 2) || !(p / 2 < 0))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2)))))) || (p < 0 && !(0 == p % 2))))) || !(d < 0))) && A == (q + p) * B + (r + -d)) && ((((((((((A == (q + p) * B + (r + -d) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && A == d * q + r) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p) || (((((((((A == (q + p) * B + (r + -d) && (A == d * q + r || !(1 == p))) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p))) && ((((0 == d % 2 || B == 1 + d / 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || B == d / 2)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && (((((0 == d % 2 || !(d < 0)) || A == (1 + d / 2) * (q + p) + (r + -d)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * (q + p) + (r + -d))) || 1 == p) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || !(p < 0)) || A == (q + p + (1 + p / 2)) * B + (r + -d + -(d / 2))) && (A == (q + p + p / 2) * B + (r + -d + -(d / 2)) || (p < 0 && !(0 == p % 2)))))) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (!(1 == p) || B == d)) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + -(d / 4))) && ((0 == (p / 2 + 1) % 2 || !(1 + p / 2 < 0)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + -(d / 4))))) && ((!(d / 2 < 0) || (((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) || !(1 + p / 2 < 0)) && (A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + (-1 + -(d / 4))) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))))) || 0 == d / 2 % 2))) || !(p < 0)) && ((p < 0 && !(0 == p % 2)) || (((((A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + -(d / 4)) || 0 == p / 2 % 2) || !(p / 2 < 0)) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + -(d / 4)))) || (!(0 == d / 2 % 2) && d / 2 < 0)) && (((((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + (-1 + -(d / 4))))) || !(d / 2 < 0)) || 0 == d / 2 % 2)))))) || ((((((((((((((((((((((((0 == p % 2 || A == (q + p + (1 + p / 2)) * B + (r + -d + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p + p / 2) * B + (r + -d + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0)) && ((((0 == p % 2 || 1 == 1 + p / 2) || (((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || A == (1 + d / 4) * (q + (1 + p / 2)) + (r + -(d / 2))) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == d / 4 * (q + (1 + p / 2)) + (r + -(d / 2))))) && ((0 == d % 2 || (((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (1 + (d / 2 + 1) / 2) * (q + (1 + p / 2)) + (r + (-1 + -(d / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (d / 2 + 1) / 2 * (q + (1 + p / 2)) + (r + (-1 + -(d / 2)))))) || !(d < 0)))) || !(p < 0)) || (((0 == (p / 2 + 1) % 2 || !(1 == 1 + (p / 2 + 1) / 2)) || !(1 + p / 2 < 0)) && (!(1 == (p / 2 + 1) / 2) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)))))) && 2 <= -d / -2) && r >= -d / -2) && A == (q + 2 * p + p) * B + (r + -(2 * d) + -d)) && (((1 == p / 2 || (((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 == p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 == 1 + p / 4)))) || (((0 == d % 2 || (((A == (1 + (d / 2 + 1) / 2) * (q + p / 2) + (r + (-1 + -(d / 2))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (d / 2 + 1) / 2 * (q + p / 2) + (r + (-1 + -(d / 2)))))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == d / 4 * (q + p / 2) + (r + -(d / 2))) && ((!(d / 2 < 0) || A == (1 + d / 4) * (q + p / 2) + (r + -(d / 2))) || 0 == d / 2 % 2))))) || (p < 0 && !(0 == p % 2)))) && ((1 == p || (((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r))) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && d % 2 == 0) && A == q * B + r) && ((0 == d % 2 || (((0 == p % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) || !(1 + p / 2 < 0)))) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) || !(1 + p / 2 < 0)))))) || !(p < 0)) && (((((((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || 0 == p / 2 % 2) || !(p / 2 < 0))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2)))))) || (p < 0 && !(0 == p % 2))))) || !(d < 0))) && A == (q + p) * B + (r + -d)) && (A == d * q + r || !(1 == p))) && ((((((((((A == (q + p) * B + (r + -d) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && A == d * q + r) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p) || (((((((((A == (q + p) * B + (r + -d) && (A == d * q + r || !(1 == p))) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p))) && ((((0 == d % 2 || B == 1 + d / 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || B == d / 2)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && (((((0 == d % 2 || !(d < 0)) || A == (1 + d / 2) * (q + p) + (r + -d)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * (q + p) + (r + -d))) || 1 == p) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || !(p < 0)) || A == (q + p + (1 + p / 2)) * B + (r + -d + -(d / 2))) && (A == (q + p + p / 2) * B + (r + -d + -(d / 2)) || (p < 0 && !(0 == p % 2)))))) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (!(1 == p) || B == d)) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + -(d / 4))) && ((0 == (p / 2 + 1) % 2 || !(1 + p / 2 < 0)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + -(d / 4))))) && ((!(d / 2 < 0) || (((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) || !(1 + p / 2 < 0)) && (A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + (-1 + -(d / 4))) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))))) || 0 == d / 2 % 2))) || !(p < 0)) && ((p < 0 && !(0 == p % 2)) || (((((A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + -(d / 4)) || 0 == p / 2 % 2) || !(p / 2 < 0)) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + -(d / 4)))) || (!(0 == d / 2 % 2) && d / 2 < 0)) && (((((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + (-1 + -(d / 4))))) || !(d / 2 < 0)) || 0 == d / 2 % 2)))))))) && A == (q + p) * B + (r + -d)) && (1 == 2 * p || A == (q + 2 * (2 * p) + p) * B + (r + -(2 * (2 * d)) + -d))) && ((((p < 0 && !(0 == p % 2)) || ((A == (q + 2 * p + 2 * p / 4) * B + (r + -(2 * d) + -(2 * d / 4)) || (d < 0 && !(0 == d % 2))) && ((A == (q + 2 * p + 2 * p / 4) * B + (r + -(2 * d) + (-1 + -(2 * d / 4))) || 0 == d % 2) || !(d < 0)))) && ((0 == p % 2 || (((0 == d % 2 || A == (q + 2 * p + (1 + 2 * p / 4)) * B + (r + -(2 * d) + (-1 + -(2 * d / 4)))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == (q + 2 * p + (1 + 2 * p / 4)) * B + (r + -(2 * d) + -(2 * d / 4))))) || !(p < 0))) || 1 == p)) && ((0 == d % 2 || (((1 == p / 2 || (((0 == p / 2 % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + (1 + p / 4)) * B + (r + -((d / 2 + 1) / 2))) && ((A == (q + (1 + p / 4)) * B + (r + (-1 + -((d / 2 + 1) / 2))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2))) || !(p / 2 < 0)) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p / 4) * B + (r + -((d / 2 + 1) / 2))) && ((A == (q + p / 4) * B + (r + (-1 + -((d / 2 + 1) / 2))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2))))) || (p < 0 && !(0 == p % 2))) && (((0 == p % 2 || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + (p / 2 + 1) / 2) * B + (r + -((d / 2 + 1) / 2))) && ((!(1 + d / 2 < 0) || A == (q + (p / 2 + 1) / 2) * B + (r + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2))) && ((0 == (p / 2 + 1) % 2 || (((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (q + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -((d / 2 + 1) / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + (1 + (p / 2 + 1) / 2)) * B + (r + -((d / 2 + 1) / 2))))) || !(1 + p / 2 < 0)))) || 1 == 1 + p / 2) || !(p < 0)))) || !(d < 0))) && (((0 == p % 2 || ((((A == B * 1 * (q + (1 + p / 2)) + (r + (-1 + -(d / 2))) || 0 == d % 2) || (((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((!(B * 1 == 1 + ((d / 2 + 1) / 2 + 1) / 2) || !(1 + (d / 2 + 1) / 2 < 0)) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && ((1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || ((!(B * 1 == (d / 2 + 1) / 4) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((!((d / 2 + 1) / 2 < 0) || !(B * 1 == 1 + (d / 2 + 1) / 4)) || 0 == (d / 2 + 1) / 2 % 2))))) || !(d < 0)) && ((((((((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || !(B * 1 == (d / 4 + 1) / 2)) && ((0 == (d / 4 + 1) % 2 || !(1 + d / 4 < 0)) || !(B * 1 == 1 + (d / 4 + 1) / 2))) || !(d / 2 < 0)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || (((d / 4 < 0 && !(0 == d / 4 % 2)) || !(B * 1 == d / 8)) && ((0 == d / 4 % 2 || !(B * 1 == 1 + d / 8)) || !(d / 4 < 0))))) || (d < 0 && !(0 == d % 2))) || A == B * 1 * (q + (1 + p / 2)) + (r + -(d / 2))))) || !(p < 0)) || (((0 == (p / 2 + 1) % 2 || !(1 + p / 2 < 0)) || (((!(1 <= 1 + ((p / 2 + 1) / 2 + 1) / 2) || !(1 + (p / 2 + 1) / 2 < 0)) || 0 == ((p / 2 + 1) / 2 + 1) % 2) && (!(1 <= ((p / 2 + 1) / 2 + 1) / 2) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2))))) && ((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || ((((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2)) || !(1 <= (p / 2 + 1) / 4)) && ((!(1 <= 1 + (p / 2 + 1) / 4) || 0 == (p / 2 + 1) / 2 % 2) || !((p / 2 + 1) / 2 < 0))))))) && A == d * q + r) && (((((((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 <= p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 <= 1 + p / 4))) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || !(p < 0)) || (((!(1 <= 1 + (p / 2 + 1) / 2) || 0 == (p / 2 + 1) % 2) || !(1 + p / 2 < 0)) && ((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || !(1 <= (p / 2 + 1) / 2))))) || (((0 == d % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || !(B * 1 == (d / 2 + 1) / 2)) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || !(B * 1 == 1 + (d / 2 + 1) / 2)))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || !(B * 1 == 1 + d / 4)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || !(B * 1 == d / 4)))))) || A == B * 1 * (q + p) + (r + -d))) && r == A) && B == 1) && (1 == p || (((((A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)) && (A == (q + p / 2) * B + (r + -(d / 2)) || (d < 0 && !(0 == d % 2)))) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || ((A == (q + (1 + p / 2)) * B + (r + -(d / 2)) || (d < 0 && !(0 == d % 2))) && ((A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)))) || !(p < 0))))) && ((A == B * 1 * (q + 2 * p) + (r + -(2 * d)) || (((d < 0 && !(0 == d % 2)) || !(B * 1 == 2 * d / 4)) && ((0 == d % 2 || !(d < 0)) || !(B * 1 == 1 + 2 * d / 4)))) || (((0 == p % 2 || !(p < 0)) || !(1 <= 1 + 2 * p / 4)) && (!(1 <= 2 * p / 4) || (p < 0 && !(0 == p % 2)))))) && ((d < 0 && !(0 == d % 2)) || ((((((!(d / 2 < 0) || ((((0 == (p / 2 + 1) % 2 || 1 == 1 + (p / 2 + 1) / 2) || !(1 + p / 2 < 0)) || (((((A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2))) || 0 == (d / 4 + 1) % 2) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + -(d / 2) + -((d / 4 + 1) / 2)))) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2))) && (((((0 == (d / 4 + 1) % 2 || A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2)))) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + -(d / 2) + -((d / 4 + 1) / 2)))) || !(1 + (p / 2 + 1) / 2 < 0)) || 0 == ((p / 2 + 1) / 2 + 1) % 2))) && ((1 == (p / 2 + 1) / 2 || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))) || (((0 == (p / 2 + 1) / 2 % 2 || !((p / 2 + 1) / 2 < 0)) || (((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + -(d / 2) + -((d / 4 + 1) / 2))) && ((0 == (d / 4 + 1) % 2 || !(1 + d / 4 < 0)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2)))))) && ((((0 == (d / 4 + 1) % 2 || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2)))) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + -(d / 2) + -((d / 4 + 1) / 2)))) || ((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2))))))) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || (((((((!(1 + (p / 2 + 1) / 2 < 0) || ((A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2))) && ((0 == d / 4 % 2 || A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0)))) || 0 == ((p / 2 + 1) / 2 + 1) % 2) && (((A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2))) && ((0 == d / 4 % 2 || A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0))) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2)))) || 0 == (p / 2 + 1) % 2) || 1 == 1 + (p / 2 + 1) / 2) || !(1 + p / 2 < 0)) && ((1 == (p / 2 + 1) / 2 || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))) || (((((0 == d / 4 % 2 || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0)) && (A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2)))) || ((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2))) && ((((A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2))) && ((0 == d / 4 % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0))) || 0 == (p / 2 + 1) / 2 % 2) || !((p / 2 + 1) / 2 < 0))))))) || 0 == p % 2) || !(p < 0)) && (((((((1 == p / 4 || (p / 2 < 0 && !(0 == p / 2 % 2))) || (((((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + p / 2 + p / 8) * B + (r + -(d / 2) + -((d / 4 + 1) / 2))) && ((A == (q + p / 2 + p / 8) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2))) || 0 == (d / 4 + 1) % 2) || !(1 + d / 4 < 0))) || (p / 4 < 0 && !(0 == p / 4 % 2))) && ((0 == p / 4 % 2 || (((A == (q + p / 2 + (1 + p / 8)) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2))) || 0 == (d / 4 + 1) % 2) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + p / 2 + (1 + p / 8)) * B + (r + -(d / 2) + -((d / 4 + 1) / 2))))) || !(p / 4 < 0)))) && (((0 == p / 2 % 2 || !(p / 2 < 0)) || (((!(1 + p / 4 < 0) || 0 == (p / 4 + 1) % 2) || (((0 == (d / 4 + 1) % 2 || !(1 + d / 4 < 0)) || A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2)))) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + -(d / 2) + -((d / 4 + 1) / 2))))) && ((((A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2))) || 0 == (d / 4 + 1) % 2) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + -(d / 2) + -((d / 4 + 1) / 2)))) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0)))) || 1 == 1 + p / 4)) || !(d / 2 < 0)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || ((((0 == p / 2 % 2 || ((((((0 == d / 4 % 2 || A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0)) && (A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2)))) || !(1 + p / 4 < 0)) || 0 == (p / 4 + 1) % 2) && ((((A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + -(d / 2) + (-1 + -(d / 8))) || 0 == d / 4 % 2) || !(d / 4 < 0)) && (A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2)))) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0)))) || !(p / 2 < 0)) || 1 == 1 + p / 4) && ((1 == p / 4 || (p / 2 < 0 && !(0 == p / 2 % 2))) || (((((0 == d / 4 % 2 || A == (q + p / 2 + p / 8) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0)) && (A == (q + p / 2 + p / 8) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2)))) || (p / 4 < 0 && !(0 == p / 4 % 2))) && ((0 == p / 4 % 2 || (((0 == d / 4 % 2 || !(d / 4 < 0)) || A == (q + p / 2 + (1 + p / 8)) * B + (r + -(d / 2) + (-1 + -(d / 8)))) && (A == (q + p / 2 + (1 + p / 8)) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2))))) || !(p / 4 < 0))))))) || (p < 0 && !(0 == p % 2)))))) && (((((((((((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || !(B * 1 == (d / 4 + 1) / 2)) && ((0 == (d / 4 + 1) % 2 || !(1 + d / 4 < 0)) || !(B * 1 == 1 + (d / 4 + 1) / 2))) || !(d / 2 < 0)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || (((d / 4 < 0 && !(0 == d / 4 % 2)) || !(B * 1 == d / 8)) && ((0 == d / 4 % 2 || !(B * 1 == 1 + d / 8)) || !(d / 4 < 0))))) || A == B * 1 * (q + p / 2) + (r + -(d / 2))) || (d < 0 && !(0 == d % 2))) && (((0 == d % 2 || A == B * 1 * (q + p / 2) + (r + (-1 + -(d / 2)))) || (((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((!(B * 1 == 1 + ((d / 2 + 1) / 2 + 1) / 2) || !(1 + (d / 2 + 1) / 2 < 0)) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && ((1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || ((!(B * 1 == (d / 2 + 1) / 4) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((!((d / 2 + 1) / 2 < 0) || !(B * 1 == 1 + (d / 2 + 1) / 4)) || 0 == (d / 2 + 1) / 2 % 2))))) || !(d < 0))) || (p < 0 && !(0 == p % 2))) || (((p / 2 < 0 && !(0 == p / 2 % 2)) || (((0 == p / 4 % 2 || !(1 <= 1 + p / 8)) || !(p / 4 < 0)) && (!(1 <= p / 8) || (!(0 == p / 4 % 2) && p / 4 < 0)))) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || (((!(1 <= 1 + (p / 4 + 1) / 2) || 0 == (p / 4 + 1) % 2) || !(1 + p / 4 < 0)) && (!(1 <= (p / 4 + 1) / 2) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0))))))) && A == q * B + r) && ((d < 0 && !(0 == d % 2)) || (((1 == p / 2 || (p < 0 && !(0 == p % 2))) || (((p / 2 < 0 && !(0 == p / 2 % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) && (((((!(d / 2 < 0) || 0 == d / 2 % 2) || A == (q + p + (1 + p / 4)) * B + (r + -d + (-1 + -(d / 4)))) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + -(d / 4)))) || 0 == p / 2 % 2) || !(p / 2 < 0)))) && (((0 == p % 2 || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) && ((0 == (p / 2 + 1) % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) || !(1 + p / 2 < 0)))) || 1 == 1 + p / 2) || !(p < 0))))) && ((((0 == d % 2 || B == 1 + d / 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || B == d / 2)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && ((0 == d % 2 || ((((((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || ((((0 == (p / 2 + 1) % 2 || 1 == 1 + (p / 2 + 1) / 2) || !(1 + p / 2 < 0)) || (((!(1 + (p / 2 + 1) / 2 < 0) || (((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && (A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2))))) || 0 == ((p / 2 + 1) / 2 + 1) % 2) && ((((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && (A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)))) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2))))) && ((1 == (p / 2 + 1) / 2 || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))) || (((0 == (p / 2 + 1) / 2 % 2 || !((p / 2 + 1) / 2 < 0)) || (((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && ((1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2))))) && (((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2)) || (((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && (A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2))))))))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((1 == (p / 2 + 1) / 2 || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))) || ((((A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))))) || ((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2))) && ((0 == (p / 2 + 1) / 2 % 2 || (((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)))) && (A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))))) || !((p / 2 + 1) / 2 < 0)))) && (((0 == (p / 2 + 1) % 2 || 1 == 1 + (p / 2 + 1) / 2) || !(1 + p / 2 < 0)) || (((!(1 + (p / 2 + 1) / 2 < 0) || ((A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))) || !((d / 2 + 1) / 2 < 0)) || 0 == (d / 2 + 1) / 2 % 2))) || 0 == ((p / 2 + 1) / 2 + 1) % 2) && (((A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))))) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2)))))))) || 0 == p % 2) || !(p < 0)) && ((((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((1 == p / 4 || (p / 2 < 0 && !(0 == p / 2 % 2))) || (((0 == p / 4 % 2 || (((A == (q + p / 2 + (1 + p / 8)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))) || !((d / 2 + 1) / 2 < 0)) || 0 == (d / 2 + 1) / 2 % 2) && (A == (q + p / 2 + (1 + p / 8)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))))) || !(p / 4 < 0)) && (((A == (q + p / 2 + p / 8) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + p / 2 + p / 8) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))))) || (p / 4 < 0 && !(0 == p / 4 % 2))))) && (((((((((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2)) || A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4))) && ((A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))) || !((d / 2 + 1) / 2 < 0)) || 0 == (d / 2 + 1) / 2 % 2)) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0)) && ((!(1 + p / 4 < 0) || 0 == (p / 4 + 1) % 2) || (((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)))) && (A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2)))))) || 0 == p / 2 % 2) || !(p / 2 < 0)) || 1 == 1 + p / 4))) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((((((A == (q + p / 2 + p / 8) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2))) && ((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + p / 2 + p / 8) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2)) || (p / 4 < 0 && !(0 == p / 4 % 2))) && (((((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + p / 2 + (1 + p / 8)) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && (A == (q + p / 2 + (1 + p / 8)) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)))) || 0 == p / 4 % 2) || !(p / 4 < 0))) || 1 == p / 4) || (p / 2 < 0 && !(0 == p / 2 % 2))) && (((0 == p / 2 % 2 || (((((1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)) || A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2))) && ((A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2))) || !(1 + (d / 2 + 1) / 2 < 0)) || 0 == ((d / 2 + 1) / 2 + 1) % 2)) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0)) && ((((A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2))) && ((A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2))) || !(1 + (d / 2 + 1) / 2 < 0)) || 0 == ((d / 2 + 1) / 2 + 1) % 2)) || !(1 + p / 4 < 0)) || 0 == (p / 4 + 1) % 2))) || !(p / 2 < 0)) || 1 == 1 + p / 4)))) || (p < 0 && !(0 == p % 2))))) || !(d < 0))) && (!(1 == p) || B == d)) && d == B * p) && ((A == B * 1 * q + r || ((!(B * 1 == d / 2) || (d < 0 && !(0 == d % 2))) && ((0 == d % 2 || !(B * 1 == 1 + d / 2)) || !(d < 0)))) || (((!(1 <= 1 + p / 2) || 0 == p % 2) || !(p < 0)) && (!(1 <= p / 2) || (p < 0 && !(0 == p % 2)))))) && ((((1 == p / 2 || (((((!(d / 2 < 0) || A == (q + p / 4) * B + (r + (-1 + -(d / 4)))) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p / 4) * B + (r + -(d / 4)))) || (p / 2 < 0 && !(0 == p / 2 % 2))) && ((0 == p / 2 % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + (1 + p / 4)) * B + (r + -(d / 4))) && ((A == (q + (1 + p / 4)) * B + (r + (-1 + -(d / 4))) || !(d / 2 < 0)) || 0 == d / 2 % 2))) || !(p / 2 < 0)))) || (p < 0 && !(0 == p % 2))) && (((0 == p % 2 || 1 == 1 + p / 2) || (((0 == (p / 2 + 1) % 2 || !(1 + p / 2 < 0)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 4))) && ((!(d / 2 < 0) || 0 == d / 2 % 2) || A == (q + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 4)))))) && ((((A == (q + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 4))) || !(d / 2 < 0)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + (p / 2 + 1) / 2) * B + (r + -(d / 4)))) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))))) && A == q * B + r) && d == B * p)) || (((((A == (q + p) * B + (r + -d) && (1 == 2 * p || A == (q + 2 * (2 * p) + p) * B + (r + -(2 * (2 * d)) + -d))) && B == 1) && ((A == d * q + r || !(1 == p)) || !(d == B * p))) && A == q * B + r) && d == B * p)) || (((((A + r * -1 == 2 * B && p == 1) && B == 1) && (A == q * B + r || (1 <= d && A == q * B + r))) && ((d == (A + -r) / 2 && (!(A + r * -1 < 0) || 0 == (A + r) % 2)) || ((!(0 == (A + r) % 2) && d == 1 + (A + -r) / 2) && A + r * -1 < 0))) && q + 2 * 1 * -1 == 0)) || (((B == 1 && ((A == d * q + r || !(1 == p)) || !(d == B * p))) && A == q * B + r) && d == B * p)) || ((((((((A == (q + p) * B + (r + -d) && ((1 == 2 * p || A == (q + 2 * (2 * p) + p) * B + (r + -(2 * (2 * d)) + -d)) || !(r == A))) && B == 1) && (A == q * B + r || (1 <= d && A == q * B + r))) && (1 == p || (((((A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)) && (A == (q + p / 2) * B + (r + -(d / 2)) || (d < 0 && !(0 == d % 2)))) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || ((A == (q + (1 + p / 2)) * B + (r + -(d / 2)) || (d < 0 && !(0 == d % 2))) && ((A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)))) || !(p < 0))))) && ((A == B * 1 * (q + 2 * (2 * p)) + (r + -(2 * (2 * d))) || !(B * 1 == d)) || !(1 <= p))) && A == q * B + r) && d == B * p) && ((A == B * 1 * q + r || ((!(B * 1 == d / 2) || (d < 0 && !(0 == d % 2))) && ((0 == d % 2 || !(B * 1 == 1 + d / 2)) || !(d < 0)))) || (((!(1 <= 1 + p / 2) || 0 == p % 2) || !(p < 0)) && (!(1 <= p / 2) || (p < 0 && !(0 == p % 2))))))) || ((((((q + 2 * (2 * 1) * -1 == 0 && p == 1) && r + 2 * (2 * B) == A) && d == B) && B == 1) && (A == q * B + r || (1 <= d && A == q * B + r))) && A == q * B + r)) || (((((((A == (q + p) * B + (r + -d) && (1 == 2 * p || A == (q + 2 * (2 * p) + p) * B + (r + -(2 * (2 * d)) + -d))) && B == 1) && (A == q * B + r || (1 <= d && A == q * B + r))) && ((A == B * 1 * (q + 2 * (2 * p)) + (r + -(2 * (2 * d))) || !(B * 1 == d)) || !(1 <= p))) && A == q * B + r) && d == B * p) && ((A == B * 1 * q + r || ((!(B * 1 == d / 2) || (d < 0 && !(0 == d % 2))) && ((0 == d % 2 || !(B * 1 == 1 + d / 2)) || !(d < 0)))) || (((!(1 <= 1 + p / 2) || 0 == p % 2) || !(p < 0)) && (!(1 <= p / 2) || (p < 0 && !(0 == p % 2))))))) || ((((((((((((((0 == d % 2 || B == 1 + d / 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || B == d / 2)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0)))) && r == A) && d == 2 * (2 * (2 * B))) && ((((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || 0 == d / 2 % 2) || B == 1 + d / 4) && ((!(0 == d / 2 % 2) && d / 2 < 0) || B == d / 4))) && ((0 == d % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || B == (d / 2 + 1) / 2) && ((B == 1 + (d / 2 + 1) / 2 || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2))) || !(d < 0))) || (((0 == p % 2 || !(p < 0)) || (((0 == (p / 2 + 1) % 2 || !(1 == 1 + (p / 2 + 1) / 2)) || !(1 + p / 2 < 0)) && (!(1 == (p / 2 + 1) / 2) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))))) && ((((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 == p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 == 1 + p / 4))) || (p < 0 && !(0 == p % 2)))))) && (!(1 == p) || B == d)) && q == 0) && B == 1) && A == q * B + r) && (((((((((((((((((((((((((0 == p % 2 || A == (q + p + (1 + p / 2)) * B + (r + -d + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p + p / 2) * B + (r + -d + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0)) && ((((0 == p % 2 || 1 == 1 + p / 2) || (((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || A == (1 + d / 4) * (q + (1 + p / 2)) + (r + -(d / 2))) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == d / 4 * (q + (1 + p / 2)) + (r + -(d / 2))))) && ((0 == d % 2 || (((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (1 + (d / 2 + 1) / 2) * (q + (1 + p / 2)) + (r + (-1 + -(d / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (d / 2 + 1) / 2 * (q + (1 + p / 2)) + (r + (-1 + -(d / 2)))))) || !(d < 0)))) || !(p < 0)) || (((0 == (p / 2 + 1) % 2 || !(1 == 1 + (p / 2 + 1) / 2)) || !(1 + p / 2 < 0)) && (!(1 == (p / 2 + 1) / 2) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)))))) && 2 <= -d / -2) && r >= -d / -2) && A == (q + 2 * p + p) * B + (r + -(2 * d) + -d)) && (((1 == p / 2 || (((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 == p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 == 1 + p / 4)))) || (((0 == d % 2 || (((A == (1 + (d / 2 + 1) / 2) * (q + p / 2) + (r + (-1 + -(d / 2))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (d / 2 + 1) / 2 * (q + p / 2) + (r + (-1 + -(d / 2)))))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == d / 4 * (q + p / 2) + (r + -(d / 2))) && ((!(d / 2 < 0) || A == (1 + d / 4) * (q + p / 2) + (r + -(d / 2))) || 0 == d / 2 % 2))))) || (p < 0 && !(0 == p % 2)))) && ((1 == p || (((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r))) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && A == d * q + r) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && d % 2 == 0) && A == q * B + r) && ((0 == d % 2 || (((0 == p % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) || !(1 + p / 2 < 0)))) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) || !(1 + p / 2 < 0)))))) || !(p < 0)) && (((((((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || 0 == p / 2 % 2) || !(p / 2 < 0))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2)))))) || (p < 0 && !(0 == p % 2))))) || !(d < 0))) && A == (q + p) * B + (r + -d)) && ((((((((((A == (q + p) * B + (r + -d) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && A == d * q + r) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p) || (((((((((A == (q + p) * B + (r + -d) && (A == d * q + r || !(1 == p))) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p))) && ((((0 == d % 2 || B == 1 + d / 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || B == d / 2)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && (((((0 == d % 2 || !(d < 0)) || A == (1 + d / 2) * (q + p) + (r + -d)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * (q + p) + (r + -d))) || 1 == p) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || !(p < 0)) || A == (q + p + (1 + p / 2)) * B + (r + -d + -(d / 2))) && (A == (q + p + p / 2) * B + (r + -d + -(d / 2)) || (p < 0 && !(0 == p % 2)))))) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (!(1 == p) || B == d)) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + -(d / 4))) && ((0 == (p / 2 + 1) % 2 || !(1 + p / 2 < 0)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + -(d / 4))))) && ((!(d / 2 < 0) || (((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) || !(1 + p / 2 < 0)) && (A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + (-1 + -(d / 4))) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))))) || 0 == d / 2 % 2))) || !(p < 0)) && ((p < 0 && !(0 == p % 2)) || (((((A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + -(d / 4)) || 0 == p / 2 % 2) || !(p / 2 < 0)) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + -(d / 4)))) || (!(0 == d / 2 % 2) && d / 2 < 0)) && (((((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + (-1 + -(d / 4))))) || !(d / 2 < 0)) || 0 == d / 2 % 2)))))) || ((((((((((((((((((((((((0 == p % 2 || A == (q + p + (1 + p / 2)) * B + (r + -d + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p + p / 2) * B + (r + -d + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0)) && ((((0 == p % 2 || 1 == 1 + p / 2) || (((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || A == (1 + d / 4) * (q + (1 + p / 2)) + (r + -(d / 2))) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == d / 4 * (q + (1 + p / 2)) + (r + -(d / 2))))) && ((0 == d % 2 || (((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (1 + (d / 2 + 1) / 2) * (q + (1 + p / 2)) + (r + (-1 + -(d / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (d / 2 + 1) / 2 * (q + (1 + p / 2)) + (r + (-1 + -(d / 2)))))) || !(d < 0)))) || !(p < 0)) || (((0 == (p / 2 + 1) % 2 || !(1 == 1 + (p / 2 + 1) / 2)) || !(1 + p / 2 < 0)) && (!(1 == (p / 2 + 1) / 2) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)))))) && 2 <= -d / -2) && r >= -d / -2) && A == (q + 2 * p + p) * B + (r + -(2 * d) + -d)) && (((1 == p / 2 || (((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 == p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 == 1 + p / 4)))) || (((0 == d % 2 || (((A == (1 + (d / 2 + 1) / 2) * (q + p / 2) + (r + (-1 + -(d / 2))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (d / 2 + 1) / 2 * (q + p / 2) + (r + (-1 + -(d / 2)))))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == d / 4 * (q + p / 2) + (r + -(d / 2))) && ((!(d / 2 < 0) || A == (1 + d / 4) * (q + p / 2) + (r + -(d / 2))) || 0 == d / 2 % 2))))) || (p < 0 && !(0 == p % 2)))) && ((1 == p || (((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r))) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && d % 2 == 0) && A == q * B + r) && ((0 == d % 2 || (((0 == p % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) || !(1 + p / 2 < 0)))) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) || !(1 + p / 2 < 0)))))) || !(p < 0)) && (((((((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || 0 == p / 2 % 2) || !(p / 2 < 0))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2)))))) || (p < 0 && !(0 == p % 2))))) || !(d < 0))) && A == (q + p) * B + (r + -d)) && (A == d * q + r || !(1 == p))) && ((((((((((A == (q + p) * B + (r + -d) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && A == d * q + r) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p) || (((((((((A == (q + p) * B + (r + -d) && (A == d * q + r || !(1 == p))) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p))) && ((((0 == d % 2 || B == 1 + d / 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || B == d / 2)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && (((((0 == d % 2 || !(d < 0)) || A == (1 + d / 2) * (q + p) + (r + -d)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * (q + p) + (r + -d))) || 1 == p) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || !(p < 0)) || A == (q + p + (1 + p / 2)) * B + (r + -d + -(d / 2))) && (A == (q + p + p / 2) * B + (r + -d + -(d / 2)) || (p < 0 && !(0 == p % 2)))))) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (!(1 == p) || B == d)) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + -(d / 4))) && ((0 == (p / 2 + 1) % 2 || !(1 + p / 2 < 0)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + -(d / 4))))) && ((!(d / 2 < 0) || (((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) || !(1 + p / 2 < 0)) && (A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + (-1 + -(d / 4))) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))))) || 0 == d / 2 % 2))) || !(p < 0)) && ((p < 0 && !(0 == p % 2)) || (((((A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + -(d / 4)) || 0 == p / 2 % 2) || !(p / 2 < 0)) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + -(d / 4)))) || (!(0 == d / 2 % 2) && d / 2 < 0)) && (((((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + (-1 + -(d / 4))))) || !(d / 2 < 0)) || 0 == d / 2 % 2)))))))) && d == B * p) && p == 2 * (2 * (2 * 1)))) || (((((((((((((((A == B * 1 * q + r || (((((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 <= p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 <= 1 + p / 4))) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || !(p < 0)) || (((!(1 <= 1 + (p / 2 + 1) / 2) || 0 == (p / 2 + 1) % 2) || !(1 + p / 2 < 0)) && ((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || !(1 <= (p / 2 + 1) / 2)))))) || (((0 == d % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || !(B * 1 == (d / 2 + 1) / 2)) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || !(B * 1 == 1 + (d / 2 + 1) / 2)))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || !(B * 1 == 1 + d / 4)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || !(B * 1 == d / 4)))))) && (((((1 == p / 2 || (((0 == p / 2 % 2 || (((!(1 + d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + -((d / 2 + 1) / 2))))) || !(p / 2 < 0)) && ((((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (q + p + p / 4) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + -((d / 2 + 1) / 2)))) || (p / 2 < 0 && !(0 == p / 2 % 2))))) || (p < 0 && !(0 == p % 2))) && (((0 == p % 2 || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + -((d / 2 + 1) / 2))) && ((!(1 + d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2))) && ((0 == (p / 2 + 1) % 2 || ((A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + -((d / 2 + 1) / 2)) || (!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0)) && ((!(1 + d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2))) || !(1 + p / 2 < 0)))) || 1 == 1 + p / 2) || !(p < 0))) || 0 == d % 2) || !(d < 0))) && B == 1) && (1 == p || (((((A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)) && (A == (q + p / 2) * B + (r + -(d / 2)) || (d < 0 && !(0 == d % 2)))) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || ((A == (q + (1 + p / 2)) * B + (r + -(d / 2)) || (d < 0 && !(0 == d % 2))) && ((A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)))) || !(p < 0))))) && ((A == d * q + r || !(1 == p)) || !(d == B * p))) && A == q * B + r) && ((((((((((((2 <= d && (((((0 == p % 2 || A == (q + p + (1 + p / 2)) * B + (r + -d + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p + p / 2) * B + (r + -d + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && A == (q + p) * B + (r + -d)) && (A == d * q + r || !(1 == p))) && A == (q + 2 * p + p) * B + (r + -(2 * d) + -d)) && (((((0 == d % 2 || !(d < 0)) || A == (1 + d / 2) * (q + p) + (r + -d)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * (q + p) + (r + -d))) || 1 == p) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && ((1 == p || (((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r))) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || !(p < 0)) || A == (q + p + (1 + p / 2)) * B + (r + -d + -(d / 2))) && (A == (q + p + p / 2) * B + (r + -d + -(d / 2)) || (p < 0 && !(0 == p % 2)))))) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && (!(1 == p) || B == d)) && A == q * B + r) || ((((((((((2 <= d && (((((0 == p % 2 || A == (q + p + (1 + p / 2)) * B + (r + -d + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p + p / 2) * B + (r + -d + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && A == (q + p) * B + (r + -d)) && (A == d * q + r || !(1 == p))) && A == (q + 2 * p + p) * B + (r + -(2 * d) + -d)) && ((1 == p || (((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r))) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || !(p < 0)) || A == (q + p + (1 + p / 2)) * B + (r + -d + -(d / 2))) && (A == (q + p + p / 2) * B + (r + -d + -(d / 2)) || (p < 0 && !(0 == p % 2)))))) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && (!(1 == p) || B == d)) && A == q * B + r))) && A == (q + p) * B + (r + -d)) && ((d < 0 && !(0 == d % 2)) || (((1 == p / 2 || (p < 0 && !(0 == p % 2))) || (((p / 2 < 0 && !(0 == p / 2 % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) && (((((!(d / 2 < 0) || 0 == d / 2 % 2) || A == (q + p + (1 + p / 4)) * B + (r + -d + (-1 + -(d / 4)))) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + -(d / 4)))) || 0 == p / 2 % 2) || !(p / 2 < 0)))) && (((0 == p % 2 || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) && ((0 == (p / 2 + 1) % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) || !(1 + p / 2 < 0)))) || 1 == 1 + p / 2) || !(p < 0))))) && ((((0 == d % 2 || B == 1 + d / 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || B == d / 2)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && (1 == 2 * p || A == (q + 2 * (2 * p) + p) * B + (r + -(2 * (2 * d)) + -d))) && (!(1 == p) || B == d)) && ((((p < 0 && !(0 == p % 2)) || ((A == (q + 2 * p + 2 * p / 4) * B + (r + -(2 * d) + -(2 * d / 4)) || (d < 0 && !(0 == d % 2))) && ((A == (q + 2 * p + 2 * p / 4) * B + (r + -(2 * d) + (-1 + -(2 * d / 4))) || 0 == d % 2) || !(d < 0)))) && ((0 == p % 2 || (((0 == d % 2 || A == (q + 2 * p + (1 + 2 * p / 4)) * B + (r + -(2 * d) + (-1 + -(2 * d / 4)))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == (q + 2 * p + (1 + 2 * p / 4)) * B + (r + -(2 * d) + -(2 * d / 4))))) || !(p < 0))) || 1 == p)) && d == B * p)) || ((((((((((A == (q + p) * B + (r + -d) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && p == 1) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && d == B) && r == A + -B) && B == 1) && r == A + -d) && q + p * -1 == 0) && q + 1 * -1 == 0) && d == 1) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((((((((((((((r == A || A + -1 * r == 0) && 0 == q) && p == 1) && r == A) && d == B) && q == 0) && B == 1) && 1 <= d) && d == 1) && A == q * B + r) && d == B * p) || ((((r == A && ((((((((((((((((((((((((((((0 == p % 2 || ((((A == B * 1 * (q + (1 + p / 2)) + (r + (-1 + -(d / 2))) || 0 == d % 2) || (((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((!(B * 1 == 1 + ((d / 2 + 1) / 2 + 1) / 2) || !(1 + (d / 2 + 1) / 2 < 0)) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && ((1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || ((!(B * 1 == (d / 2 + 1) / 4) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((!((d / 2 + 1) / 2 < 0) || !(B * 1 == 1 + (d / 2 + 1) / 4)) || 0 == (d / 2 + 1) / 2 % 2))))) || !(d < 0)) && ((((((((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || !(B * 1 == (d / 4 + 1) / 2)) && ((0 == (d / 4 + 1) % 2 || !(1 + d / 4 < 0)) || !(B * 1 == 1 + (d / 4 + 1) / 2))) || !(d / 2 < 0)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || (((d / 4 < 0 && !(0 == d / 4 % 2)) || !(B * 1 == d / 8)) && ((0 == d / 4 % 2 || !(B * 1 == 1 + d / 8)) || !(d / 4 < 0))))) || (d < 0 && !(0 == d % 2))) || A == B * 1 * (q + (1 + p / 2)) + (r + -(d / 2))))) || !(p < 0)) || (((0 == (p / 2 + 1) % 2 || !(1 + p / 2 < 0)) || (((!(1 <= 1 + ((p / 2 + 1) / 2 + 1) / 2) || !(1 + (p / 2 + 1) / 2 < 0)) || 0 == ((p / 2 + 1) / 2 + 1) % 2) && (!(1 <= ((p / 2 + 1) / 2 + 1) / 2) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2))))) && ((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || ((((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2)) || !(1 <= (p / 2 + 1) / 4)) && ((!(1 <= 1 + (p / 2 + 1) / 4) || 0 == (p / 2 + 1) / 2 % 2) || !((p / 2 + 1) / 2 < 0)))))) && ((A == B * 1 * q + r || (((((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 <= p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 <= 1 + p / 4))) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || !(p < 0)) || (((!(1 <= 1 + (p / 2 + 1) / 2) || 0 == (p / 2 + 1) % 2) || !(1 + p / 2 < 0)) && ((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || !(1 <= (p / 2 + 1) / 2)))))) || (((0 == d % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || !(B * 1 == (d / 2 + 1) / 2)) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || !(B * 1 == 1 + (d / 2 + 1) / 2)))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || !(B * 1 == 1 + d / 4)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || !(B * 1 == d / 4))))))) && (((((((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 <= p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 <= 1 + p / 4))) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || !(p < 0)) || (((!(1 <= 1 + (p / 2 + 1) / 2) || 0 == (p / 2 + 1) % 2) || !(1 + p / 2 < 0)) && ((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || !(1 <= (p / 2 + 1) / 2))))) || (((0 == d % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || !(B * 1 == (d / 2 + 1) / 2)) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || !(B * 1 == 1 + (d / 2 + 1) / 2)))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || !(B * 1 == 1 + d / 4)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || !(B * 1 == d / 4)))))) || A == B * 1 * (q + p) + (r + -d))) && (((((1 == p / 2 || (((0 == p / 2 % 2 || (((!(1 + d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + -((d / 2 + 1) / 2))))) || !(p / 2 < 0)) && ((((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (q + p + p / 4) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + -((d / 2 + 1) / 2)))) || (p / 2 < 0 && !(0 == p / 2 % 2))))) || (p < 0 && !(0 == p % 2))) && (((0 == p % 2 || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + -((d / 2 + 1) / 2))) && ((!(1 + d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2))) && ((0 == (p / 2 + 1) % 2 || ((A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + -((d / 2 + 1) / 2)) || (!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0)) && ((!(1 + d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2))) || !(1 + p / 2 < 0)))) || 1 == 1 + p / 2) || !(p < 0))) || 0 == d % 2) || !(d < 0))) && r == A) && ((((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || 0 == d / 2 % 2) || B == 1 + d / 4) && ((!(0 == d / 2 % 2) && d / 2 < 0) || B == d / 4))) && ((0 == d % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || B == (d / 2 + 1) / 2) && ((B == 1 + (d / 2 + 1) / 2 || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2))) || !(d < 0))) || (((0 == p % 2 || !(p < 0)) || (((0 == (p / 2 + 1) % 2 || !(1 == 1 + (p / 2 + 1) / 2)) || !(1 + p / 2 < 0)) && (!(1 == (p / 2 + 1) / 2) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))))) && ((((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 == p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 == 1 + p / 4))) || (p < 0 && !(0 == p % 2)))))) && B == 1) && (1 == p || (((((A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)) && (A == (q + p / 2) * B + (r + -(d / 2)) || (d < 0 && !(0 == d % 2)))) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || ((A == (q + (1 + p / 2)) * B + (r + -(d / 2)) || (d < 0 && !(0 == d % 2))) && ((A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)))) || !(p < 0))))) && ((A == B * 1 * (q + 2 * p) + (r + -(2 * d)) || (((d < 0 && !(0 == d % 2)) || !(B * 1 == 2 * d / 4)) && ((0 == d % 2 || !(d < 0)) || !(B * 1 == 1 + 2 * d / 4)))) || (((0 == p % 2 || !(p < 0)) || !(1 <= 1 + 2 * p / 4)) && (!(1 <= 2 * p / 4) || (p < 0 && !(0 == p % 2)))))) && ((d < 0 && !(0 == d % 2)) || ((((((!(d / 2 < 0) || ((((0 == (p / 2 + 1) % 2 || 1 == 1 + (p / 2 + 1) / 2) || !(1 + p / 2 < 0)) || (((((A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2))) || 0 == (d / 4 + 1) % 2) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + -(d / 2) + -((d / 4 + 1) / 2)))) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2))) && (((((0 == (d / 4 + 1) % 2 || A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2)))) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + -(d / 2) + -((d / 4 + 1) / 2)))) || !(1 + (p / 2 + 1) / 2 < 0)) || 0 == ((p / 2 + 1) / 2 + 1) % 2))) && ((1 == (p / 2 + 1) / 2 || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))) || (((0 == (p / 2 + 1) / 2 % 2 || !((p / 2 + 1) / 2 < 0)) || (((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + -(d / 2) + -((d / 4 + 1) / 2))) && ((0 == (d / 4 + 1) % 2 || !(1 + d / 4 < 0)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2)))))) && ((((0 == (d / 4 + 1) % 2 || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2)))) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + -(d / 2) + -((d / 4 + 1) / 2)))) || ((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2))))))) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || (((((((!(1 + (p / 2 + 1) / 2 < 0) || ((A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2))) && ((0 == d / 4 % 2 || A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0)))) || 0 == ((p / 2 + 1) / 2 + 1) % 2) && (((A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2))) && ((0 == d / 4 % 2 || A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0))) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2)))) || 0 == (p / 2 + 1) % 2) || 1 == 1 + (p / 2 + 1) / 2) || !(1 + p / 2 < 0)) && ((1 == (p / 2 + 1) / 2 || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))) || (((((0 == d / 4 % 2 || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0)) && (A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2)))) || ((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2))) && ((((A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2))) && ((0 == d / 4 % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0))) || 0 == (p / 2 + 1) / 2 % 2) || !((p / 2 + 1) / 2 < 0))))))) || 0 == p % 2) || !(p < 0)) && (((((((1 == p / 4 || (p / 2 < 0 && !(0 == p / 2 % 2))) || (((((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + p / 2 + p / 8) * B + (r + -(d / 2) + -((d / 4 + 1) / 2))) && ((A == (q + p / 2 + p / 8) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2))) || 0 == (d / 4 + 1) % 2) || !(1 + d / 4 < 0))) || (p / 4 < 0 && !(0 == p / 4 % 2))) && ((0 == p / 4 % 2 || (((A == (q + p / 2 + (1 + p / 8)) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2))) || 0 == (d / 4 + 1) % 2) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + p / 2 + (1 + p / 8)) * B + (r + -(d / 2) + -((d / 4 + 1) / 2))))) || !(p / 4 < 0)))) && (((0 == p / 2 % 2 || !(p / 2 < 0)) || (((!(1 + p / 4 < 0) || 0 == (p / 4 + 1) % 2) || (((0 == (d / 4 + 1) % 2 || !(1 + d / 4 < 0)) || A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2)))) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + -(d / 2) + -((d / 4 + 1) / 2))))) && ((((A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2))) || 0 == (d / 4 + 1) % 2) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + -(d / 2) + -((d / 4 + 1) / 2)))) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0)))) || 1 == 1 + p / 4)) || !(d / 2 < 0)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || ((((0 == p / 2 % 2 || ((((((0 == d / 4 % 2 || A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0)) && (A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2)))) || !(1 + p / 4 < 0)) || 0 == (p / 4 + 1) % 2) && ((((A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + -(d / 2) + (-1 + -(d / 8))) || 0 == d / 4 % 2) || !(d / 4 < 0)) && (A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2)))) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0)))) || !(p / 2 < 0)) || 1 == 1 + p / 4) && ((1 == p / 4 || (p / 2 < 0 && !(0 == p / 2 % 2))) || (((((0 == d / 4 % 2 || A == (q + p / 2 + p / 8) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0)) && (A == (q + p / 2 + p / 8) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2)))) || (p / 4 < 0 && !(0 == p / 4 % 2))) && ((0 == p / 4 % 2 || (((0 == d / 4 % 2 || !(d / 4 < 0)) || A == (q + p / 2 + (1 + p / 8)) * B + (r + -(d / 2) + (-1 + -(d / 8)))) && (A == (q + p / 2 + (1 + p / 8)) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2))))) || !(p / 4 < 0))))))) || (p < 0 && !(0 == p % 2)))))) && (((((((((((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || !(B * 1 == (d / 4 + 1) / 2)) && ((0 == (d / 4 + 1) % 2 || !(1 + d / 4 < 0)) || !(B * 1 == 1 + (d / 4 + 1) / 2))) || !(d / 2 < 0)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || (((d / 4 < 0 && !(0 == d / 4 % 2)) || !(B * 1 == d / 8)) && ((0 == d / 4 % 2 || !(B * 1 == 1 + d / 8)) || !(d / 4 < 0))))) || A == B * 1 * (q + p / 2) + (r + -(d / 2))) || (d < 0 && !(0 == d % 2))) && (((0 == d % 2 || A == B * 1 * (q + p / 2) + (r + (-1 + -(d / 2)))) || (((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((!(B * 1 == 1 + ((d / 2 + 1) / 2 + 1) / 2) || !(1 + (d / 2 + 1) / 2 < 0)) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && ((1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || ((!(B * 1 == (d / 2 + 1) / 4) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((!((d / 2 + 1) / 2 < 0) || !(B * 1 == 1 + (d / 2 + 1) / 4)) || 0 == (d / 2 + 1) / 2 % 2))))) || !(d < 0))) || (p < 0 && !(0 == p % 2))) || (((p / 2 < 0 && !(0 == p / 2 % 2)) || (((0 == p / 4 % 2 || !(1 <= 1 + p / 8)) || !(p / 4 < 0)) && (!(1 <= p / 8) || (!(0 == p / 4 % 2) && p / 4 < 0)))) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || (((!(1 <= 1 + (p / 4 + 1) / 2) || 0 == (p / 4 + 1) % 2) || !(1 + p / 4 < 0)) && (!(1 <= (p / 4 + 1) / 2) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0))))))) && A == q * B + r) && A == (q + p) * B + (r + -d)) && (A == d * q + r || !(1 == p))) && (((((((((((((((((((((((((0 == p % 2 || A == (q + p + (1 + p / 2)) * B + (r + -d + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p + p / 2) * B + (r + -d + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0)) && ((((0 == p % 2 || 1 == 1 + p / 2) || (((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || A == (1 + d / 4) * (q + (1 + p / 2)) + (r + -(d / 2))) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == d / 4 * (q + (1 + p / 2)) + (r + -(d / 2))))) && ((0 == d % 2 || (((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (1 + (d / 2 + 1) / 2) * (q + (1 + p / 2)) + (r + (-1 + -(d / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (d / 2 + 1) / 2 * (q + (1 + p / 2)) + (r + (-1 + -(d / 2)))))) || !(d < 0)))) || !(p < 0)) || (((0 == (p / 2 + 1) % 2 || !(1 == 1 + (p / 2 + 1) / 2)) || !(1 + p / 2 < 0)) && (!(1 == (p / 2 + 1) / 2) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)))))) && (((((((((((((r == A || A + -1 * r == 0) && A == (q + p) * B + (r + -d)) && (A == d * q + r || !(1 == p))) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && 0 == q) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p) || ((((((((((((r == A || A + -1 * r == 0) && A == (q + p) * B + (r + -d)) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && 0 == q) && A == d * q + r) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p))) && 2 <= -d / -2) && r >= -d / -2) && A == (q + 2 * p + p) * B + (r + -(2 * d) + -d)) && (((1 == p / 2 || (((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 == p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 == 1 + p / 4)))) || (((0 == d % 2 || (((A == (1 + (d / 2 + 1) / 2) * (q + p / 2) + (r + (-1 + -(d / 2))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (d / 2 + 1) / 2 * (q + p / 2) + (r + (-1 + -(d / 2)))))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == d / 4 * (q + p / 2) + (r + -(d / 2))) && ((!(d / 2 < 0) || A == (1 + d / 4) * (q + p / 2) + (r + -(d / 2))) || 0 == d / 2 % 2))))) || (p < 0 && !(0 == p % 2)))) && ((1 == p || (((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r))) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && A == d * q + r) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && d % 2 == 0) && A == q * B + r) && ((0 == d % 2 || (((0 == p % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) || !(1 + p / 2 < 0)))) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) || !(1 + p / 2 < 0)))))) || !(p < 0)) && (((((((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || 0 == p / 2 % 2) || !(p / 2 < 0))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2)))))) || (p < 0 && !(0 == p % 2))))) || !(d < 0))) && A == (q + p) * B + (r + -d)) && ((((0 == d % 2 || B == 1 + d / 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || B == d / 2)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && (((((0 == d % 2 || !(d < 0)) || A == (1 + d / 2) * (q + p) + (r + -d)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * (q + p) + (r + -d))) || 1 == p) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || !(p < 0)) || A == (q + p + (1 + p / 2)) * B + (r + -d + -(d / 2))) && (A == (q + p + p / 2) * B + (r + -d + -(d / 2)) || (p < 0 && !(0 == p % 2)))))) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (!(1 == p) || B == d)) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + -(d / 4))) && ((0 == (p / 2 + 1) % 2 || !(1 + p / 2 < 0)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + -(d / 4))))) && ((!(d / 2 < 0) || (((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) || !(1 + p / 2 < 0)) && (A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + (-1 + -(d / 4))) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))))) || 0 == d / 2 % 2))) || !(p < 0)) && ((p < 0 && !(0 == p % 2)) || (((((A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + -(d / 4)) || 0 == p / 2 % 2) || !(p / 2 < 0)) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + -(d / 4)))) || (!(0 == d / 2 % 2) && d / 2 < 0)) && (((((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + (-1 + -(d / 4))))) || !(d / 2 < 0)) || 0 == d / 2 % 2)))))) || ((((((((((((((((((((((((0 == p % 2 || A == (q + p + (1 + p / 2)) * B + (r + -d + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p + p / 2) * B + (r + -d + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0)) && ((((0 == p % 2 || 1 == 1 + p / 2) || (((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || A == (1 + d / 4) * (q + (1 + p / 2)) + (r + -(d / 2))) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == d / 4 * (q + (1 + p / 2)) + (r + -(d / 2))))) && ((0 == d % 2 || (((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (1 + (d / 2 + 1) / 2) * (q + (1 + p / 2)) + (r + (-1 + -(d / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (d / 2 + 1) / 2 * (q + (1 + p / 2)) + (r + (-1 + -(d / 2)))))) || !(d < 0)))) || !(p < 0)) || (((0 == (p / 2 + 1) % 2 || !(1 == 1 + (p / 2 + 1) / 2)) || !(1 + p / 2 < 0)) && (!(1 == (p / 2 + 1) / 2) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)))))) && (((((((((((((r == A || A + -1 * r == 0) && A == (q + p) * B + (r + -d)) && (A == d * q + r || !(1 == p))) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && 0 == q) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p) || ((((((((((((r == A || A + -1 * r == 0) && A == (q + p) * B + (r + -d)) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && 0 == q) && A == d * q + r) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p))) && 2 <= -d / -2) && r >= -d / -2) && A == (q + 2 * p + p) * B + (r + -(2 * d) + -d)) && (((1 == p / 2 || (((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 == p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 == 1 + p / 4)))) || (((0 == d % 2 || (((A == (1 + (d / 2 + 1) / 2) * (q + p / 2) + (r + (-1 + -(d / 2))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (d / 2 + 1) / 2 * (q + p / 2) + (r + (-1 + -(d / 2)))))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == d / 4 * (q + p / 2) + (r + -(d / 2))) && ((!(d / 2 < 0) || A == (1 + d / 4) * (q + p / 2) + (r + -(d / 2))) || 0 == d / 2 % 2))))) || (p < 0 && !(0 == p % 2)))) && ((1 == p || (((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r))) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && d % 2 == 0) && A == q * B + r) && ((0 == d % 2 || (((0 == p % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) || !(1 + p / 2 < 0)))) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) || !(1 + p / 2 < 0)))))) || !(p < 0)) && (((((((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || 0 == p / 2 % 2) || !(p / 2 < 0))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2)))))) || (p < 0 && !(0 == p % 2))))) || !(d < 0))) && A == (q + p) * B + (r + -d)) && (A == d * q + r || !(1 == p))) && ((((0 == d % 2 || B == 1 + d / 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || B == d / 2)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && (((((0 == d % 2 || !(d < 0)) || A == (1 + d / 2) * (q + p) + (r + -d)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * (q + p) + (r + -d))) || 1 == p) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || !(p < 0)) || A == (q + p + (1 + p / 2)) * B + (r + -d + -(d / 2))) && (A == (q + p + p / 2) * B + (r + -d + -(d / 2)) || (p < 0 && !(0 == p % 2)))))) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (!(1 == p) || B == d)) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + -(d / 4))) && ((0 == (p / 2 + 1) % 2 || !(1 + p / 2 < 0)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + -(d / 4))))) && ((!(d / 2 < 0) || (((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) || !(1 + p / 2 < 0)) && (A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + (-1 + -(d / 4))) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))))) || 0 == d / 2 % 2))) || !(p < 0)) && ((p < 0 && !(0 == p % 2)) || (((((A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + -(d / 4)) || 0 == p / 2 % 2) || !(p / 2 < 0)) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + -(d / 4)))) || (!(0 == d / 2 % 2) && d / 2 < 0)) && (((((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + (-1 + -(d / 4))))) || !(d / 2 < 0)) || 0 == d / 2 % 2)))))))) && ((d < 0 && !(0 == d % 2)) || (((1 == p / 2 || (p < 0 && !(0 == p % 2))) || (((p / 2 < 0 && !(0 == p / 2 % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) && (((((!(d / 2 < 0) || 0 == d / 2 % 2) || A == (q + p + (1 + p / 4)) * B + (r + -d + (-1 + -(d / 4)))) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + -(d / 4)))) || 0 == p / 2 % 2) || !(p / 2 < 0)))) && (((0 == p % 2 || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) && ((0 == (p / 2 + 1) % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) || !(1 + p / 2 < 0)))) || 1 == 1 + p / 2) || !(p < 0))))) && ((((0 == d % 2 || B == 1 + d / 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || B == d / 2)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && ((0 == d % 2 || ((((((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || ((((0 == (p / 2 + 1) % 2 || 1 == 1 + (p / 2 + 1) / 2) || !(1 + p / 2 < 0)) || (((!(1 + (p / 2 + 1) / 2 < 0) || (((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && (A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2))))) || 0 == ((p / 2 + 1) / 2 + 1) % 2) && ((((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && (A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)))) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2))))) && ((1 == (p / 2 + 1) / 2 || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))) || (((0 == (p / 2 + 1) / 2 % 2 || !((p / 2 + 1) / 2 < 0)) || (((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && ((1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2))))) && (((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2)) || (((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && (A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2))))))))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((1 == (p / 2 + 1) / 2 || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))) || ((((A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))))) || ((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2))) && ((0 == (p / 2 + 1) / 2 % 2 || (((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)))) && (A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))))) || !((p / 2 + 1) / 2 < 0)))) && (((0 == (p / 2 + 1) % 2 || 1 == 1 + (p / 2 + 1) / 2) || !(1 + p / 2 < 0)) || (((!(1 + (p / 2 + 1) / 2 < 0) || ((A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))) || !((d / 2 + 1) / 2 < 0)) || 0 == (d / 2 + 1) / 2 % 2))) || 0 == ((p / 2 + 1) / 2 + 1) % 2) && (((A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))))) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2)))))))) || 0 == p % 2) || !(p < 0)) && ((((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((1 == p / 4 || (p / 2 < 0 && !(0 == p / 2 % 2))) || (((0 == p / 4 % 2 || (((A == (q + p / 2 + (1 + p / 8)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))) || !((d / 2 + 1) / 2 < 0)) || 0 == (d / 2 + 1) / 2 % 2) && (A == (q + p / 2 + (1 + p / 8)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))))) || !(p / 4 < 0)) && (((A == (q + p / 2 + p / 8) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + p / 2 + p / 8) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))))) || (p / 4 < 0 && !(0 == p / 4 % 2))))) && (((((((((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2)) || A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4))) && ((A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))) || !((d / 2 + 1) / 2 < 0)) || 0 == (d / 2 + 1) / 2 % 2)) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0)) && ((!(1 + p / 4 < 0) || 0 == (p / 4 + 1) % 2) || (((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)))) && (A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2)))))) || 0 == p / 2 % 2) || !(p / 2 < 0)) || 1 == 1 + p / 4))) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((((((A == (q + p / 2 + p / 8) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2))) && ((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + p / 2 + p / 8) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2)) || (p / 4 < 0 && !(0 == p / 4 % 2))) && (((((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + p / 2 + (1 + p / 8)) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && (A == (q + p / 2 + (1 + p / 8)) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)))) || 0 == p / 4 % 2) || !(p / 4 < 0))) || 1 == p / 4) || (p / 2 < 0 && !(0 == p / 2 % 2))) && (((0 == p / 2 % 2 || (((((1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)) || A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2))) && ((A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2))) || !(1 + (d / 2 + 1) / 2 < 0)) || 0 == ((d / 2 + 1) / 2 + 1) % 2)) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0)) && ((((A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2))) && ((A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2))) || !(1 + (d / 2 + 1) / 2 < 0)) || 0 == ((d / 2 + 1) / 2 + 1) % 2)) || !(1 + p / 4 < 0)) || 0 == (p / 4 + 1) % 2))) || !(p / 2 < 0)) || 1 == 1 + p / 4)))) || (p < 0 && !(0 == p % 2))))) || !(d < 0))) && (1 == 2 * p || A == (q + 2 * (2 * p) + p) * B + (r + -(2 * (2 * d)) + -d))) && (!(1 == p) || B == d)) && ((((p < 0 && !(0 == p % 2)) || ((A == (q + 2 * p + 2 * p / 4) * B + (r + -(2 * d) + -(2 * d / 4)) || (d < 0 && !(0 == d % 2))) && ((A == (q + 2 * p + 2 * p / 4) * B + (r + -(2 * d) + (-1 + -(2 * d / 4))) || 0 == d % 2) || !(d < 0)))) && ((0 == p % 2 || (((0 == d % 2 || A == (q + 2 * p + (1 + 2 * p / 4)) * B + (r + -(2 * d) + (-1 + -(2 * d / 4)))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == (q + 2 * p + (1 + 2 * p / 4)) * B + (r + -(2 * d) + -(2 * d / 4))))) || !(p < 0))) || 1 == p)) && ((0 == d % 2 || (((1 == p / 2 || (((0 == p / 2 % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + (1 + p / 4)) * B + (r + -((d / 2 + 1) / 2))) && ((A == (q + (1 + p / 4)) * B + (r + (-1 + -((d / 2 + 1) / 2))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2))) || !(p / 2 < 0)) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p / 4) * B + (r + -((d / 2 + 1) / 2))) && ((A == (q + p / 4) * B + (r + (-1 + -((d / 2 + 1) / 2))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2))))) || (p < 0 && !(0 == p % 2))) && (((0 == p % 2 || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + (p / 2 + 1) / 2) * B + (r + -((d / 2 + 1) / 2))) && ((!(1 + d / 2 < 0) || A == (q + (p / 2 + 1) / 2) * B + (r + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2))) && ((0 == (p / 2 + 1) % 2 || (((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (q + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -((d / 2 + 1) / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + (1 + (p / 2 + 1) / 2)) * B + (r + -((d / 2 + 1) / 2))))) || !(1 + p / 2 < 0)))) || 1 == 1 + p / 2) || !(p < 0)))) || !(d < 0))) && d == B * p) && ((((1 == p / 2 || (((((!(d / 2 < 0) || A == (q + p / 4) * B + (r + (-1 + -(d / 4)))) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p / 4) * B + (r + -(d / 4)))) || (p / 2 < 0 && !(0 == p / 2 % 2))) && ((0 == p / 2 % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + (1 + p / 4)) * B + (r + -(d / 4))) && ((A == (q + (1 + p / 4)) * B + (r + (-1 + -(d / 4))) || !(d / 2 < 0)) || 0 == d / 2 % 2))) || !(p / 2 < 0)))) || (p < 0 && !(0 == p % 2))) && (((0 == p % 2 || 1 == 1 + p / 2) || (((0 == (p / 2 + 1) % 2 || !(1 + p / 2 < 0)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 4))) && ((!(d / 2 < 0) || 0 == d / 2 % 2) || A == (q + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 4)))))) && ((((A == (q + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 4))) || !(d / 2 < 0)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + (p / 2 + 1) / 2) * B + (r + -(d / 4)))) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) || (((((((((((((((((((((((((((A == B * 1 * q + r || (((((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 <= p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 <= 1 + p / 4))) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || !(p < 0)) || (((!(1 <= 1 + (p / 2 + 1) / 2) || 0 == (p / 2 + 1) % 2) || !(1 + p / 2 < 0)) && ((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || !(1 <= (p / 2 + 1) / 2)))))) || (((0 == d % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || !(B * 1 == (d / 2 + 1) / 2)) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || !(B * 1 == 1 + (d / 2 + 1) / 2)))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || !(B * 1 == 1 + d / 4)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || !(B * 1 == d / 4)))))) && (((((1 == p / 2 || (((0 == p / 2 % 2 || (((!(1 + d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + -((d / 2 + 1) / 2))))) || !(p / 2 < 0)) && ((((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (q + p + p / 4) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + -((d / 2 + 1) / 2)))) || (p / 2 < 0 && !(0 == p / 2 % 2))))) || (p < 0 && !(0 == p % 2))) && (((0 == p % 2 || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + -((d / 2 + 1) / 2))) && ((!(1 + d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2))) && ((0 == (p / 2 + 1) % 2 || ((A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + -((d / 2 + 1) / 2)) || (!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0)) && ((!(1 + d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2))) || !(1 + p / 2 < 0)))) || 1 == 1 + p / 2) || !(p < 0))) || 0 == d % 2) || !(d < 0))) && ((((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || 0 == d / 2 % 2) || B == 1 + d / 4) && ((!(0 == d / 2 % 2) && d / 2 < 0) || B == d / 4))) && ((0 == d % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || B == (d / 2 + 1) / 2) && ((B == 1 + (d / 2 + 1) / 2 || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2))) || !(d < 0))) || (((0 == p % 2 || !(p < 0)) || (((0 == (p / 2 + 1) % 2 || !(1 == 1 + (p / 2 + 1) / 2)) || !(1 + p / 2 < 0)) && (!(1 == (p / 2 + 1) / 2) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))))) && ((((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 == p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 == 1 + p / 4))) || (p < 0 && !(0 == p % 2)))))) && ((A == B * 1 * (q + 2 * (2 * p)) + (r + -(2 * (2 * d))) || !(B * 1 == d)) || !(1 <= p))) && A == (q + p) * B + (r + -d)) && (((((((((((((((((((((((((0 == p % 2 || A == (q + p + (1 + p / 2)) * B + (r + -d + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p + p / 2) * B + (r + -d + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0)) && ((((0 == p % 2 || 1 == 1 + p / 2) || (((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || A == (1 + d / 4) * (q + (1 + p / 2)) + (r + -(d / 2))) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == d / 4 * (q + (1 + p / 2)) + (r + -(d / 2))))) && ((0 == d % 2 || (((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (1 + (d / 2 + 1) / 2) * (q + (1 + p / 2)) + (r + (-1 + -(d / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (d / 2 + 1) / 2 * (q + (1 + p / 2)) + (r + (-1 + -(d / 2)))))) || !(d < 0)))) || !(p < 0)) || (((0 == (p / 2 + 1) % 2 || !(1 == 1 + (p / 2 + 1) / 2)) || !(1 + p / 2 < 0)) && (!(1 == (p / 2 + 1) / 2) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)))))) && (((((((((((((r == A || A + -1 * r == 0) && A == (q + p) * B + (r + -d)) && (A == d * q + r || !(1 == p))) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && 0 == q) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p) || ((((((((((((r == A || A + -1 * r == 0) && A == (q + p) * B + (r + -d)) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && 0 == q) && A == d * q + r) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p))) && 2 <= -d / -2) && r >= -d / -2) && A == (q + 2 * p + p) * B + (r + -(2 * d) + -d)) && (((1 == p / 2 || (((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 == p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 == 1 + p / 4)))) || (((0 == d % 2 || (((A == (1 + (d / 2 + 1) / 2) * (q + p / 2) + (r + (-1 + -(d / 2))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (d / 2 + 1) / 2 * (q + p / 2) + (r + (-1 + -(d / 2)))))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == d / 4 * (q + p / 2) + (r + -(d / 2))) && ((!(d / 2 < 0) || A == (1 + d / 4) * (q + p / 2) + (r + -(d / 2))) || 0 == d / 2 % 2))))) || (p < 0 && !(0 == p % 2)))) && ((1 == p || (((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r))) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && A == d * q + r) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && d % 2 == 0) && A == q * B + r) && ((0 == d % 2 || (((0 == p % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) || !(1 + p / 2 < 0)))) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) || !(1 + p / 2 < 0)))))) || !(p < 0)) && (((((((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || 0 == p / 2 % 2) || !(p / 2 < 0))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2)))))) || (p < 0 && !(0 == p % 2))))) || !(d < 0))) && A == (q + p) * B + (r + -d)) && ((((0 == d % 2 || B == 1 + d / 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || B == d / 2)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && (((((0 == d % 2 || !(d < 0)) || A == (1 + d / 2) * (q + p) + (r + -d)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * (q + p) + (r + -d))) || 1 == p) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || !(p < 0)) || A == (q + p + (1 + p / 2)) * B + (r + -d + -(d / 2))) && (A == (q + p + p / 2) * B + (r + -d + -(d / 2)) || (p < 0 && !(0 == p % 2)))))) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (!(1 == p) || B == d)) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + -(d / 4))) && ((0 == (p / 2 + 1) % 2 || !(1 + p / 2 < 0)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + -(d / 4))))) && ((!(d / 2 < 0) || (((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) || !(1 + p / 2 < 0)) && (A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + (-1 + -(d / 4))) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))))) || 0 == d / 2 % 2))) || !(p < 0)) && ((p < 0 && !(0 == p % 2)) || (((((A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + -(d / 4)) || 0 == p / 2 % 2) || !(p / 2 < 0)) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + -(d / 4)))) || (!(0 == d / 2 % 2) && d / 2 < 0)) && (((((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + (-1 + -(d / 4))))) || !(d / 2 < 0)) || 0 == d / 2 % 2)))))) || ((((((((((((((((((((((((0 == p % 2 || A == (q + p + (1 + p / 2)) * B + (r + -d + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p + p / 2) * B + (r + -d + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0)) && ((((0 == p % 2 || 1 == 1 + p / 2) || (((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || A == (1 + d / 4) * (q + (1 + p / 2)) + (r + -(d / 2))) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == d / 4 * (q + (1 + p / 2)) + (r + -(d / 2))))) && ((0 == d % 2 || (((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (1 + (d / 2 + 1) / 2) * (q + (1 + p / 2)) + (r + (-1 + -(d / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (d / 2 + 1) / 2 * (q + (1 + p / 2)) + (r + (-1 + -(d / 2)))))) || !(d < 0)))) || !(p < 0)) || (((0 == (p / 2 + 1) % 2 || !(1 == 1 + (p / 2 + 1) / 2)) || !(1 + p / 2 < 0)) && (!(1 == (p / 2 + 1) / 2) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)))))) && (((((((((((((r == A || A + -1 * r == 0) && A == (q + p) * B + (r + -d)) && (A == d * q + r || !(1 == p))) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && 0 == q) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p) || ((((((((((((r == A || A + -1 * r == 0) && A == (q + p) * B + (r + -d)) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && 0 == q) && A == d * q + r) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p))) && 2 <= -d / -2) && r >= -d / -2) && A == (q + 2 * p + p) * B + (r + -(2 * d) + -d)) && (((1 == p / 2 || (((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 == p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 == 1 + p / 4)))) || (((0 == d % 2 || (((A == (1 + (d / 2 + 1) / 2) * (q + p / 2) + (r + (-1 + -(d / 2))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (d / 2 + 1) / 2 * (q + p / 2) + (r + (-1 + -(d / 2)))))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == d / 4 * (q + p / 2) + (r + -(d / 2))) && ((!(d / 2 < 0) || A == (1 + d / 4) * (q + p / 2) + (r + -(d / 2))) || 0 == d / 2 % 2))))) || (p < 0 && !(0 == p % 2)))) && ((1 == p || (((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r))) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && d % 2 == 0) && A == q * B + r) && ((0 == d % 2 || (((0 == p % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) || !(1 + p / 2 < 0)))) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) || !(1 + p / 2 < 0)))))) || !(p < 0)) && (((((((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || 0 == p / 2 % 2) || !(p / 2 < 0))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2)))))) || (p < 0 && !(0 == p % 2))))) || !(d < 0))) && A == (q + p) * B + (r + -d)) && (A == d * q + r || !(1 == p))) && ((((0 == d % 2 || B == 1 + d / 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || B == d / 2)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && (((((0 == d % 2 || !(d < 0)) || A == (1 + d / 2) * (q + p) + (r + -d)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * (q + p) + (r + -d))) || 1 == p) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || !(p < 0)) || A == (q + p + (1 + p / 2)) * B + (r + -d + -(d / 2))) && (A == (q + p + p / 2) * B + (r + -d + -(d / 2)) || (p < 0 && !(0 == p % 2)))))) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (!(1 == p) || B == d)) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + -(d / 4))) && ((0 == (p / 2 + 1) % 2 || !(1 + p / 2 < 0)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + -(d / 4))))) && ((!(d / 2 < 0) || (((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) || !(1 + p / 2 < 0)) && (A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + (-1 + -(d / 4))) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))))) || 0 == d / 2 % 2))) || !(p < 0)) && ((p < 0 && !(0 == p % 2)) || (((((A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + -(d / 4)) || 0 == p / 2 % 2) || !(p / 2 < 0)) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + -(d / 4)))) || (!(0 == d / 2 % 2) && d / 2 < 0)) && (((((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + (-1 + -(d / 4))))) || !(d / 2 < 0)) || 0 == d / 2 % 2)))))))) && (1 == 2 * p || A == (q + 2 * (2 * p) + p) * B + (r + -(2 * (2 * d)) + -d))) && ((((p < 0 && !(0 == p % 2)) || ((A == (q + 2 * p + 2 * p / 4) * B + (r + -(2 * d) + -(2 * d / 4)) || (d < 0 && !(0 == d % 2))) && ((A == (q + 2 * p + 2 * p / 4) * B + (r + -(2 * d) + (-1 + -(2 * d / 4))) || 0 == d % 2) || !(d < 0)))) && ((0 == p % 2 || (((0 == d % 2 || A == (q + 2 * p + (1 + 2 * p / 4)) * B + (r + -(2 * d) + (-1 + -(2 * d / 4)))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == (q + 2 * p + (1 + 2 * p / 4)) * B + (r + -(2 * d) + -(2 * d / 4))))) || !(p < 0))) || 1 == p)) && ((0 == d % 2 || (((1 == p / 2 || (((0 == p / 2 % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + (1 + p / 4)) * B + (r + -((d / 2 + 1) / 2))) && ((A == (q + (1 + p / 4)) * B + (r + (-1 + -((d / 2 + 1) / 2))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2))) || !(p / 2 < 0)) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p / 4) * B + (r + -((d / 2 + 1) / 2))) && ((A == (q + p / 4) * B + (r + (-1 + -((d / 2 + 1) / 2))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2))))) || (p < 0 && !(0 == p % 2))) && (((0 == p % 2 || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + (p / 2 + 1) / 2) * B + (r + -((d / 2 + 1) / 2))) && ((!(1 + d / 2 < 0) || A == (q + (p / 2 + 1) / 2) * B + (r + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2))) && ((0 == (p / 2 + 1) % 2 || (((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (q + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -((d / 2 + 1) / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + (1 + (p / 2 + 1) / 2)) * B + (r + -((d / 2 + 1) / 2))))) || !(1 + p / 2 < 0)))) || 1 == 1 + p / 2) || !(p < 0)))) || !(d < 0))) && (((0 == p % 2 || ((((A == B * 1 * (q + (1 + p / 2)) + (r + (-1 + -(d / 2))) || 0 == d % 2) || (((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((!(B * 1 == 1 + ((d / 2 + 1) / 2 + 1) / 2) || !(1 + (d / 2 + 1) / 2 < 0)) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && ((1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || ((!(B * 1 == (d / 2 + 1) / 4) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((!((d / 2 + 1) / 2 < 0) || !(B * 1 == 1 + (d / 2 + 1) / 4)) || 0 == (d / 2 + 1) / 2 % 2))))) || !(d < 0)) && ((((((((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || !(B * 1 == (d / 4 + 1) / 2)) && ((0 == (d / 4 + 1) % 2 || !(1 + d / 4 < 0)) || !(B * 1 == 1 + (d / 4 + 1) / 2))) || !(d / 2 < 0)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || (((d / 4 < 0 && !(0 == d / 4 % 2)) || !(B * 1 == d / 8)) && ((0 == d / 4 % 2 || !(B * 1 == 1 + d / 8)) || !(d / 4 < 0))))) || (d < 0 && !(0 == d % 2))) || A == B * 1 * (q + (1 + p / 2)) + (r + -(d / 2))))) || !(p < 0)) || (((0 == (p / 2 + 1) % 2 || !(1 + p / 2 < 0)) || (((!(1 <= 1 + ((p / 2 + 1) / 2 + 1) / 2) || !(1 + (p / 2 + 1) / 2 < 0)) || 0 == ((p / 2 + 1) / 2 + 1) % 2) && (!(1 <= ((p / 2 + 1) / 2 + 1) / 2) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2))))) && ((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || ((((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2)) || !(1 <= (p / 2 + 1) / 4)) && ((!(1 <= 1 + (p / 2 + 1) / 4) || 0 == (p / 2 + 1) / 2 % 2) || !((p / 2 + 1) / 2 < 0))))))) && A == d * q + r) && (((((((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 <= p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 <= 1 + p / 4))) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || !(p < 0)) || (((!(1 <= 1 + (p / 2 + 1) / 2) || 0 == (p / 2 + 1) % 2) || !(1 + p / 2 < 0)) && ((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || !(1 <= (p / 2 + 1) / 2))))) || (((0 == d % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || !(B * 1 == (d / 2 + 1) / 2)) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || !(B * 1 == 1 + (d / 2 + 1) / 2)))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || !(B * 1 == 1 + d / 4)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || !(B * 1 == d / 4)))))) || A == B * 1 * (q + p) + (r + -d))) && r == A) && B == 1) && (1 == p || (((((A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)) && (A == (q + p / 2) * B + (r + -(d / 2)) || (d < 0 && !(0 == d % 2)))) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || ((A == (q + (1 + p / 2)) * B + (r + -(d / 2)) || (d < 0 && !(0 == d % 2))) && ((A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)))) || !(p < 0))))) && ((A == B * 1 * (q + 2 * p) + (r + -(2 * d)) || (((d < 0 && !(0 == d % 2)) || !(B * 1 == 2 * d / 4)) && ((0 == d % 2 || !(d < 0)) || !(B * 1 == 1 + 2 * d / 4)))) || (((0 == p % 2 || !(p < 0)) || !(1 <= 1 + 2 * p / 4)) && (!(1 <= 2 * p / 4) || (p < 0 && !(0 == p % 2)))))) && ((d < 0 && !(0 == d % 2)) || ((((((!(d / 2 < 0) || ((((0 == (p / 2 + 1) % 2 || 1 == 1 + (p / 2 + 1) / 2) || !(1 + p / 2 < 0)) || (((((A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2))) || 0 == (d / 4 + 1) % 2) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + -(d / 2) + -((d / 4 + 1) / 2)))) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2))) && (((((0 == (d / 4 + 1) % 2 || A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2)))) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + -(d / 2) + -((d / 4 + 1) / 2)))) || !(1 + (p / 2 + 1) / 2 < 0)) || 0 == ((p / 2 + 1) / 2 + 1) % 2))) && ((1 == (p / 2 + 1) / 2 || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))) || (((0 == (p / 2 + 1) / 2 % 2 || !((p / 2 + 1) / 2 < 0)) || (((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + -(d / 2) + -((d / 4 + 1) / 2))) && ((0 == (d / 4 + 1) % 2 || !(1 + d / 4 < 0)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2)))))) && ((((0 == (d / 4 + 1) % 2 || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2)))) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + -(d / 2) + -((d / 4 + 1) / 2)))) || ((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2))))))) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || (((((((!(1 + (p / 2 + 1) / 2 < 0) || ((A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2))) && ((0 == d / 4 % 2 || A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0)))) || 0 == ((p / 2 + 1) / 2 + 1) % 2) && (((A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2))) && ((0 == d / 4 % 2 || A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0))) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2)))) || 0 == (p / 2 + 1) % 2) || 1 == 1 + (p / 2 + 1) / 2) || !(1 + p / 2 < 0)) && ((1 == (p / 2 + 1) / 2 || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))) || (((((0 == d / 4 % 2 || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0)) && (A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2)))) || ((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2))) && ((((A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2))) && ((0 == d / 4 % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0))) || 0 == (p / 2 + 1) / 2 % 2) || !((p / 2 + 1) / 2 < 0))))))) || 0 == p % 2) || !(p < 0)) && (((((((1 == p / 4 || (p / 2 < 0 && !(0 == p / 2 % 2))) || (((((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + p / 2 + p / 8) * B + (r + -(d / 2) + -((d / 4 + 1) / 2))) && ((A == (q + p / 2 + p / 8) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2))) || 0 == (d / 4 + 1) % 2) || !(1 + d / 4 < 0))) || (p / 4 < 0 && !(0 == p / 4 % 2))) && ((0 == p / 4 % 2 || (((A == (q + p / 2 + (1 + p / 8)) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2))) || 0 == (d / 4 + 1) % 2) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + p / 2 + (1 + p / 8)) * B + (r + -(d / 2) + -((d / 4 + 1) / 2))))) || !(p / 4 < 0)))) && (((0 == p / 2 % 2 || !(p / 2 < 0)) || (((!(1 + p / 4 < 0) || 0 == (p / 4 + 1) % 2) || (((0 == (d / 4 + 1) % 2 || !(1 + d / 4 < 0)) || A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2)))) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + -(d / 2) + -((d / 4 + 1) / 2))))) && ((((A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2))) || 0 == (d / 4 + 1) % 2) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + -(d / 2) + -((d / 4 + 1) / 2)))) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0)))) || 1 == 1 + p / 4)) || !(d / 2 < 0)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || ((((0 == p / 2 % 2 || ((((((0 == d / 4 % 2 || A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0)) && (A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2)))) || !(1 + p / 4 < 0)) || 0 == (p / 4 + 1) % 2) && ((((A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + -(d / 2) + (-1 + -(d / 8))) || 0 == d / 4 % 2) || !(d / 4 < 0)) && (A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2)))) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0)))) || !(p / 2 < 0)) || 1 == 1 + p / 4) && ((1 == p / 4 || (p / 2 < 0 && !(0 == p / 2 % 2))) || (((((0 == d / 4 % 2 || A == (q + p / 2 + p / 8) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0)) && (A == (q + p / 2 + p / 8) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2)))) || (p / 4 < 0 && !(0 == p / 4 % 2))) && ((0 == p / 4 % 2 || (((0 == d / 4 % 2 || !(d / 4 < 0)) || A == (q + p / 2 + (1 + p / 8)) * B + (r + -(d / 2) + (-1 + -(d / 8)))) && (A == (q + p / 2 + (1 + p / 8)) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2))))) || !(p / 4 < 0))))))) || (p < 0 && !(0 == p % 2)))))) && (((((((((((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || !(B * 1 == (d / 4 + 1) / 2)) && ((0 == (d / 4 + 1) % 2 || !(1 + d / 4 < 0)) || !(B * 1 == 1 + (d / 4 + 1) / 2))) || !(d / 2 < 0)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || (((d / 4 < 0 && !(0 == d / 4 % 2)) || !(B * 1 == d / 8)) && ((0 == d / 4 % 2 || !(B * 1 == 1 + d / 8)) || !(d / 4 < 0))))) || A == B * 1 * (q + p / 2) + (r + -(d / 2))) || (d < 0 && !(0 == d % 2))) && (((0 == d % 2 || A == B * 1 * (q + p / 2) + (r + (-1 + -(d / 2)))) || (((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((!(B * 1 == 1 + ((d / 2 + 1) / 2 + 1) / 2) || !(1 + (d / 2 + 1) / 2 < 0)) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && ((1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || ((!(B * 1 == (d / 2 + 1) / 4) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((!((d / 2 + 1) / 2 < 0) || !(B * 1 == 1 + (d / 2 + 1) / 4)) || 0 == (d / 2 + 1) / 2 % 2))))) || !(d < 0))) || (p < 0 && !(0 == p % 2))) || (((p / 2 < 0 && !(0 == p / 2 % 2)) || (((0 == p / 4 % 2 || !(1 <= 1 + p / 8)) || !(p / 4 < 0)) && (!(1 <= p / 8) || (!(0 == p / 4 % 2) && p / 4 < 0)))) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || (((!(1 <= 1 + (p / 4 + 1) / 2) || 0 == (p / 4 + 1) % 2) || !(1 + p / 4 < 0)) && (!(1 <= (p / 4 + 1) / 2) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0))))))) && A == q * B + r) && ((d < 0 && !(0 == d % 2)) || (((1 == p / 2 || (p < 0 && !(0 == p % 2))) || (((p / 2 < 0 && !(0 == p / 2 % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) && (((((!(d / 2 < 0) || 0 == d / 2 % 2) || A == (q + p + (1 + p / 4)) * B + (r + -d + (-1 + -(d / 4)))) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + -(d / 4)))) || 0 == p / 2 % 2) || !(p / 2 < 0)))) && (((0 == p % 2 || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) && ((0 == (p / 2 + 1) % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) || !(1 + p / 2 < 0)))) || 1 == 1 + p / 2) || !(p < 0))))) && ((((0 == d % 2 || B == 1 + d / 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || B == d / 2)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && ((0 == d % 2 || ((((((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || ((((0 == (p / 2 + 1) % 2 || 1 == 1 + (p / 2 + 1) / 2) || !(1 + p / 2 < 0)) || (((!(1 + (p / 2 + 1) / 2 < 0) || (((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && (A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2))))) || 0 == ((p / 2 + 1) / 2 + 1) % 2) && ((((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && (A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)))) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2))))) && ((1 == (p / 2 + 1) / 2 || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))) || (((0 == (p / 2 + 1) / 2 % 2 || !((p / 2 + 1) / 2 < 0)) || (((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && ((1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2))))) && (((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2)) || (((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && (A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2))))))))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((1 == (p / 2 + 1) / 2 || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))) || ((((A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))))) || ((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2))) && ((0 == (p / 2 + 1) / 2 % 2 || (((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)))) && (A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))))) || !((p / 2 + 1) / 2 < 0)))) && (((0 == (p / 2 + 1) % 2 || 1 == 1 + (p / 2 + 1) / 2) || !(1 + p / 2 < 0)) || (((!(1 + (p / 2 + 1) / 2 < 0) || ((A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))) || !((d / 2 + 1) / 2 < 0)) || 0 == (d / 2 + 1) / 2 % 2))) || 0 == ((p / 2 + 1) / 2 + 1) % 2) && (((A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))))) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2)))))))) || 0 == p % 2) || !(p < 0)) && ((((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((1 == p / 4 || (p / 2 < 0 && !(0 == p / 2 % 2))) || (((0 == p / 4 % 2 || (((A == (q + p / 2 + (1 + p / 8)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))) || !((d / 2 + 1) / 2 < 0)) || 0 == (d / 2 + 1) / 2 % 2) && (A == (q + p / 2 + (1 + p / 8)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))))) || !(p / 4 < 0)) && (((A == (q + p / 2 + p / 8) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + p / 2 + p / 8) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))))) || (p / 4 < 0 && !(0 == p / 4 % 2))))) && (((((((((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2)) || A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4))) && ((A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))) || !((d / 2 + 1) / 2 < 0)) || 0 == (d / 2 + 1) / 2 % 2)) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0)) && ((!(1 + p / 4 < 0) || 0 == (p / 4 + 1) % 2) || (((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)))) && (A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2)))))) || 0 == p / 2 % 2) || !(p / 2 < 0)) || 1 == 1 + p / 4))) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((((((A == (q + p / 2 + p / 8) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2))) && ((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + p / 2 + p / 8) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2)) || (p / 4 < 0 && !(0 == p / 4 % 2))) && (((((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + p / 2 + (1 + p / 8)) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && (A == (q + p / 2 + (1 + p / 8)) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)))) || 0 == p / 4 % 2) || !(p / 4 < 0))) || 1 == p / 4) || (p / 2 < 0 && !(0 == p / 2 % 2))) && (((0 == p / 2 % 2 || (((((1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)) || A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2))) && ((A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2))) || !(1 + (d / 2 + 1) / 2 < 0)) || 0 == ((d / 2 + 1) / 2 + 1) % 2)) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0)) && ((((A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2))) && ((A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2))) || !(1 + (d / 2 + 1) / 2 < 0)) || 0 == ((d / 2 + 1) / 2 + 1) % 2)) || !(1 + p / 4 < 0)) || 0 == (p / 4 + 1) % 2))) || !(p / 2 < 0)) || 1 == 1 + p / 4)))) || (p < 0 && !(0 == p % 2))))) || !(d < 0))) && (!(1 == p) || B == d)) && d == B * p) && ((A == B * 1 * q + r || ((!(B * 1 == d / 2) || (d < 0 && !(0 == d % 2))) && ((0 == d % 2 || !(B * 1 == 1 + d / 2)) || !(d < 0)))) || (((!(1 <= 1 + p / 2) || 0 == p % 2) || !(p < 0)) && (!(1 <= p / 2) || (p < 0 && !(0 == p % 2)))))) && ((((1 == p / 2 || (((((!(d / 2 < 0) || A == (q + p / 4) * B + (r + (-1 + -(d / 4)))) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p / 4) * B + (r + -(d / 4)))) || (p / 2 < 0 && !(0 == p / 2 % 2))) && ((0 == p / 2 % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + (1 + p / 4)) * B + (r + -(d / 4))) && ((A == (q + (1 + p / 4)) * B + (r + (-1 + -(d / 4))) || !(d / 2 < 0)) || 0 == d / 2 % 2))) || !(p / 2 < 0)))) || (p < 0 && !(0 == p % 2))) && (((0 == p % 2 || 1 == 1 + p / 2) || (((0 == (p / 2 + 1) % 2 || !(1 + p / 2 < 0)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 4))) && ((!(d / 2 < 0) || 0 == d / 2 % 2) || A == (q + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 4)))))) && ((((A == (q + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 4))) || !(d / 2 < 0)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + (p / 2 + 1) / 2) * B + (r + -(d / 4)))) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))))) || !(p < 0))) || (d < 0 && !(0 == d % 2))))) || ((((((((((((((((((((((((((A == B * 1 * q + r || (((((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 <= p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 <= 1 + p / 4))) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || !(p < 0)) || (((!(1 <= 1 + (p / 2 + 1) / 2) || 0 == (p / 2 + 1) % 2) || !(1 + p / 2 < 0)) && ((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || !(1 <= (p / 2 + 1) / 2)))))) || (((0 == d % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || !(B * 1 == (d / 2 + 1) / 2)) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || !(B * 1 == 1 + (d / 2 + 1) / 2)))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || !(B * 1 == 1 + d / 4)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || !(B * 1 == d / 4)))))) && (((((1 == p / 2 || (((0 == p / 2 % 2 || (((!(1 + d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + -((d / 2 + 1) / 2))))) || !(p / 2 < 0)) && ((((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (q + p + p / 4) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + -((d / 2 + 1) / 2)))) || (p / 2 < 0 && !(0 == p / 2 % 2))))) || (p < 0 && !(0 == p % 2))) && (((0 == p % 2 || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + -((d / 2 + 1) / 2))) && ((!(1 + d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2))) && ((0 == (p / 2 + 1) % 2 || ((A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + -((d / 2 + 1) / 2)) || (!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0)) && ((!(1 + d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2))) || !(1 + p / 2 < 0)))) || 1 == 1 + p / 2) || !(p < 0))) || 0 == d % 2) || !(d < 0))) && ((((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || 0 == d / 2 % 2) || B == 1 + d / 4) && ((!(0 == d / 2 % 2) && d / 2 < 0) || B == d / 4))) && ((0 == d % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || B == (d / 2 + 1) / 2) && ((B == 1 + (d / 2 + 1) / 2 || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2))) || !(d < 0))) || (((0 == p % 2 || !(p < 0)) || (((0 == (p / 2 + 1) % 2 || !(1 == 1 + (p / 2 + 1) / 2)) || !(1 + p / 2 < 0)) && (!(1 == (p / 2 + 1) / 2) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))))) && ((((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 == p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 == 1 + p / 4))) || (p < 0 && !(0 == p % 2)))))) && A == (q + p) * B + (r + -d)) && (A == d * q + r || !(1 == p))) && (((((((((((((((((((((((((0 == p % 2 || A == (q + p + (1 + p / 2)) * B + (r + -d + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p + p / 2) * B + (r + -d + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0)) && ((((0 == p % 2 || 1 == 1 + p / 2) || (((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || A == (1 + d / 4) * (q + (1 + p / 2)) + (r + -(d / 2))) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == d / 4 * (q + (1 + p / 2)) + (r + -(d / 2))))) && ((0 == d % 2 || (((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (1 + (d / 2 + 1) / 2) * (q + (1 + p / 2)) + (r + (-1 + -(d / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (d / 2 + 1) / 2 * (q + (1 + p / 2)) + (r + (-1 + -(d / 2)))))) || !(d < 0)))) || !(p < 0)) || (((0 == (p / 2 + 1) % 2 || !(1 == 1 + (p / 2 + 1) / 2)) || !(1 + p / 2 < 0)) && (!(1 == (p / 2 + 1) / 2) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)))))) && (((((((((((((r == A || A + -1 * r == 0) && A == (q + p) * B + (r + -d)) && (A == d * q + r || !(1 == p))) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && 0 == q) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p) || ((((((((((((r == A || A + -1 * r == 0) && A == (q + p) * B + (r + -d)) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && 0 == q) && A == d * q + r) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p))) && 2 <= -d / -2) && r >= -d / -2) && A == (q + 2 * p + p) * B + (r + -(2 * d) + -d)) && (((1 == p / 2 || (((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 == p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 == 1 + p / 4)))) || (((0 == d % 2 || (((A == (1 + (d / 2 + 1) / 2) * (q + p / 2) + (r + (-1 + -(d / 2))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (d / 2 + 1) / 2 * (q + p / 2) + (r + (-1 + -(d / 2)))))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == d / 4 * (q + p / 2) + (r + -(d / 2))) && ((!(d / 2 < 0) || A == (1 + d / 4) * (q + p / 2) + (r + -(d / 2))) || 0 == d / 2 % 2))))) || (p < 0 && !(0 == p % 2)))) && ((1 == p || (((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r))) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && A == d * q + r) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && d % 2 == 0) && A == q * B + r) && ((0 == d % 2 || (((0 == p % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) || !(1 + p / 2 < 0)))) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) || !(1 + p / 2 < 0)))))) || !(p < 0)) && (((((((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || 0 == p / 2 % 2) || !(p / 2 < 0))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2)))))) || (p < 0 && !(0 == p % 2))))) || !(d < 0))) && A == (q + p) * B + (r + -d)) && ((((0 == d % 2 || B == 1 + d / 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || B == d / 2)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && (((((0 == d % 2 || !(d < 0)) || A == (1 + d / 2) * (q + p) + (r + -d)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * (q + p) + (r + -d))) || 1 == p) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || !(p < 0)) || A == (q + p + (1 + p / 2)) * B + (r + -d + -(d / 2))) && (A == (q + p + p / 2) * B + (r + -d + -(d / 2)) || (p < 0 && !(0 == p % 2)))))) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (!(1 == p) || B == d)) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + -(d / 4))) && ((0 == (p / 2 + 1) % 2 || !(1 + p / 2 < 0)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + -(d / 4))))) && ((!(d / 2 < 0) || (((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) || !(1 + p / 2 < 0)) && (A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + (-1 + -(d / 4))) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))))) || 0 == d / 2 % 2))) || !(p < 0)) && ((p < 0 && !(0 == p % 2)) || (((((A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + -(d / 4)) || 0 == p / 2 % 2) || !(p / 2 < 0)) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + -(d / 4)))) || (!(0 == d / 2 % 2) && d / 2 < 0)) && (((((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + (-1 + -(d / 4))))) || !(d / 2 < 0)) || 0 == d / 2 % 2)))))) || ((((((((((((((((((((((((0 == p % 2 || A == (q + p + (1 + p / 2)) * B + (r + -d + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p + p / 2) * B + (r + -d + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0)) && ((((0 == p % 2 || 1 == 1 + p / 2) || (((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || A == (1 + d / 4) * (q + (1 + p / 2)) + (r + -(d / 2))) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == d / 4 * (q + (1 + p / 2)) + (r + -(d / 2))))) && ((0 == d % 2 || (((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (1 + (d / 2 + 1) / 2) * (q + (1 + p / 2)) + (r + (-1 + -(d / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (d / 2 + 1) / 2 * (q + (1 + p / 2)) + (r + (-1 + -(d / 2)))))) || !(d < 0)))) || !(p < 0)) || (((0 == (p / 2 + 1) % 2 || !(1 == 1 + (p / 2 + 1) / 2)) || !(1 + p / 2 < 0)) && (!(1 == (p / 2 + 1) / 2) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)))))) && (((((((((((((r == A || A + -1 * r == 0) && A == (q + p) * B + (r + -d)) && (A == d * q + r || !(1 == p))) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && 0 == q) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p) || ((((((((((((r == A || A + -1 * r == 0) && A == (q + p) * B + (r + -d)) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && 0 == q) && A == d * q + r) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p))) && 2 <= -d / -2) && r >= -d / -2) && A == (q + 2 * p + p) * B + (r + -(2 * d) + -d)) && (((1 == p / 2 || (((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 == p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 == 1 + p / 4)))) || (((0 == d % 2 || (((A == (1 + (d / 2 + 1) / 2) * (q + p / 2) + (r + (-1 + -(d / 2))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (d / 2 + 1) / 2 * (q + p / 2) + (r + (-1 + -(d / 2)))))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == d / 4 * (q + p / 2) + (r + -(d / 2))) && ((!(d / 2 < 0) || A == (1 + d / 4) * (q + p / 2) + (r + -(d / 2))) || 0 == d / 2 % 2))))) || (p < 0 && !(0 == p % 2)))) && ((1 == p || (((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r))) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && d % 2 == 0) && A == q * B + r) && ((0 == d % 2 || (((0 == p % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) || !(1 + p / 2 < 0)))) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) || !(1 + p / 2 < 0)))))) || !(p < 0)) && (((((((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || 0 == p / 2 % 2) || !(p / 2 < 0))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2)))))) || (p < 0 && !(0 == p % 2))))) || !(d < 0))) && A == (q + p) * B + (r + -d)) && (A == d * q + r || !(1 == p))) && ((((0 == d % 2 || B == 1 + d / 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || B == d / 2)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && (((((0 == d % 2 || !(d < 0)) || A == (1 + d / 2) * (q + p) + (r + -d)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * (q + p) + (r + -d))) || 1 == p) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || !(p < 0)) || A == (q + p + (1 + p / 2)) * B + (r + -d + -(d / 2))) && (A == (q + p + p / 2) * B + (r + -d + -(d / 2)) || (p < 0 && !(0 == p % 2)))))) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (!(1 == p) || B == d)) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + -(d / 4))) && ((0 == (p / 2 + 1) % 2 || !(1 + p / 2 < 0)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + -(d / 4))))) && ((!(d / 2 < 0) || (((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) || !(1 + p / 2 < 0)) && (A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + (-1 + -(d / 4))) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))))) || 0 == d / 2 % 2))) || !(p < 0)) && ((p < 0 && !(0 == p % 2)) || (((((A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + -(d / 4)) || 0 == p / 2 % 2) || !(p / 2 < 0)) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + -(d / 4)))) || (!(0 == d / 2 % 2) && d / 2 < 0)) && (((((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + (-1 + -(d / 4))))) || !(d / 2 < 0)) || 0 == d / 2 % 2)))))))) && (1 == 2 * p || A == (q + 2 * (2 * p) + p) * B + (r + -(2 * (2 * d)) + -d))) && ((((p < 0 && !(0 == p % 2)) || ((A == (q + 2 * p + 2 * p / 4) * B + (r + -(2 * d) + -(2 * d / 4)) || (d < 0 && !(0 == d % 2))) && ((A == (q + 2 * p + 2 * p / 4) * B + (r + -(2 * d) + (-1 + -(2 * d / 4))) || 0 == d % 2) || !(d < 0)))) && ((0 == p % 2 || (((0 == d % 2 || A == (q + 2 * p + (1 + 2 * p / 4)) * B + (r + -(2 * d) + (-1 + -(2 * d / 4)))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == (q + 2 * p + (1 + 2 * p / 4)) * B + (r + -(2 * d) + -(2 * d / 4))))) || !(p < 0))) || 1 == p)) && ((0 == d % 2 || (((1 == p / 2 || (((0 == p / 2 % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + (1 + p / 4)) * B + (r + -((d / 2 + 1) / 2))) && ((A == (q + (1 + p / 4)) * B + (r + (-1 + -((d / 2 + 1) / 2))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2))) || !(p / 2 < 0)) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p / 4) * B + (r + -((d / 2 + 1) / 2))) && ((A == (q + p / 4) * B + (r + (-1 + -((d / 2 + 1) / 2))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2))))) || (p < 0 && !(0 == p % 2))) && (((0 == p % 2 || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + (p / 2 + 1) / 2) * B + (r + -((d / 2 + 1) / 2))) && ((!(1 + d / 2 < 0) || A == (q + (p / 2 + 1) / 2) * B + (r + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2))) && ((0 == (p / 2 + 1) % 2 || (((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (q + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -((d / 2 + 1) / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + (1 + (p / 2 + 1) / 2)) * B + (r + -((d / 2 + 1) / 2))))) || !(1 + p / 2 < 0)))) || 1 == 1 + p / 2) || !(p < 0)))) || !(d < 0))) && (((0 == p % 2 || ((((A == B * 1 * (q + (1 + p / 2)) + (r + (-1 + -(d / 2))) || 0 == d % 2) || (((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((!(B * 1 == 1 + ((d / 2 + 1) / 2 + 1) / 2) || !(1 + (d / 2 + 1) / 2 < 0)) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && ((1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || ((!(B * 1 == (d / 2 + 1) / 4) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((!((d / 2 + 1) / 2 < 0) || !(B * 1 == 1 + (d / 2 + 1) / 4)) || 0 == (d / 2 + 1) / 2 % 2))))) || !(d < 0)) && ((((((((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || !(B * 1 == (d / 4 + 1) / 2)) && ((0 == (d / 4 + 1) % 2 || !(1 + d / 4 < 0)) || !(B * 1 == 1 + (d / 4 + 1) / 2))) || !(d / 2 < 0)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || (((d / 4 < 0 && !(0 == d / 4 % 2)) || !(B * 1 == d / 8)) && ((0 == d / 4 % 2 || !(B * 1 == 1 + d / 8)) || !(d / 4 < 0))))) || (d < 0 && !(0 == d % 2))) || A == B * 1 * (q + (1 + p / 2)) + (r + -(d / 2))))) || !(p < 0)) || (((0 == (p / 2 + 1) % 2 || !(1 + p / 2 < 0)) || (((!(1 <= 1 + ((p / 2 + 1) / 2 + 1) / 2) || !(1 + (p / 2 + 1) / 2 < 0)) || 0 == ((p / 2 + 1) / 2 + 1) % 2) && (!(1 <= ((p / 2 + 1) / 2 + 1) / 2) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2))))) && ((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || ((((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2)) || !(1 <= (p / 2 + 1) / 4)) && ((!(1 <= 1 + (p / 2 + 1) / 4) || 0 == (p / 2 + 1) / 2 % 2) || !((p / 2 + 1) / 2 < 0))))))) && (((((((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 <= p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 <= 1 + p / 4))) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || !(p < 0)) || (((!(1 <= 1 + (p / 2 + 1) / 2) || 0 == (p / 2 + 1) % 2) || !(1 + p / 2 < 0)) && ((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || !(1 <= (p / 2 + 1) / 2))))) || (((0 == d % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || !(B * 1 == (d / 2 + 1) / 2)) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || !(B * 1 == 1 + (d / 2 + 1) / 2)))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || !(B * 1 == 1 + d / 4)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || !(B * 1 == d / 4)))))) || A == B * 1 * (q + p) + (r + -d))) && r == A) && B == 1) && (1 == p || (((((A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)) && (A == (q + p / 2) * B + (r + -(d / 2)) || (d < 0 && !(0 == d % 2)))) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || ((A == (q + (1 + p / 2)) * B + (r + -(d / 2)) || (d < 0 && !(0 == d % 2))) && ((A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)))) || !(p < 0))))) && ((A == B * 1 * (q + 2 * p) + (r + -(2 * d)) || (((d < 0 && !(0 == d % 2)) || !(B * 1 == 2 * d / 4)) && ((0 == d % 2 || !(d < 0)) || !(B * 1 == 1 + 2 * d / 4)))) || (((0 == p % 2 || !(p < 0)) || !(1 <= 1 + 2 * p / 4)) && (!(1 <= 2 * p / 4) || (p < 0 && !(0 == p % 2)))))) && ((d < 0 && !(0 == d % 2)) || ((((((!(d / 2 < 0) || ((((0 == (p / 2 + 1) % 2 || 1 == 1 + (p / 2 + 1) / 2) || !(1 + p / 2 < 0)) || (((((A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2))) || 0 == (d / 4 + 1) % 2) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + -(d / 2) + -((d / 4 + 1) / 2)))) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2))) && (((((0 == (d / 4 + 1) % 2 || A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2)))) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + -(d / 2) + -((d / 4 + 1) / 2)))) || !(1 + (p / 2 + 1) / 2 < 0)) || 0 == ((p / 2 + 1) / 2 + 1) % 2))) && ((1 == (p / 2 + 1) / 2 || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))) || (((0 == (p / 2 + 1) / 2 % 2 || !((p / 2 + 1) / 2 < 0)) || (((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + -(d / 2) + -((d / 4 + 1) / 2))) && ((0 == (d / 4 + 1) % 2 || !(1 + d / 4 < 0)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2)))))) && ((((0 == (d / 4 + 1) % 2 || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2)))) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + -(d / 2) + -((d / 4 + 1) / 2)))) || ((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2))))))) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || (((((((!(1 + (p / 2 + 1) / 2 < 0) || ((A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2))) && ((0 == d / 4 % 2 || A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0)))) || 0 == ((p / 2 + 1) / 2 + 1) % 2) && (((A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2))) && ((0 == d / 4 % 2 || A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0))) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2)))) || 0 == (p / 2 + 1) % 2) || 1 == 1 + (p / 2 + 1) / 2) || !(1 + p / 2 < 0)) && ((1 == (p / 2 + 1) / 2 || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))) || (((((0 == d / 4 % 2 || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0)) && (A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2)))) || ((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2))) && ((((A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2))) && ((0 == d / 4 % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0))) || 0 == (p / 2 + 1) / 2 % 2) || !((p / 2 + 1) / 2 < 0))))))) || 0 == p % 2) || !(p < 0)) && (((((((1 == p / 4 || (p / 2 < 0 && !(0 == p / 2 % 2))) || (((((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + p / 2 + p / 8) * B + (r + -(d / 2) + -((d / 4 + 1) / 2))) && ((A == (q + p / 2 + p / 8) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2))) || 0 == (d / 4 + 1) % 2) || !(1 + d / 4 < 0))) || (p / 4 < 0 && !(0 == p / 4 % 2))) && ((0 == p / 4 % 2 || (((A == (q + p / 2 + (1 + p / 8)) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2))) || 0 == (d / 4 + 1) % 2) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + p / 2 + (1 + p / 8)) * B + (r + -(d / 2) + -((d / 4 + 1) / 2))))) || !(p / 4 < 0)))) && (((0 == p / 2 % 2 || !(p / 2 < 0)) || (((!(1 + p / 4 < 0) || 0 == (p / 4 + 1) % 2) || (((0 == (d / 4 + 1) % 2 || !(1 + d / 4 < 0)) || A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2)))) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + -(d / 2) + -((d / 4 + 1) / 2))))) && ((((A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2))) || 0 == (d / 4 + 1) % 2) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + -(d / 2) + -((d / 4 + 1) / 2)))) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0)))) || 1 == 1 + p / 4)) || !(d / 2 < 0)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || ((((0 == p / 2 % 2 || ((((((0 == d / 4 % 2 || A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0)) && (A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2)))) || !(1 + p / 4 < 0)) || 0 == (p / 4 + 1) % 2) && ((((A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + -(d / 2) + (-1 + -(d / 8))) || 0 == d / 4 % 2) || !(d / 4 < 0)) && (A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2)))) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0)))) || !(p / 2 < 0)) || 1 == 1 + p / 4) && ((1 == p / 4 || (p / 2 < 0 && !(0 == p / 2 % 2))) || (((((0 == d / 4 % 2 || A == (q + p / 2 + p / 8) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0)) && (A == (q + p / 2 + p / 8) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2)))) || (p / 4 < 0 && !(0 == p / 4 % 2))) && ((0 == p / 4 % 2 || (((0 == d / 4 % 2 || !(d / 4 < 0)) || A == (q + p / 2 + (1 + p / 8)) * B + (r + -(d / 2) + (-1 + -(d / 8)))) && (A == (q + p / 2 + (1 + p / 8)) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2))))) || !(p / 4 < 0))))))) || (p < 0 && !(0 == p % 2)))))) && (((((((((((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || !(B * 1 == (d / 4 + 1) / 2)) && ((0 == (d / 4 + 1) % 2 || !(1 + d / 4 < 0)) || !(B * 1 == 1 + (d / 4 + 1) / 2))) || !(d / 2 < 0)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || (((d / 4 < 0 && !(0 == d / 4 % 2)) || !(B * 1 == d / 8)) && ((0 == d / 4 % 2 || !(B * 1 == 1 + d / 8)) || !(d / 4 < 0))))) || A == B * 1 * (q + p / 2) + (r + -(d / 2))) || (d < 0 && !(0 == d % 2))) && (((0 == d % 2 || A == B * 1 * (q + p / 2) + (r + (-1 + -(d / 2)))) || (((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((!(B * 1 == 1 + ((d / 2 + 1) / 2 + 1) / 2) || !(1 + (d / 2 + 1) / 2 < 0)) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && ((1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || ((!(B * 1 == (d / 2 + 1) / 4) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((!((d / 2 + 1) / 2 < 0) || !(B * 1 == 1 + (d / 2 + 1) / 4)) || 0 == (d / 2 + 1) / 2 % 2))))) || !(d < 0))) || (p < 0 && !(0 == p % 2))) || (((p / 2 < 0 && !(0 == p / 2 % 2)) || (((0 == p / 4 % 2 || !(1 <= 1 + p / 8)) || !(p / 4 < 0)) && (!(1 <= p / 8) || (!(0 == p / 4 % 2) && p / 4 < 0)))) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || (((!(1 <= 1 + (p / 4 + 1) / 2) || 0 == (p / 4 + 1) % 2) || !(1 + p / 4 < 0)) && (!(1 <= (p / 4 + 1) / 2) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0))))))) && A == q * B + r) && ((d < 0 && !(0 == d % 2)) || (((1 == p / 2 || (p < 0 && !(0 == p % 2))) || (((p / 2 < 0 && !(0 == p / 2 % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) && (((((!(d / 2 < 0) || 0 == d / 2 % 2) || A == (q + p + (1 + p / 4)) * B + (r + -d + (-1 + -(d / 4)))) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + -(d / 4)))) || 0 == p / 2 % 2) || !(p / 2 < 0)))) && (((0 == p % 2 || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) && ((0 == (p / 2 + 1) % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) || !(1 + p / 2 < 0)))) || 1 == 1 + p / 2) || !(p < 0))))) && ((((0 == d % 2 || B == 1 + d / 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || B == d / 2)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && ((0 == d % 2 || ((((((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || ((((0 == (p / 2 + 1) % 2 || 1 == 1 + (p / 2 + 1) / 2) || !(1 + p / 2 < 0)) || (((!(1 + (p / 2 + 1) / 2 < 0) || (((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && (A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2))))) || 0 == ((p / 2 + 1) / 2 + 1) % 2) && ((((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && (A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)))) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2))))) && ((1 == (p / 2 + 1) / 2 || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))) || (((0 == (p / 2 + 1) / 2 % 2 || !((p / 2 + 1) / 2 < 0)) || (((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && ((1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2))))) && (((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2)) || (((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && (A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2))))))))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((1 == (p / 2 + 1) / 2 || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))) || ((((A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))))) || ((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2))) && ((0 == (p / 2 + 1) / 2 % 2 || (((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)))) && (A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))))) || !((p / 2 + 1) / 2 < 0)))) && (((0 == (p / 2 + 1) % 2 || 1 == 1 + (p / 2 + 1) / 2) || !(1 + p / 2 < 0)) || (((!(1 + (p / 2 + 1) / 2 < 0) || ((A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))) || !((d / 2 + 1) / 2 < 0)) || 0 == (d / 2 + 1) / 2 % 2))) || 0 == ((p / 2 + 1) / 2 + 1) % 2) && (((A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))))) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2)))))))) || 0 == p % 2) || !(p < 0)) && ((((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((1 == p / 4 || (p / 2 < 0 && !(0 == p / 2 % 2))) || (((0 == p / 4 % 2 || (((A == (q + p / 2 + (1 + p / 8)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))) || !((d / 2 + 1) / 2 < 0)) || 0 == (d / 2 + 1) / 2 % 2) && (A == (q + p / 2 + (1 + p / 8)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))))) || !(p / 4 < 0)) && (((A == (q + p / 2 + p / 8) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + p / 2 + p / 8) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))))) || (p / 4 < 0 && !(0 == p / 4 % 2))))) && (((((((((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2)) || A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4))) && ((A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))) || !((d / 2 + 1) / 2 < 0)) || 0 == (d / 2 + 1) / 2 % 2)) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0)) && ((!(1 + p / 4 < 0) || 0 == (p / 4 + 1) % 2) || (((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)))) && (A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2)))))) || 0 == p / 2 % 2) || !(p / 2 < 0)) || 1 == 1 + p / 4))) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((((((A == (q + p / 2 + p / 8) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2))) && ((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + p / 2 + p / 8) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2)) || (p / 4 < 0 && !(0 == p / 4 % 2))) && (((((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + p / 2 + (1 + p / 8)) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && (A == (q + p / 2 + (1 + p / 8)) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)))) || 0 == p / 4 % 2) || !(p / 4 < 0))) || 1 == p / 4) || (p / 2 < 0 && !(0 == p / 2 % 2))) && (((0 == p / 2 % 2 || (((((1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)) || A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2))) && ((A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2))) || !(1 + (d / 2 + 1) / 2 < 0)) || 0 == ((d / 2 + 1) / 2 + 1) % 2)) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0)) && ((((A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2))) && ((A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2))) || !(1 + (d / 2 + 1) / 2 < 0)) || 0 == ((d / 2 + 1) / 2 + 1) % 2)) || !(1 + p / 4 < 0)) || 0 == (p / 4 + 1) % 2))) || !(p / 2 < 0)) || 1 == 1 + p / 4)))) || (p < 0 && !(0 == p % 2))))) || !(d < 0))) && (!(1 == p) || B == d)) && d == B * p) && ((A == B * 1 * q + r || ((!(B * 1 == d / 2) || (d < 0 && !(0 == d % 2))) && ((0 == d % 2 || !(B * 1 == 1 + d / 2)) || !(d < 0)))) || (((!(1 <= 1 + p / 2) || 0 == p % 2) || !(p < 0)) && (!(1 <= p / 2) || (p < 0 && !(0 == p % 2)))))) && ((((1 == p / 2 || (((((!(d / 2 < 0) || A == (q + p / 4) * B + (r + (-1 + -(d / 4)))) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p / 4) * B + (r + -(d / 4)))) || (p / 2 < 0 && !(0 == p / 2 % 2))) && ((0 == p / 2 % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + (1 + p / 4)) * B + (r + -(d / 4))) && ((A == (q + (1 + p / 4)) * B + (r + (-1 + -(d / 4))) || !(d / 2 < 0)) || 0 == d / 2 % 2))) || !(p / 2 < 0)))) || (p < 0 && !(0 == p % 2))) && (((0 == p % 2 || 1 == 1 + p / 2) || (((0 == (p / 2 + 1) % 2 || !(1 + p / 2 < 0)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 4))) && ((!(d / 2 < 0) || 0 == d / 2 % 2) || A == (q + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 4)))))) && ((((A == (q + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 4))) || !(d / 2 < 0)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + (p / 2 + 1) / 2) * B + (r + -(d / 4)))) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))))) && B == 1) && A == q * B + r) && d == B * p)) || ((((((((((d == 2 * 1 && 2 <= d) && (r == A || A + -1 * r == 0)) && 0 == q) && r == A) && q == 0) && B == 1) && p == 2 * 1) && A == q * B + r) && d == B * p) && d == 2 * B)) || ((((((((((((((((((((((((((r == A || A + -1 * r == 0) && A == (q + p) * B + (r + -d)) && (A == d * q + r || !(1 == p))) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && 0 == q) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p) || ((((((((((((r == A || A + -1 * r == 0) && A == (q + p) * B + (r + -d)) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && 0 == q) && A == d * q + r) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p)) && 2 <= -d / -2) && r >= -d / -2) && r == A) && q == 0) && B == 1) && d == 2 * (2 * 1)) && d % 2 == 0) && A == q * B + r) && p == 2 * (2 * 1)) && d == 2 * (2 * B)) && ((((0 == d % 2 || B == 1 + d / 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || B == d / 2)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && (!(1 == p) || B == d)) && d == B * p)) || (((((((((((((((((((((((((((((((((((0 == p % 2 || A == (q + p + (1 + p / 2)) * B + (r + -d + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p + p / 2) * B + (r + -d + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0)) && ((((0 == p % 2 || 1 == 1 + p / 2) || (((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || A == (1 + d / 4) * (q + (1 + p / 2)) + (r + -(d / 2))) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == d / 4 * (q + (1 + p / 2)) + (r + -(d / 2))))) && ((0 == d % 2 || (((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (1 + (d / 2 + 1) / 2) * (q + (1 + p / 2)) + (r + (-1 + -(d / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (d / 2 + 1) / 2 * (q + (1 + p / 2)) + (r + (-1 + -(d / 2)))))) || !(d < 0)))) || !(p < 0)) || (((0 == (p / 2 + 1) % 2 || !(1 == 1 + (p / 2 + 1) / 2)) || !(1 + p / 2 < 0)) && (!(1 == (p / 2 + 1) / 2) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)))))) && (((((((((((((r == A || A + -1 * r == 0) && A == (q + p) * B + (r + -d)) && (A == d * q + r || !(1 == p))) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && 0 == q) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p) || ((((((((((((r == A || A + -1 * r == 0) && A == (q + p) * B + (r + -d)) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && 0 == q) && A == d * q + r) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p))) && 2 <= -d / -2) && r >= -d / -2) && A == (q + 2 * p + p) * B + (r + -(2 * d) + -d)) && (((1 == p / 2 || (((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 == p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 == 1 + p / 4)))) || (((0 == d % 2 || (((A == (1 + (d / 2 + 1) / 2) * (q + p / 2) + (r + (-1 + -(d / 2))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (d / 2 + 1) / 2 * (q + p / 2) + (r + (-1 + -(d / 2)))))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == d / 4 * (q + p / 2) + (r + -(d / 2))) && ((!(d / 2 < 0) || A == (1 + d / 4) * (q + p / 2) + (r + -(d / 2))) || 0 == d / 2 % 2))))) || (p < 0 && !(0 == p % 2)))) && ((1 == p || (((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r))) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && A == d * q + r) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && d % 2 == 0) && A == q * B + r) && ((0 == d % 2 || (((0 == p % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) || !(1 + p / 2 < 0)))) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) || !(1 + p / 2 < 0)))))) || !(p < 0)) && (((((((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || 0 == p / 2 % 2) || !(p / 2 < 0))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2)))))) || (p < 0 && !(0 == p % 2))))) || !(d < 0))) && A == (q + p) * B + (r + -d)) && ((((0 == d % 2 || B == 1 + d / 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || B == d / 2)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && (((((0 == d % 2 || !(d < 0)) || A == (1 + d / 2) * (q + p) + (r + -d)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * (q + p) + (r + -d))) || 1 == p) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || !(p < 0)) || A == (q + p + (1 + p / 2)) * B + (r + -d + -(d / 2))) && (A == (q + p + p / 2) * B + (r + -d + -(d / 2)) || (p < 0 && !(0 == p % 2)))))) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (!(1 == p) || B == d)) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + -(d / 4))) && ((0 == (p / 2 + 1) % 2 || !(1 + p / 2 < 0)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + -(d / 4))))) && ((!(d / 2 < 0) || (((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) || !(1 + p / 2 < 0)) && (A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + (-1 + -(d / 4))) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))))) || 0 == d / 2 % 2))) || !(p < 0)) && ((p < 0 && !(0 == p % 2)) || (((((A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + -(d / 4)) || 0 == p / 2 % 2) || !(p / 2 < 0)) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + -(d / 4)))) || (!(0 == d / 2 % 2) && d / 2 < 0)) && (((((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + (-1 + -(d / 4))))) || !(d / 2 < 0)) || 0 == d / 2 % 2)))))) || ((((((((((((((((((((((((0 == p % 2 || A == (q + p + (1 + p / 2)) * B + (r + -d + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p + p / 2) * B + (r + -d + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0)) && ((((0 == p % 2 || 1 == 1 + p / 2) || (((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || A == (1 + d / 4) * (q + (1 + p / 2)) + (r + -(d / 2))) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == d / 4 * (q + (1 + p / 2)) + (r + -(d / 2))))) && ((0 == d % 2 || (((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (1 + (d / 2 + 1) / 2) * (q + (1 + p / 2)) + (r + (-1 + -(d / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (d / 2 + 1) / 2 * (q + (1 + p / 2)) + (r + (-1 + -(d / 2)))))) || !(d < 0)))) || !(p < 0)) || (((0 == (p / 2 + 1) % 2 || !(1 == 1 + (p / 2 + 1) / 2)) || !(1 + p / 2 < 0)) && (!(1 == (p / 2 + 1) / 2) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)))))) && (((((((((((((r == A || A + -1 * r == 0) && A == (q + p) * B + (r + -d)) && (A == d * q + r || !(1 == p))) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && 0 == q) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p) || ((((((((((((r == A || A + -1 * r == 0) && A == (q + p) * B + (r + -d)) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && 0 == q) && A == d * q + r) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p))) && 2 <= -d / -2) && r >= -d / -2) && A == (q + 2 * p + p) * B + (r + -(2 * d) + -d)) && (((1 == p / 2 || (((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 == p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 == 1 + p / 4)))) || (((0 == d % 2 || (((A == (1 + (d / 2 + 1) / 2) * (q + p / 2) + (r + (-1 + -(d / 2))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (d / 2 + 1) / 2 * (q + p / 2) + (r + (-1 + -(d / 2)))))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == d / 4 * (q + p / 2) + (r + -(d / 2))) && ((!(d / 2 < 0) || A == (1 + d / 4) * (q + p / 2) + (r + -(d / 2))) || 0 == d / 2 % 2))))) || (p < 0 && !(0 == p % 2)))) && ((1 == p || (((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r))) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && d % 2 == 0) && A == q * B + r) && ((0 == d % 2 || (((0 == p % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) || !(1 + p / 2 < 0)))) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) || !(1 + p / 2 < 0)))))) || !(p < 0)) && (((((((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || 0 == p / 2 % 2) || !(p / 2 < 0))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2)))))) || (p < 0 && !(0 == p % 2))))) || !(d < 0))) && A == (q + p) * B + (r + -d)) && (A == d * q + r || !(1 == p))) && ((((0 == d % 2 || B == 1 + d / 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || B == d / 2)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && (((((0 == d % 2 || !(d < 0)) || A == (1 + d / 2) * (q + p) + (r + -d)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * (q + p) + (r + -d))) || 1 == p) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || !(p < 0)) || A == (q + p + (1 + p / 2)) * B + (r + -d + -(d / 2))) && (A == (q + p + p / 2) * B + (r + -d + -(d / 2)) || (p < 0 && !(0 == p % 2)))))) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (!(1 == p) || B == d)) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + -(d / 4))) && ((0 == (p / 2 + 1) % 2 || !(1 + p / 2 < 0)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + -(d / 4))))) && ((!(d / 2 < 0) || (((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) || !(1 + p / 2 < 0)) && (A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + (-1 + -(d / 4))) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))))) || 0 == d / 2 % 2))) || !(p < 0)) && ((p < 0 && !(0 == p % 2)) || (((((A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + -(d / 4)) || 0 == p / 2 % 2) || !(p / 2 < 0)) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + -(d / 4)))) || (!(0 == d / 2 % 2) && d / 2 < 0)) && (((((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + (-1 + -(d / 4))))) || !(d / 2 < 0)) || 0 == d / 2 % 2))))))) && ((((0 == d % 2 || B == 1 + d / 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || B == d / 2)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && r == A) && d == 2 * (2 * (2 * B))) && ((((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || 0 == d / 2 % 2) || B == 1 + d / 4) && ((!(0 == d / 2 % 2) && d / 2 < 0) || B == d / 4))) && ((0 == d % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || B == (d / 2 + 1) / 2) && ((B == 1 + (d / 2 + 1) / 2 || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2))) || !(d < 0))) || (((0 == p % 2 || !(p < 0)) || (((0 == (p / 2 + 1) % 2 || !(1 == 1 + (p / 2 + 1) / 2)) || !(1 + p / 2 < 0)) && (!(1 == (p / 2 + 1) / 2) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))))) && ((((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 == p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 == 1 + p / 4))) || (p < 0 && !(0 == p % 2)))))) && (!(1 == p) || B == d)) && q == 0) && B == 1) && A == q * B + r) && d == B * p) && p == 2 * (2 * (2 * 1))) RESULT: Ultimate proved your program to be correct! [2023-02-17 07:33:34,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE