./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 26d01a9c 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-?-26d01a9 [2023-02-17 02:06:59,254 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 02:06:59,256 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 02:06:59,276 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 02:06:59,276 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 02:06:59,277 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 02:06:59,278 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 02:06:59,279 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 02:06:59,280 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 02:06:59,281 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 02:06:59,282 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 02:06:59,283 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 02:06:59,283 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 02:06:59,284 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 02:06:59,284 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 02:06:59,285 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 02:06:59,286 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 02:06:59,287 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 02:06:59,288 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 02:06:59,289 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 02:06:59,290 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 02:06:59,291 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 02:06:59,291 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 02:06:59,292 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 02:06:59,294 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 02:06:59,294 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 02:06:59,295 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 02:06:59,295 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 02:06:59,296 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 02:06:59,296 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 02:06:59,297 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 02:06:59,297 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 02:06:59,298 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 02:06:59,298 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 02:06:59,299 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 02:06:59,299 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 02:06:59,300 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 02:06:59,300 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 02:06:59,300 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 02:06:59,301 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 02:06:59,319 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 02:06:59,320 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 02:06:59,341 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 02:06:59,342 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 02:06:59,342 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 02:06:59,342 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 02:06:59,342 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 02:06:59,343 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 02:06:59,343 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 02:06:59,343 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 02:06:59,343 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 02:06:59,343 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 02:06:59,344 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 02:06:59,344 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 02:06:59,344 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 02:06:59,344 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 02:06:59,344 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 02:06:59,344 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 02:06:59,344 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 02:06:59,344 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 02:06:59,345 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 02:06:59,345 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 02:06:59,345 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 02:06:59,345 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 02:06:59,345 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 02:06:59,345 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 02:06:59,345 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 02:06:59,346 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 02:06:59,346 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 02:06:59,346 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 02:06:59,346 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 02:06:59,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 02:06:59,346 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 02:06:59,346 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 02:06:59,346 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 02:06:59,347 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 02:06:59,347 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 02:06:59,347 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 02:06:59,545 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 02:06:59,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 02:06:59,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 02:06:59,569 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 02:06:59,570 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 02:06:59,570 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 02:07:00,570 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 02:07:00,730 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 02:07:00,730 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound100.c [2023-02-17 02:07:00,734 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4936f121d/5622247e17874b44a3047231dd36d5c1/FLAG04c16df58 [2023-02-17 02:07:01,134 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4936f121d/5622247e17874b44a3047231dd36d5c1 [2023-02-17 02:07:01,136 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 02:07:01,136 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 02:07:01,137 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 02:07:01,137 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 02:07:01,142 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 02:07:01,143 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 02:07:01" (1/1) ... [2023-02-17 02:07:01,143 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e635396 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:07:01, skipping insertion in model container [2023-02-17 02:07:01,145 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 02:07:01" (1/1) ... [2023-02-17 02:07:01,150 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 02:07:01,164 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 02:07:01,264 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 02:07:01,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 02:07:01,294 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 02:07:01,302 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 02:07:01,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 02:07:01,317 INFO L208 MainTranslator]: Completed translation [2023-02-17 02:07:01,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:07:01 WrapperNode [2023-02-17 02:07:01,318 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 02:07:01,319 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 02:07:01,319 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 02:07:01,319 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 02:07:01,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:07:01" (1/1) ... [2023-02-17 02:07:01,327 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:07:01" (1/1) ... [2023-02-17 02:07:01,338 INFO L138 Inliner]: procedures = 14, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2023-02-17 02:07:01,339 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 02:07:01,339 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 02:07:01,339 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 02:07:01,340 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 02:07:01,345 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:07:01" (1/1) ... [2023-02-17 02:07:01,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:07:01" (1/1) ... [2023-02-17 02:07:01,347 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:07:01" (1/1) ... [2023-02-17 02:07:01,347 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:07:01" (1/1) ... [2023-02-17 02:07:01,349 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:07:01" (1/1) ... [2023-02-17 02:07:01,353 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:07:01" (1/1) ... [2023-02-17 02:07:01,354 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:07:01" (1/1) ... [2023-02-17 02:07:01,354 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:07:01" (1/1) ... [2023-02-17 02:07:01,356 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 02:07:01,357 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 02:07:01,357 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 02:07:01,357 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 02:07:01,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:07:01" (1/1) ... [2023-02-17 02:07:01,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 02:07:01,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:07:01,380 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 02:07:01,384 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 02:07:01,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 02:07:01,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 02:07:01,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 02:07:01,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 02:07:01,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-17 02:07:01,408 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-17 02:07:01,457 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 02:07:01,459 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 02:07:01,645 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 02:07:01,650 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 02:07:01,650 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-17 02:07:01,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 02:07:01 BoogieIcfgContainer [2023-02-17 02:07:01,651 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 02:07:01,653 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 02:07:01,653 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 02:07:01,655 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 02:07:01,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 02:07:01" (1/3) ... [2023-02-17 02:07:01,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36a12ca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 02:07:01, skipping insertion in model container [2023-02-17 02:07:01,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:07:01" (2/3) ... [2023-02-17 02:07:01,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36a12ca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 02:07:01, skipping insertion in model container [2023-02-17 02:07:01,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 02:07:01" (3/3) ... [2023-02-17 02:07:01,657 INFO L112 eAbstractionObserver]: Analyzing ICFG hard2_valuebound100.c [2023-02-17 02:07:01,679 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 02:07:01,680 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 02:07:01,713 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 02:07:01,719 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;@3f8c390, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 02:07:01,719 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 02:07:01,722 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 02:07:01,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-17 02:07:01,739 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:07:01,739 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:07:01,740 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:07:01,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:07:01,743 INFO L85 PathProgramCache]: Analyzing trace with hash -586848446, now seen corresponding path program 1 times [2023-02-17 02:07:01,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:07:01,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872619510] [2023-02-17 02:07:01,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:07:01,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:07:01,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:07:01,881 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 02:07:01,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:07:01,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872619510] [2023-02-17 02:07:01,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872619510] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:07:01,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:07:01,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 02:07:01,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671517983] [2023-02-17 02:07:01,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:07:01,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 02:07:01,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:07:01,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 02:07:01,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 02:07:01,920 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 02:07:01,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:07:01,940 INFO L93 Difference]: Finished difference Result 49 states and 83 transitions. [2023-02-17 02:07:01,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 02:07:01,943 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 02:07:01,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:07:01,951 INFO L225 Difference]: With dead ends: 49 [2023-02-17 02:07:01,951 INFO L226 Difference]: Without dead ends: 22 [2023-02-17 02:07:01,954 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 02:07:01,964 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 02:07:01,965 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 02:07:01,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-02-17 02:07:01,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-02-17 02:07:01,997 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 02:07:01,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2023-02-17 02:07:02,000 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 9 [2023-02-17 02:07:02,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:07:02,001 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2023-02-17 02:07:02,001 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 02:07:02,002 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2023-02-17 02:07:02,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-17 02:07:02,003 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:07:02,003 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:07:02,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 02:07:02,004 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:07:02,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:07:02,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1188158916, now seen corresponding path program 1 times [2023-02-17 02:07:02,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:07:02,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620102068] [2023-02-17 02:07:02,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:07:02,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:07:02,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:07:02,136 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 02:07:02,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:07:02,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620102068] [2023-02-17 02:07:02,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620102068] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:07:02,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:07:02,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 02:07:02,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666391881] [2023-02-17 02:07:02,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:07:02,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 02:07:02,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:07:02,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 02:07:02,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 02:07:02,151 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 02:07:02,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:07:02,215 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2023-02-17 02:07:02,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 02:07:02,215 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 02:07:02,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:07:02,216 INFO L225 Difference]: With dead ends: 35 [2023-02-17 02:07:02,217 INFO L226 Difference]: Without dead ends: 33 [2023-02-17 02:07:02,217 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 02:07:02,218 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 02:07:02,219 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 02:07:02,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-02-17 02:07:02,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2023-02-17 02:07:02,227 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 02:07:02,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2023-02-17 02:07:02,229 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2023-02-17 02:07:02,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:07:02,230 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2023-02-17 02:07:02,231 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 02:07:02,232 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2023-02-17 02:07:02,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-17 02:07:02,233 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:07:02,233 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:07:02,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-17 02:07:02,234 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:07:02,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:07:02,236 INFO L85 PathProgramCache]: Analyzing trace with hash -697944935, now seen corresponding path program 1 times [2023-02-17 02:07:02,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:07:02,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268424969] [2023-02-17 02:07:02,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:07:02,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:07:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:07:02,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 02:07:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:07:02,349 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 02:07:02,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:07:02,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268424969] [2023-02-17 02:07:02,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268424969] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:07:02,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:07:02,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 02:07:02,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286796717] [2023-02-17 02:07:02,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:07:02,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 02:07:02,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:07:02,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 02:07:02,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 02:07:02,352 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 02:07:02,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:07:02,389 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2023-02-17 02:07:02,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 02:07:02,389 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 02:07:02,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:07:02,390 INFO L225 Difference]: With dead ends: 39 [2023-02-17 02:07:02,390 INFO L226 Difference]: Without dead ends: 37 [2023-02-17 02:07:02,390 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 02:07:02,391 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 02:07:02,392 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 02:07:02,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-02-17 02:07:02,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2023-02-17 02:07:02,396 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 02:07:02,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2023-02-17 02:07:02,397 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 14 [2023-02-17 02:07:02,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:07:02,398 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2023-02-17 02:07:02,398 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 02:07:02,398 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2023-02-17 02:07:02,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-17 02:07:02,398 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:07:02,399 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:07:02,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-17 02:07:02,399 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:07:02,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:07:02,399 INFO L85 PathProgramCache]: Analyzing trace with hash 262992548, now seen corresponding path program 1 times [2023-02-17 02:07:02,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:07:02,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22115412] [2023-02-17 02:07:02,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:07:02,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:07:02,407 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:07:02,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1644223913] [2023-02-17 02:07:02,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:07:02,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:07:02,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:07:02,410 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 02:07:02,411 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 02:07:02,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:07:02,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-17 02:07:02,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:07:02,541 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 02:07:02,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:07:02,646 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 02:07:02,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:07:02,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22115412] [2023-02-17 02:07:02,648 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:07:02,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644223913] [2023-02-17 02:07:02,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644223913] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:07:02,648 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:07:02,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-17 02:07:02,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258582551] [2023-02-17 02:07:02,652 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:07:02,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 02:07:02,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:07:02,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 02:07:02,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-17 02:07:02,655 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), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-17 02:07:02,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:07:02,867 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2023-02-17 02:07:02,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 02:07:02,867 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), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 19 [2023-02-17 02:07:02,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:07:02,869 INFO L225 Difference]: With dead ends: 65 [2023-02-17 02:07:02,869 INFO L226 Difference]: Without dead ends: 51 [2023-02-17 02:07:02,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-17 02:07:02,870 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 26 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 02:07:02,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 60 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 02:07:02,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-02-17 02:07:02,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-02-17 02:07:02,890 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 02:07:02,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2023-02-17 02:07:02,891 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 19 [2023-02-17 02:07:02,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:07:02,891 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2023-02-17 02:07:02,891 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), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-17 02:07:02,892 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2023-02-17 02:07:02,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-17 02:07:02,892 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:07:02,892 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 02:07:02,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-17 02:07:03,099 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 02:07:03,100 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:07:03,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:07:03,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1807142342, now seen corresponding path program 1 times [2023-02-17 02:07:03,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:07:03,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918342164] [2023-02-17 02:07:03,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:07:03,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:07:03,106 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:07:03,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1468615865] [2023-02-17 02:07:03,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:07:03,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:07:03,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:07:03,108 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 02:07:03,112 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 02:07:03,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:07:03,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 02:07:03,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:07:03,176 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-17 02:07:03,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:07:03,225 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-17 02:07:03,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:07:03,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918342164] [2023-02-17 02:07:03,226 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:07:03,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468615865] [2023-02-17 02:07:03,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468615865] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:07:03,226 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:07:03,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2023-02-17 02:07:03,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116048297] [2023-02-17 02:07:03,227 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:07:03,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 02:07:03,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:07:03,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 02:07:03,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-02-17 02:07:03,228 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), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-17 02:07:03,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:07:03,361 INFO L93 Difference]: Finished difference Result 66 states and 83 transitions. [2023-02-17 02:07:03,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 02:07:03,361 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), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 26 [2023-02-17 02:07:03,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:07:03,362 INFO L225 Difference]: With dead ends: 66 [2023-02-17 02:07:03,362 INFO L226 Difference]: Without dead ends: 59 [2023-02-17 02:07:03,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-02-17 02:07:03,363 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 21 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:07:03,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 80 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:07:03,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-02-17 02:07:03,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2023-02-17 02:07:03,371 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 02:07:03,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2023-02-17 02:07:03,371 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 26 [2023-02-17 02:07:03,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:07:03,372 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2023-02-17 02:07:03,372 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), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-17 02:07:03,372 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2023-02-17 02:07:03,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-17 02:07:03,373 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:07:03,373 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 02:07:03,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-17 02:07:03,578 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 02:07:03,578 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:07:03,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:07:03,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1034157389, now seen corresponding path program 1 times [2023-02-17 02:07:03,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:07:03,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123619074] [2023-02-17 02:07:03,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:07:03,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:07:03,585 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:07:03,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1083437013] [2023-02-17 02:07:03,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:07:03,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:07:03,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:07:03,586 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 02:07:03,588 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 02:07:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:07:03,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-17 02:07:03,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:07:03,701 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 18 proven. 26 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-02-17 02:07:03,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:07:03,844 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 18 proven. 26 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-02-17 02:07:03,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:07:03,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123619074] [2023-02-17 02:07:03,845 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:07:03,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083437013] [2023-02-17 02:07:03,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083437013] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:07:03,845 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:07:03,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2023-02-17 02:07:03,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747387338] [2023-02-17 02:07:03,846 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:07:03,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-17 02:07:03,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:07:03,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-17 02:07:03,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2023-02-17 02:07:03,847 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), 5 states have call predecessors, (16), 5 states have call successors, (16) [2023-02-17 02:07:04,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:07:04,826 INFO L93 Difference]: Finished difference Result 142 states and 193 transitions. [2023-02-17 02:07:04,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 02:07:04,827 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), 5 states have call predecessors, (16), 5 states have call successors, (16) Word has length 56 [2023-02-17 02:07:04,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:07:04,828 INFO L225 Difference]: With dead ends: 142 [2023-02-17 02:07:04,828 INFO L226 Difference]: Without dead ends: 111 [2023-02-17 02:07:04,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2023-02-17 02:07:04,829 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 48 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-17 02:07:04,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 94 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-17 02:07:04,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-02-17 02:07:04,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2023-02-17 02:07:04,856 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 02:07:04,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 138 transitions. [2023-02-17 02:07:04,857 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 138 transitions. Word has length 56 [2023-02-17 02:07:04,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:07:04,857 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 138 transitions. [2023-02-17 02:07:04,858 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), 5 states have call predecessors, (16), 5 states have call successors, (16) [2023-02-17 02:07:04,858 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 138 transitions. [2023-02-17 02:07:04,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-02-17 02:07:04,859 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:07:04,859 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 02:07:04,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-17 02:07:05,064 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 02:07:05,064 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:07:05,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:07:05,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1199454569, now seen corresponding path program 1 times [2023-02-17 02:07:05,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:07:05,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930325713] [2023-02-17 02:07:05,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:07:05,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:07:05,077 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:07:05,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [29823494] [2023-02-17 02:07:05,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:07:05,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:07:05,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:07:05,078 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 02:07:05,080 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 02:07:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:07:05,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-17 02:07:05,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:07:05,164 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 22 proven. 34 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-17 02:07:05,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:07:05,305 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 22 proven. 34 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-17 02:07:05,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:07:05,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930325713] [2023-02-17 02:07:05,306 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:07:05,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29823494] [2023-02-17 02:07:05,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29823494] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:07:05,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:07:05,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2023-02-17 02:07:05,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736695263] [2023-02-17 02:07:05,307 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:07:05,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-17 02:07:05,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:07:05,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-17 02:07:05,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2023-02-17 02:07:05,308 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), 6 states have call predecessors, (20), 6 states have call successors, (20) [2023-02-17 02:07:06,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:07:06,027 INFO L93 Difference]: Finished difference Result 161 states and 210 transitions. [2023-02-17 02:07:06,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 02:07:06,028 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), 6 states have call predecessors, (20), 6 states have call successors, (20) Word has length 67 [2023-02-17 02:07:06,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:07:06,029 INFO L225 Difference]: With dead ends: 161 [2023-02-17 02:07:06,029 INFO L226 Difference]: Without dead ends: 123 [2023-02-17 02:07:06,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2023-02-17 02:07:06,030 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 25 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-17 02:07:06,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 87 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-17 02:07:06,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-02-17 02:07:06,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 101. [2023-02-17 02:07:06,051 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 02:07:06,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 125 transitions. [2023-02-17 02:07:06,054 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 125 transitions. Word has length 67 [2023-02-17 02:07:06,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:07:06,055 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 125 transitions. [2023-02-17 02:07:06,055 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), 6 states have call predecessors, (20), 6 states have call successors, (20) [2023-02-17 02:07:06,055 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 125 transitions. [2023-02-17 02:07:06,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-02-17 02:07:06,059 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:07:06,060 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 02:07:06,069 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 02:07:06,264 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 02:07:06,264 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:07:06,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:07:06,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1728532070, now seen corresponding path program 1 times [2023-02-17 02:07:06,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:07:06,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737220065] [2023-02-17 02:07:06,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:07:06,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:07:06,270 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:07:06,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1530711211] [2023-02-17 02:07:06,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:07:06,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:07:06,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:07:06,274 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 02:07:06,276 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 02:07:06,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:07:06,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-17 02:07:06,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:07:06,350 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 24 proven. 37 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-17 02:07:06,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:07:06,481 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 24 proven. 37 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-17 02:07:06,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:07:06,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737220065] [2023-02-17 02:07:06,482 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:07:06,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530711211] [2023-02-17 02:07:06,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530711211] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:07:06,482 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:07:06,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2023-02-17 02:07:06,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261392359] [2023-02-17 02:07:06,482 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:07:06,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-17 02:07:06,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:07:06,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-17 02:07:06,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2023-02-17 02:07:06,484 INFO L87 Difference]: Start difference. First operand 101 states and 125 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, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 8 states have call predecessors, (22), 8 states have call successors, (22) [2023-02-17 02:07:06,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:07:06,728 INFO L93 Difference]: Finished difference Result 117 states and 139 transitions. [2023-02-17 02:07:06,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 02:07:06,729 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, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 8 states have call predecessors, (22), 8 states have call successors, (22) Word has length 72 [2023-02-17 02:07:06,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:07:06,730 INFO L225 Difference]: With dead ends: 117 [2023-02-17 02:07:06,730 INFO L226 Difference]: Without dead ends: 86 [2023-02-17 02:07:06,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2023-02-17 02:07:06,731 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 02:07:06,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 92 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 02:07:06,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-17 02:07:06,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-02-17 02:07:06,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 57 states have internal predecessors, (60), 21 states have call successors, (21), 10 states have call predecessors, (21), 10 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-17 02:07:06,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 101 transitions. [2023-02-17 02:07:06,748 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 101 transitions. Word has length 72 [2023-02-17 02:07:06,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:07:06,748 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 101 transitions. [2023-02-17 02:07:06,748 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, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 8 states have call predecessors, (22), 8 states have call successors, (22) [2023-02-17 02:07:06,748 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 101 transitions. [2023-02-17 02:07:06,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-02-17 02:07:06,750 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:07:06,750 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 02:07:06,757 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 02:07:06,955 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 02:07:06,955 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:07:06,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:07:06,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1412721000, now seen corresponding path program 1 times [2023-02-17 02:07:06,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:07:06,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011016912] [2023-02-17 02:07:06,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:07:06,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:07:06,968 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:07:06,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [375015497] [2023-02-17 02:07:06,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:07:06,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:07:06,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:07:06,969 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 02:07:06,971 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 02:07:07,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:07:07,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 02:07:07,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:07:07,050 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 02:07:07,050 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:07:07,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:07:07,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011016912] [2023-02-17 02:07:07,050 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:07:07,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375015497] [2023-02-17 02:07:07,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375015497] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:07:07,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:07:07,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 02:07:07,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171399569] [2023-02-17 02:07:07,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:07:07,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 02:07:07,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:07:07,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 02:07:07,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:07:07,053 INFO L87 Difference]: Start difference. First operand 86 states and 101 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 02:07:07,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:07:07,118 INFO L93 Difference]: Finished difference Result 116 states and 138 transitions. [2023-02-17 02:07:07,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 02:07:07,118 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 02:07:07,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:07:07,121 INFO L225 Difference]: With dead ends: 116 [2023-02-17 02:07:07,121 INFO L226 Difference]: Without dead ends: 86 [2023-02-17 02:07:07,122 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 02:07:07,122 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 02:07:07,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 95 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 02:07:07,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-17 02:07:07,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 78. [2023-02-17 02:07:07,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.08) internal successors, (54), 52 states have internal predecessors, (54), 17 states have call successors, (17), 10 states have call predecessors, (17), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-02-17 02:07:07,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2023-02-17 02:07:07,138 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 86 [2023-02-17 02:07:07,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:07:07,138 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2023-02-17 02:07:07,138 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 02:07:07,139 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2023-02-17 02:07:07,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-02-17 02:07:07,139 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:07:07,139 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 02:07:07,157 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 02:07:07,345 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 02:07:07,345 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:07:07,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:07:07,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1193302554, now seen corresponding path program 2 times [2023-02-17 02:07:07,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:07:07,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632509537] [2023-02-17 02:07:07,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:07:07,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:07:07,352 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:07:07,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [742939237] [2023-02-17 02:07:07,352 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 02:07:07,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:07:07,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:07:07,373 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 02:07:07,375 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 02:07:07,421 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 02:07:07,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 02:07:07,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-17 02:07:07,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:07:07,511 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 02:07:07,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:07:09,155 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 02:07:09,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:07:09,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632509537] [2023-02-17 02:07:09,156 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:07:09,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742939237] [2023-02-17 02:07:09,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742939237] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:07:09,156 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:07:09,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2023-02-17 02:07:09,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3380342] [2023-02-17 02:07:09,156 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:07:09,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-17 02:07:09,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:07:09,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-17 02:07:09,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2023-02-17 02:07:09,158 INFO L87 Difference]: Start difference. First operand 78 states and 87 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 02:07:11,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 02:07:15,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:07:15,624 INFO L93 Difference]: Finished difference Result 154 states and 193 transitions. [2023-02-17 02:07:15,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-17 02:07:15,625 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 02:07:15,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:07:15,626 INFO L225 Difference]: With dead ends: 154 [2023-02-17 02:07:15,626 INFO L226 Difference]: Without dead ends: 131 [2023-02-17 02:07:15,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 149 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=151, Invalid=551, Unknown=0, NotChecked=0, Total=702 [2023-02-17 02:07:15,627 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 82 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:07:15,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 168 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2023-02-17 02:07:15,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-02-17 02:07:15,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2023-02-17 02:07:15,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 80 states have (on average 1.1375) internal successors, (91), 86 states have internal predecessors, (91), 35 states have call successors, (35), 13 states have call predecessors, (35), 13 states have return successors, (34), 29 states have call predecessors, (34), 34 states have call successors, (34) [2023-02-17 02:07:15,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 160 transitions. [2023-02-17 02:07:15,705 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 160 transitions. Word has length 86 [2023-02-17 02:07:15,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:07:15,705 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 160 transitions. [2023-02-17 02:07:15,705 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 02:07:15,705 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 160 transitions. [2023-02-17 02:07:15,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-02-17 02:07:15,706 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:07:15,706 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 02:07:15,713 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 02:07:15,913 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 02:07:15,913 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:07:15,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:07:15,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1474759586, now seen corresponding path program 2 times [2023-02-17 02:07:15,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:07:15,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845904151] [2023-02-17 02:07:15,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:07:15,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:07:15,925 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:07:15,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [418531784] [2023-02-17 02:07:15,926 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 02:07:15,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:07:15,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:07:15,927 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 02:07:15,929 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 02:07:15,975 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 02:07:15,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 02:07:15,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 49 conjunts are in the unsatisfiable core [2023-02-17 02:07:15,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:07:16,089 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 32 proven. 68 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-02-17 02:07:16,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:07:17,420 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 32 proven. 68 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-02-17 02:07:17,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:07:17,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845904151] [2023-02-17 02:07:17,420 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:07:17,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418531784] [2023-02-17 02:07:17,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418531784] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:07:17,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:07:17,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2023-02-17 02:07:17,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753226781] [2023-02-17 02:07:17,421 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:07:17,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-02-17 02:07:17,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:07:17,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-02-17 02:07:17,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=545, Unknown=0, NotChecked=0, Total=702 [2023-02-17 02:07:17,422 INFO L87 Difference]: Start difference. First operand 129 states and 160 transitions. Second operand has 27 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 15 states have call successors, (32), 3 states have call predecessors, (32), 2 states have return successors, (30), 13 states have call predecessors, (30), 13 states have call successors, (30) [2023-02-17 02:07:20,827 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 02:07:25,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 02:07:28,127 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 02:07:31,825 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 02:07:33,828 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 02:07:35,849 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 02:07:37,855 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 02:07:38,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:07:38,245 INFO L93 Difference]: Finished difference Result 188 states and 240 transitions. [2023-02-17 02:07:38,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-17 02:07:38,246 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 15 states have call successors, (32), 3 states have call predecessors, (32), 2 states have return successors, (30), 13 states have call predecessors, (30), 13 states have call successors, (30) Word has length 97 [2023-02-17 02:07:38,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:07:38,247 INFO L225 Difference]: With dead ends: 188 [2023-02-17 02:07:38,247 INFO L226 Difference]: Without dead ends: 120 [2023-02-17 02:07:38,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=327, Invalid=1005, Unknown=0, NotChecked=0, Total=1332 [2023-02-17 02:07:38,248 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 61 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 126 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.9s IncrementalHoareTripleChecker+Time [2023-02-17 02:07:38,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 164 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 826 Invalid, 7 Unknown, 0 Unchecked, 19.9s Time] [2023-02-17 02:07:38,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-02-17 02:07:38,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 103. [2023-02-17 02:07:38,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 68 states have internal predecessors, (70), 24 states have call successors, (24), 13 states have call predecessors, (24), 13 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2023-02-17 02:07:38,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2023-02-17 02:07:38,289 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 97 [2023-02-17 02:07:38,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:07:38,289 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2023-02-17 02:07:38,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 15 states have call successors, (32), 3 states have call predecessors, (32), 2 states have return successors, (30), 13 states have call predecessors, (30), 13 states have call successors, (30) [2023-02-17 02:07:38,289 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2023-02-17 02:07:38,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-02-17 02:07:38,290 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:07:38,290 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:07:38,300 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 02:07:38,495 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 02:07:38,495 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:07:38,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:07:38,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1779279917, now seen corresponding path program 1 times [2023-02-17 02:07:38,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:07:38,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578227094] [2023-02-17 02:07:38,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:07:38,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:07:38,509 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:07:38,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [270271796] [2023-02-17 02:07:38,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:07:38,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:07:38,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:07:38,511 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 02:07:38,513 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 02:07:38,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:07:38,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 02:07:38,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:07:38,604 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 66 proven. 13 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-02-17 02:07:38,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:07:38,647 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 66 proven. 13 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-02-17 02:07:38,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:07:38,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578227094] [2023-02-17 02:07:38,648 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:07:38,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270271796] [2023-02-17 02:07:38,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270271796] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:07:38,648 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:07:38,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2023-02-17 02:07:38,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027329614] [2023-02-17 02:07:38,648 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:07:38,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 02:07:38,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:07:38,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 02:07:38,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:07:38,649 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2023-02-17 02:07:38,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:07:38,729 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2023-02-17 02:07:38,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 02:07:38,729 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 114 [2023-02-17 02:07:38,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:07:38,730 INFO L225 Difference]: With dead ends: 111 [2023-02-17 02:07:38,730 INFO L226 Difference]: Without dead ends: 104 [2023-02-17 02:07:38,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 214 SyntacticMatches, 8 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:07:38,731 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 6 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 02:07:38,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 79 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 02:07:38,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-02-17 02:07:38,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2023-02-17 02:07:38,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 68 states have internal predecessors, (70), 23 states have call successors, (23), 13 states have call predecessors, (23), 13 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2023-02-17 02:07:38,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2023-02-17 02:07:38,772 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 114 [2023-02-17 02:07:38,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:07:38,773 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2023-02-17 02:07:38,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2023-02-17 02:07:38,773 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2023-02-17 02:07:38,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-02-17 02:07:38,773 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:07:38,774 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 02:07:38,780 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 02:07:38,978 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 02:07:38,978 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:07:38,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:07:38,979 INFO L85 PathProgramCache]: Analyzing trace with hash 289773103, now seen corresponding path program 2 times [2023-02-17 02:07:38,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:07:38,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968521901] [2023-02-17 02:07:38,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:07:38,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:07:38,984 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:07:38,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2079283392] [2023-02-17 02:07:38,984 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 02:07:38,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:07:38,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:07:38,986 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 02:07:38,988 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 02:07:39,039 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 02:07:39,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 02:07:39,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 56 conjunts are in the unsatisfiable core [2023-02-17 02:07:39,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:07:39,184 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 02:07:39,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:07:46,246 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 02:07:46,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:07:46,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968521901] [2023-02-17 02:07:46,247 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:07:46,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079283392] [2023-02-17 02:07:46,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079283392] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:07:46,248 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:07:46,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 [2023-02-17 02:07:46,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297871168] [2023-02-17 02:07:46,248 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:07:46,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-17 02:07:46,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:07:46,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-17 02:07:46,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2023-02-17 02:07:46,250 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand has 28 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 26 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 02:07:50,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 02:07:52,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 02:07:57,201 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 02:08:05,593 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 02:08:09,191 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 02:08:12,186 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 02:08:17,730 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 02:08:19,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:08:19,497 INFO L93 Difference]: Finished difference Result 214 states and 265 transitions. [2023-02-17 02:08:19,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-17 02:08:19,497 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 26 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 02:08:19,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:08:19,498 INFO L225 Difference]: With dead ends: 214 [2023-02-17 02:08:19,498 INFO L226 Difference]: Without dead ends: 191 [2023-02-17 02:08:19,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=446, Invalid=1446, Unknown=0, NotChecked=0, Total=1892 [2023-02-17 02:08:19,499 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 80 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 176 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.8s IncrementalHoareTripleChecker+Time [2023-02-17 02:08:19,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 194 Invalid, 1220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 1039 Invalid, 5 Unknown, 0 Unchecked, 25.8s Time] [2023-02-17 02:08:19,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-02-17 02:08:19,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 182. [2023-02-17 02:08:19,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 115 states have (on average 1.1304347826086956) internal successors, (130), 120 states have internal predecessors, (130), 46 states have call successors, (46), 20 states have call predecessors, (46), 20 states have return successors, (45), 41 states have call predecessors, (45), 45 states have call successors, (45) [2023-02-17 02:08:19,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 221 transitions. [2023-02-17 02:08:19,717 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 221 transitions. Word has length 116 [2023-02-17 02:08:19,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:08:19,718 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 221 transitions. [2023-02-17 02:08:19,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 26 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 02:08:19,719 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 221 transitions. [2023-02-17 02:08:19,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-02-17 02:08:19,721 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:08: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 02:08:19,726 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 02:08:19,926 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 02:08:19,926 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:08:19,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:08:19,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1316179534, now seen corresponding path program 3 times [2023-02-17 02:08:19,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:08:19,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191938994] [2023-02-17 02:08:19,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:08:19,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:08:19,932 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:08:19,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [279729918] [2023-02-17 02:08:19,932 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 02:08:19,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:08:19,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:08:19,933 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 02:08:19,935 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 02:08:19,980 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-17 02:08:19,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 02:08:19,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-17 02:08:19,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:08:20,067 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 02:08:20,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:08:22,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:08:22,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191938994] [2023-02-17 02:08:22,239 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:08:22,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279729918] [2023-02-17 02:08:22,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279729918] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:08:22,240 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-17 02:08:22,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2023-02-17 02:08:22,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858449433] [2023-02-17 02:08:22,240 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-17 02:08:22,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-17 02:08:22,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:08:22,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-17 02:08:22,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=123, Unknown=1, NotChecked=0, Total=156 [2023-02-17 02:08:22,241 INFO L87 Difference]: Start difference. First operand 182 states and 221 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 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 02:08:22,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:08:22,575 INFO L93 Difference]: Finished difference Result 200 states and 235 transitions. [2023-02-17 02:08:22,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 02:08:22,575 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 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 02:08:22,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:08:22,577 INFO L225 Difference]: With dead ends: 200 [2023-02-17 02:08:22,577 INFO L226 Difference]: Without dead ends: 198 [2023-02-17 02:08:22,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=53, Invalid=186, Unknown=1, NotChecked=0, Total=240 [2023-02-17 02:08:22,578 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:08:22,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 47 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:08:22,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2023-02-17 02:08:22,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2023-02-17 02:08:22,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 127 states have (on average 1.1181102362204725) internal successors, (142), 132 states have internal predecessors, (142), 46 states have call successors, (46), 24 states have call predecessors, (46), 24 states have return successors, (45), 41 states have call predecessors, (45), 45 states have call successors, (45) [2023-02-17 02:08:22,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 233 transitions. [2023-02-17 02:08:22,795 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 233 transitions. Word has length 121 [2023-02-17 02:08:22,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:08:22,796 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 233 transitions. [2023-02-17 02:08:22,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 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 02:08:22,796 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 233 transitions. [2023-02-17 02:08:22,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-02-17 02:08:22,797 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:08:22,797 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 02:08:22,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-17 02:08:23,004 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 02:08:23,004 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:08:23,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:08:23,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1262824565, now seen corresponding path program 2 times [2023-02-17 02:08:23,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:08:23,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203057168] [2023-02-17 02:08:23,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:08:23,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:08:23,013 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:08:23,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1426492168] [2023-02-17 02:08:23,013 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 02:08:23,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:08:23,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:08:23,015 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 02:08:23,016 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 02:08:23,069 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 02:08:23,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 02:08:23,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 63 conjunts are in the unsatisfiable core [2023-02-17 02:08:23,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:08:23,240 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 95 proven. 110 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2023-02-17 02:08:23,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:08:25,066 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 95 proven. 110 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2023-02-17 02:08:25,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:08:25,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203057168] [2023-02-17 02:08:25,066 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:08:25,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426492168] [2023-02-17 02:08:25,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426492168] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:08:25,067 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:08:25,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 32 [2023-02-17 02:08:25,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023049067] [2023-02-17 02:08:25,067 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:08:25,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-02-17 02:08:25,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:08:25,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-17 02:08:25,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=773, Unknown=0, NotChecked=0, Total=992 [2023-02-17 02:08:25,070 INFO L87 Difference]: Start difference. First operand 198 states and 233 transitions. Second operand has 32 states, 30 states have (on average 1.8666666666666667) internal successors, (56), 28 states have internal predecessors, (56), 17 states have call successors, (42), 3 states have call predecessors, (42), 2 states have return successors, (40), 17 states have call predecessors, (40), 15 states have call successors, (40) [2023-02-17 02:08:31,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:08:31,006 INFO L93 Difference]: Finished difference Result 279 states and 333 transitions. [2023-02-17 02:08:31,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-17 02:08:31,007 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 1.8666666666666667) internal successors, (56), 28 states have internal predecessors, (56), 17 states have call successors, (42), 3 states have call predecessors, (42), 2 states have return successors, (40), 17 states have call predecessors, (40), 15 states have call successors, (40) Word has length 127 [2023-02-17 02:08:31,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:08:31,008 INFO L225 Difference]: With dead ends: 279 [2023-02-17 02:08:31,008 INFO L226 Difference]: Without dead ends: 198 [2023-02-17 02:08:31,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 221 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=594, Invalid=1662, Unknown=0, NotChecked=0, Total=2256 [2023-02-17 02:08:31,009 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 63 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-02-17 02:08:31,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 178 Invalid, 1049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-02-17 02:08:31,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2023-02-17 02:08:31,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 183. [2023-02-17 02:08:31,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 119 states have (on average 1.0672268907563025) internal successors, (127), 124 states have internal predecessors, (127), 38 states have call successors, (38), 25 states have call predecessors, (38), 25 states have return successors, (38), 33 states have call predecessors, (38), 38 states have call successors, (38) [2023-02-17 02:08:31,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 203 transitions. [2023-02-17 02:08:31,205 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 203 transitions. Word has length 127 [2023-02-17 02:08:31,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:08:31,205 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 203 transitions. [2023-02-17 02:08:31,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 1.8666666666666667) internal successors, (56), 28 states have internal predecessors, (56), 17 states have call successors, (42), 3 states have call predecessors, (42), 2 states have return successors, (40), 17 states have call predecessors, (40), 15 states have call successors, (40) [2023-02-17 02:08:31,205 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 203 transitions. [2023-02-17 02:08:31,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-02-17 02:08:31,206 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:08:31,206 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:08:31,213 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 02:08:31,411 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 02:08:31,411 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:08:31,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:08:31,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1395307885, now seen corresponding path program 3 times [2023-02-17 02:08:31,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:08:31,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583286356] [2023-02-17 02:08:31,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:08:31,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:08:31,417 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:08:31,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [769166837] [2023-02-17 02:08:31,417 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 02:08:31,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:08:31,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:08:31,419 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 02:08:31,421 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 02:08:31,486 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-17 02:08:31,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 02:08:31,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-17 02:08:31,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:08:31,587 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 177 proven. 50 refuted. 0 times theorem prover too weak. 641 trivial. 0 not checked. [2023-02-17 02:08:31,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:08:31,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:08:31,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583286356] [2023-02-17 02:08:31,833 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:08:31,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769166837] [2023-02-17 02:08:31,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769166837] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:08:31,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-17 02:08:31,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2023-02-17 02:08:31,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697607667] [2023-02-17 02:08:31,833 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-17 02:08:31,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 02:08:31,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:08:31,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 02:08:31,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2023-02-17 02:08:31,834 INFO L87 Difference]: Start difference. First operand 183 states and 203 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 02:08:32,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:08:32,089 INFO L93 Difference]: Finished difference Result 183 states and 203 transitions. [2023-02-17 02:08:32,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 02:08:32,090 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 129 [2023-02-17 02:08:32,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:08:32,090 INFO L225 Difference]: With dead ends: 183 [2023-02-17 02:08:32,090 INFO L226 Difference]: Without dead ends: 0 [2023-02-17 02:08:32,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 121 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 02:08:32,091 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 16 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:08:32,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 37 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:08:32,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-17 02:08:32,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-17 02:08:32,092 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 02:08:32,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-17 02:08:32,092 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 129 [2023-02-17 02:08:32,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:08:32,093 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-17 02:08:32,093 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 02:08:32,093 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-17 02:08:32,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-17 02:08:32,095 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-17 02:08:32,100 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 02:08:32,295 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 02:08:32,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-17 02:08:32,415 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 55) no Hoare annotation was computed. [2023-02-17 02:08:32,418 INFO L895 garLoopResultBuilder]: At program point L52-2(lines 44 56) the Hoare annotation is: (let ((.cse315 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse196 (div |ULTIMATE.start_main_~d~0#1| 2))) (let ((.cse195 (+ .cse196 1)) (.cse316 (+ .cse315 1)) (.cse324 (- .cse196))) (let ((.cse323 (+ (- 1) .cse324)) (.cse214 (+ |ULTIMATE.start_main_~q~0#1| .cse316)) (.cse232 (+ |ULTIMATE.start_main_~q~0#1| .cse315)) (.cse336 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse121 (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0)) (.cse225 (div |ULTIMATE.start_main_~d~0#1| 4)) (.cse228 (div .cse195 2)) (.cse130 (div |ULTIMATE.start_main_~p~0#1| 4)) (.cse120 (div .cse316 2))) (let ((.cse103 (= (mod .cse316 2) 0)) (.cse331 (< .cse316 0)) (.cse119 (+ .cse120 1)) (.cse131 (+ .cse130 1)) (.cse332 (< .cse315 0)) (.cse127 (= (mod .cse315 2) 0)) (.cse229 (+ .cse228 1)) (.cse221 (+ .cse225 1)) (.cse321 (- .cse228)) (.cse318 (- .cse225)) (.cse33 (- |ULTIMATE.start_main_~d~0#1|)) (.cse36 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse61 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (.cse212 (+ |ULTIMATE.start_main_~r~0#1| .cse324)) (.cse132 (and .cse336 (not .cse121))) (.cse334 (* |ULTIMATE.start_main_~B~0#1| .cse232)) (.cse122 (not .cse336)) (.cse335 (* .cse214 |ULTIMATE.start_main_~B~0#1|)) (.cse210 (+ |ULTIMATE.start_main_~r~0#1| .cse323)) (.cse333 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse163 (* 2 |ULTIMATE.start_main_~p~0#1|)) (.cse162 (* 2 |ULTIMATE.start_main_~d~0#1|)) (.cse32 (- |ULTIMATE.start_main_~r~0#1|)) (.cse37 (* (- 1) |ULTIMATE.start_main_~r~0#1|))) (let ((.cse86 (+ .cse37 |ULTIMATE.start_main_~A~0#1|)) (.cse78 (+ |ULTIMATE.start_main_~A~0#1| .cse32)) (.cse142 (div .cse162 4)) (.cse158 (div .cse163 4)) (.cse291 (= .cse315 1)) (.cse290 (= .cse316 1)) (.cse151 (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (.cse97 (not .cse333)) (.cse133 (and (or .cse132 (= (+ .cse210 .cse334) |ULTIMATE.start_main_~A~0#1|)) (or .cse121 .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ .cse335 .cse210))))) (.cse123 (and (or (= (+ .cse334 .cse212) |ULTIMATE.start_main_~A~0#1|) .cse132) (or (= (+ .cse335 .cse212) |ULTIMATE.start_main_~A~0#1|) .cse121 .cse122))) (.cse111 (and (not .cse61) .cse333)) (.cse135 (not .cse36)) (.cse67 (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)) (.cse140 (+ |ULTIMATE.start_main_~r~0#1| .cse33)) (.cse319 (+ (- 1) .cse318)) (.cse113 (= (mod .cse196 2) 0)) (.cse325 (< .cse196 0)) (.cse57 (>= |ULTIMATE.start_main_~r~0#1| .cse196)) (.cse110 (>= |ULTIMATE.start_main_~r~0#1| .cse195)) (.cse320 (+ (- 1) .cse321)) (.cse326 (< .cse195 0)) (.cse108 (= (mod .cse195 2) 0)) (.cse327 (< .cse221 0)) (.cse261 (= (mod .cse221 2) 0)) (.cse266 (= (mod .cse225 2) 0)) (.cse328 (< .cse225 0)) (.cse284 (= (mod .cse229 2) 0)) (.cse329 (< .cse229 0)) (.cse275 (= (mod .cse228 2) 0)) (.cse330 (< .cse228 0)) (.cse303 (div .cse221 2)) (.cse302 (div |ULTIMATE.start_main_~d~0#1| 8)) (.cse298 (div .cse195 4)) (.cse292 (div .cse229 2)) (.cse247 (= .cse130 1)) (.cse129 (and .cse332 (not .cse127))) (.cse241 (= .cse131 1)) (.cse126 (not .cse332)) (.cse197 (= .cse119 1)) (.cse105 (not .cse331)) (.cse100 (and .cse331 (not .cse103))) (.cse203 (= .cse120 1))) (let ((.cse235 (and (or (not .cse197) .cse103 .cse105) (or .cse100 (not .cse203)))) (.cse218 (and (or (not .cse247) .cse129) (or (not .cse241) .cse126 .cse127))) (.cse251 (div |ULTIMATE.start_main_~p~0#1| 8)) (.cse245 (div .cse131 2)) (.cse242 (= (mod .cse131 2) 0)) (.cse294 (< .cse131 0)) (.cse293 (- .cse292)) (.cse297 (- .cse298)) (.cse248 (= (mod .cse130 2) 0)) (.cse299 (< .cse130 0)) (.cse301 (- .cse302)) (.cse304 (- .cse303)) (.cse205 (div .cse316 4)) (.cse199 (div .cse119 2)) (.cse201 (= (mod .cse119 2) 0)) (.cse306 (< .cse119 0)) (.cse206 (= (mod .cse120 2) 0)) (.cse307 (< .cse120 0)) (.cse277 (and (not .cse275) .cse330)) (.cse272 (not .cse330)) (.cse296 (+ .cse298 1)) (.cse238 (>= .cse210 .cse228)) (.cse283 (not .cse329)) (.cse295 (+ .cse292 1)) (.cse279 (and (not .cse284) .cse329)) (.cse237 (>= .cse210 .cse229)) (.cse265 (and (not .cse266) .cse328)) (.cse269 (not .cse328)) (.cse300 (+ .cse302 1)) (.cse239 (>= .cse212 .cse225)) (.cse254 (and .cse327 (not .cse261))) (.cse260 (not .cse327)) (.cse305 (+ .cse303 1)) (.cse240 (>= .cse212 .cse221)) (.cse227 (+ .cse210 .cse321)) (.cse98 (and .cse326 (not .cse108))) (.cse109 (not .cse326)) (.cse230 (+ .cse210 .cse320)) (.cse52 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse159 (+ |ULTIMATE.start_main_~q~0#1| .cse163)) (.cse134 (not .cse110)) (.cse124 (not .cse57)) (.cse309 (* (+ .cse214 .cse120) |ULTIMATE.start_main_~B~0#1|)) (.cse308 (* (+ .cse119 .cse214) |ULTIMATE.start_main_~B~0#1|)) (.cse116 (and (not .cse113) .cse325)) (.cse224 (+ .cse318 .cse212)) (.cse311 (* (+ .cse130 .cse232) |ULTIMATE.start_main_~B~0#1|)) (.cse219 (+ .cse319 .cse212)) (.cse310 (* (+ .cse131 .cse232) |ULTIMATE.start_main_~B~0#1|)) (.cse115 (not .cse325)) (.cse233 (+ .cse140 .cse324)) (.cse234 (+ .cse140 .cse323)) (.cse19 (or .cse135 .cse67)) (.cse50 (or .cse123 .cse111)) (.cse1 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse51 (or .cse97 .cse133 .cse61)) (.cse45 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse10 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)) (.cse47 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse23 (= |ULTIMATE.start_main_~A~0#1| (+ .cse140 (* |ULTIMATE.start_main_~B~0#1| .cse151)))) (.cse13 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse194 (and (or (not .cse291) .cse132) (or .cse121 .cse122 (not .cse290)))) (.cse164 (* |ULTIMATE.start_main_~B~0#1| 1)) (.cse160 (+ .cse158 1)) (.cse147 (+ .cse142 1)) (.cse156 (+ (- .cse162) |ULTIMATE.start_main_~r~0#1|)) (.cse141 (- .cse142)) (.cse73 (div .cse78 2)) (.cse84 (< .cse86 0)) (.cse322 (= (mod (+ |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0)) (.cse87 (* 2 |ULTIMATE.start_main_~B~0#1|))) (let ((.cse46 (* 2 .cse87)) (.cse107 (not (>= |ULTIMATE.start_main_~r~0#1| .cse229))) (.cse106 (+ .cse320 |ULTIMATE.start_main_~r~0#1|)) (.cse99 (not (>= |ULTIMATE.start_main_~r~0#1| .cse228))) (.cse101 (+ |ULTIMATE.start_main_~r~0#1| .cse321)) (.cse114 (not (>= |ULTIMATE.start_main_~r~0#1| .cse221))) (.cse112 (+ .cse319 |ULTIMATE.start_main_~r~0#1|)) (.cse118 (+ .cse318 |ULTIMATE.start_main_~r~0#1|)) (.cse117 (not (>= |ULTIMATE.start_main_~r~0#1| .cse225))) (.cse65 (* |ULTIMATE.start_main_~B~0#1| 4)) (.cse74 (or (not .cse84) .cse322)) (.cse79 (+ .cse73 1)) (.cse83 (not .cse322)) (.cse69 (* 2 1)) (.cse39 (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse146 (+ (- 1) .cse141)) (.cse152 (>= .cse156 |ULTIMATE.start_main_~d~0#1|)) (.cse150 (>= |ULTIMATE.start_main_~r~0#1| .cse162)) (.cse177 (not (>= .cse140 .cse228))) (.cse178 (+ .cse140 .cse321)) (.cse176 (not (>= .cse140 .cse229))) (.cse175 (+ .cse320 .cse140)) (.cse173 (not (>= .cse140 .cse221))) (.cse172 (+ .cse140 .cse319)) (.cse168 (not (>= .cse140 .cse225))) (.cse169 (+ .cse318 .cse140)) (.cse145 (>= .cse140 .cse147)) (.cse144 (>= .cse140 .cse142)) (.cse59 (not (>= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|))) (.cse149 (= .cse158 1)) (.cse148 (= 1 .cse160)) (.cse137 (= (+ |ULTIMATE.start_main_~r~0#1| (* .cse164 |ULTIMATE.start_main_~q~0#1|)) |ULTIMATE.start_main_~A~0#1|)) (.cse55 (or .cse194 (and (or (= .cse196 |ULTIMATE.start_main_~B~0#1|) .cse111) (or .cse97 (= |ULTIMATE.start_main_~B~0#1| .cse195) .cse61)))) (.cse56 (let ((.cse317 (or .cse194 (and (or .cse97 .cse61 (= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| .cse195)) |ULTIMATE.start_main_~A~0#1|)) (or .cse111 (= |ULTIMATE.start_main_~A~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* .cse196 |ULTIMATE.start_main_~q~0#1|)))))))) (or (and .cse50 .cse1 .cse51 .cse19 .cse317 .cse45 .cse10 .cse47 .cse23 .cse13) (and .cse50 .cse1 .cse51 .cse317 .cse45 .cse10 .cse47 .cse23 .cse67 .cse13)))) (.cse35 (or .cse36 (let ((.cse314 (* (+ .cse151 .cse316) |ULTIMATE.start_main_~B~0#1|)) (.cse313 (* (+ .cse151 .cse315) |ULTIMATE.start_main_~B~0#1|))) (and (or (and (or (= (+ .cse313 .cse233) |ULTIMATE.start_main_~A~0#1|) .cse132) (or .cse121 .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ .cse233 .cse314)))) .cse111) (or .cse97 (and (or .cse121 (= |ULTIMATE.start_main_~A~0#1| (+ .cse234 .cse314)) .cse122) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse234 .cse313)) .cse132)) .cse61))))) (.cse38 (or (and (or .cse290 .cse121 .cse122 (and (or .cse113 .cse115 (and (or .cse103 (= (+ .cse219 .cse308) |ULTIMATE.start_main_~A~0#1|) .cse105) (or .cse100 (= |ULTIMATE.start_main_~A~0#1| (+ .cse309 .cse219))))) (or .cse116 (and (or .cse100 (= (+ .cse309 .cse224) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse308 .cse224)) .cse103 .cse105))))) (or (and (or .cse116 (and (or (= (+ .cse311 .cse224) |ULTIMATE.start_main_~A~0#1|) .cse129) (or (= (+ .cse224 .cse310) |ULTIMATE.start_main_~A~0#1|) .cse126 .cse127))) (or (and (or .cse129 (= (+ .cse311 .cse219) |ULTIMATE.start_main_~A~0#1|)) (or .cse126 .cse127 (= |ULTIMATE.start_main_~A~0#1| (+ .cse219 .cse310)))) .cse113 .cse115)) .cse132 .cse291)) .cse111)) (.cse58 (<= 2 .cse196)) (.cse40 (or .cse36 (and .cse50 .cse51))) (.cse63 (or .cse194 (let ((.cse312 (+ |ULTIMATE.start_main_~q~0#1| 1))) (and (or .cse97 .cse134 .cse61 (= |ULTIMATE.start_main_~A~0#1| (+ .cse210 (* .cse312 .cse195)))) (or .cse124 .cse111 (= (+ (* .cse196 .cse312) .cse212) |ULTIMATE.start_main_~A~0#1|)))))) (.cse26 (or (= .cse163 1) (= |ULTIMATE.start_main_~A~0#1| (+ (+ .cse156 .cse33) (* |ULTIMATE.start_main_~B~0#1| (+ .cse159 |ULTIMATE.start_main_~p~0#1|)))))) (.cse60 (or .cse135 .cse52)) (.cse42 (or .cse97 .cse61 (and (or .cse290 .cse121 .cse122 (and (or (and (or (= (+ .cse308 .cse230) |ULTIMATE.start_main_~A~0#1|) .cse103 .cse105) (or .cse100 (= |ULTIMATE.start_main_~A~0#1| (+ .cse309 .cse230)))) .cse108 .cse109) (or .cse98 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse227 .cse308)) .cse103 .cse105) (or .cse100 (= (+ .cse227 .cse309) |ULTIMATE.start_main_~A~0#1|)))))) (or (and (or (and (or .cse126 .cse127 (= (+ .cse227 .cse310) |ULTIMATE.start_main_~A~0#1|)) (or .cse129 (= |ULTIMATE.start_main_~A~0#1| (+ .cse227 .cse311)))) .cse98) (or .cse108 .cse109 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse230 .cse310)) .cse126 .cse127) (or (= (+ .cse311 .cse230) |ULTIMATE.start_main_~A~0#1|) .cse129)))) .cse132 .cse291)))) (.cse143 (+ .cse151 1)) (.cse213 (and (or .cse116 (and (or (not (= .cse164 .cse302)) .cse265) (or .cse266 .cse269 (not (= .cse164 .cse300)))) .cse239) (or .cse113 (and (or (not (= .cse164 .cse303)) .cse254) (or .cse260 .cse261 (not (= .cse164 .cse305)))) .cse115 .cse240))) (.cse209 (and (or (and (or (not (= .cse164 .cse298)) .cse277) (or .cse272 (not (= .cse164 .cse296)) .cse275)) .cse98 .cse238) (or (and (or .cse283 .cse284 (not (= .cse164 .cse295))) (or .cse279 (not (= .cse164 .cse292)))) .cse108 .cse109 .cse237))) (.cse207 (not .cse307)) (.cse204 (and (not .cse206) .cse307)) (.cse202 (not .cse306)) (.cse198 (and (not .cse201) .cse306)) (.cse200 (+ .cse199 1)) (.cse208 (+ .cse205 1)) (.cse259 (not (>= .cse212 .cse305))) (.cse262 (+ (+ (- 1) .cse304) .cse212)) (.cse255 (+ .cse212 .cse304)) (.cse258 (not (>= .cse212 .cse303))) (.cse264 (+ .cse212 .cse301)) (.cse263 (not (>= .cse212 .cse302))) (.cse268 (+ (+ (- 1) .cse301) .cse212)) (.cse267 (not (>= .cse212 .cse300))) (.cse252 (and (not .cse248) .cse299)) (.cse250 (not .cse299)) (.cse276 (+ .cse297 .cse210)) (.cse278 (not (>= .cse210 .cse298))) (.cse273 (+ .cse210 (+ (- 1) .cse297))) (.cse274 (not (>= .cse210 .cse296))) (.cse285 (not (>= .cse210 .cse295))) (.cse282 (+ .cse210 (+ (- 1) .cse293))) (.cse243 (not .cse294)) (.cse246 (and (not .cse242) .cse294)) (.cse281 (+ .cse210 .cse293)) (.cse280 (not (>= .cse210 .cse292))) (.cse244 (+ 1 .cse245)) (.cse249 (+ .cse251 1)) (.cse136 (and (or .cse235 .cse290 .cse121 .cse122) (or .cse218 .cse132 .cse291))) (.cse174 (>= .cse140 .cse195)) (.cse138 (and (or .cse98 (not (= .cse164 .cse228))) (or (not (= .cse164 .cse229)) .cse108 .cse109))) (.cse139 (and (or .cse113 (not (= .cse164 .cse221)) .cse115) (or .cse116 (not (= .cse164 .cse225))))) (.cse167 (>= .cse140 .cse196)) (.cse193 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse164 .cse151) .cse140)))) (let ((.cse62 (<= 4 |ULTIMATE.start_main_~p~0#1|)) (.cse53 (= (+ |ULTIMATE.start_main_~p~0#1| 0) |ULTIMATE.start_main_~q~0#1|)) (.cse0 (or .cse136 (and (or .cse97 .cse174 .cse138 .cse61) (or .cse139 .cse111 .cse167)) .cse193)) (.cse18 (or (let ((.cse286 (* |ULTIMATE.start_main_~B~0#1| (+ .cse232 .cse251))) (.cse287 (* |ULTIMATE.start_main_~B~0#1| (+ .cse249 .cse232))) (.cse289 (* |ULTIMATE.start_main_~B~0#1| (+ .cse244 .cse232))) (.cse288 (* (+ .cse232 .cse245) |ULTIMATE.start_main_~B~0#1|))) (and (or (and (or (and (or .cse116 (and (or .cse266 .cse267 (and (or (= (+ .cse268 .cse286) |ULTIMATE.start_main_~A~0#1|) .cse252) (or (= (+ .cse268 .cse287) |ULTIMATE.start_main_~A~0#1|) .cse248 .cse250)) .cse269) (or .cse263 (and (or .cse248 .cse250 (= |ULTIMATE.start_main_~A~0#1| (+ .cse264 .cse287))) (or (= (+ .cse264 .cse286) |ULTIMATE.start_main_~A~0#1|) .cse252)) .cse265)) .cse239) (or (and (or (and (or .cse248 .cse250 (= |ULTIMATE.start_main_~A~0#1| (+ .cse255 .cse287))) (or .cse252 (= (+ .cse255 .cse286) |ULTIMATE.start_main_~A~0#1|))) .cse254 .cse258) (or .cse259 .cse260 .cse261 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse262 .cse286)) .cse252) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse262 .cse287)) .cse248 .cse250)))) .cse113 .cse115 .cse240)) .cse129) (or .cse126 .cse127 (and (or (and (or .cse259 .cse260 .cse261 (and (or .cse246 (= (+ .cse288 .cse262) |ULTIMATE.start_main_~A~0#1|)) (or .cse242 .cse243 (= |ULTIMATE.start_main_~A~0#1| (+ .cse289 .cse262))))) (or .cse254 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse255 .cse288)) .cse246) (or .cse242 .cse243 (= |ULTIMATE.start_main_~A~0#1| (+ .cse255 .cse289)))) .cse258)) .cse113 .cse115 .cse240) (or .cse116 (and (or (and (or .cse242 (= (+ .cse264 .cse289) |ULTIMATE.start_main_~A~0#1|) .cse243) (or .cse246 (= (+ .cse264 .cse288) |ULTIMATE.start_main_~A~0#1|))) .cse263 .cse265) (or .cse266 (and (or .cse242 .cse243 (= |ULTIMATE.start_main_~A~0#1| (+ .cse289 .cse268))) (or (= (+ .cse288 .cse268) |ULTIMATE.start_main_~A~0#1|) .cse246)) .cse267 .cse269)) .cse239)))) .cse111) (or .cse97 (and (or (and (or .cse98 .cse238 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse286 .cse276)) .cse252) (or .cse248 (= (+ .cse287 .cse276) |ULTIMATE.start_main_~A~0#1|) .cse250)) .cse277 .cse278) (or .cse272 .cse274 (and (or (= (+ .cse273 .cse286) |ULTIMATE.start_main_~A~0#1|) .cse252) (or .cse248 (= |ULTIMATE.start_main_~A~0#1| (+ .cse273 .cse287)) .cse250)) .cse275))) (or (and (or .cse283 (and (or .cse248 (= |ULTIMATE.start_main_~A~0#1| (+ .cse282 .cse287)) .cse250) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse282 .cse286)) .cse252)) .cse284 .cse285) (or .cse279 .cse280 (and (or .cse252 (= (+ .cse281 .cse286) |ULTIMATE.start_main_~A~0#1|)) (or .cse248 (= (+ .cse281 .cse287) |ULTIMATE.start_main_~A~0#1|) .cse250)))) .cse108 .cse109 .cse237)) .cse129) (or (and (or (and (or (and (or .cse246 (= (+ .cse288 .cse276) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse289 .cse276) |ULTIMATE.start_main_~A~0#1|) .cse242 .cse243)) .cse277 .cse278) (or .cse272 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse273 .cse289)) .cse242 .cse243) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse273 .cse288)) .cse246)) .cse274 .cse275)) .cse98 .cse238) (or (and (or .cse283 .cse284 .cse285 (and (or .cse242 .cse243 (= |ULTIMATE.start_main_~A~0#1| (+ .cse282 .cse289))) (or .cse246 (= |ULTIMATE.start_main_~A~0#1| (+ .cse282 .cse288))))) (or (and (or (= (+ .cse281 .cse289) |ULTIMATE.start_main_~A~0#1|) .cse242 .cse243) (or .cse246 (= (+ .cse281 .cse288) |ULTIMATE.start_main_~A~0#1|))) .cse279 .cse280)) .cse108 .cse109 .cse237)) .cse126 .cse127)) .cse61))) .cse132)) (.cse44 (<= 8 |ULTIMATE.start_main_~p~0#1|)) (.cse21 (or (let ((.cse270 (* (+ .cse208 .cse214) |ULTIMATE.start_main_~B~0#1|)) (.cse271 (* (+ .cse214 .cse205) |ULTIMATE.start_main_~B~0#1|)) (.cse257 (* |ULTIMATE.start_main_~B~0#1| (+ .cse200 .cse214))) (.cse256 (* |ULTIMATE.start_main_~B~0#1| (+ .cse214 .cse199)))) (and (or .cse111 (and (or .cse103 (and (or (and (or .cse254 (and (or .cse198 (= |ULTIMATE.start_main_~A~0#1| (+ .cse255 .cse256))) (or .cse201 (= (+ .cse257 .cse255) |ULTIMATE.start_main_~A~0#1|) .cse202)) .cse258) (or .cse259 .cse260 .cse261 (and (or (= (+ .cse262 .cse256) |ULTIMATE.start_main_~A~0#1|) .cse198) (or .cse201 (= |ULTIMATE.start_main_~A~0#1| (+ .cse257 .cse262)) .cse202)))) .cse113 .cse115 .cse240) (or .cse116 .cse239 (and (or .cse263 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse264 .cse256)) .cse198) (or .cse201 .cse202 (= (+ .cse264 .cse257) |ULTIMATE.start_main_~A~0#1|))) .cse265) (or .cse266 .cse267 (and (or .cse201 .cse202 (= |ULTIMATE.start_main_~A~0#1| (+ .cse257 .cse268))) (or .cse198 (= (+ .cse256 .cse268) |ULTIMATE.start_main_~A~0#1|))) .cse269)))) .cse105) (or .cse100 (and (or (and (or (and (or .cse206 (= (+ .cse262 .cse270) |ULTIMATE.start_main_~A~0#1|) .cse207) (or .cse204 (= (+ .cse271 .cse262) |ULTIMATE.start_main_~A~0#1|))) .cse259 .cse260 .cse261) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse255 .cse271)) .cse204) (or .cse206 .cse207 (= |ULTIMATE.start_main_~A~0#1| (+ .cse255 .cse270)))) .cse254 .cse258)) .cse113 .cse115 .cse240) (or .cse116 (and (or .cse266 .cse267 .cse269 (and (or .cse204 (= (+ .cse271 .cse268) |ULTIMATE.start_main_~A~0#1|)) (or .cse206 .cse207 (= (+ .cse270 .cse268) |ULTIMATE.start_main_~A~0#1|)))) (or .cse263 .cse265 (and (or .cse206 .cse207 (= (+ .cse264 .cse270) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse264 .cse271) |ULTIMATE.start_main_~A~0#1|) .cse204)))) .cse239))))) (or .cse97 (and (or .cse100 (and (or .cse98 (and (or .cse272 (and (or (= (+ .cse273 .cse270) |ULTIMATE.start_main_~A~0#1|) .cse206 .cse207) (or .cse204 (= |ULTIMATE.start_main_~A~0#1| (+ .cse273 .cse271)))) .cse274 .cse275) (or (and (or .cse206 (= (+ .cse270 .cse276) |ULTIMATE.start_main_~A~0#1|) .cse207) (or .cse204 (= |ULTIMATE.start_main_~A~0#1| (+ .cse271 .cse276)))) .cse277 .cse278)) .cse238) (or (and (or .cse279 .cse280 (and (or .cse206 (= |ULTIMATE.start_main_~A~0#1| (+ .cse281 .cse270)) .cse207) (or .cse204 (= (+ .cse281 .cse271) |ULTIMATE.start_main_~A~0#1|)))) (or (and (or .cse206 (= (+ .cse282 .cse270) |ULTIMATE.start_main_~A~0#1|) .cse207) (or .cse204 (= |ULTIMATE.start_main_~A~0#1| (+ .cse282 .cse271)))) .cse283 .cse284 .cse285)) .cse108 .cse109 .cse237))) (or .cse103 (and (or .cse108 (and (or .cse283 (and (or .cse201 .cse202 (= (+ .cse282 .cse257) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse282 .cse256)) .cse198)) .cse284 .cse285) (or .cse279 (and (or .cse201 (= (+ .cse281 .cse257) |ULTIMATE.start_main_~A~0#1|) .cse202) (or .cse198 (= (+ .cse281 .cse256) |ULTIMATE.start_main_~A~0#1|))) .cse280)) .cse109 .cse237) (or (and (or .cse272 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse257 .cse273)) .cse201 .cse202) (or .cse198 (= |ULTIMATE.start_main_~A~0#1| (+ .cse273 .cse256)))) .cse274 .cse275) (or (and (or (= (+ .cse257 .cse276) |ULTIMATE.start_main_~A~0#1|) .cse201 .cse202) (or .cse198 (= |ULTIMATE.start_main_~A~0#1| (+ .cse256 .cse276)))) .cse277 .cse278)) .cse98 .cse238)) .cse105)) .cse61))) .cse121 .cse122)) (.cse24 (or (and (or .cse241 (and (or .cse242 .cse243 (not (= .cse244 1))) (or (not (= 1 .cse245)) .cse246)) .cse126 .cse127) (or .cse247 (and (or .cse248 (not (= .cse249 1)) .cse250) (or (not (= .cse251 1)) .cse252)) .cse129)) (let ((.cse253 (* .cse164 .cse232))) (and (or (= (+ .cse253 .cse212) |ULTIMATE.start_main_~A~0#1|) .cse111 .cse213) (or .cse97 .cse209 (= (+ .cse210 .cse253) |ULTIMATE.start_main_~A~0#1|) .cse61))) .cse132)) (.cse48 (let ((.cse222 (not .cse240)) (.cse223 (not .cse239)) (.cse226 (not .cse238)) (.cse231 (not .cse237))) (let ((.cse215 (or .cse235 .cse121 (let ((.cse236 (+ .cse214 1))) (and (or .cse111 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse219 (* .cse236 .cse221))) .cse113 .cse115 .cse222) (or .cse116 .cse223 (= (+ (* .cse236 .cse225) .cse224) |ULTIMATE.start_main_~A~0#1|)))) (or .cse97 (and (or .cse226 (= |ULTIMATE.start_main_~A~0#1| (+ .cse227 (* .cse236 .cse228))) .cse98) (or .cse231 .cse108 .cse109 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse236 .cse229) .cse230)))) .cse61))) .cse122)) (.cse216 (or .cse194 (and (or (not .cse167) .cse111 (= (+ .cse233 (* .cse196 .cse143)) |ULTIMATE.start_main_~A~0#1|)) (or .cse97 (not .cse174) (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse143 .cse195) .cse234)) .cse61)))) (.cse217 (or .cse218 (let ((.cse220 (+ .cse232 1))) (and (or .cse111 (and (or (= (+ .cse219 (* .cse220 .cse221)) |ULTIMATE.start_main_~A~0#1|) .cse113 .cse115 .cse222) (or .cse116 .cse223 (= (+ .cse224 (* .cse220 .cse225)) |ULTIMATE.start_main_~A~0#1|)))) (or .cse97 (and (or .cse226 .cse98 (= |ULTIMATE.start_main_~A~0#1| (+ .cse227 (* .cse220 .cse228)))) (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse220 .cse229) .cse230)) .cse231 .cse108 .cse109)) .cse61))) .cse132))) (or (and .cse55 .cse56 .cse1 .cse35 .cse57 .cse19 .cse38 .cse58 .cse40 .cse215 .cse63 .cse216 .cse23 .cse217 .cse26 .cse60 .cse42 .cse61) (and .cse55 .cse56 .cse1 .cse35 .cse57 .cse38 .cse58 .cse40 .cse215 .cse63 .cse216 .cse23 .cse217 .cse26 .cse67 .cse60 .cse42 .cse61))))) (.cse27 (or (and (or .cse103 .cse197 .cse105 (and (or .cse198 (not (= .cse199 1))) (or (not (= .cse200 1)) .cse201 .cse202))) (or .cse100 .cse203 (and (or .cse204 (not (= .cse205 1))) (or .cse206 .cse207 (not (= .cse208 1)))))) .cse121 (let ((.cse211 (* .cse214 .cse164))) (and (or .cse97 .cse209 (= |ULTIMATE.start_main_~A~0#1| (+ .cse210 .cse211)) .cse61) (or .cse111 (= (+ .cse212 .cse211) |ULTIMATE.start_main_~A~0#1|) .cse213))) .cse122)) (.cse5 (or .cse194 (and (or .cse97 (not (= .cse164 .cse195)) .cse61) (or (not (= .cse196 .cse164)) .cse111)) .cse36 .cse137)) (.cse54 (or (and (or .cse97 .cse145 (let ((.cse183 (< .cse147 0)) (.cse181 (= (mod .cse147 2) 0)) (.cse182 (div .cse147 2))) (and (or .cse181 (not (= (+ .cse182 1) .cse164)) (not .cse183)) (or (and .cse183 (not .cse181)) (not (= .cse164 .cse182))))) .cse61) (or (let ((.cse184 (= (mod .cse142 2) 0)) (.cse186 (< .cse142 0)) (.cse185 (div .cse162 8))) (and (or .cse184 (not (= (+ .cse185 1) .cse164)) (not .cse186)) (or (and (not .cse184) .cse186) (not (= .cse164 .cse185))))) .cse111 .cse144)) .cse59 (and (or (let ((.cse189 (div .cse163 8)) (.cse187 (= (mod .cse158 2) 0)) (.cse188 (< .cse158 0))) (and (or .cse187 (not .cse188) (not (= (+ .cse189 1) 1))) (or (not (= .cse189 1)) (and (not .cse187) .cse188)))) .cse149 .cse132) (or .cse121 .cse122 (let ((.cse190 (= (mod .cse160 2) 0)) (.cse191 (< .cse160 0)) (.cse192 (div .cse160 2))) (and (or (and (not .cse190) .cse191) (not (= .cse192 1))) (or .cse190 (not .cse191) (not (= (+ .cse192 1) 1))))) .cse148)) .cse193)) (.cse6 (or .cse121 (let ((.cse179 (* (+ .cse119 .cse151) |ULTIMATE.start_main_~B~0#1|)) (.cse180 (* (+ .cse151 .cse120) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse97 (and (or .cse177 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse179 .cse178)) .cse103 .cse105) (or .cse100 (= (+ .cse180 .cse178) |ULTIMATE.start_main_~A~0#1|))) .cse98) (or .cse176 (and (or .cse103 (= |ULTIMATE.start_main_~A~0#1| (+ .cse175 .cse179)) .cse105) (or .cse100 (= |ULTIMATE.start_main_~A~0#1| (+ .cse175 .cse180)))) .cse108 .cse109)) .cse174 .cse61) (or (and (or .cse173 .cse113 (and (or .cse103 .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ .cse172 .cse179))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse172 .cse180)) .cse100)) .cse115) (or .cse116 .cse168 (and (or .cse103 (= |ULTIMATE.start_main_~A~0#1| (+ .cse169 .cse179)) .cse105) (or (= (+ .cse180 .cse169) |ULTIMATE.start_main_~A~0#1|) .cse100)))) .cse111 .cse167))) .cse122)) (.cse7 (or (let ((.cse170 (* (+ .cse130 .cse151) |ULTIMATE.start_main_~B~0#1|)) (.cse171 (* (+ .cse151 .cse131) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse111 .cse167 (and (or .cse116 .cse168 (and (or .cse129 (= (+ .cse169 .cse170) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse171 .cse169) |ULTIMATE.start_main_~A~0#1|) .cse126 .cse127))) (or (and (or .cse126 .cse127 (= (+ .cse171 .cse172) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse172 .cse170)) .cse129)) .cse173 .cse113 .cse115))) (or .cse97 .cse174 (and (or (and (or (= (+ .cse175 .cse171) |ULTIMATE.start_main_~A~0#1|) .cse126 .cse127) (or (= (+ .cse175 .cse170) |ULTIMATE.start_main_~A~0#1|) .cse129)) .cse176 .cse108 .cse109) (or .cse177 (and (or (= (+ .cse170 .cse178) |ULTIMATE.start_main_~A~0#1|) .cse129) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse171 .cse178)) .cse126 .cse127)) .cse98)) .cse61))) .cse132)) (.cse9 (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse164 .cse159) .cse156)) .cse152 .cse36 (not .cse150) (let ((.cse165 (div (* |ULTIMATE.start_main_~p~0#1| 4) 8))) (and (or (not (= .cse165 1)) .cse132) (or .cse121 .cse122 (not (= (+ .cse165 1) 1))))) (let ((.cse166 (div (* |ULTIMATE.start_main_~d~0#1| 4) 8))) (and (or (not (= .cse164 .cse166)) .cse111) (or .cse97 (not (= (+ .cse166 1) .cse164)) .cse61))))) (.cse11 (let ((.cse161 (+ (- (* .cse162 2)) |ULTIMATE.start_main_~r~0#1|))) (or (not (>= .cse161 |ULTIMATE.start_main_~d~0#1|)) (>= .cse161 .cse162) (= (+ (+ .cse161 .cse33) (* (+ |ULTIMATE.start_main_~p~0#1| (+ |ULTIMATE.start_main_~q~0#1| (* 2 .cse163))) |ULTIMATE.start_main_~B~0#1|)) |ULTIMATE.start_main_~A~0#1|)))) (.cse15 (or .cse152 (let ((.cse155 (* (+ .cse159 .cse160) |ULTIMATE.start_main_~B~0#1|)) (.cse153 (* |ULTIMATE.start_main_~B~0#1| (+ .cse158 .cse159)))) (and (or .cse97 (let ((.cse154 (+ .cse146 .cse156))) (and (or (= (+ .cse153 .cse154) |ULTIMATE.start_main_~A~0#1|) .cse132) (or (= (+ .cse155 .cse154) |ULTIMATE.start_main_~A~0#1|) .cse121 .cse122))) (not (>= .cse156 .cse147)) .cse61) (or (let ((.cse157 (+ .cse141 .cse156))) (and (or .cse121 (= |ULTIMATE.start_main_~A~0#1| (+ .cse155 .cse157)) .cse122) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse157 .cse153)) .cse132))) .cse111 (not (>= .cse156 .cse142))))))) (.cse49 (= .cse39 |ULTIMATE.start_main_~A~0#1|)) (.cse64 (<= 2 |ULTIMATE.start_main_~d~0#1|)) (.cse43 (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|)) (.cse41 (* 2 .cse69)) (.cse70 (= |ULTIMATE.start_main_~p~0#1| .cse69)) (.cse71 (= (+ 4 0) |ULTIMATE.start_main_~q~0#1|)) (.cse85 (or (and (= |ULTIMATE.start_main_~d~0#1| .cse73) .cse74) (and (= |ULTIMATE.start_main_~d~0#1| .cse79) .cse83 .cse84))) (.cse72 (= .cse86 .cse65)) (.cse68 (= |ULTIMATE.start_main_~d~0#1| .cse87)) (.cse88 (= 2 |ULTIMATE.start_main_~p~0#1|)) (.cse22 (<= 2 |ULTIMATE.start_main_~p~0#1|)) (.cse12 (or .cse135 (= (+ .cse140 (* |ULTIMATE.start_main_~d~0#1| .cse151)) |ULTIMATE.start_main_~A~0#1|) .cse59)) (.cse14 (or .cse1 (and .cse1 (<= 1 |ULTIMATE.start_main_~d~0#1|)))) (.cse17 (or (and (or .cse111 (= (+ (+ .cse140 .cse141) (* .cse142 .cse143)) |ULTIMATE.start_main_~A~0#1|) (not .cse144)) (or .cse97 (not .cse145) (= (+ (+ .cse146 .cse140) (* .cse147 .cse143)) |ULTIMATE.start_main_~A~0#1|) .cse61)) (and (or (not .cse148) .cse121 .cse122) (or (not .cse149) .cse132)) .cse150)) (.cse20 (or .cse136 .cse137 (and (or .cse97 .cse138 .cse110 .cse61) (or .cse57 .cse139 .cse111)))) (.cse8 (or .cse135 (not .cse10) .cse67)) (.cse2 (or .cse59 .cse23)) (.cse3 (or .cse97 .cse133 .cse134 .cse61)) (.cse4 (>= |ULTIMATE.start_main_~p~0#1| 1)) (.cse25 (or (let ((.cse125 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse131))) (.cse128 (* |ULTIMATE.start_main_~B~0#1| (+ .cse130 |ULTIMATE.start_main_~q~0#1|)))) (and (or .cse97 (and (or .cse107 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse106 .cse125)) .cse126 .cse127) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse128 .cse106)) .cse129)) .cse108 .cse109) (or .cse98 .cse99 (and (or (= (+ .cse128 .cse101) |ULTIMATE.start_main_~A~0#1|) .cse129) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse101 .cse125)) .cse126 .cse127)))) .cse110 .cse61) (or .cse57 .cse111 (and (or .cse113 .cse114 .cse115 (and (or .cse126 (= |ULTIMATE.start_main_~A~0#1| (+ .cse112 .cse125)) .cse127) (or .cse129 (= |ULTIMATE.start_main_~A~0#1| (+ .cse112 .cse128))))) (or .cse116 (and (or (= (+ .cse118 .cse125) |ULTIMATE.start_main_~A~0#1|) .cse126 .cse127) (or (= (+ .cse118 .cse128) |ULTIMATE.start_main_~A~0#1|) .cse129)) .cse117))))) .cse132)) (.cse66 (>= |ULTIMATE.start_main_~A~0#1| .cse46)) (.cse16 (or .cse123 .cse124 .cse111)) (.cse28 (or (let ((.cse102 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse120))) (.cse104 (* |ULTIMATE.start_main_~B~0#1| (+ .cse119 |ULTIMATE.start_main_~q~0#1|)))) (and (or .cse97 (and (or .cse98 .cse99 (and (or .cse100 (= (+ .cse101 .cse102) |ULTIMATE.start_main_~A~0#1|)) (or .cse103 (= |ULTIMATE.start_main_~A~0#1| (+ .cse104 .cse101)) .cse105))) (or (and (or .cse100 (= |ULTIMATE.start_main_~A~0#1| (+ .cse106 .cse102))) (or .cse103 (= (+ .cse104 .cse106) |ULTIMATE.start_main_~A~0#1|) .cse105)) .cse107 .cse108 .cse109)) .cse110 .cse61) (or .cse57 .cse111 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse112 .cse104)) .cse103 .cse105) (or .cse100 (= (+ .cse112 .cse102) |ULTIMATE.start_main_~A~0#1|))) .cse113 .cse114 .cse115) (or .cse116 .cse117 (and (or .cse100 (= (+ .cse118 .cse102) |ULTIMATE.start_main_~A~0#1|)) (or .cse103 (= |ULTIMATE.start_main_~A~0#1| (+ .cse118 .cse104)) .cse105))))))) .cse121 .cse122))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse18 .cse1 .cse2 .cse19 .cse20 .cse3 .cse5 .cse6 .cse21 .cse22 .cse7 .cse9 .cse10 .cse23 .cse11 .cse24 .cse25 .cse26 .cse13 .cse15 .cse27 .cse16 .cse28) (let ((.cse34 (+ |ULTIMATE.start_main_~A~0#1| (* (- 1) .cse39)))) (and (let ((.cse31 (< .cse34 0)) (.cse29 (div (+ |ULTIMATE.start_main_~A~0#1| .cse32 .cse33) 2)) (.cse30 (= (mod (+ |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0))) (or (and (= .cse29 |ULTIMATE.start_main_~d~0#1|) (or .cse30 (not .cse31))) (and .cse31 (= |ULTIMATE.start_main_~d~0#1| (+ .cse29 1)) (not .cse30)))) .cse35 .cse36 (= |ULTIMATE.start_main_~B~0#1| (+ (* (- 2) |ULTIMATE.start_main_~B~0#1|) .cse37 |ULTIMATE.start_main_~A~0#1|)) (= 2 .cse34) .cse38 (>= .cse39 |ULTIMATE.start_main_~d~0#1|) .cse40 .cse23 (= (+ (- 2) |ULTIMATE.start_main_~q~0#1|) 1) .cse26 .cse13 (not (>= (+ .cse39 .cse34) .cse41)) .cse42 (= (+ (* (- 1) 2) .cse43) 0))) (and .cse1 .cse4 .cse8 .cse10 .cse13) (and .cse1 .cse44 (= (* 2 .cse41) |ULTIMATE.start_main_~p~0#1|) .cse45 (>= |ULTIMATE.start_main_~r~0#1| .cse46) .cse10 .cse47 (= (* .cse46 2) |ULTIMATE.start_main_~d~0#1|) .cse13 .cse48) (and .cse49 (= |ULTIMATE.start_main_~d~0#1| 1) .cse50 .cse51 .cse36 .cse52 (= |ULTIMATE.start_main_~r~0#1| (+ (- |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~A~0#1|)) .cse23 .cse13 (= |ULTIMATE.start_main_~q~0#1| (+ 0 1)) .cse53) (and .cse1 .cse2 .cse4 .cse8 .cse10 .cse11 .cse13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse54 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse36 .cse52 .cse45 .cse47 .cse13) (and .cse1 .cse19 .cse22 .cse8 .cse10 .cse23 .cse26 .cse13) (and .cse55 .cse56 .cse57 (= .cse46 |ULTIMATE.start_main_~d~0#1|) .cse58 (= |ULTIMATE.start_main_~p~0#1| .cse41) .cse45 (= |ULTIMATE.start_main_~d~0#1| .cse41) .cse59 .cse47 .cse13 .cse60 .cse61) (and .cse1 .cse2 .cse3 .cse5 .cse54 .cse6 .cse22 .cse7 .cse8 .cse9 .cse10 .cse23 .cse11 .cse12 .cse26 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse62 .cse1 .cse35 .cse19 .cse20 .cse40 .cse63 .cse8 .cse64 .cse10 .cse23 .cse25 .cse26 .cse13 .cse60 .cse28) (and .cse62 (= |ULTIMATE.start_main_~p~0#1| 4) .cse49 .cse1 .cse35 .cse19 .cse40 .cse63 (= |ULTIMATE.start_main_~d~0#1| .cse65) .cse64 .cse10 .cse23 (= (+ |ULTIMATE.start_main_~A~0#1| .cse33) |ULTIMATE.start_main_~r~0#1|) .cse66 .cse26 .cse13 .cse60 .cse53 (>= .cse39 .cse46)) (and .cse1 (or (and .cse0 .cse18 .cse1 .cse2 .cse20 .cse3 .cse44 .cse5 .cse6 .cse21 .cse7 .cse9 .cse10 .cse47 .cse11 .cse24 .cse25 .cse67 .cse13 .cse48 .cse15 .cse27 .cse16 .cse28) (and .cse18 .cse1 .cse2 .cse19 .cse20 .cse3 .cse44 .cse5 .cse54 .cse6 .cse21 .cse7 .cse9 .cse10 .cse47 .cse11 .cse24 .cse25 .cse13 .cse48 .cse15 .cse27 .cse16 .cse28)) .cse10 .cse47 .cse13) (and .cse68 (= |ULTIMATE.start_main_~d~0#1| .cse69) .cse45 .cse10 .cse47 .cse13 .cse70) (and .cse71 .cse1 .cse36 .cse72 .cse4 (or (and (not (>= |ULTIMATE.start_main_~r~0#1| .cse73)) .cse74 (let ((.cse77 (= (mod .cse73 2) 0)) (.cse75 (< .cse73 0)) (.cse76 (div .cse78 4))) (or (and .cse75 (= (+ .cse76 1) |ULTIMATE.start_main_~d~0#1|) (not .cse77)) (and (or .cse77 (not .cse75)) (= |ULTIMATE.start_main_~d~0#1| .cse76))))) (and (not (>= |ULTIMATE.start_main_~r~0#1| .cse79)) (let ((.cse81 (= (mod .cse79 2) 0)) (.cse80 (< .cse79 0)) (.cse82 (div .cse79 2))) (or (and .cse80 (not .cse81) (= (+ .cse82 1) |ULTIMATE.start_main_~d~0#1|)) (and (or .cse81 (not .cse80)) (= .cse82 |ULTIMATE.start_main_~d~0#1|)))) .cse83 .cse84)) .cse12 .cse66 .cse13 .cse14 .cse17) (and .cse1 .cse2 .cse4 .cse5 .cse54 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse85 .cse36 (= (+ (* (- 1) .cse69) |ULTIMATE.start_main_~q~0#1|) 0) .cse13 .cse14 (= .cse86 .cse87)) (and .cse49 .cse1 .cse19 .cse68 .cse88 .cse64 .cse23 (= .cse43 0) .cse13 .cse60 (= 2 |ULTIMATE.start_main_~d~0#1|) (not (>= .cse39 .cse41)) .cse70) (let ((.cse89 (+ |ULTIMATE.start_main_~r~0#1| .cse65))) (and .cse71 .cse1 .cse85 .cse72 .cse68 (= .cse89 |ULTIMATE.start_main_~A~0#1|) .cse88 .cse22 (>= .cse89 .cse46) .cse59 .cse10 (= |ULTIMATE.start_main_~q~0#1| 4) (let ((.cse91 (= (mod |ULTIMATE.start_main_~q~0#1| 2) 0)) (.cse92 (< |ULTIMATE.start_main_~q~0#1| 0)) (.cse90 (div |ULTIMATE.start_main_~q~0#1| 2))) (or (and (= .cse90 |ULTIMATE.start_main_~p~0#1|) (or .cse91 (not .cse92))) (and (not .cse91) .cse92 (= (+ .cse90 1) |ULTIMATE.start_main_~p~0#1|)))) .cse23 .cse12 .cse66 .cse26 .cse13 .cse14 .cse17)) (and .cse1 .cse20 .cse4 .cse8 .cse10 .cse25 .cse13 .cse28) (let ((.cse96 (* |ULTIMATE.start_main_~B~0#1| (- 4)))) (let ((.cse94 (+ .cse96 .cse37 |ULTIMATE.start_main_~A~0#1|))) (let ((.cse93 (+ .cse94 |ULTIMATE.start_main_~r~0#1|)) (.cse95 (+ .cse96 |ULTIMATE.start_main_~A~0#1|))) (and (not (>= .cse93 .cse87)) .cse2 .cse36 .cse3 (= .cse94 |ULTIMATE.start_main_~B~0#1|) .cse4 .cse52 (= (+ |ULTIMATE.start_main_~q~0#1| (- 4)) 1) (>= .cse93 .cse94) .cse10 (>= (+ .cse65 .cse95) .cse46) .cse25 .cse66 (not (>= .cse95 .cse87)) (= |ULTIMATE.start_main_~r~0#1| (+ .cse33 .cse95)) (= |ULTIMATE.start_main_~q~0#1| (+ |ULTIMATE.start_main_~p~0#1| 4)) .cse13 .cse16 .cse28))))))))))))) [2023-02-17 02:08:32,418 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 13) no Hoare annotation was computed. [2023-02-17 02:08:32,421 INFO L895 garLoopResultBuilder]: At program point L44-1(lines 44 56) the Hoare annotation is: (let ((.cse45 (div |ULTIMATE.start_main_~d~0#1| 2)) (.cse271 (div |ULTIMATE.start_main_~p~0#1| 2))) (let ((.cse272 (+ .cse271 1)) (.cse281 (- .cse45))) (let ((.cse280 (+ (- 1) .cse281)) (.cse92 (+ |ULTIMATE.start_main_~q~0#1| .cse272)) (.cse75 (+ |ULTIMATE.start_main_~q~0#1| .cse271)) (.cse287 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse52 (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (let ((.cse33 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (.cse71 (+ |ULTIMATE.start_main_~r~0#1| .cse281)) (.cse51 (and .cse287 (not .cse52))) (.cse285 (* |ULTIMATE.start_main_~B~0#1| .cse75)) (.cse53 (not .cse287)) (.cse286 (* .cse92 |ULTIMATE.start_main_~B~0#1|)) (.cse74 (+ |ULTIMATE.start_main_~r~0#1| .cse280)) (.cse284 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse27 (- |ULTIMATE.start_main_~d~0#1|)) (.cse44 (+ .cse45 1))) (let ((.cse125 (div .cse44 2)) (.cse124 (div |ULTIMATE.start_main_~d~0#1| 4)) (.cse174 (div .cse272 2)) (.cse130 (= .cse271 1)) (.cse128 (= .cse272 1)) (.cse39 (+ |ULTIMATE.start_main_~r~0#1| .cse27)) (.cse38 (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (.cse30 (not .cse284)) (.cse224 (and (or .cse51 (= (+ .cse74 .cse285) |ULTIMATE.start_main_~A~0#1|)) (or .cse52 .cse53 (= |ULTIMATE.start_main_~A~0#1| (+ .cse286 .cse74))))) (.cse183 (and (or (= (+ .cse285 .cse71) |ULTIMATE.start_main_~A~0#1|) .cse51) (or (= (+ .cse286 .cse71) |ULTIMATE.start_main_~A~0#1|) .cse52 .cse53))) (.cse35 (and (not .cse33) .cse284)) (.cse177 (div |ULTIMATE.start_main_~p~0#1| 4))) (let ((.cse178 (+ .cse177 1)) (.cse282 (< .cse271 0)) (.cse62 (= (mod .cse271 2) 0)) (.cse241 (or .cse183 .cse35)) (.cse158 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse242 (or .cse30 .cse224 .cse33)) (.cse23 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)) (.cse182 (= |ULTIMATE.start_main_~A~0#1| (+ .cse39 (* |ULTIMATE.start_main_~B~0#1| .cse38)))) (.cse8 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse43 (and (or (not .cse130) .cse51) (or .cse52 .cse53 (not .cse128)))) (.cse76 (= (mod .cse272 2) 0)) (.cse283 (< .cse272 0)) (.cse173 (+ .cse174 1)) (.cse234 (- .cse124)) (.cse123 (+ .cse124 1)) (.cse126 (+ .cse125 1)) (.cse237 (- .cse125))) (let ((.cse236 (+ (- 1) .cse237)) (.cse122 (>= .cse74 .cse126)) (.cse278 (< .cse44 0)) (.cse120 (= (mod .cse44 2) 0)) (.cse114 (>= .cse74 .cse125)) (.cse99 (>= .cse71 .cse124)) (.cse100 (= (mod .cse45 2) 0)) (.cse107 (>= .cse71 .cse123)) (.cse279 (< .cse45 0)) (.cse235 (+ (- 1) .cse234)) (.cse77 (= .cse173 1)) (.cse78 (not .cse283)) (.cse84 (and .cse283 (not .cse76))) (.cse85 (= .cse174 1)) (.cse180 (* 2 |ULTIMATE.start_main_~p~0#1|)) (.cse49 (* 2 |ULTIMATE.start_main_~d~0#1|)) (.cse20 (or .cse43 (and (or (= .cse45 |ULTIMATE.start_main_~B~0#1|) .cse35) (or .cse30 (= |ULTIMATE.start_main_~B~0#1| .cse44) .cse33)))) (.cse11 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse238 (or .cse43 (and (or .cse30 .cse33 (= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| .cse44)) |ULTIMATE.start_main_~A~0#1|)) (or .cse35 (= |ULTIMATE.start_main_~A~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* .cse45 |ULTIMATE.start_main_~q~0#1|))))))) (.cse240 (or (and .cse158 .cse23 .cse182) (and .cse241 .cse158 .cse242 .cse23 .cse182) (and .cse241 .cse158 .cse242 (= |ULTIMATE.start_main_~r~0#1| (+ (- |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~A~0#1|)) .cse23 .cse182 .cse8 (= |ULTIMATE.start_main_~q~0#1| (+ 0 1))))) (.cse42 (>= |ULTIMATE.start_main_~r~0#1| .cse45)) (.cse41 (>= |ULTIMATE.start_main_~r~0#1| .cse44)) (.cse63 (= .cse177 1)) (.cse69 (and .cse282 (not .cse62))) (.cse55 (= .cse178 1)) (.cse61 (not .cse282))) (let ((.cse134 (- |ULTIMATE.start_main_~r~0#1|)) (.cse10 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse129 (and (or (not .cse63) .cse69) (or (not .cse55) .cse61 .cse62))) (.cse36 (>= .cse39 .cse45)) (.cse31 (>= .cse39 .cse44)) (.cse225 (not .cse41)) (.cse184 (not .cse42)) (.cse157 (* (- 1) |ULTIMATE.start_main_~r~0#1|)) (.cse7 (or (and .cse20 .cse11 .cse238 .cse240) (and .cse20 .cse11 .cse238 (<= 1 |ULTIMATE.start_main_~d~0#1|) .cse240))) (.cse47 (+ (- .cse49) |ULTIMATE.start_main_~r~0#1|)) (.cse46 (+ |ULTIMATE.start_main_~q~0#1| .cse180)) (.cse5 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse260 (+ .cse39 .cse281)) (.cse262 (+ .cse39 .cse280)) (.cse127 (and (or (not .cse77) .cse76 .cse78) (or .cse84 (not .cse85)))) (.cse251 (+ .cse235 .cse71)) (.cse106 (not .cse279)) (.cse253 (not .cse107)) (.cse93 (and (not .cse100) .cse279)) (.cse254 (not .cse99)) (.cse255 (+ .cse234 .cse71)) (.cse256 (not .cse114)) (.cse257 (+ .cse74 .cse237)) (.cse113 (and .cse278 (not .cse120))) (.cse259 (not .cse122)) (.cse121 (not .cse278)) (.cse258 (+ .cse74 .cse236))) (let ((.cse101 (div .cse123 2)) (.cse94 (div |ULTIMATE.start_main_~d~0#1| 8)) (.cse108 (div .cse44 4)) (.cse119 (div .cse126 2)) (.cse67 (div |ULTIMATE.start_main_~p~0#1| 8)) (.cse59 (div .cse178 2)) (.cse116 (= (mod .cse126 2) 0)) (.cse56 (= (mod .cse178 2) 0)) (.cse244 (< .cse178 0)) (.cse243 (< .cse126 0)) (.cse112 (= (mod .cse125 2) 0)) (.cse245 (< .cse125 0)) (.cse64 (= (mod .cse177 2) 0)) (.cse246 (< .cse177 0)) (.cse96 (= (mod .cse124 2) 0)) (.cse247 (< .cse124 0)) (.cse104 (= (mod .cse123 2) 0)) (.cse248 (< .cse123 0)) (.cse87 (div .cse272 4)) (.cse80 (div .cse173 2)) (.cse82 (= (mod .cse173 2) 0)) (.cse249 (< .cse173 0)) (.cse88 (= (mod .cse174 2) 0)) (.cse250 (< .cse174 0)) (.cse14 (or .cse127 .cse52 (let ((.cse277 (+ .cse92 1))) (and (or .cse35 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse251 (* .cse277 .cse123))) .cse100 .cse106 .cse253) (or .cse93 .cse254 (= (+ (* .cse277 .cse124) .cse255) |ULTIMATE.start_main_~A~0#1|)))) (or .cse30 (and (or .cse256 (= |ULTIMATE.start_main_~A~0#1| (+ .cse257 (* .cse277 .cse125))) .cse113) (or .cse259 .cse120 .cse121 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse277 .cse126) .cse258)))) .cse33))) .cse53)) (.cse15 (let ((.cse274 (* (+ .cse92 .cse174) |ULTIMATE.start_main_~B~0#1|)) (.cse273 (* (+ .cse173 .cse92) |ULTIMATE.start_main_~B~0#1|)) (.cse276 (* (+ .cse177 .cse75) |ULTIMATE.start_main_~B~0#1|)) (.cse275 (* (+ .cse178 .cse75) |ULTIMATE.start_main_~B~0#1|))) (let ((.cse265 (or (and (or .cse128 .cse52 .cse53 (and (or .cse100 .cse106 (and (or .cse76 (= (+ .cse251 .cse273) |ULTIMATE.start_main_~A~0#1|) .cse78) (or .cse84 (= |ULTIMATE.start_main_~A~0#1| (+ .cse274 .cse251))))) (or .cse93 (and (or .cse84 (= (+ .cse274 .cse255) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse273 .cse255)) .cse76 .cse78))))) (or (and (or .cse93 (and (or (= (+ .cse276 .cse255) |ULTIMATE.start_main_~A~0#1|) .cse69) (or (= (+ .cse255 .cse275) |ULTIMATE.start_main_~A~0#1|) .cse61 .cse62))) (or (and (or .cse69 (= (+ .cse276 .cse251) |ULTIMATE.start_main_~A~0#1|)) (or .cse61 .cse62 (= |ULTIMATE.start_main_~A~0#1| (+ .cse251 .cse275)))) .cse100 .cse106)) .cse51 .cse130)) .cse35)) (.cse268 (or .cse30 .cse33 (and (or .cse128 .cse52 .cse53 (and (or (and (or (= (+ .cse273 .cse258) |ULTIMATE.start_main_~A~0#1|) .cse76 .cse78) (or .cse84 (= |ULTIMATE.start_main_~A~0#1| (+ .cse274 .cse258)))) .cse120 .cse121) (or .cse113 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse257 .cse273)) .cse76 .cse78) (or .cse84 (= (+ .cse257 .cse274) |ULTIMATE.start_main_~A~0#1|)))))) (or (and (or (and (or .cse61 .cse62 (= (+ .cse257 .cse275) |ULTIMATE.start_main_~A~0#1|)) (or .cse69 (= |ULTIMATE.start_main_~A~0#1| (+ .cse257 .cse276)))) .cse113) (or .cse120 .cse121 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse258 .cse275)) .cse61 .cse62) (or (= (+ .cse276 .cse258) |ULTIMATE.start_main_~A~0#1|) .cse69)))) .cse51 .cse130)))) (.cse264 (or .cse5 (let ((.cse270 (* (+ .cse38 .cse272) |ULTIMATE.start_main_~B~0#1|)) (.cse269 (* (+ .cse38 .cse271) |ULTIMATE.start_main_~B~0#1|))) (and (or (and (or (= (+ .cse269 .cse260) |ULTIMATE.start_main_~A~0#1|) .cse51) (or .cse52 .cse53 (= |ULTIMATE.start_main_~A~0#1| (+ .cse260 .cse270)))) .cse35) (or .cse30 (and (or .cse52 (= |ULTIMATE.start_main_~A~0#1| (+ .cse262 .cse270)) .cse53) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse262 .cse269)) .cse51)) .cse33))))) (.cse266 (or .cse5 (and .cse241 .cse242))) (.cse267 (or (= .cse180 1) (= |ULTIMATE.start_main_~A~0#1| (+ (+ .cse47 .cse27) (* |ULTIMATE.start_main_~B~0#1| (+ .cse46 |ULTIMATE.start_main_~p~0#1|))))))) (or (and .cse158 .cse264 .cse265 .cse266 .cse182 .cse7 .cse267 .cse268) (and .cse264 (= |ULTIMATE.start_main_~B~0#1| (+ (* (- 2) |ULTIMATE.start_main_~B~0#1|) .cse157 |ULTIMATE.start_main_~A~0#1|)) .cse265 .cse266 .cse182 (= (+ (- 2) |ULTIMATE.start_main_~q~0#1|) 1) .cse7 .cse267 .cse8 .cse268) (and .cse158 .cse264 .cse266 .cse182 .cse7 .cse267))))) (.cse16 (or .cse43 (let ((.cse263 (+ |ULTIMATE.start_main_~q~0#1| 1))) (and (or .cse30 .cse225 .cse33 (= |ULTIMATE.start_main_~A~0#1| (+ .cse74 (* .cse263 .cse44)))) (or .cse184 .cse35 (= (+ (* .cse45 .cse263) .cse71) |ULTIMATE.start_main_~A~0#1|)))))) (.cse17 (or .cse43 (let ((.cse261 (+ .cse38 1))) (and (or (not .cse36) .cse35 (= (+ .cse260 (* .cse45 .cse261)) |ULTIMATE.start_main_~A~0#1|)) (or .cse30 (not .cse31) (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse261 .cse44) .cse262)) .cse33))))) (.cse18 (or .cse129 (let ((.cse252 (+ .cse75 1))) (and (or .cse35 (and (or (= (+ .cse251 (* .cse252 .cse123)) |ULTIMATE.start_main_~A~0#1|) .cse100 .cse106 .cse253) (or .cse93 .cse254 (= (+ .cse255 (* .cse252 .cse124)) |ULTIMATE.start_main_~A~0#1|)))) (or .cse30 (and (or .cse256 .cse113 (= |ULTIMATE.start_main_~A~0#1| (+ .cse257 (* .cse252 .cse125)))) (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse252 .cse126) .cse258)) .cse259 .cse120 .cse121)) .cse33))) .cse51)) (.cse181 (not (>= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|))) (.cse26 (* 2 .cse10)) (.cse9 (+ .cse157 |ULTIMATE.start_main_~A~0#1|)) (.cse142 (+ |ULTIMATE.start_main_~A~0#1| .cse134))) (let ((.cse0 (div .cse142 2)) (.cse4 (< .cse9 0)) (.cse147 (= (mod (+ |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0)) (.cse146 (>= |ULTIMATE.start_main_~A~0#1| .cse26)) (.cse28 (* |ULTIMATE.start_main_~B~0#1| (- 4))) (.cse137 (>= |ULTIMATE.start_main_~p~0#1| 1)) (.cse138 (or (and .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse14 .cse15 .cse16 .cse17 .cse18 (or (not .cse5) (= (+ .cse39 (* |ULTIMATE.start_main_~d~0#1| .cse38)) |ULTIMATE.start_main_~A~0#1|) .cse181)))) (.cse48 (>= .cse47 |ULTIMATE.start_main_~d~0#1|)) (.cse89 (not .cse250)) (.cse86 (and (not .cse88) .cse250)) (.cse83 (not .cse249)) (.cse79 (and (not .cse82) .cse249)) (.cse81 (+ .cse80 1)) (.cse90 (+ .cse87 1)) (.cse103 (not .cse248)) (.cse102 (and .cse248 (not .cse104))) (.cse95 (and (not .cse96) .cse247)) (.cse97 (not .cse247)) (.cse68 (and (not .cse64) .cse246)) (.cse66 (not .cse246)) (.cse109 (and (not .cse112) .cse245)) (.cse110 (not .cse245)) (.cse115 (not .cse243)) (.cse57 (not .cse244)) (.cse60 (and (not .cse56) .cse244)) (.cse118 (and (not .cse116) .cse243)) (.cse58 (+ 1 .cse59)) (.cse65 (+ .cse67 1)) (.cse117 (+ .cse119 1)) (.cse111 (+ .cse108 1)) (.cse98 (+ .cse94 1)) (.cse105 (+ .cse101 1)) (.cse136 (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse19 (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)) (.cse12 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse13 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))) (let ((.cse21 (let ((.cse239 (or (and .cse241 .cse158 .cse242 .cse12 .cse23 .cse13 .cse182 .cse8) (and .cse158 .cse12 .cse23 .cse13 .cse182 .cse8)))) (or (and .cse238 .cse239 .cse19) (and (= .cse136 |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~d~0#1| 1) .cse5 .cse240 (= (+ |ULTIMATE.start_main_~p~0#1| 0) |ULTIMATE.start_main_~q~0#1|)) (and .cse238 .cse240 .cse19) (and .cse238 .cse239)))) (.cse22 (let ((.cse230 (- .cse119)) (.cse231 (- .cse108)) (.cse232 (- .cse94)) (.cse233 (- .cse101))) (let ((.cse168 (not (>= |ULTIMATE.start_main_~r~0#1| .cse126))) (.cse167 (+ .cse236 |ULTIMATE.start_main_~r~0#1|)) (.cse163 (not (>= |ULTIMATE.start_main_~r~0#1| .cse125))) (.cse164 (+ |ULTIMATE.start_main_~r~0#1| .cse237)) (.cse170 (not (>= |ULTIMATE.start_main_~r~0#1| .cse123))) (.cse169 (+ .cse235 |ULTIMATE.start_main_~r~0#1|)) (.cse172 (+ .cse234 |ULTIMATE.start_main_~r~0#1|)) (.cse171 (not (>= |ULTIMATE.start_main_~r~0#1| .cse124))) (.cse200 (not (>= .cse39 .cse125))) (.cse201 (+ .cse39 .cse237)) (.cse199 (not (>= .cse39 .cse126))) (.cse198 (+ .cse236 .cse39)) (.cse197 (not (>= .cse39 .cse123))) (.cse196 (+ .cse39 .cse235)) (.cse192 (not (>= .cse39 .cse124))) (.cse193 (+ .cse234 .cse39)) (.cse206 (not (>= .cse71 .cse105))) (.cse207 (+ (+ (- 1) .cse233) .cse71)) (.cse202 (+ .cse71 .cse233)) (.cse205 (not (>= .cse71 .cse101))) (.cse209 (+ .cse71 .cse232)) (.cse208 (not (>= .cse71 .cse94))) (.cse211 (+ (+ (- 1) .cse232) .cse71)) (.cse210 (not (>= .cse71 .cse98))) (.cse216 (+ .cse231 .cse74)) (.cse217 (not (>= .cse74 .cse108))) (.cse214 (+ .cse74 (+ (- 1) .cse231))) (.cse215 (not (>= .cse74 .cse111))) (.cse221 (not (>= .cse74 .cse117))) (.cse220 (+ .cse74 (+ (- 1) .cse230))) (.cse219 (+ .cse74 .cse230)) (.cse218 (not (>= .cse74 .cse119)))) (let ((.cse148 (or (let ((.cse226 (* |ULTIMATE.start_main_~B~0#1| (+ .cse75 .cse67))) (.cse227 (* |ULTIMATE.start_main_~B~0#1| (+ .cse65 .cse75))) (.cse229 (* |ULTIMATE.start_main_~B~0#1| (+ .cse58 .cse75))) (.cse228 (* (+ .cse75 .cse59) |ULTIMATE.start_main_~B~0#1|))) (and (or (and (or (and (or .cse93 (and (or .cse96 .cse210 (and (or (= (+ .cse211 .cse226) |ULTIMATE.start_main_~A~0#1|) .cse68) (or (= (+ .cse211 .cse227) |ULTIMATE.start_main_~A~0#1|) .cse64 .cse66)) .cse97) (or .cse208 (and (or .cse64 .cse66 (= |ULTIMATE.start_main_~A~0#1| (+ .cse209 .cse227))) (or (= (+ .cse209 .cse226) |ULTIMATE.start_main_~A~0#1|) .cse68)) .cse95)) .cse99) (or (and (or (and (or .cse64 .cse66 (= |ULTIMATE.start_main_~A~0#1| (+ .cse202 .cse227))) (or .cse68 (= (+ .cse202 .cse226) |ULTIMATE.start_main_~A~0#1|))) .cse102 .cse205) (or .cse206 .cse103 .cse104 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse207 .cse226)) .cse68) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse207 .cse227)) .cse64 .cse66)))) .cse100 .cse106 .cse107)) .cse69) (or .cse61 .cse62 (and (or (and (or .cse206 .cse103 .cse104 (and (or .cse60 (= (+ .cse228 .cse207) |ULTIMATE.start_main_~A~0#1|)) (or .cse56 .cse57 (= |ULTIMATE.start_main_~A~0#1| (+ .cse229 .cse207))))) (or .cse102 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse202 .cse228)) .cse60) (or .cse56 .cse57 (= |ULTIMATE.start_main_~A~0#1| (+ .cse202 .cse229)))) .cse205)) .cse100 .cse106 .cse107) (or .cse93 (and (or (and (or .cse56 (= (+ .cse209 .cse229) |ULTIMATE.start_main_~A~0#1|) .cse57) (or .cse60 (= (+ .cse209 .cse228) |ULTIMATE.start_main_~A~0#1|))) .cse208 .cse95) (or .cse96 (and (or .cse56 .cse57 (= |ULTIMATE.start_main_~A~0#1| (+ .cse229 .cse211))) (or (= (+ .cse228 .cse211) |ULTIMATE.start_main_~A~0#1|) .cse60)) .cse210 .cse97)) .cse99)))) .cse35) (or .cse30 (and (or (and (or .cse113 .cse114 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse226 .cse216)) .cse68) (or .cse64 (= (+ .cse227 .cse216) |ULTIMATE.start_main_~A~0#1|) .cse66)) .cse109 .cse217) (or .cse110 .cse215 (and (or (= (+ .cse214 .cse226) |ULTIMATE.start_main_~A~0#1|) .cse68) (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ .cse214 .cse227)) .cse66)) .cse112))) (or (and (or .cse115 (and (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ .cse220 .cse227)) .cse66) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse220 .cse226)) .cse68)) .cse116 .cse221) (or .cse118 .cse218 (and (or .cse68 (= (+ .cse219 .cse226) |ULTIMATE.start_main_~A~0#1|)) (or .cse64 (= (+ .cse219 .cse227) |ULTIMATE.start_main_~A~0#1|) .cse66)))) .cse120 .cse121 .cse122)) .cse69) (or (and (or (and (or (and (or .cse60 (= (+ .cse228 .cse216) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse229 .cse216) |ULTIMATE.start_main_~A~0#1|) .cse56 .cse57)) .cse109 .cse217) (or .cse110 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse214 .cse229)) .cse56 .cse57) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse214 .cse228)) .cse60)) .cse215 .cse112)) .cse113 .cse114) (or (and (or .cse115 .cse116 .cse221 (and (or .cse56 .cse57 (= |ULTIMATE.start_main_~A~0#1| (+ .cse220 .cse229))) (or .cse60 (= |ULTIMATE.start_main_~A~0#1| (+ .cse220 .cse228))))) (or (and (or (= (+ .cse219 .cse229) |ULTIMATE.start_main_~A~0#1|) .cse56 .cse57) (or .cse60 (= (+ .cse219 .cse228) |ULTIMATE.start_main_~A~0#1|))) .cse118 .cse218)) .cse120 .cse121 .cse122)) .cse61 .cse62)) .cse33))) .cse51)) (.cse149 (or .cse30 .cse224 .cse225 .cse33)) (.cse159 (or .cse52 (let ((.cse222 (* (+ .cse173 .cse38) |ULTIMATE.start_main_~B~0#1|)) (.cse223 (* (+ .cse38 .cse174) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse30 (and (or .cse200 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse222 .cse201)) .cse76 .cse78) (or .cse84 (= (+ .cse223 .cse201) |ULTIMATE.start_main_~A~0#1|))) .cse113) (or .cse199 (and (or .cse76 (= |ULTIMATE.start_main_~A~0#1| (+ .cse198 .cse222)) .cse78) (or .cse84 (= |ULTIMATE.start_main_~A~0#1| (+ .cse198 .cse223)))) .cse120 .cse121)) .cse31 .cse33) (or (and (or .cse197 .cse100 (and (or .cse76 .cse78 (= |ULTIMATE.start_main_~A~0#1| (+ .cse196 .cse222))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse196 .cse223)) .cse84)) .cse106) (or .cse93 .cse192 (and (or .cse76 (= |ULTIMATE.start_main_~A~0#1| (+ .cse193 .cse222)) .cse78) (or (= (+ .cse223 .cse193) |ULTIMATE.start_main_~A~0#1|) .cse84)))) .cse35 .cse36))) .cse53)) (.cse150 (or (let ((.cse212 (* (+ .cse90 .cse92) |ULTIMATE.start_main_~B~0#1|)) (.cse213 (* (+ .cse92 .cse87) |ULTIMATE.start_main_~B~0#1|)) (.cse204 (* |ULTIMATE.start_main_~B~0#1| (+ .cse81 .cse92))) (.cse203 (* |ULTIMATE.start_main_~B~0#1| (+ .cse92 .cse80)))) (and (or .cse35 (and (or .cse76 (and (or (and (or .cse102 (and (or .cse79 (= |ULTIMATE.start_main_~A~0#1| (+ .cse202 .cse203))) (or .cse82 (= (+ .cse204 .cse202) |ULTIMATE.start_main_~A~0#1|) .cse83)) .cse205) (or .cse206 .cse103 .cse104 (and (or (= (+ .cse207 .cse203) |ULTIMATE.start_main_~A~0#1|) .cse79) (or .cse82 (= |ULTIMATE.start_main_~A~0#1| (+ .cse204 .cse207)) .cse83)))) .cse100 .cse106 .cse107) (or .cse93 .cse99 (and (or .cse208 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse209 .cse203)) .cse79) (or .cse82 .cse83 (= (+ .cse209 .cse204) |ULTIMATE.start_main_~A~0#1|))) .cse95) (or .cse96 .cse210 (and (or .cse82 .cse83 (= |ULTIMATE.start_main_~A~0#1| (+ .cse204 .cse211))) (or .cse79 (= (+ .cse203 .cse211) |ULTIMATE.start_main_~A~0#1|))) .cse97)))) .cse78) (or .cse84 (and (or (and (or (and (or .cse88 (= (+ .cse207 .cse212) |ULTIMATE.start_main_~A~0#1|) .cse89) (or .cse86 (= (+ .cse213 .cse207) |ULTIMATE.start_main_~A~0#1|))) .cse206 .cse103 .cse104) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse202 .cse213)) .cse86) (or .cse88 .cse89 (= |ULTIMATE.start_main_~A~0#1| (+ .cse202 .cse212)))) .cse102 .cse205)) .cse100 .cse106 .cse107) (or .cse93 (and (or .cse96 .cse210 .cse97 (and (or .cse86 (= (+ .cse213 .cse211) |ULTIMATE.start_main_~A~0#1|)) (or .cse88 .cse89 (= (+ .cse212 .cse211) |ULTIMATE.start_main_~A~0#1|)))) (or .cse208 .cse95 (and (or .cse88 .cse89 (= (+ .cse209 .cse212) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse209 .cse213) |ULTIMATE.start_main_~A~0#1|) .cse86)))) .cse99))))) (or .cse30 (and (or .cse84 (and (or .cse113 (and (or .cse110 (and (or (= (+ .cse214 .cse212) |ULTIMATE.start_main_~A~0#1|) .cse88 .cse89) (or .cse86 (= |ULTIMATE.start_main_~A~0#1| (+ .cse214 .cse213)))) .cse215 .cse112) (or (and (or .cse88 (= (+ .cse212 .cse216) |ULTIMATE.start_main_~A~0#1|) .cse89) (or .cse86 (= |ULTIMATE.start_main_~A~0#1| (+ .cse213 .cse216)))) .cse109 .cse217)) .cse114) (or (and (or .cse118 .cse218 (and (or .cse88 (= |ULTIMATE.start_main_~A~0#1| (+ .cse219 .cse212)) .cse89) (or .cse86 (= (+ .cse219 .cse213) |ULTIMATE.start_main_~A~0#1|)))) (or (and (or .cse88 (= (+ .cse220 .cse212) |ULTIMATE.start_main_~A~0#1|) .cse89) (or .cse86 (= |ULTIMATE.start_main_~A~0#1| (+ .cse220 .cse213)))) .cse115 .cse116 .cse221)) .cse120 .cse121 .cse122))) (or .cse76 (and (or .cse120 (and (or .cse115 (and (or .cse82 .cse83 (= (+ .cse220 .cse204) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse220 .cse203)) .cse79)) .cse116 .cse221) (or .cse118 (and (or .cse82 (= (+ .cse219 .cse204) |ULTIMATE.start_main_~A~0#1|) .cse83) (or .cse79 (= (+ .cse219 .cse203) |ULTIMATE.start_main_~A~0#1|))) .cse218)) .cse121 .cse122) (or (and (or .cse110 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse204 .cse214)) .cse82 .cse83) (or .cse79 (= |ULTIMATE.start_main_~A~0#1| (+ .cse214 .cse203)))) .cse215 .cse112) (or (and (or (= (+ .cse204 .cse216) |ULTIMATE.start_main_~A~0#1|) .cse82 .cse83) (or .cse79 (= |ULTIMATE.start_main_~A~0#1| (+ .cse203 .cse216)))) .cse109 .cse217)) .cse113 .cse114)) .cse78)) .cse33))) .cse52 .cse53)) (.cse160 (or (let ((.cse194 (* (+ .cse177 .cse38) |ULTIMATE.start_main_~B~0#1|)) (.cse195 (* (+ .cse38 .cse178) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse35 .cse36 (and (or .cse93 .cse192 (and (or .cse69 (= (+ .cse193 .cse194) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse195 .cse193) |ULTIMATE.start_main_~A~0#1|) .cse61 .cse62))) (or (and (or .cse61 .cse62 (= (+ .cse195 .cse196) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse196 .cse194)) .cse69)) .cse197 .cse100 .cse106))) (or .cse30 .cse31 (and (or (and (or (= (+ .cse198 .cse195) |ULTIMATE.start_main_~A~0#1|) .cse61 .cse62) (or (= (+ .cse198 .cse194) |ULTIMATE.start_main_~A~0#1|) .cse69)) .cse199 .cse120 .cse121) (or .cse200 (and (or (= (+ .cse194 .cse201) |ULTIMATE.start_main_~A~0#1|) .cse69) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse195 .cse201)) .cse61 .cse62)) .cse113)) .cse33))) .cse51)) (.cse162 (or .cse48 (let ((.cse189 (div .cse49 4)) (.cse191 (div .cse180 4))) (let ((.cse187 (* (+ .cse46 (+ .cse191 1)) |ULTIMATE.start_main_~B~0#1|)) (.cse185 (* |ULTIMATE.start_main_~B~0#1| (+ .cse191 .cse46))) (.cse188 (- .cse189))) (and (or .cse30 (let ((.cse186 (+ (+ (- 1) .cse188) .cse47))) (and (or (= (+ .cse185 .cse186) |ULTIMATE.start_main_~A~0#1|) .cse51) (or (= (+ .cse187 .cse186) |ULTIMATE.start_main_~A~0#1|) .cse52 .cse53))) (not (>= .cse47 (+ .cse189 1))) .cse33) (or (let ((.cse190 (+ .cse188 .cse47))) (and (or .cse52 (= |ULTIMATE.start_main_~A~0#1| (+ .cse187 .cse190)) .cse53) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse190 .cse185)) .cse51))) .cse35 (not (>= .cse47 .cse189)))))))) (.cse152 (or .cse183 .cse184 .cse35)) (.cse155 (or .cse181 .cse182)) (.cse161 (let ((.cse179 (+ (- (* .cse49 2)) |ULTIMATE.start_main_~r~0#1|))) (or (not (>= .cse179 |ULTIMATE.start_main_~d~0#1|)) (>= .cse179 .cse49) (= (+ (+ .cse179 .cse27) (* (+ |ULTIMATE.start_main_~p~0#1| (+ |ULTIMATE.start_main_~q~0#1| (* 2 .cse180))) |ULTIMATE.start_main_~B~0#1|)) |ULTIMATE.start_main_~A~0#1|)))) (.cse151 (or (let ((.cse175 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse178))) (.cse176 (* |ULTIMATE.start_main_~B~0#1| (+ .cse177 |ULTIMATE.start_main_~q~0#1|)))) (and (or .cse30 (and (or .cse168 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse167 .cse175)) .cse61 .cse62) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse167)) .cse69)) .cse120 .cse121) (or .cse113 .cse163 (and (or (= (+ .cse176 .cse164) |ULTIMATE.start_main_~A~0#1|) .cse69) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse164 .cse175)) .cse61 .cse62)))) .cse41 .cse33) (or .cse42 .cse35 (and (or .cse100 .cse170 .cse106 (and (or .cse61 (= |ULTIMATE.start_main_~A~0#1| (+ .cse169 .cse175)) .cse62) (or .cse69 (= |ULTIMATE.start_main_~A~0#1| (+ .cse169 .cse176))))) (or .cse93 (and (or (= (+ .cse172 .cse175) |ULTIMATE.start_main_~A~0#1|) .cse61 .cse62) (or (= (+ .cse172 .cse176) |ULTIMATE.start_main_~A~0#1|) .cse69)) .cse171))))) .cse51)) (.cse153 (or (let ((.cse165 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse174))) (.cse166 (* |ULTIMATE.start_main_~B~0#1| (+ .cse173 |ULTIMATE.start_main_~q~0#1|)))) (and (or .cse30 (and (or .cse113 .cse163 (and (or .cse84 (= (+ .cse164 .cse165) |ULTIMATE.start_main_~A~0#1|)) (or .cse76 (= |ULTIMATE.start_main_~A~0#1| (+ .cse166 .cse164)) .cse78))) (or (and (or .cse84 (= |ULTIMATE.start_main_~A~0#1| (+ .cse167 .cse165))) (or .cse76 (= (+ .cse166 .cse167) |ULTIMATE.start_main_~A~0#1|) .cse78)) .cse168 .cse120 .cse121)) .cse41 .cse33) (or .cse42 .cse35 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse169 .cse166)) .cse76 .cse78) (or .cse84 (= (+ .cse169 .cse165) |ULTIMATE.start_main_~A~0#1|))) .cse100 .cse170 .cse106) (or .cse93 .cse171 (and (or .cse84 (= (+ .cse172 .cse165) |ULTIMATE.start_main_~A~0#1|)) (or .cse76 (= |ULTIMATE.start_main_~A~0#1| (+ .cse172 .cse166)) .cse78))))))) .cse52 .cse53))) (or (and .cse148 .cse149 .cse137 .cse150 .cse138 .cse151 .cse152 .cse153) (let ((.cse156 (+ .cse28 .cse157 |ULTIMATE.start_main_~A~0#1|))) (let ((.cse154 (+ .cse156 |ULTIMATE.start_main_~r~0#1|))) (and (not (>= .cse154 .cse10)) .cse155 .cse149 (= .cse156 |ULTIMATE.start_main_~B~0#1|) .cse137 (= (+ |ULTIMATE.start_main_~q~0#1| (- 4)) 1) (>= .cse154 .cse156) .cse138 .cse151 .cse146 .cse8 .cse152 .cse153))) (and .cse158 .cse155 .cse137 .cse159 .cse160 .cse138 .cse161 .cse162) (and .cse148 .cse158 .cse155 .cse149 .cse137 .cse159 .cse150 .cse160 .cse138 .cse161 .cse162 .cse152) (and .cse158 .cse155 .cse137 .cse138 .cse161) (and .cse158 .cse155 .cse137 .cse138 .cse161 .cse151 .cse153)))))) (.cse6 (* 2 1)) (.cse24 (* |ULTIMATE.start_main_~B~0#1| 4)) (.cse1 (or (not .cse4) .cse147)) (.cse2 (+ .cse0 1)) (.cse3 (not .cse147))) (or (and (or (and (= |ULTIMATE.start_main_~d~0#1| .cse0) .cse1) (and (= |ULTIMATE.start_main_~d~0#1| .cse2) .cse3 .cse4)) .cse5 (= (+ (* (- 1) .cse6) |ULTIMATE.start_main_~q~0#1|) 0) .cse7 .cse8 (= .cse9 .cse10)) (and .cse5 .cse11 .cse12 .cse13 .cse8) (and .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse20 .cse11 .cse21) (let ((.cse25 (+ .cse28 |ULTIMATE.start_main_~A~0#1|))) (and .cse22 .cse5 .cse11 .cse23 (>= (+ .cse24 .cse25) .cse26) (not (>= .cse25 .cse10)) (= |ULTIMATE.start_main_~r~0#1| (+ .cse27 .cse25)) (= |ULTIMATE.start_main_~q~0#1| (+ |ULTIMATE.start_main_~p~0#1| 4)) .cse8)) (and .cse5 .cse11 .cse21 .cse8) (and .cse5 .cse11 .cse12 .cse23 .cse13 .cse8) (let ((.cse37 (* |ULTIMATE.start_main_~B~0#1| 1))) (let ((.cse29 (and (or .cse127 .cse128 .cse52 .cse53) (or .cse129 .cse51 .cse130))) (.cse32 (and (or .cse113 (not (= .cse37 .cse125))) (or (not (= .cse37 .cse126)) .cse120 .cse121))) (.cse34 (and (or .cse100 (not (= .cse37 .cse123)) .cse106) (or .cse93 (not (= .cse37 .cse124))))) (.cse40 (= (+ |ULTIMATE.start_main_~r~0#1| (* .cse37 |ULTIMATE.start_main_~q~0#1|)) |ULTIMATE.start_main_~A~0#1|)) (.cse73 (and (or (and (or (not (= .cse37 .cse108)) .cse109) (or .cse110 (not (= .cse37 .cse111)) .cse112)) .cse113 .cse114) (or (and (or .cse115 .cse116 (not (= .cse37 .cse117))) (or .cse118 (not (= .cse37 .cse119)))) .cse120 .cse121 .cse122))) (.cse72 (and (or .cse93 (and (or (not (= .cse37 .cse94)) .cse95) (or .cse96 .cse97 (not (= .cse37 .cse98)))) .cse99) (or .cse100 (and (or (not (= .cse37 .cse101)) .cse102) (or .cse103 .cse104 (not (= .cse37 .cse105)))) .cse106 .cse107)))) (and (or .cse29 (and (or .cse30 .cse31 .cse32 .cse33) (or .cse34 .cse35 .cse36)) (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse37 .cse38) .cse39))) .cse22 (or .cse29 .cse40 (and (or .cse30 .cse32 .cse41 .cse33) (or .cse42 .cse34 .cse35))) (or .cse43 (and (or .cse30 (not (= .cse37 .cse44)) .cse33) (or (not (= .cse45 .cse37)) .cse35)) .cse5 .cse40) (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse37 .cse46) .cse47)) .cse48 .cse5 (not (>= |ULTIMATE.start_main_~r~0#1| .cse49)) (let ((.cse50 (div (* |ULTIMATE.start_main_~p~0#1| 4) 8))) (and (or (not (= .cse50 1)) .cse51) (or .cse52 .cse53 (not (= (+ .cse50 1) 1))))) (let ((.cse54 (div (* |ULTIMATE.start_main_~d~0#1| 4) 8))) (and (or (not (= .cse37 .cse54)) .cse35) (or .cse30 (not (= (+ .cse54 1) .cse37)) .cse33)))) .cse23 (or (and (or .cse55 (and (or .cse56 .cse57 (not (= .cse58 1))) (or (not (= 1 .cse59)) .cse60)) .cse61 .cse62) (or .cse63 (and (or .cse64 (not (= .cse65 1)) .cse66) (or (not (= .cse67 1)) .cse68)) .cse69)) (let ((.cse70 (* .cse37 .cse75))) (and (or (= (+ .cse70 .cse71) |ULTIMATE.start_main_~A~0#1|) .cse35 .cse72) (or .cse30 .cse73 (= (+ .cse74 .cse70) |ULTIMATE.start_main_~A~0#1|) .cse33))) .cse51) .cse19 .cse8 (or (and (or .cse76 .cse77 .cse78 (and (or .cse79 (not (= .cse80 1))) (or (not (= .cse81 1)) .cse82 .cse83))) (or .cse84 .cse85 (and (or .cse86 (not (= .cse87 1))) (or .cse88 .cse89 (not (= .cse90 1)))))) .cse52 (let ((.cse91 (* .cse92 .cse37))) (and (or .cse30 .cse73 (= |ULTIMATE.start_main_~A~0#1| (+ .cse74 .cse91)) .cse33) (or .cse35 (= (+ .cse71 .cse91) |ULTIMATE.start_main_~A~0#1|) .cse72))) .cse53)))) (let ((.cse135 (+ |ULTIMATE.start_main_~A~0#1| (* (- 1) .cse136)))) (and (let ((.cse133 (< .cse135 0)) (.cse131 (div (+ |ULTIMATE.start_main_~A~0#1| .cse134 .cse27) 2)) (.cse132 (= (mod (+ |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0))) (or (and (= .cse131 |ULTIMATE.start_main_~d~0#1|) (or .cse132 (not .cse133))) (and .cse133 (= |ULTIMATE.start_main_~d~0#1| (+ .cse131 1)) (not .cse132)))) .cse5 (= 2 .cse135) (>= .cse136 |ULTIMATE.start_main_~d~0#1|) .cse15 (not (>= (+ .cse136 .cse135) (* 2 .cse6))) (= (+ (* (- 1) 2) (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|)) 0))) (and (= (+ 4 0) |ULTIMATE.start_main_~q~0#1|) .cse5 (= .cse9 .cse24) .cse137 .cse138 (or (and (not (>= |ULTIMATE.start_main_~r~0#1| .cse0)) .cse1 (let ((.cse141 (= (mod .cse0 2) 0)) (.cse139 (< .cse0 0)) (.cse140 (div .cse142 4))) (or (and .cse139 (= (+ .cse140 1) |ULTIMATE.start_main_~d~0#1|) (not .cse141)) (and (or .cse141 (not .cse139)) (= |ULTIMATE.start_main_~d~0#1| .cse140))))) (and (not (>= |ULTIMATE.start_main_~r~0#1| .cse2)) (let ((.cse144 (= (mod .cse2 2) 0)) (.cse143 (< .cse2 0)) (.cse145 (div .cse2 2))) (or (and .cse143 (not .cse144) (= (+ .cse145 1) |ULTIMATE.start_main_~d~0#1|)) (and (or .cse144 (not .cse143)) (= .cse145 |ULTIMATE.start_main_~d~0#1|)))) .cse3 .cse4)) .cse146 .cse8))))))))))))) [2023-02-17 02:08:32,421 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 22 61) the Hoare annotation is: true [2023-02-17 02:08:32,424 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (let ((.cse195 (div |ULTIMATE.start_main_~d~0#1| 2)) (.cse270 (div |ULTIMATE.start_main_~p~0#1| 2))) (let ((.cse237 (+ .cse270 1)) (.cse272 (- .cse195))) (let ((.cse271 (+ (- 1) .cse272)) (.cse109 (+ |ULTIMATE.start_main_~q~0#1| .cse237)) (.cse138 (+ |ULTIMATE.start_main_~q~0#1| .cse270)) (.cse282 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse43 (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (let ((.cse194 (+ .cse195 1)) (.cse89 (div .cse237 2)) (.cse123 (div |ULTIMATE.start_main_~p~0#1| 4)) (.cse141 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse15 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (.cse107 (+ |ULTIMATE.start_main_~r~0#1| .cse272)) (.cse42 (and .cse282 (not .cse43))) (.cse280 (* |ULTIMATE.start_main_~B~0#1| .cse138)) (.cse44 (not .cse282)) (.cse281 (* .cse109 |ULTIMATE.start_main_~B~0#1|)) (.cse105 (+ |ULTIMATE.start_main_~r~0#1| .cse271)) (.cse279 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse140 (- |ULTIMATE.start_main_~d~0#1|))) (let ((.cse226 (= .cse270 1)) (.cse224 (= .cse237 1)) (.cse5 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse24 (+ |ULTIMATE.start_main_~r~0#1| .cse140)) (.cse154 (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (.cse23 (not .cse279)) (.cse197 (and (or .cse42 (= (+ .cse105 .cse280) |ULTIMATE.start_main_~A~0#1|)) (or .cse43 .cse44 (= |ULTIMATE.start_main_~A~0#1| (+ .cse281 .cse105))))) (.cse90 (and (or (= (+ .cse280 .cse107) |ULTIMATE.start_main_~A~0#1|) .cse42) (or (= (+ .cse281 .cse107) |ULTIMATE.start_main_~A~0#1|) .cse43 .cse44))) (.cse35 (and (not .cse15) .cse279)) (.cse275 (not .cse141)) (.cse67 (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)) (.cse124 (+ .cse123 1)) (.cse277 (< .cse270 0)) (.cse120 (= (mod .cse270 2) 0)) (.cse73 (= (mod .cse237 2) 0)) (.cse278 (< .cse237 0)) (.cse88 (+ .cse89 1)) (.cse221 (div .cse194 2)) (.cse220 (div |ULTIMATE.start_main_~d~0#1| 4))) (let ((.cse219 (+ .cse220 1)) (.cse222 (+ .cse221 1)) (.cse230 (- .cse221)) (.cse227 (- .cse220)) (.cse82 (= (mod .cse195 2) 0)) (.cse273 (< .cse195 0)) (.cse274 (< .cse194 0)) (.cse78 (= (mod .cse194 2) 0)) (.cse92 (= .cse88 1)) (.cse75 (not .cse278)) (.cse70 (and .cse278 (not .cse73))) (.cse98 (= .cse89 1)) (.cse10 (>= |ULTIMATE.start_main_~r~0#1| .cse195)) (.cse80 (>= |ULTIMATE.start_main_~r~0#1| .cse194)) (.cse131 (= .cse123 1)) (.cse122 (and .cse277 (not .cse120))) (.cse125 (= .cse124 1)) (.cse119 (not .cse277)) (.cse41 (* 2 |ULTIMATE.start_main_~p~0#1|)) (.cse33 (* 2 |ULTIMATE.start_main_~d~0#1|)) (.cse238 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse18 (or .cse275 .cse67)) (.cse266 (or .cse90 .cse35)) (.cse0 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse267 (or .cse23 .cse197 .cse15)) (.cse3 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse4 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)) (.cse199 (= |ULTIMATE.start_main_~A~0#1| (+ .cse24 (* |ULTIMATE.start_main_~B~0#1| .cse154)))) (.cse6 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse7 (or .cse5 (and (= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0) (not .cse5)))) (.cse193 (and (or (not .cse226) .cse42) (or .cse43 .cse44 (not .cse224))))) (let ((.cse1 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse218 (>= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse8 (let ((.cse276 (or .cse193 (and (or .cse23 .cse15 (= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| .cse194)) |ULTIMATE.start_main_~A~0#1|)) (or .cse35 (= |ULTIMATE.start_main_~A~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* .cse195 |ULTIMATE.start_main_~q~0#1|)))))))) (or (and .cse266 .cse0 .cse267 .cse18 .cse276 .cse3 .cse4 .cse5 .cse199 .cse6 .cse7) (and .cse266 .cse0 .cse267 .cse276 .cse3 .cse4 .cse5 .cse199 .cse67 .cse6 .cse7)))) (.cse9 (or .cse193 (and (or (= .cse195 |ULTIMATE.start_main_~B~0#1|) .cse35) (or .cse23 (= |ULTIMATE.start_main_~B~0#1| .cse194) .cse15)))) (.cse12 (<= 2 .cse195)) (.cse14 (or .cse275 .cse238)) (.cse115 (+ (- .cse33) |ULTIMATE.start_main_~r~0#1|)) (.cse117 (+ |ULTIMATE.start_main_~q~0#1| .cse41)) (.cse225 (and (or (not .cse131) .cse122) (or (not .cse125) .cse119 .cse120))) (.cse66 (>= .cse24 .cse195)) (.cse63 (>= .cse24 .cse194)) (.cse198 (not .cse80)) (.cse91 (not .cse10)) (.cse223 (and (or (not .cse92) .cse73 .cse75) (or .cse70 (not .cse98)))) (.cse68 (and .cse274 (not .cse78))) (.cse79 (not .cse274)) (.cse85 (and (not .cse82) .cse273)) (.cse84 (not .cse273)) (.cse228 (+ (- 1) .cse227)) (.cse229 (+ (- 1) .cse230)) (.cse190 (>= .cse105 .cse222)) (.cse182 (>= .cse105 .cse221)) (.cse165 (>= .cse107 .cse220)) (.cse164 (>= .cse107 .cse219)) (.cse2 (* 2 1))) (let ((.cse21 (<= 8 |ULTIMATE.start_main_~p~0#1|)) (.cse13 (* 2 .cse2)) (.cse55 (let ((.cse256 (not .cse164)) (.cse257 (not .cse165)) (.cse259 (not .cse182)) (.cse251 (+ .cse105 .cse230)) (.cse260 (not .cse190)) (.cse249 (+ .cse105 .cse229)) (.cse250 (* (+ .cse109 .cse89) |ULTIMATE.start_main_~B~0#1|)) (.cse248 (* (+ .cse88 .cse109) |ULTIMATE.start_main_~B~0#1|)) (.cse258 (+ .cse227 .cse107)) (.cse253 (* (+ .cse123 .cse138) |ULTIMATE.start_main_~B~0#1|)) (.cse254 (+ .cse228 .cse107)) (.cse252 (* (+ .cse124 .cse138) |ULTIMATE.start_main_~B~0#1|)) (.cse261 (+ .cse24 .cse272)) (.cse263 (+ .cse24 .cse271))) (let ((.cse241 (or .cse141 (let ((.cse269 (* (+ .cse154 .cse237) |ULTIMATE.start_main_~B~0#1|)) (.cse268 (* (+ .cse154 .cse270) |ULTIMATE.start_main_~B~0#1|))) (and (or (and (or (= (+ .cse268 .cse261) |ULTIMATE.start_main_~A~0#1|) .cse42) (or .cse43 .cse44 (= |ULTIMATE.start_main_~A~0#1| (+ .cse261 .cse269)))) .cse35) (or .cse23 (and (or .cse43 (= |ULTIMATE.start_main_~A~0#1| (+ .cse263 .cse269)) .cse44) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse263 .cse268)) .cse42)) .cse15))))) (.cse242 (or (and (or .cse224 .cse43 .cse44 (and (or .cse82 .cse84 (and (or .cse73 (= (+ .cse254 .cse248) |ULTIMATE.start_main_~A~0#1|) .cse75) (or .cse70 (= |ULTIMATE.start_main_~A~0#1| (+ .cse250 .cse254))))) (or .cse85 (and (or .cse70 (= (+ .cse250 .cse258) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse248 .cse258)) .cse73 .cse75))))) (or (and (or .cse85 (and (or (= (+ .cse253 .cse258) |ULTIMATE.start_main_~A~0#1|) .cse122) (or (= (+ .cse258 .cse252) |ULTIMATE.start_main_~A~0#1|) .cse119 .cse120))) (or (and (or .cse122 (= (+ .cse253 .cse254) |ULTIMATE.start_main_~A~0#1|)) (or .cse119 .cse120 (= |ULTIMATE.start_main_~A~0#1| (+ .cse254 .cse252)))) .cse82 .cse84)) .cse42 .cse226)) .cse35)) (.cse243 (or .cse141 (and .cse266 .cse267))) (.cse239 (or .cse223 .cse43 (let ((.cse265 (+ .cse109 1))) (and (or .cse35 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse254 (* .cse265 .cse219))) .cse82 .cse84 .cse256) (or .cse85 .cse257 (= (+ (* .cse265 .cse220) .cse258) |ULTIMATE.start_main_~A~0#1|)))) (or .cse23 (and (or .cse259 (= |ULTIMATE.start_main_~A~0#1| (+ .cse251 (* .cse265 .cse221))) .cse68) (or .cse260 .cse78 .cse79 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse265 .cse222) .cse249)))) .cse15))) .cse44)) (.cse244 (or .cse193 (let ((.cse264 (+ |ULTIMATE.start_main_~q~0#1| 1))) (and (or .cse23 .cse198 .cse15 (= |ULTIMATE.start_main_~A~0#1| (+ .cse105 (* .cse264 .cse194)))) (or .cse91 .cse35 (= (+ (* .cse195 .cse264) .cse107) |ULTIMATE.start_main_~A~0#1|)))))) (.cse245 (or .cse193 (let ((.cse262 (+ .cse154 1))) (and (or (not .cse66) .cse35 (= (+ .cse261 (* .cse195 .cse262)) |ULTIMATE.start_main_~A~0#1|)) (or .cse23 (not .cse63) (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse262 .cse194) .cse263)) .cse15))))) (.cse240 (or .cse225 (let ((.cse255 (+ .cse138 1))) (and (or .cse35 (and (or (= (+ .cse254 (* .cse255 .cse219)) |ULTIMATE.start_main_~A~0#1|) .cse82 .cse84 .cse256) (or .cse85 .cse257 (= (+ .cse258 (* .cse255 .cse220)) |ULTIMATE.start_main_~A~0#1|)))) (or .cse23 (and (or .cse259 .cse68 (= |ULTIMATE.start_main_~A~0#1| (+ .cse251 (* .cse255 .cse221)))) (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse255 .cse222) .cse249)) .cse260 .cse78 .cse79)) .cse15))) .cse42)) (.cse246 (or (= .cse41 1) (= |ULTIMATE.start_main_~A~0#1| (+ (+ .cse115 .cse140) (* |ULTIMATE.start_main_~B~0#1| (+ .cse117 |ULTIMATE.start_main_~p~0#1|)))))) (.cse247 (or .cse23 .cse15 (and (or .cse224 .cse43 .cse44 (and (or (and (or (= (+ .cse248 .cse249) |ULTIMATE.start_main_~A~0#1|) .cse73 .cse75) (or .cse70 (= |ULTIMATE.start_main_~A~0#1| (+ .cse250 .cse249)))) .cse78 .cse79) (or .cse68 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse251 .cse248)) .cse73 .cse75) (or .cse70 (= (+ .cse251 .cse250) |ULTIMATE.start_main_~A~0#1|)))))) (or (and (or (and (or .cse119 .cse120 (= (+ .cse251 .cse252) |ULTIMATE.start_main_~A~0#1|)) (or .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ .cse251 .cse253)))) .cse68) (or .cse78 .cse79 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse249 .cse252)) .cse119 .cse120) (or (= (+ .cse253 .cse249) |ULTIMATE.start_main_~A~0#1|) .cse122)))) .cse42 .cse226))))) (or (and (or .cse218 (and .cse239 .cse240)) .cse8 .cse9 .cse0 .cse241 .cse10 .cse18 .cse242 .cse12 .cse243 .cse244 .cse245 .cse199 .cse246 .cse14 .cse247 .cse15) (and .cse8 .cse9 .cse0 .cse241 .cse10 .cse18 .cse242 .cse12 .cse243 .cse239 .cse244 .cse245 .cse199 .cse240 .cse246 .cse14 .cse247 .cse15) (and .cse8 .cse9 .cse0 .cse241 .cse10 .cse242 .cse12 .cse243 .cse239 .cse244 .cse245 .cse199 .cse240 .cse246 .cse67 .cse14 .cse247 .cse15))))) (.cse11 (* 2 .cse1))) (or (and .cse0 (= |ULTIMATE.start_main_~d~0#1| .cse1) (= |ULTIMATE.start_main_~d~0#1| .cse2) (<= 2 |ULTIMATE.start_main_~p~0#1|) (<= 2 |ULTIMATE.start_main_~d~0#1|) .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_main_~p~0#1| .cse2)) (and (<= 4 |ULTIMATE.start_main_~p~0#1|) .cse8 .cse9 .cse0 .cse10 (= .cse11 |ULTIMATE.start_main_~d~0#1|) .cse12 (= |ULTIMATE.start_main_~p~0#1| .cse13) .cse3 (= |ULTIMATE.start_main_~d~0#1| .cse13) .cse4 .cse5 .cse6 .cse14 .cse15) (and .cse0 (let ((.cse233 (< .cse219 0)) (.cse162 (= (mod .cse219 2) 0)) (.cse169 (= (mod .cse220 2) 0)) (.cse234 (< .cse220 0)) (.cse188 (= (mod .cse222 2) 0)) (.cse235 (< .cse222 0)) (.cse178 (= (mod .cse221 2) 0)) (.cse236 (< .cse221 0)) (.cse215 (div .cse219 2)) (.cse214 (div |ULTIMATE.start_main_~d~0#1| 8)) (.cse210 (div .cse194 4)) (.cse204 (div .cse222 2))) (let ((.cse135 (div |ULTIMATE.start_main_~p~0#1| 8)) (.cse129 (div .cse124 2)) (.cse126 (= (mod .cse124 2) 0)) (.cse206 (< .cse124 0)) (.cse205 (- .cse204)) (.cse209 (- .cse210)) (.cse132 (= (mod .cse123 2) 0)) (.cse211 (< .cse123 0)) (.cse213 (- .cse214)) (.cse216 (- .cse215)) (.cse100 (div .cse237 4)) (.cse94 (div .cse88 2)) (.cse96 (= (mod .cse88 2) 0)) (.cse231 (< .cse88 0)) (.cse101 (= (mod .cse89 2) 0)) (.cse232 (< .cse89 0)) (.cse180 (and (not .cse178) .cse236)) (.cse175 (not .cse236)) (.cse208 (+ .cse210 1)) (.cse187 (not .cse235)) (.cse207 (+ .cse204 1)) (.cse183 (and (not .cse188) .cse235)) (.cse168 (and (not .cse169) .cse234)) (.cse172 (not .cse234)) (.cse212 (+ .cse214 1)) (.cse155 (and .cse233 (not .cse162))) (.cse161 (not .cse233)) (.cse28 (* |ULTIMATE.start_main_~B~0#1| 1)) (.cse217 (+ .cse215 1)) (.cse40 (div .cse41 4)) (.cse34 (div .cse33 4))) (let ((.cse25 (+ .cse34 1)) (.cse48 (+ .cse40 1)) (.cse77 (not (>= |ULTIMATE.start_main_~r~0#1| .cse222))) (.cse76 (+ .cse229 |ULTIMATE.start_main_~r~0#1|)) (.cse69 (not (>= |ULTIMATE.start_main_~r~0#1| .cse221))) (.cse71 (+ |ULTIMATE.start_main_~r~0#1| .cse230)) (.cse83 (not (>= |ULTIMATE.start_main_~r~0#1| .cse219))) (.cse81 (+ .cse228 |ULTIMATE.start_main_~r~0#1|)) (.cse87 (+ .cse227 |ULTIMATE.start_main_~r~0#1|)) (.cse86 (not (>= |ULTIMATE.start_main_~r~0#1| .cse220))) (.cse108 (and (or .cse85 (and (or (not (= .cse28 .cse214)) .cse168) (or .cse169 .cse172 (not (= .cse28 .cse212)))) .cse165) (or .cse82 (and (or (not (= .cse28 .cse215)) .cse155) (or .cse161 .cse162 (not (= .cse28 .cse217)))) .cse84 .cse164))) (.cse104 (and (or (and (or (not (= .cse28 .cse210)) .cse180) (or .cse175 (not (= .cse28 .cse208)) .cse178)) .cse68 .cse182) (or (and (or .cse187 .cse188 (not (= .cse28 .cse207))) (or .cse183 (not (= .cse28 .cse204)))) .cse78 .cse79 .cse190))) (.cse110 (>= .cse115 |ULTIMATE.start_main_~d~0#1|)) (.cse102 (not .cse232)) (.cse99 (and (not .cse101) .cse232)) (.cse97 (not .cse231)) (.cse93 (and (not .cse96) .cse231)) (.cse95 (+ .cse94 1)) (.cse103 (+ .cse100 1)) (.cse152 (not (>= .cse24 .cse221))) (.cse153 (+ .cse24 .cse230)) (.cse151 (not (>= .cse24 .cse222))) (.cse150 (+ .cse229 .cse24)) (.cse149 (not (>= .cse24 .cse219))) (.cse148 (+ .cse24 .cse228)) (.cse144 (not (>= .cse24 .cse220))) (.cse145 (+ .cse227 .cse24)) (.cse62 (and (or .cse223 .cse224 .cse43 .cse44) (or .cse225 .cse42 .cse226))) (.cse196 (= (+ |ULTIMATE.start_main_~r~0#1| (* .cse28 |ULTIMATE.start_main_~q~0#1|)) |ULTIMATE.start_main_~A~0#1|)) (.cse64 (and (or .cse68 (not (= .cse28 .cse221))) (or (not (= .cse28 .cse222)) .cse78 .cse79))) (.cse65 (and (or .cse82 (not (= .cse28 .cse219)) .cse84) (or .cse85 (not (= .cse28 .cse220))))) (.cse36 (not .cse218)) (.cse160 (not (>= .cse107 .cse217))) (.cse163 (+ (+ (- 1) .cse216) .cse107)) (.cse156 (+ .cse107 .cse216)) (.cse159 (not (>= .cse107 .cse215))) (.cse167 (+ .cse107 .cse213)) (.cse166 (not (>= .cse107 .cse214))) (.cse171 (+ (+ (- 1) .cse213) .cse107)) (.cse170 (not (>= .cse107 .cse212))) (.cse136 (and (not .cse132) .cse211)) (.cse134 (not .cse211)) (.cse179 (+ .cse209 .cse105)) (.cse181 (not (>= .cse105 .cse210))) (.cse176 (+ .cse105 (+ (- 1) .cse209))) (.cse177 (not (>= .cse105 .cse208))) (.cse189 (not (>= .cse105 .cse207))) (.cse186 (+ .cse105 (+ (- 1) .cse205))) (.cse127 (not .cse206)) (.cse130 (and (not .cse126) .cse206)) (.cse185 (+ .cse105 .cse205)) (.cse184 (not (>= .cse105 .cse204))) (.cse128 (+ 1 .cse129)) (.cse133 (+ .cse135 1))) (let ((.cse49 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse28 .cse154) .cse24))) (.cse16 (or (let ((.cse200 (* |ULTIMATE.start_main_~B~0#1| (+ .cse138 .cse135))) (.cse201 (* |ULTIMATE.start_main_~B~0#1| (+ .cse133 .cse138))) (.cse203 (* |ULTIMATE.start_main_~B~0#1| (+ .cse128 .cse138))) (.cse202 (* (+ .cse138 .cse129) |ULTIMATE.start_main_~B~0#1|))) (and (or (and (or (and (or .cse85 (and (or .cse169 .cse170 (and (or (= (+ .cse171 .cse200) |ULTIMATE.start_main_~A~0#1|) .cse136) (or (= (+ .cse171 .cse201) |ULTIMATE.start_main_~A~0#1|) .cse132 .cse134)) .cse172) (or .cse166 (and (or .cse132 .cse134 (= |ULTIMATE.start_main_~A~0#1| (+ .cse167 .cse201))) (or (= (+ .cse167 .cse200) |ULTIMATE.start_main_~A~0#1|) .cse136)) .cse168)) .cse165) (or (and (or (and (or .cse132 .cse134 (= |ULTIMATE.start_main_~A~0#1| (+ .cse156 .cse201))) (or .cse136 (= (+ .cse156 .cse200) |ULTIMATE.start_main_~A~0#1|))) .cse155 .cse159) (or .cse160 .cse161 .cse162 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse163 .cse200)) .cse136) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse163 .cse201)) .cse132 .cse134)))) .cse82 .cse84 .cse164)) .cse122) (or .cse119 .cse120 (and (or (and (or .cse160 .cse161 .cse162 (and (or .cse130 (= (+ .cse202 .cse163) |ULTIMATE.start_main_~A~0#1|)) (or .cse126 .cse127 (= |ULTIMATE.start_main_~A~0#1| (+ .cse203 .cse163))))) (or .cse155 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse156 .cse202)) .cse130) (or .cse126 .cse127 (= |ULTIMATE.start_main_~A~0#1| (+ .cse156 .cse203)))) .cse159)) .cse82 .cse84 .cse164) (or .cse85 (and (or (and (or .cse126 (= (+ .cse167 .cse203) |ULTIMATE.start_main_~A~0#1|) .cse127) (or .cse130 (= (+ .cse167 .cse202) |ULTIMATE.start_main_~A~0#1|))) .cse166 .cse168) (or .cse169 (and (or .cse126 .cse127 (= |ULTIMATE.start_main_~A~0#1| (+ .cse203 .cse171))) (or (= (+ .cse202 .cse171) |ULTIMATE.start_main_~A~0#1|) .cse130)) .cse170 .cse172)) .cse165)))) .cse35) (or .cse23 (and (or (and (or .cse68 .cse182 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse200 .cse179)) .cse136) (or .cse132 (= (+ .cse201 .cse179) |ULTIMATE.start_main_~A~0#1|) .cse134)) .cse180 .cse181) (or .cse175 .cse177 (and (or (= (+ .cse176 .cse200) |ULTIMATE.start_main_~A~0#1|) .cse136) (or .cse132 (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse201)) .cse134)) .cse178))) (or (and (or .cse187 (and (or .cse132 (= |ULTIMATE.start_main_~A~0#1| (+ .cse186 .cse201)) .cse134) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse186 .cse200)) .cse136)) .cse188 .cse189) (or .cse183 .cse184 (and (or .cse136 (= (+ .cse185 .cse200) |ULTIMATE.start_main_~A~0#1|)) (or .cse132 (= (+ .cse185 .cse201) |ULTIMATE.start_main_~A~0#1|) .cse134)))) .cse78 .cse79 .cse190)) .cse122) (or (and (or (and (or (and (or .cse130 (= (+ .cse202 .cse179) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse203 .cse179) |ULTIMATE.start_main_~A~0#1|) .cse126 .cse127)) .cse180 .cse181) (or .cse175 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse203)) .cse126 .cse127) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse202)) .cse130)) .cse177 .cse178)) .cse68 .cse182) (or (and (or .cse187 .cse188 .cse189 (and (or .cse126 .cse127 (= |ULTIMATE.start_main_~A~0#1| (+ .cse186 .cse203))) (or .cse130 (= |ULTIMATE.start_main_~A~0#1| (+ .cse186 .cse202))))) (or (and (or (= (+ .cse185 .cse203) |ULTIMATE.start_main_~A~0#1|) .cse126 .cse127) (or .cse130 (= (+ .cse185 .cse202) |ULTIMATE.start_main_~A~0#1|))) .cse183 .cse184)) .cse78 .cse79 .cse190)) .cse119 .cse120)) .cse15))) .cse42)) (.cse17 (or .cse36 .cse199)) (.cse19 (or .cse62 .cse196 (and (or .cse23 .cse64 .cse80 .cse15) (or .cse10 .cse65 .cse35)))) (.cse20 (or .cse23 .cse197 .cse198 .cse15)) (.cse22 (or .cse193 (and (or .cse23 (not (= .cse28 .cse194)) .cse15) (or (not (= .cse195 .cse28)) .cse35)) .cse141 .cse196)) (.cse50 (or .cse43 (let ((.cse191 (* (+ .cse88 .cse154) |ULTIMATE.start_main_~B~0#1|)) (.cse192 (* (+ .cse154 .cse89) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse23 (and (or .cse152 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse191 .cse153)) .cse73 .cse75) (or .cse70 (= (+ .cse192 .cse153) |ULTIMATE.start_main_~A~0#1|))) .cse68) (or .cse151 (and (or .cse73 (= |ULTIMATE.start_main_~A~0#1| (+ .cse150 .cse191)) .cse75) (or .cse70 (= |ULTIMATE.start_main_~A~0#1| (+ .cse150 .cse192)))) .cse78 .cse79)) .cse63 .cse15) (or (and (or .cse149 .cse82 (and (or .cse73 .cse75 (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse191))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse192)) .cse70)) .cse84) (or .cse85 .cse144 (and (or .cse73 (= |ULTIMATE.start_main_~A~0#1| (+ .cse145 .cse191)) .cse75) (or (= (+ .cse192 .cse145) |ULTIMATE.start_main_~A~0#1|) .cse70)))) .cse35 .cse66))) .cse44)) (.cse51 (or (let ((.cse173 (* (+ .cse103 .cse109) |ULTIMATE.start_main_~B~0#1|)) (.cse174 (* (+ .cse109 .cse100) |ULTIMATE.start_main_~B~0#1|)) (.cse158 (* |ULTIMATE.start_main_~B~0#1| (+ .cse95 .cse109))) (.cse157 (* |ULTIMATE.start_main_~B~0#1| (+ .cse109 .cse94)))) (and (or .cse35 (and (or .cse73 (and (or (and (or .cse155 (and (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ .cse156 .cse157))) (or .cse96 (= (+ .cse158 .cse156) |ULTIMATE.start_main_~A~0#1|) .cse97)) .cse159) (or .cse160 .cse161 .cse162 (and (or (= (+ .cse163 .cse157) |ULTIMATE.start_main_~A~0#1|) .cse93) (or .cse96 (= |ULTIMATE.start_main_~A~0#1| (+ .cse158 .cse163)) .cse97)))) .cse82 .cse84 .cse164) (or .cse85 .cse165 (and (or .cse166 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse167 .cse157)) .cse93) (or .cse96 .cse97 (= (+ .cse167 .cse158) |ULTIMATE.start_main_~A~0#1|))) .cse168) (or .cse169 .cse170 (and (or .cse96 .cse97 (= |ULTIMATE.start_main_~A~0#1| (+ .cse158 .cse171))) (or .cse93 (= (+ .cse157 .cse171) |ULTIMATE.start_main_~A~0#1|))) .cse172)))) .cse75) (or .cse70 (and (or (and (or (and (or .cse101 (= (+ .cse163 .cse173) |ULTIMATE.start_main_~A~0#1|) .cse102) (or .cse99 (= (+ .cse174 .cse163) |ULTIMATE.start_main_~A~0#1|))) .cse160 .cse161 .cse162) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse156 .cse174)) .cse99) (or .cse101 .cse102 (= |ULTIMATE.start_main_~A~0#1| (+ .cse156 .cse173)))) .cse155 .cse159)) .cse82 .cse84 .cse164) (or .cse85 (and (or .cse169 .cse170 .cse172 (and (or .cse99 (= (+ .cse174 .cse171) |ULTIMATE.start_main_~A~0#1|)) (or .cse101 .cse102 (= (+ .cse173 .cse171) |ULTIMATE.start_main_~A~0#1|)))) (or .cse166 .cse168 (and (or .cse101 .cse102 (= (+ .cse167 .cse173) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse167 .cse174) |ULTIMATE.start_main_~A~0#1|) .cse99)))) .cse165))))) (or .cse23 (and (or .cse70 (and (or .cse68 (and (or .cse175 (and (or (= (+ .cse176 .cse173) |ULTIMATE.start_main_~A~0#1|) .cse101 .cse102) (or .cse99 (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse174)))) .cse177 .cse178) (or (and (or .cse101 (= (+ .cse173 .cse179) |ULTIMATE.start_main_~A~0#1|) .cse102) (or .cse99 (= |ULTIMATE.start_main_~A~0#1| (+ .cse174 .cse179)))) .cse180 .cse181)) .cse182) (or (and (or .cse183 .cse184 (and (or .cse101 (= |ULTIMATE.start_main_~A~0#1| (+ .cse185 .cse173)) .cse102) (or .cse99 (= (+ .cse185 .cse174) |ULTIMATE.start_main_~A~0#1|)))) (or (and (or .cse101 (= (+ .cse186 .cse173) |ULTIMATE.start_main_~A~0#1|) .cse102) (or .cse99 (= |ULTIMATE.start_main_~A~0#1| (+ .cse186 .cse174)))) .cse187 .cse188 .cse189)) .cse78 .cse79 .cse190))) (or .cse73 (and (or .cse78 (and (or .cse187 (and (or .cse96 .cse97 (= (+ .cse186 .cse158) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse186 .cse157)) .cse93)) .cse188 .cse189) (or .cse183 (and (or .cse96 (= (+ .cse185 .cse158) |ULTIMATE.start_main_~A~0#1|) .cse97) (or .cse93 (= (+ .cse185 .cse157) |ULTIMATE.start_main_~A~0#1|))) .cse184)) .cse79 .cse190) (or (and (or .cse175 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse158 .cse176)) .cse96 .cse97) (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse157)))) .cse177 .cse178) (or (and (or (= (+ .cse158 .cse179) |ULTIMATE.start_main_~A~0#1|) .cse96 .cse97) (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ .cse157 .cse179)))) .cse180 .cse181)) .cse68 .cse182)) .cse75)) .cse15))) .cse43 .cse44)) (.cse52 (or (let ((.cse146 (* (+ .cse123 .cse154) |ULTIMATE.start_main_~B~0#1|)) (.cse147 (* (+ .cse154 .cse124) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse35 .cse66 (and (or .cse85 .cse144 (and (or .cse122 (= (+ .cse145 .cse146) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse147 .cse145) |ULTIMATE.start_main_~A~0#1|) .cse119 .cse120))) (or (and (or .cse119 .cse120 (= (+ .cse147 .cse148) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse146)) .cse122)) .cse149 .cse82 .cse84))) (or .cse23 .cse63 (and (or (and (or (= (+ .cse150 .cse147) |ULTIMATE.start_main_~A~0#1|) .cse119 .cse120) (or (= (+ .cse150 .cse146) |ULTIMATE.start_main_~A~0#1|) .cse122)) .cse151 .cse78 .cse79) (or .cse152 (and (or (= (+ .cse146 .cse153) |ULTIMATE.start_main_~A~0#1|) .cse122) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse147 .cse153)) .cse119 .cse120)) .cse68)) .cse15))) .cse42)) (.cse53 (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse28 .cse117) .cse115)) .cse110 .cse141 (not (>= |ULTIMATE.start_main_~r~0#1| .cse33)) (let ((.cse142 (div (* |ULTIMATE.start_main_~p~0#1| 4) 8))) (and (or (not (= .cse142 1)) .cse42) (or .cse43 .cse44 (not (= (+ .cse142 1) 1))))) (let ((.cse143 (div (* |ULTIMATE.start_main_~d~0#1| 4) 8))) (and (or (not (= .cse28 .cse143)) .cse35) (or .cse23 (not (= (+ .cse143 1) .cse28)) .cse15))))) (.cse54 (let ((.cse139 (+ (- (* .cse33 2)) |ULTIMATE.start_main_~r~0#1|))) (or (not (>= .cse139 |ULTIMATE.start_main_~d~0#1|)) (>= .cse139 .cse33) (= (+ (+ .cse139 .cse140) (* (+ |ULTIMATE.start_main_~p~0#1| (+ |ULTIMATE.start_main_~q~0#1| (* 2 .cse41))) |ULTIMATE.start_main_~B~0#1|)) |ULTIMATE.start_main_~A~0#1|)))) (.cse56 (or (and (or .cse125 (and (or .cse126 .cse127 (not (= .cse128 1))) (or (not (= 1 .cse129)) .cse130)) .cse119 .cse120) (or .cse131 (and (or .cse132 (not (= .cse133 1)) .cse134) (or (not (= .cse135 1)) .cse136)) .cse122)) (let ((.cse137 (* .cse28 .cse138))) (and (or (= (+ .cse137 .cse107) |ULTIMATE.start_main_~A~0#1|) .cse35 .cse108) (or .cse23 .cse104 (= (+ .cse105 .cse137) |ULTIMATE.start_main_~A~0#1|) .cse15))) .cse42)) (.cse57 (or (let ((.cse118 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse124))) (.cse121 (* |ULTIMATE.start_main_~B~0#1| (+ .cse123 |ULTIMATE.start_main_~q~0#1|)))) (and (or .cse23 (and (or .cse77 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse76 .cse118)) .cse119 .cse120) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse121 .cse76)) .cse122)) .cse78 .cse79) (or .cse68 .cse69 (and (or (= (+ .cse121 .cse71) |ULTIMATE.start_main_~A~0#1|) .cse122) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse118)) .cse119 .cse120)))) .cse80 .cse15) (or .cse10 .cse35 (and (or .cse82 .cse83 .cse84 (and (or .cse119 (= |ULTIMATE.start_main_~A~0#1| (+ .cse81 .cse118)) .cse120) (or .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ .cse81 .cse121))))) (or .cse85 (and (or (= (+ .cse87 .cse118) |ULTIMATE.start_main_~A~0#1|) .cse119 .cse120) (or (= (+ .cse87 .cse121) |ULTIMATE.start_main_~A~0#1|) .cse122)) .cse86))))) .cse42)) (.cse58 (or .cse110 (let ((.cse113 (* (+ .cse117 .cse48) |ULTIMATE.start_main_~B~0#1|)) (.cse111 (* |ULTIMATE.start_main_~B~0#1| (+ .cse40 .cse117))) (.cse114 (- .cse34))) (and (or .cse23 (let ((.cse112 (+ (+ (- 1) .cse114) .cse115))) (and (or (= (+ .cse111 .cse112) |ULTIMATE.start_main_~A~0#1|) .cse42) (or (= (+ .cse113 .cse112) |ULTIMATE.start_main_~A~0#1|) .cse43 .cse44))) (not (>= .cse115 .cse25)) .cse15) (or (let ((.cse116 (+ .cse114 .cse115))) (and (or .cse43 (= |ULTIMATE.start_main_~A~0#1| (+ .cse113 .cse116)) .cse44) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse116 .cse111)) .cse42))) .cse35 (not (>= .cse115 .cse34))))))) (.cse59 (or (and (or .cse73 .cse92 .cse75 (and (or .cse93 (not (= .cse94 1))) (or (not (= .cse95 1)) .cse96 .cse97))) (or .cse70 .cse98 (and (or .cse99 (not (= .cse100 1))) (or .cse101 .cse102 (not (= .cse103 1)))))) .cse43 (let ((.cse106 (* .cse109 .cse28))) (and (or .cse23 .cse104 (= |ULTIMATE.start_main_~A~0#1| (+ .cse105 .cse106)) .cse15) (or .cse35 (= (+ .cse107 .cse106) |ULTIMATE.start_main_~A~0#1|) .cse108))) .cse44)) (.cse60 (or .cse90 .cse91 .cse35)) (.cse61 (or (let ((.cse72 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse89))) (.cse74 (* |ULTIMATE.start_main_~B~0#1| (+ .cse88 |ULTIMATE.start_main_~q~0#1|)))) (and (or .cse23 (and (or .cse68 .cse69 (and (or .cse70 (= (+ .cse71 .cse72) |ULTIMATE.start_main_~A~0#1|)) (or .cse73 (= |ULTIMATE.start_main_~A~0#1| (+ .cse74 .cse71)) .cse75))) (or (and (or .cse70 (= |ULTIMATE.start_main_~A~0#1| (+ .cse76 .cse72))) (or .cse73 (= (+ .cse74 .cse76) |ULTIMATE.start_main_~A~0#1|) .cse75)) .cse77 .cse78 .cse79)) .cse80 .cse15) (or .cse10 .cse35 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse81 .cse74)) .cse73 .cse75) (or .cse70 (= (+ .cse81 .cse72) |ULTIMATE.start_main_~A~0#1|))) .cse82 .cse83 .cse84) (or .cse85 .cse86 (and (or .cse70 (= (+ .cse87 .cse72) |ULTIMATE.start_main_~A~0#1|)) (or .cse73 (= |ULTIMATE.start_main_~A~0#1| (+ .cse87 .cse74)) .cse75))))))) .cse43 .cse44))) (or (and .cse16 .cse0 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (or (and (or .cse23 (>= .cse24 .cse25) (let ((.cse29 (< .cse25 0)) (.cse26 (= (mod .cse25 2) 0)) (.cse27 (div .cse25 2))) (and (or .cse26 (not (= (+ .cse27 1) .cse28)) (not .cse29)) (or (and .cse29 (not .cse26)) (not (= .cse28 .cse27))))) .cse15) (or (let ((.cse30 (= (mod .cse34 2) 0)) (.cse32 (< .cse34 0)) (.cse31 (div .cse33 8))) (and (or .cse30 (not (= (+ .cse31 1) .cse28)) (not .cse32)) (or (and (not .cse30) .cse32) (not (= .cse28 .cse31))))) .cse35 (>= .cse24 .cse34))) .cse36 (and (or (let ((.cse39 (div .cse41 8)) (.cse37 (= (mod .cse40 2) 0)) (.cse38 (< .cse40 0))) (and (or .cse37 (not .cse38) (not (= (+ .cse39 1) 1))) (or (not (= .cse39 1)) (and (not .cse37) .cse38)))) (= .cse40 1) .cse42) (or .cse43 .cse44 (let ((.cse45 (= (mod .cse48 2) 0)) (.cse46 (< .cse48 0)) (.cse47 (div .cse48 2))) (and (or (and (not .cse45) .cse46) (not (= .cse47 1))) (or .cse45 (not .cse46) (not (= (+ .cse47 1) 1))))) (= 1 .cse48))) .cse49) .cse50 .cse51 .cse52 .cse53 .cse4 .cse5 .cse54 .cse55 .cse56 .cse57 .cse6 .cse58 .cse59 .cse60 .cse61) (and (or .cse62 (and (or .cse23 .cse63 .cse64 .cse15) (or .cse65 .cse35 .cse66)) .cse49) .cse16 .cse0 .cse17 .cse19 .cse20 .cse21 .cse22 .cse50 .cse51 .cse52 .cse53 .cse4 .cse5 .cse54 .cse55 .cse56 .cse57 .cse67 .cse6 .cse58 .cse59 .cse60 .cse61)))))) .cse4 .cse5 .cse6) (and (= |ULTIMATE.start_main_~d~0#1| 1) .cse0 .cse141 (>= |ULTIMATE.start_main_~p~0#1| 1) .cse238 .cse3 (<= 1 |ULTIMATE.start_main_~d~0#1|) .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse21 (= (* 2 .cse13) |ULTIMATE.start_main_~p~0#1|) .cse3 (>= |ULTIMATE.start_main_~r~0#1| .cse11) .cse4 .cse5 .cse55 (= (* .cse11 2) |ULTIMATE.start_main_~d~0#1|) .cse6)))))))))) [2023-02-17 02:08:32,424 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-17 02:08:32,424 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-17 02:08:32,427 INFO L895 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (let ((.cse315 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse196 (div |ULTIMATE.start_main_~d~0#1| 2))) (let ((.cse195 (+ .cse196 1)) (.cse316 (+ .cse315 1)) (.cse324 (- .cse196))) (let ((.cse323 (+ (- 1) .cse324)) (.cse214 (+ |ULTIMATE.start_main_~q~0#1| .cse316)) (.cse232 (+ |ULTIMATE.start_main_~q~0#1| .cse315)) (.cse336 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse121 (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0)) (.cse225 (div |ULTIMATE.start_main_~d~0#1| 4)) (.cse228 (div .cse195 2)) (.cse130 (div |ULTIMATE.start_main_~p~0#1| 4)) (.cse120 (div .cse316 2))) (let ((.cse103 (= (mod .cse316 2) 0)) (.cse331 (< .cse316 0)) (.cse119 (+ .cse120 1)) (.cse131 (+ .cse130 1)) (.cse332 (< .cse315 0)) (.cse127 (= (mod .cse315 2) 0)) (.cse229 (+ .cse228 1)) (.cse221 (+ .cse225 1)) (.cse321 (- .cse228)) (.cse318 (- .cse225)) (.cse33 (- |ULTIMATE.start_main_~d~0#1|)) (.cse36 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse61 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (.cse212 (+ |ULTIMATE.start_main_~r~0#1| .cse324)) (.cse132 (and .cse336 (not .cse121))) (.cse334 (* |ULTIMATE.start_main_~B~0#1| .cse232)) (.cse122 (not .cse336)) (.cse335 (* .cse214 |ULTIMATE.start_main_~B~0#1|)) (.cse210 (+ |ULTIMATE.start_main_~r~0#1| .cse323)) (.cse333 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse163 (* 2 |ULTIMATE.start_main_~p~0#1|)) (.cse162 (* 2 |ULTIMATE.start_main_~d~0#1|)) (.cse32 (- |ULTIMATE.start_main_~r~0#1|)) (.cse37 (* (- 1) |ULTIMATE.start_main_~r~0#1|))) (let ((.cse86 (+ .cse37 |ULTIMATE.start_main_~A~0#1|)) (.cse78 (+ |ULTIMATE.start_main_~A~0#1| .cse32)) (.cse142 (div .cse162 4)) (.cse158 (div .cse163 4)) (.cse291 (= .cse315 1)) (.cse290 (= .cse316 1)) (.cse151 (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (.cse97 (not .cse333)) (.cse133 (and (or .cse132 (= (+ .cse210 .cse334) |ULTIMATE.start_main_~A~0#1|)) (or .cse121 .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ .cse335 .cse210))))) (.cse123 (and (or (= (+ .cse334 .cse212) |ULTIMATE.start_main_~A~0#1|) .cse132) (or (= (+ .cse335 .cse212) |ULTIMATE.start_main_~A~0#1|) .cse121 .cse122))) (.cse111 (and (not .cse61) .cse333)) (.cse135 (not .cse36)) (.cse67 (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)) (.cse140 (+ |ULTIMATE.start_main_~r~0#1| .cse33)) (.cse319 (+ (- 1) .cse318)) (.cse113 (= (mod .cse196 2) 0)) (.cse325 (< .cse196 0)) (.cse57 (>= |ULTIMATE.start_main_~r~0#1| .cse196)) (.cse110 (>= |ULTIMATE.start_main_~r~0#1| .cse195)) (.cse320 (+ (- 1) .cse321)) (.cse326 (< .cse195 0)) (.cse108 (= (mod .cse195 2) 0)) (.cse327 (< .cse221 0)) (.cse261 (= (mod .cse221 2) 0)) (.cse266 (= (mod .cse225 2) 0)) (.cse328 (< .cse225 0)) (.cse284 (= (mod .cse229 2) 0)) (.cse329 (< .cse229 0)) (.cse275 (= (mod .cse228 2) 0)) (.cse330 (< .cse228 0)) (.cse303 (div .cse221 2)) (.cse302 (div |ULTIMATE.start_main_~d~0#1| 8)) (.cse298 (div .cse195 4)) (.cse292 (div .cse229 2)) (.cse247 (= .cse130 1)) (.cse129 (and .cse332 (not .cse127))) (.cse241 (= .cse131 1)) (.cse126 (not .cse332)) (.cse197 (= .cse119 1)) (.cse105 (not .cse331)) (.cse100 (and .cse331 (not .cse103))) (.cse203 (= .cse120 1))) (let ((.cse235 (and (or (not .cse197) .cse103 .cse105) (or .cse100 (not .cse203)))) (.cse218 (and (or (not .cse247) .cse129) (or (not .cse241) .cse126 .cse127))) (.cse251 (div |ULTIMATE.start_main_~p~0#1| 8)) (.cse245 (div .cse131 2)) (.cse242 (= (mod .cse131 2) 0)) (.cse294 (< .cse131 0)) (.cse293 (- .cse292)) (.cse297 (- .cse298)) (.cse248 (= (mod .cse130 2) 0)) (.cse299 (< .cse130 0)) (.cse301 (- .cse302)) (.cse304 (- .cse303)) (.cse205 (div .cse316 4)) (.cse199 (div .cse119 2)) (.cse201 (= (mod .cse119 2) 0)) (.cse306 (< .cse119 0)) (.cse206 (= (mod .cse120 2) 0)) (.cse307 (< .cse120 0)) (.cse277 (and (not .cse275) .cse330)) (.cse272 (not .cse330)) (.cse296 (+ .cse298 1)) (.cse238 (>= .cse210 .cse228)) (.cse283 (not .cse329)) (.cse295 (+ .cse292 1)) (.cse279 (and (not .cse284) .cse329)) (.cse237 (>= .cse210 .cse229)) (.cse265 (and (not .cse266) .cse328)) (.cse269 (not .cse328)) (.cse300 (+ .cse302 1)) (.cse239 (>= .cse212 .cse225)) (.cse254 (and .cse327 (not .cse261))) (.cse260 (not .cse327)) (.cse305 (+ .cse303 1)) (.cse240 (>= .cse212 .cse221)) (.cse227 (+ .cse210 .cse321)) (.cse98 (and .cse326 (not .cse108))) (.cse109 (not .cse326)) (.cse230 (+ .cse210 .cse320)) (.cse52 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse159 (+ |ULTIMATE.start_main_~q~0#1| .cse163)) (.cse134 (not .cse110)) (.cse124 (not .cse57)) (.cse309 (* (+ .cse214 .cse120) |ULTIMATE.start_main_~B~0#1|)) (.cse308 (* (+ .cse119 .cse214) |ULTIMATE.start_main_~B~0#1|)) (.cse116 (and (not .cse113) .cse325)) (.cse224 (+ .cse318 .cse212)) (.cse311 (* (+ .cse130 .cse232) |ULTIMATE.start_main_~B~0#1|)) (.cse219 (+ .cse319 .cse212)) (.cse310 (* (+ .cse131 .cse232) |ULTIMATE.start_main_~B~0#1|)) (.cse115 (not .cse325)) (.cse233 (+ .cse140 .cse324)) (.cse234 (+ .cse140 .cse323)) (.cse19 (or .cse135 .cse67)) (.cse50 (or .cse123 .cse111)) (.cse1 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse51 (or .cse97 .cse133 .cse61)) (.cse45 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse10 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)) (.cse47 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse23 (= |ULTIMATE.start_main_~A~0#1| (+ .cse140 (* |ULTIMATE.start_main_~B~0#1| .cse151)))) (.cse13 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse194 (and (or (not .cse291) .cse132) (or .cse121 .cse122 (not .cse290)))) (.cse164 (* |ULTIMATE.start_main_~B~0#1| 1)) (.cse160 (+ .cse158 1)) (.cse147 (+ .cse142 1)) (.cse156 (+ (- .cse162) |ULTIMATE.start_main_~r~0#1|)) (.cse141 (- .cse142)) (.cse73 (div .cse78 2)) (.cse84 (< .cse86 0)) (.cse322 (= (mod (+ |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0)) (.cse87 (* 2 |ULTIMATE.start_main_~B~0#1|))) (let ((.cse46 (* 2 .cse87)) (.cse107 (not (>= |ULTIMATE.start_main_~r~0#1| .cse229))) (.cse106 (+ .cse320 |ULTIMATE.start_main_~r~0#1|)) (.cse99 (not (>= |ULTIMATE.start_main_~r~0#1| .cse228))) (.cse101 (+ |ULTIMATE.start_main_~r~0#1| .cse321)) (.cse114 (not (>= |ULTIMATE.start_main_~r~0#1| .cse221))) (.cse112 (+ .cse319 |ULTIMATE.start_main_~r~0#1|)) (.cse118 (+ .cse318 |ULTIMATE.start_main_~r~0#1|)) (.cse117 (not (>= |ULTIMATE.start_main_~r~0#1| .cse225))) (.cse65 (* |ULTIMATE.start_main_~B~0#1| 4)) (.cse74 (or (not .cse84) .cse322)) (.cse79 (+ .cse73 1)) (.cse83 (not .cse322)) (.cse69 (* 2 1)) (.cse39 (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse146 (+ (- 1) .cse141)) (.cse152 (>= .cse156 |ULTIMATE.start_main_~d~0#1|)) (.cse150 (>= |ULTIMATE.start_main_~r~0#1| .cse162)) (.cse177 (not (>= .cse140 .cse228))) (.cse178 (+ .cse140 .cse321)) (.cse176 (not (>= .cse140 .cse229))) (.cse175 (+ .cse320 .cse140)) (.cse173 (not (>= .cse140 .cse221))) (.cse172 (+ .cse140 .cse319)) (.cse168 (not (>= .cse140 .cse225))) (.cse169 (+ .cse318 .cse140)) (.cse145 (>= .cse140 .cse147)) (.cse144 (>= .cse140 .cse142)) (.cse59 (not (>= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|))) (.cse149 (= .cse158 1)) (.cse148 (= 1 .cse160)) (.cse137 (= (+ |ULTIMATE.start_main_~r~0#1| (* .cse164 |ULTIMATE.start_main_~q~0#1|)) |ULTIMATE.start_main_~A~0#1|)) (.cse55 (or .cse194 (and (or (= .cse196 |ULTIMATE.start_main_~B~0#1|) .cse111) (or .cse97 (= |ULTIMATE.start_main_~B~0#1| .cse195) .cse61)))) (.cse56 (let ((.cse317 (or .cse194 (and (or .cse97 .cse61 (= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| .cse195)) |ULTIMATE.start_main_~A~0#1|)) (or .cse111 (= |ULTIMATE.start_main_~A~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* .cse196 |ULTIMATE.start_main_~q~0#1|)))))))) (or (and .cse50 .cse1 .cse51 .cse19 .cse317 .cse45 .cse10 .cse47 .cse23 .cse13) (and .cse50 .cse1 .cse51 .cse317 .cse45 .cse10 .cse47 .cse23 .cse67 .cse13)))) (.cse35 (or .cse36 (let ((.cse314 (* (+ .cse151 .cse316) |ULTIMATE.start_main_~B~0#1|)) (.cse313 (* (+ .cse151 .cse315) |ULTIMATE.start_main_~B~0#1|))) (and (or (and (or (= (+ .cse313 .cse233) |ULTIMATE.start_main_~A~0#1|) .cse132) (or .cse121 .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ .cse233 .cse314)))) .cse111) (or .cse97 (and (or .cse121 (= |ULTIMATE.start_main_~A~0#1| (+ .cse234 .cse314)) .cse122) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse234 .cse313)) .cse132)) .cse61))))) (.cse38 (or (and (or .cse290 .cse121 .cse122 (and (or .cse113 .cse115 (and (or .cse103 (= (+ .cse219 .cse308) |ULTIMATE.start_main_~A~0#1|) .cse105) (or .cse100 (= |ULTIMATE.start_main_~A~0#1| (+ .cse309 .cse219))))) (or .cse116 (and (or .cse100 (= (+ .cse309 .cse224) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse308 .cse224)) .cse103 .cse105))))) (or (and (or .cse116 (and (or (= (+ .cse311 .cse224) |ULTIMATE.start_main_~A~0#1|) .cse129) (or (= (+ .cse224 .cse310) |ULTIMATE.start_main_~A~0#1|) .cse126 .cse127))) (or (and (or .cse129 (= (+ .cse311 .cse219) |ULTIMATE.start_main_~A~0#1|)) (or .cse126 .cse127 (= |ULTIMATE.start_main_~A~0#1| (+ .cse219 .cse310)))) .cse113 .cse115)) .cse132 .cse291)) .cse111)) (.cse58 (<= 2 .cse196)) (.cse40 (or .cse36 (and .cse50 .cse51))) (.cse63 (or .cse194 (let ((.cse312 (+ |ULTIMATE.start_main_~q~0#1| 1))) (and (or .cse97 .cse134 .cse61 (= |ULTIMATE.start_main_~A~0#1| (+ .cse210 (* .cse312 .cse195)))) (or .cse124 .cse111 (= (+ (* .cse196 .cse312) .cse212) |ULTIMATE.start_main_~A~0#1|)))))) (.cse26 (or (= .cse163 1) (= |ULTIMATE.start_main_~A~0#1| (+ (+ .cse156 .cse33) (* |ULTIMATE.start_main_~B~0#1| (+ .cse159 |ULTIMATE.start_main_~p~0#1|)))))) (.cse60 (or .cse135 .cse52)) (.cse42 (or .cse97 .cse61 (and (or .cse290 .cse121 .cse122 (and (or (and (or (= (+ .cse308 .cse230) |ULTIMATE.start_main_~A~0#1|) .cse103 .cse105) (or .cse100 (= |ULTIMATE.start_main_~A~0#1| (+ .cse309 .cse230)))) .cse108 .cse109) (or .cse98 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse227 .cse308)) .cse103 .cse105) (or .cse100 (= (+ .cse227 .cse309) |ULTIMATE.start_main_~A~0#1|)))))) (or (and (or (and (or .cse126 .cse127 (= (+ .cse227 .cse310) |ULTIMATE.start_main_~A~0#1|)) (or .cse129 (= |ULTIMATE.start_main_~A~0#1| (+ .cse227 .cse311)))) .cse98) (or .cse108 .cse109 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse230 .cse310)) .cse126 .cse127) (or (= (+ .cse311 .cse230) |ULTIMATE.start_main_~A~0#1|) .cse129)))) .cse132 .cse291)))) (.cse143 (+ .cse151 1)) (.cse213 (and (or .cse116 (and (or (not (= .cse164 .cse302)) .cse265) (or .cse266 .cse269 (not (= .cse164 .cse300)))) .cse239) (or .cse113 (and (or (not (= .cse164 .cse303)) .cse254) (or .cse260 .cse261 (not (= .cse164 .cse305)))) .cse115 .cse240))) (.cse209 (and (or (and (or (not (= .cse164 .cse298)) .cse277) (or .cse272 (not (= .cse164 .cse296)) .cse275)) .cse98 .cse238) (or (and (or .cse283 .cse284 (not (= .cse164 .cse295))) (or .cse279 (not (= .cse164 .cse292)))) .cse108 .cse109 .cse237))) (.cse207 (not .cse307)) (.cse204 (and (not .cse206) .cse307)) (.cse202 (not .cse306)) (.cse198 (and (not .cse201) .cse306)) (.cse200 (+ .cse199 1)) (.cse208 (+ .cse205 1)) (.cse259 (not (>= .cse212 .cse305))) (.cse262 (+ (+ (- 1) .cse304) .cse212)) (.cse255 (+ .cse212 .cse304)) (.cse258 (not (>= .cse212 .cse303))) (.cse264 (+ .cse212 .cse301)) (.cse263 (not (>= .cse212 .cse302))) (.cse268 (+ (+ (- 1) .cse301) .cse212)) (.cse267 (not (>= .cse212 .cse300))) (.cse252 (and (not .cse248) .cse299)) (.cse250 (not .cse299)) (.cse276 (+ .cse297 .cse210)) (.cse278 (not (>= .cse210 .cse298))) (.cse273 (+ .cse210 (+ (- 1) .cse297))) (.cse274 (not (>= .cse210 .cse296))) (.cse285 (not (>= .cse210 .cse295))) (.cse282 (+ .cse210 (+ (- 1) .cse293))) (.cse243 (not .cse294)) (.cse246 (and (not .cse242) .cse294)) (.cse281 (+ .cse210 .cse293)) (.cse280 (not (>= .cse210 .cse292))) (.cse244 (+ 1 .cse245)) (.cse249 (+ .cse251 1)) (.cse136 (and (or .cse235 .cse290 .cse121 .cse122) (or .cse218 .cse132 .cse291))) (.cse174 (>= .cse140 .cse195)) (.cse138 (and (or .cse98 (not (= .cse164 .cse228))) (or (not (= .cse164 .cse229)) .cse108 .cse109))) (.cse139 (and (or .cse113 (not (= .cse164 .cse221)) .cse115) (or .cse116 (not (= .cse164 .cse225))))) (.cse167 (>= .cse140 .cse196)) (.cse193 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse164 .cse151) .cse140)))) (let ((.cse62 (<= 4 |ULTIMATE.start_main_~p~0#1|)) (.cse53 (= (+ |ULTIMATE.start_main_~p~0#1| 0) |ULTIMATE.start_main_~q~0#1|)) (.cse0 (or .cse136 (and (or .cse97 .cse174 .cse138 .cse61) (or .cse139 .cse111 .cse167)) .cse193)) (.cse18 (or (let ((.cse286 (* |ULTIMATE.start_main_~B~0#1| (+ .cse232 .cse251))) (.cse287 (* |ULTIMATE.start_main_~B~0#1| (+ .cse249 .cse232))) (.cse289 (* |ULTIMATE.start_main_~B~0#1| (+ .cse244 .cse232))) (.cse288 (* (+ .cse232 .cse245) |ULTIMATE.start_main_~B~0#1|))) (and (or (and (or (and (or .cse116 (and (or .cse266 .cse267 (and (or (= (+ .cse268 .cse286) |ULTIMATE.start_main_~A~0#1|) .cse252) (or (= (+ .cse268 .cse287) |ULTIMATE.start_main_~A~0#1|) .cse248 .cse250)) .cse269) (or .cse263 (and (or .cse248 .cse250 (= |ULTIMATE.start_main_~A~0#1| (+ .cse264 .cse287))) (or (= (+ .cse264 .cse286) |ULTIMATE.start_main_~A~0#1|) .cse252)) .cse265)) .cse239) (or (and (or (and (or .cse248 .cse250 (= |ULTIMATE.start_main_~A~0#1| (+ .cse255 .cse287))) (or .cse252 (= (+ .cse255 .cse286) |ULTIMATE.start_main_~A~0#1|))) .cse254 .cse258) (or .cse259 .cse260 .cse261 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse262 .cse286)) .cse252) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse262 .cse287)) .cse248 .cse250)))) .cse113 .cse115 .cse240)) .cse129) (or .cse126 .cse127 (and (or (and (or .cse259 .cse260 .cse261 (and (or .cse246 (= (+ .cse288 .cse262) |ULTIMATE.start_main_~A~0#1|)) (or .cse242 .cse243 (= |ULTIMATE.start_main_~A~0#1| (+ .cse289 .cse262))))) (or .cse254 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse255 .cse288)) .cse246) (or .cse242 .cse243 (= |ULTIMATE.start_main_~A~0#1| (+ .cse255 .cse289)))) .cse258)) .cse113 .cse115 .cse240) (or .cse116 (and (or (and (or .cse242 (= (+ .cse264 .cse289) |ULTIMATE.start_main_~A~0#1|) .cse243) (or .cse246 (= (+ .cse264 .cse288) |ULTIMATE.start_main_~A~0#1|))) .cse263 .cse265) (or .cse266 (and (or .cse242 .cse243 (= |ULTIMATE.start_main_~A~0#1| (+ .cse289 .cse268))) (or (= (+ .cse288 .cse268) |ULTIMATE.start_main_~A~0#1|) .cse246)) .cse267 .cse269)) .cse239)))) .cse111) (or .cse97 (and (or (and (or .cse98 .cse238 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse286 .cse276)) .cse252) (or .cse248 (= (+ .cse287 .cse276) |ULTIMATE.start_main_~A~0#1|) .cse250)) .cse277 .cse278) (or .cse272 .cse274 (and (or (= (+ .cse273 .cse286) |ULTIMATE.start_main_~A~0#1|) .cse252) (or .cse248 (= |ULTIMATE.start_main_~A~0#1| (+ .cse273 .cse287)) .cse250)) .cse275))) (or (and (or .cse283 (and (or .cse248 (= |ULTIMATE.start_main_~A~0#1| (+ .cse282 .cse287)) .cse250) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse282 .cse286)) .cse252)) .cse284 .cse285) (or .cse279 .cse280 (and (or .cse252 (= (+ .cse281 .cse286) |ULTIMATE.start_main_~A~0#1|)) (or .cse248 (= (+ .cse281 .cse287) |ULTIMATE.start_main_~A~0#1|) .cse250)))) .cse108 .cse109 .cse237)) .cse129) (or (and (or (and (or (and (or .cse246 (= (+ .cse288 .cse276) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse289 .cse276) |ULTIMATE.start_main_~A~0#1|) .cse242 .cse243)) .cse277 .cse278) (or .cse272 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse273 .cse289)) .cse242 .cse243) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse273 .cse288)) .cse246)) .cse274 .cse275)) .cse98 .cse238) (or (and (or .cse283 .cse284 .cse285 (and (or .cse242 .cse243 (= |ULTIMATE.start_main_~A~0#1| (+ .cse282 .cse289))) (or .cse246 (= |ULTIMATE.start_main_~A~0#1| (+ .cse282 .cse288))))) (or (and (or (= (+ .cse281 .cse289) |ULTIMATE.start_main_~A~0#1|) .cse242 .cse243) (or .cse246 (= (+ .cse281 .cse288) |ULTIMATE.start_main_~A~0#1|))) .cse279 .cse280)) .cse108 .cse109 .cse237)) .cse126 .cse127)) .cse61))) .cse132)) (.cse44 (<= 8 |ULTIMATE.start_main_~p~0#1|)) (.cse21 (or (let ((.cse270 (* (+ .cse208 .cse214) |ULTIMATE.start_main_~B~0#1|)) (.cse271 (* (+ .cse214 .cse205) |ULTIMATE.start_main_~B~0#1|)) (.cse257 (* |ULTIMATE.start_main_~B~0#1| (+ .cse200 .cse214))) (.cse256 (* |ULTIMATE.start_main_~B~0#1| (+ .cse214 .cse199)))) (and (or .cse111 (and (or .cse103 (and (or (and (or .cse254 (and (or .cse198 (= |ULTIMATE.start_main_~A~0#1| (+ .cse255 .cse256))) (or .cse201 (= (+ .cse257 .cse255) |ULTIMATE.start_main_~A~0#1|) .cse202)) .cse258) (or .cse259 .cse260 .cse261 (and (or (= (+ .cse262 .cse256) |ULTIMATE.start_main_~A~0#1|) .cse198) (or .cse201 (= |ULTIMATE.start_main_~A~0#1| (+ .cse257 .cse262)) .cse202)))) .cse113 .cse115 .cse240) (or .cse116 .cse239 (and (or .cse263 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse264 .cse256)) .cse198) (or .cse201 .cse202 (= (+ .cse264 .cse257) |ULTIMATE.start_main_~A~0#1|))) .cse265) (or .cse266 .cse267 (and (or .cse201 .cse202 (= |ULTIMATE.start_main_~A~0#1| (+ .cse257 .cse268))) (or .cse198 (= (+ .cse256 .cse268) |ULTIMATE.start_main_~A~0#1|))) .cse269)))) .cse105) (or .cse100 (and (or (and (or (and (or .cse206 (= (+ .cse262 .cse270) |ULTIMATE.start_main_~A~0#1|) .cse207) (or .cse204 (= (+ .cse271 .cse262) |ULTIMATE.start_main_~A~0#1|))) .cse259 .cse260 .cse261) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse255 .cse271)) .cse204) (or .cse206 .cse207 (= |ULTIMATE.start_main_~A~0#1| (+ .cse255 .cse270)))) .cse254 .cse258)) .cse113 .cse115 .cse240) (or .cse116 (and (or .cse266 .cse267 .cse269 (and (or .cse204 (= (+ .cse271 .cse268) |ULTIMATE.start_main_~A~0#1|)) (or .cse206 .cse207 (= (+ .cse270 .cse268) |ULTIMATE.start_main_~A~0#1|)))) (or .cse263 .cse265 (and (or .cse206 .cse207 (= (+ .cse264 .cse270) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse264 .cse271) |ULTIMATE.start_main_~A~0#1|) .cse204)))) .cse239))))) (or .cse97 (and (or .cse100 (and (or .cse98 (and (or .cse272 (and (or (= (+ .cse273 .cse270) |ULTIMATE.start_main_~A~0#1|) .cse206 .cse207) (or .cse204 (= |ULTIMATE.start_main_~A~0#1| (+ .cse273 .cse271)))) .cse274 .cse275) (or (and (or .cse206 (= (+ .cse270 .cse276) |ULTIMATE.start_main_~A~0#1|) .cse207) (or .cse204 (= |ULTIMATE.start_main_~A~0#1| (+ .cse271 .cse276)))) .cse277 .cse278)) .cse238) (or (and (or .cse279 .cse280 (and (or .cse206 (= |ULTIMATE.start_main_~A~0#1| (+ .cse281 .cse270)) .cse207) (or .cse204 (= (+ .cse281 .cse271) |ULTIMATE.start_main_~A~0#1|)))) (or (and (or .cse206 (= (+ .cse282 .cse270) |ULTIMATE.start_main_~A~0#1|) .cse207) (or .cse204 (= |ULTIMATE.start_main_~A~0#1| (+ .cse282 .cse271)))) .cse283 .cse284 .cse285)) .cse108 .cse109 .cse237))) (or .cse103 (and (or .cse108 (and (or .cse283 (and (or .cse201 .cse202 (= (+ .cse282 .cse257) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse282 .cse256)) .cse198)) .cse284 .cse285) (or .cse279 (and (or .cse201 (= (+ .cse281 .cse257) |ULTIMATE.start_main_~A~0#1|) .cse202) (or .cse198 (= (+ .cse281 .cse256) |ULTIMATE.start_main_~A~0#1|))) .cse280)) .cse109 .cse237) (or (and (or .cse272 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse257 .cse273)) .cse201 .cse202) (or .cse198 (= |ULTIMATE.start_main_~A~0#1| (+ .cse273 .cse256)))) .cse274 .cse275) (or (and (or (= (+ .cse257 .cse276) |ULTIMATE.start_main_~A~0#1|) .cse201 .cse202) (or .cse198 (= |ULTIMATE.start_main_~A~0#1| (+ .cse256 .cse276)))) .cse277 .cse278)) .cse98 .cse238)) .cse105)) .cse61))) .cse121 .cse122)) (.cse24 (or (and (or .cse241 (and (or .cse242 .cse243 (not (= .cse244 1))) (or (not (= 1 .cse245)) .cse246)) .cse126 .cse127) (or .cse247 (and (or .cse248 (not (= .cse249 1)) .cse250) (or (not (= .cse251 1)) .cse252)) .cse129)) (let ((.cse253 (* .cse164 .cse232))) (and (or (= (+ .cse253 .cse212) |ULTIMATE.start_main_~A~0#1|) .cse111 .cse213) (or .cse97 .cse209 (= (+ .cse210 .cse253) |ULTIMATE.start_main_~A~0#1|) .cse61))) .cse132)) (.cse48 (let ((.cse222 (not .cse240)) (.cse223 (not .cse239)) (.cse226 (not .cse238)) (.cse231 (not .cse237))) (let ((.cse215 (or .cse235 .cse121 (let ((.cse236 (+ .cse214 1))) (and (or .cse111 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse219 (* .cse236 .cse221))) .cse113 .cse115 .cse222) (or .cse116 .cse223 (= (+ (* .cse236 .cse225) .cse224) |ULTIMATE.start_main_~A~0#1|)))) (or .cse97 (and (or .cse226 (= |ULTIMATE.start_main_~A~0#1| (+ .cse227 (* .cse236 .cse228))) .cse98) (or .cse231 .cse108 .cse109 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse236 .cse229) .cse230)))) .cse61))) .cse122)) (.cse216 (or .cse194 (and (or (not .cse167) .cse111 (= (+ .cse233 (* .cse196 .cse143)) |ULTIMATE.start_main_~A~0#1|)) (or .cse97 (not .cse174) (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse143 .cse195) .cse234)) .cse61)))) (.cse217 (or .cse218 (let ((.cse220 (+ .cse232 1))) (and (or .cse111 (and (or (= (+ .cse219 (* .cse220 .cse221)) |ULTIMATE.start_main_~A~0#1|) .cse113 .cse115 .cse222) (or .cse116 .cse223 (= (+ .cse224 (* .cse220 .cse225)) |ULTIMATE.start_main_~A~0#1|)))) (or .cse97 (and (or .cse226 .cse98 (= |ULTIMATE.start_main_~A~0#1| (+ .cse227 (* .cse220 .cse228)))) (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse220 .cse229) .cse230)) .cse231 .cse108 .cse109)) .cse61))) .cse132))) (or (and .cse55 .cse56 .cse1 .cse35 .cse57 .cse19 .cse38 .cse58 .cse40 .cse215 .cse63 .cse216 .cse23 .cse217 .cse26 .cse60 .cse42 .cse61) (and .cse55 .cse56 .cse1 .cse35 .cse57 .cse38 .cse58 .cse40 .cse215 .cse63 .cse216 .cse23 .cse217 .cse26 .cse67 .cse60 .cse42 .cse61))))) (.cse27 (or (and (or .cse103 .cse197 .cse105 (and (or .cse198 (not (= .cse199 1))) (or (not (= .cse200 1)) .cse201 .cse202))) (or .cse100 .cse203 (and (or .cse204 (not (= .cse205 1))) (or .cse206 .cse207 (not (= .cse208 1)))))) .cse121 (let ((.cse211 (* .cse214 .cse164))) (and (or .cse97 .cse209 (= |ULTIMATE.start_main_~A~0#1| (+ .cse210 .cse211)) .cse61) (or .cse111 (= (+ .cse212 .cse211) |ULTIMATE.start_main_~A~0#1|) .cse213))) .cse122)) (.cse5 (or .cse194 (and (or .cse97 (not (= .cse164 .cse195)) .cse61) (or (not (= .cse196 .cse164)) .cse111)) .cse36 .cse137)) (.cse54 (or (and (or .cse97 .cse145 (let ((.cse183 (< .cse147 0)) (.cse181 (= (mod .cse147 2) 0)) (.cse182 (div .cse147 2))) (and (or .cse181 (not (= (+ .cse182 1) .cse164)) (not .cse183)) (or (and .cse183 (not .cse181)) (not (= .cse164 .cse182))))) .cse61) (or (let ((.cse184 (= (mod .cse142 2) 0)) (.cse186 (< .cse142 0)) (.cse185 (div .cse162 8))) (and (or .cse184 (not (= (+ .cse185 1) .cse164)) (not .cse186)) (or (and (not .cse184) .cse186) (not (= .cse164 .cse185))))) .cse111 .cse144)) .cse59 (and (or (let ((.cse189 (div .cse163 8)) (.cse187 (= (mod .cse158 2) 0)) (.cse188 (< .cse158 0))) (and (or .cse187 (not .cse188) (not (= (+ .cse189 1) 1))) (or (not (= .cse189 1)) (and (not .cse187) .cse188)))) .cse149 .cse132) (or .cse121 .cse122 (let ((.cse190 (= (mod .cse160 2) 0)) (.cse191 (< .cse160 0)) (.cse192 (div .cse160 2))) (and (or (and (not .cse190) .cse191) (not (= .cse192 1))) (or .cse190 (not .cse191) (not (= (+ .cse192 1) 1))))) .cse148)) .cse193)) (.cse6 (or .cse121 (let ((.cse179 (* (+ .cse119 .cse151) |ULTIMATE.start_main_~B~0#1|)) (.cse180 (* (+ .cse151 .cse120) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse97 (and (or .cse177 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse179 .cse178)) .cse103 .cse105) (or .cse100 (= (+ .cse180 .cse178) |ULTIMATE.start_main_~A~0#1|))) .cse98) (or .cse176 (and (or .cse103 (= |ULTIMATE.start_main_~A~0#1| (+ .cse175 .cse179)) .cse105) (or .cse100 (= |ULTIMATE.start_main_~A~0#1| (+ .cse175 .cse180)))) .cse108 .cse109)) .cse174 .cse61) (or (and (or .cse173 .cse113 (and (or .cse103 .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ .cse172 .cse179))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse172 .cse180)) .cse100)) .cse115) (or .cse116 .cse168 (and (or .cse103 (= |ULTIMATE.start_main_~A~0#1| (+ .cse169 .cse179)) .cse105) (or (= (+ .cse180 .cse169) |ULTIMATE.start_main_~A~0#1|) .cse100)))) .cse111 .cse167))) .cse122)) (.cse7 (or (let ((.cse170 (* (+ .cse130 .cse151) |ULTIMATE.start_main_~B~0#1|)) (.cse171 (* (+ .cse151 .cse131) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse111 .cse167 (and (or .cse116 .cse168 (and (or .cse129 (= (+ .cse169 .cse170) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse171 .cse169) |ULTIMATE.start_main_~A~0#1|) .cse126 .cse127))) (or (and (or .cse126 .cse127 (= (+ .cse171 .cse172) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse172 .cse170)) .cse129)) .cse173 .cse113 .cse115))) (or .cse97 .cse174 (and (or (and (or (= (+ .cse175 .cse171) |ULTIMATE.start_main_~A~0#1|) .cse126 .cse127) (or (= (+ .cse175 .cse170) |ULTIMATE.start_main_~A~0#1|) .cse129)) .cse176 .cse108 .cse109) (or .cse177 (and (or (= (+ .cse170 .cse178) |ULTIMATE.start_main_~A~0#1|) .cse129) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse171 .cse178)) .cse126 .cse127)) .cse98)) .cse61))) .cse132)) (.cse9 (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse164 .cse159) .cse156)) .cse152 .cse36 (not .cse150) (let ((.cse165 (div (* |ULTIMATE.start_main_~p~0#1| 4) 8))) (and (or (not (= .cse165 1)) .cse132) (or .cse121 .cse122 (not (= (+ .cse165 1) 1))))) (let ((.cse166 (div (* |ULTIMATE.start_main_~d~0#1| 4) 8))) (and (or (not (= .cse164 .cse166)) .cse111) (or .cse97 (not (= (+ .cse166 1) .cse164)) .cse61))))) (.cse11 (let ((.cse161 (+ (- (* .cse162 2)) |ULTIMATE.start_main_~r~0#1|))) (or (not (>= .cse161 |ULTIMATE.start_main_~d~0#1|)) (>= .cse161 .cse162) (= (+ (+ .cse161 .cse33) (* (+ |ULTIMATE.start_main_~p~0#1| (+ |ULTIMATE.start_main_~q~0#1| (* 2 .cse163))) |ULTIMATE.start_main_~B~0#1|)) |ULTIMATE.start_main_~A~0#1|)))) (.cse15 (or .cse152 (let ((.cse155 (* (+ .cse159 .cse160) |ULTIMATE.start_main_~B~0#1|)) (.cse153 (* |ULTIMATE.start_main_~B~0#1| (+ .cse158 .cse159)))) (and (or .cse97 (let ((.cse154 (+ .cse146 .cse156))) (and (or (= (+ .cse153 .cse154) |ULTIMATE.start_main_~A~0#1|) .cse132) (or (= (+ .cse155 .cse154) |ULTIMATE.start_main_~A~0#1|) .cse121 .cse122))) (not (>= .cse156 .cse147)) .cse61) (or (let ((.cse157 (+ .cse141 .cse156))) (and (or .cse121 (= |ULTIMATE.start_main_~A~0#1| (+ .cse155 .cse157)) .cse122) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse157 .cse153)) .cse132))) .cse111 (not (>= .cse156 .cse142))))))) (.cse49 (= .cse39 |ULTIMATE.start_main_~A~0#1|)) (.cse64 (<= 2 |ULTIMATE.start_main_~d~0#1|)) (.cse43 (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|)) (.cse41 (* 2 .cse69)) (.cse70 (= |ULTIMATE.start_main_~p~0#1| .cse69)) (.cse71 (= (+ 4 0) |ULTIMATE.start_main_~q~0#1|)) (.cse85 (or (and (= |ULTIMATE.start_main_~d~0#1| .cse73) .cse74) (and (= |ULTIMATE.start_main_~d~0#1| .cse79) .cse83 .cse84))) (.cse72 (= .cse86 .cse65)) (.cse68 (= |ULTIMATE.start_main_~d~0#1| .cse87)) (.cse88 (= 2 |ULTIMATE.start_main_~p~0#1|)) (.cse22 (<= 2 |ULTIMATE.start_main_~p~0#1|)) (.cse12 (or .cse135 (= (+ .cse140 (* |ULTIMATE.start_main_~d~0#1| .cse151)) |ULTIMATE.start_main_~A~0#1|) .cse59)) (.cse14 (or .cse1 (and .cse1 (<= 1 |ULTIMATE.start_main_~d~0#1|)))) (.cse17 (or (and (or .cse111 (= (+ (+ .cse140 .cse141) (* .cse142 .cse143)) |ULTIMATE.start_main_~A~0#1|) (not .cse144)) (or .cse97 (not .cse145) (= (+ (+ .cse146 .cse140) (* .cse147 .cse143)) |ULTIMATE.start_main_~A~0#1|) .cse61)) (and (or (not .cse148) .cse121 .cse122) (or (not .cse149) .cse132)) .cse150)) (.cse20 (or .cse136 .cse137 (and (or .cse97 .cse138 .cse110 .cse61) (or .cse57 .cse139 .cse111)))) (.cse8 (or .cse135 (not .cse10) .cse67)) (.cse2 (or .cse59 .cse23)) (.cse3 (or .cse97 .cse133 .cse134 .cse61)) (.cse4 (>= |ULTIMATE.start_main_~p~0#1| 1)) (.cse25 (or (let ((.cse125 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse131))) (.cse128 (* |ULTIMATE.start_main_~B~0#1| (+ .cse130 |ULTIMATE.start_main_~q~0#1|)))) (and (or .cse97 (and (or .cse107 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse106 .cse125)) .cse126 .cse127) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse128 .cse106)) .cse129)) .cse108 .cse109) (or .cse98 .cse99 (and (or (= (+ .cse128 .cse101) |ULTIMATE.start_main_~A~0#1|) .cse129) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse101 .cse125)) .cse126 .cse127)))) .cse110 .cse61) (or .cse57 .cse111 (and (or .cse113 .cse114 .cse115 (and (or .cse126 (= |ULTIMATE.start_main_~A~0#1| (+ .cse112 .cse125)) .cse127) (or .cse129 (= |ULTIMATE.start_main_~A~0#1| (+ .cse112 .cse128))))) (or .cse116 (and (or (= (+ .cse118 .cse125) |ULTIMATE.start_main_~A~0#1|) .cse126 .cse127) (or (= (+ .cse118 .cse128) |ULTIMATE.start_main_~A~0#1|) .cse129)) .cse117))))) .cse132)) (.cse66 (>= |ULTIMATE.start_main_~A~0#1| .cse46)) (.cse16 (or .cse123 .cse124 .cse111)) (.cse28 (or (let ((.cse102 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse120))) (.cse104 (* |ULTIMATE.start_main_~B~0#1| (+ .cse119 |ULTIMATE.start_main_~q~0#1|)))) (and (or .cse97 (and (or .cse98 .cse99 (and (or .cse100 (= (+ .cse101 .cse102) |ULTIMATE.start_main_~A~0#1|)) (or .cse103 (= |ULTIMATE.start_main_~A~0#1| (+ .cse104 .cse101)) .cse105))) (or (and (or .cse100 (= |ULTIMATE.start_main_~A~0#1| (+ .cse106 .cse102))) (or .cse103 (= (+ .cse104 .cse106) |ULTIMATE.start_main_~A~0#1|) .cse105)) .cse107 .cse108 .cse109)) .cse110 .cse61) (or .cse57 .cse111 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse112 .cse104)) .cse103 .cse105) (or .cse100 (= (+ .cse112 .cse102) |ULTIMATE.start_main_~A~0#1|))) .cse113 .cse114 .cse115) (or .cse116 .cse117 (and (or .cse100 (= (+ .cse118 .cse102) |ULTIMATE.start_main_~A~0#1|)) (or .cse103 (= |ULTIMATE.start_main_~A~0#1| (+ .cse118 .cse104)) .cse105))))))) .cse121 .cse122))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse18 .cse1 .cse2 .cse19 .cse20 .cse3 .cse5 .cse6 .cse21 .cse22 .cse7 .cse9 .cse10 .cse23 .cse11 .cse24 .cse25 .cse26 .cse13 .cse15 .cse27 .cse16 .cse28) (let ((.cse34 (+ |ULTIMATE.start_main_~A~0#1| (* (- 1) .cse39)))) (and (let ((.cse31 (< .cse34 0)) (.cse29 (div (+ |ULTIMATE.start_main_~A~0#1| .cse32 .cse33) 2)) (.cse30 (= (mod (+ |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0))) (or (and (= .cse29 |ULTIMATE.start_main_~d~0#1|) (or .cse30 (not .cse31))) (and .cse31 (= |ULTIMATE.start_main_~d~0#1| (+ .cse29 1)) (not .cse30)))) .cse35 .cse36 (= |ULTIMATE.start_main_~B~0#1| (+ (* (- 2) |ULTIMATE.start_main_~B~0#1|) .cse37 |ULTIMATE.start_main_~A~0#1|)) (= 2 .cse34) .cse38 (>= .cse39 |ULTIMATE.start_main_~d~0#1|) .cse40 .cse23 (= (+ (- 2) |ULTIMATE.start_main_~q~0#1|) 1) .cse26 .cse13 (not (>= (+ .cse39 .cse34) .cse41)) .cse42 (= (+ (* (- 1) 2) .cse43) 0))) (and .cse1 .cse4 .cse8 .cse10 .cse13) (and .cse1 .cse44 (= (* 2 .cse41) |ULTIMATE.start_main_~p~0#1|) .cse45 (>= |ULTIMATE.start_main_~r~0#1| .cse46) .cse10 .cse47 (= (* .cse46 2) |ULTIMATE.start_main_~d~0#1|) .cse13 .cse48) (and .cse49 (= |ULTIMATE.start_main_~d~0#1| 1) .cse50 .cse51 .cse36 .cse52 (= |ULTIMATE.start_main_~r~0#1| (+ (- |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~A~0#1|)) .cse23 .cse13 (= |ULTIMATE.start_main_~q~0#1| (+ 0 1)) .cse53) (and .cse1 .cse2 .cse4 .cse8 .cse10 .cse11 .cse13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse54 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse36 .cse52 .cse45 .cse47 .cse13) (and .cse1 .cse19 .cse22 .cse8 .cse10 .cse23 .cse26 .cse13) (and .cse55 .cse56 .cse57 (= .cse46 |ULTIMATE.start_main_~d~0#1|) .cse58 (= |ULTIMATE.start_main_~p~0#1| .cse41) .cse45 (= |ULTIMATE.start_main_~d~0#1| .cse41) .cse59 .cse47 .cse13 .cse60 .cse61) (and .cse1 .cse2 .cse3 .cse5 .cse54 .cse6 .cse22 .cse7 .cse8 .cse9 .cse10 .cse23 .cse11 .cse12 .cse26 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse62 .cse1 .cse35 .cse19 .cse20 .cse40 .cse63 .cse8 .cse64 .cse10 .cse23 .cse25 .cse26 .cse13 .cse60 .cse28) (and .cse62 (= |ULTIMATE.start_main_~p~0#1| 4) .cse49 .cse1 .cse35 .cse19 .cse40 .cse63 (= |ULTIMATE.start_main_~d~0#1| .cse65) .cse64 .cse10 .cse23 (= (+ |ULTIMATE.start_main_~A~0#1| .cse33) |ULTIMATE.start_main_~r~0#1|) .cse66 .cse26 .cse13 .cse60 .cse53 (>= .cse39 .cse46)) (and .cse1 (or (and .cse0 .cse18 .cse1 .cse2 .cse20 .cse3 .cse44 .cse5 .cse6 .cse21 .cse7 .cse9 .cse10 .cse47 .cse11 .cse24 .cse25 .cse67 .cse13 .cse48 .cse15 .cse27 .cse16 .cse28) (and .cse18 .cse1 .cse2 .cse19 .cse20 .cse3 .cse44 .cse5 .cse54 .cse6 .cse21 .cse7 .cse9 .cse10 .cse47 .cse11 .cse24 .cse25 .cse13 .cse48 .cse15 .cse27 .cse16 .cse28)) .cse10 .cse47 .cse13) (and .cse68 (= |ULTIMATE.start_main_~d~0#1| .cse69) .cse45 .cse10 .cse47 .cse13 .cse70) (and .cse71 .cse1 .cse36 .cse72 .cse4 (or (and (not (>= |ULTIMATE.start_main_~r~0#1| .cse73)) .cse74 (let ((.cse77 (= (mod .cse73 2) 0)) (.cse75 (< .cse73 0)) (.cse76 (div .cse78 4))) (or (and .cse75 (= (+ .cse76 1) |ULTIMATE.start_main_~d~0#1|) (not .cse77)) (and (or .cse77 (not .cse75)) (= |ULTIMATE.start_main_~d~0#1| .cse76))))) (and (not (>= |ULTIMATE.start_main_~r~0#1| .cse79)) (let ((.cse81 (= (mod .cse79 2) 0)) (.cse80 (< .cse79 0)) (.cse82 (div .cse79 2))) (or (and .cse80 (not .cse81) (= (+ .cse82 1) |ULTIMATE.start_main_~d~0#1|)) (and (or .cse81 (not .cse80)) (= .cse82 |ULTIMATE.start_main_~d~0#1|)))) .cse83 .cse84)) .cse12 .cse66 .cse13 .cse14 .cse17) (and .cse1 .cse2 .cse4 .cse5 .cse54 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse85 .cse36 (= (+ (* (- 1) .cse69) |ULTIMATE.start_main_~q~0#1|) 0) .cse13 .cse14 (= .cse86 .cse87)) (and .cse49 .cse1 .cse19 .cse68 .cse88 .cse64 .cse23 (= .cse43 0) .cse13 .cse60 (= 2 |ULTIMATE.start_main_~d~0#1|) (not (>= .cse39 .cse41)) .cse70) (let ((.cse89 (+ |ULTIMATE.start_main_~r~0#1| .cse65))) (and .cse71 .cse1 .cse85 .cse72 .cse68 (= .cse89 |ULTIMATE.start_main_~A~0#1|) .cse88 .cse22 (>= .cse89 .cse46) .cse59 .cse10 (= |ULTIMATE.start_main_~q~0#1| 4) (let ((.cse91 (= (mod |ULTIMATE.start_main_~q~0#1| 2) 0)) (.cse92 (< |ULTIMATE.start_main_~q~0#1| 0)) (.cse90 (div |ULTIMATE.start_main_~q~0#1| 2))) (or (and (= .cse90 |ULTIMATE.start_main_~p~0#1|) (or .cse91 (not .cse92))) (and (not .cse91) .cse92 (= (+ .cse90 1) |ULTIMATE.start_main_~p~0#1|)))) .cse23 .cse12 .cse66 .cse26 .cse13 .cse14 .cse17)) (and .cse1 .cse20 .cse4 .cse8 .cse10 .cse25 .cse13 .cse28) (let ((.cse96 (* |ULTIMATE.start_main_~B~0#1| (- 4)))) (let ((.cse94 (+ .cse96 .cse37 |ULTIMATE.start_main_~A~0#1|))) (let ((.cse93 (+ .cse94 |ULTIMATE.start_main_~r~0#1|)) (.cse95 (+ .cse96 |ULTIMATE.start_main_~A~0#1|))) (and (not (>= .cse93 .cse87)) .cse2 .cse36 .cse3 (= .cse94 |ULTIMATE.start_main_~B~0#1|) .cse4 .cse52 (= (+ |ULTIMATE.start_main_~q~0#1| (- 4)) 1) (>= .cse93 .cse94) .cse10 (>= (+ .cse65 .cse95) .cse46) .cse25 .cse66 (not (>= .cse95 .cse87)) (= |ULTIMATE.start_main_~r~0#1| (+ .cse33 .cse95)) (= |ULTIMATE.start_main_~q~0#1| (+ |ULTIMATE.start_main_~p~0#1| 4)) .cse13 .cse16 .cse28))))))))))))) [2023-02-17 02:08:32,427 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2023-02-17 02:08:32,430 INFO L895 garLoopResultBuilder]: At program point L45-1(line 45) the Hoare annotation is: (let ((.cse306 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse145 (div |ULTIMATE.start_main_~d~0#1| 2))) (let ((.cse144 (+ .cse145 1)) (.cse337 (- .cse145)) (.cse307 (+ .cse306 1))) (let ((.cse134 (div |ULTIMATE.start_main_~p~0#1| 4)) (.cse124 (div .cse307 2)) (.cse165 (* 2 |ULTIMATE.start_main_~p~0#1|)) (.cse164 (* 2 |ULTIMATE.start_main_~d~0#1|)) (.cse336 (+ (- 1) .cse337)) (.cse218 (+ |ULTIMATE.start_main_~q~0#1| .cse307)) (.cse233 (+ |ULTIMATE.start_main_~q~0#1| .cse306)) (.cse343 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse125 (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0)) (.cse284 (div |ULTIMATE.start_main_~d~0#1| 4)) (.cse287 (div .cse144 2))) (let ((.cse329 (- .cse287)) (.cse326 (- .cse284)) (.cse30 (- |ULTIMATE.start_main_~d~0#1|)) (.cse1 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse75 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (.cse216 (+ |ULTIMATE.start_main_~r~0#1| .cse337)) (.cse136 (and .cse343 (not .cse125))) (.cse339 (* |ULTIMATE.start_main_~B~0#1| .cse233)) (.cse126 (not .cse343)) (.cse340 (* .cse218 |ULTIMATE.start_main_~B~0#1|)) (.cse214 (+ |ULTIMATE.start_main_~r~0#1| .cse336)) (.cse338 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse29 (- |ULTIMATE.start_main_~r~0#1|)) (.cse33 (* (- 1) |ULTIMATE.start_main_~r~0#1|)) (.cse288 (+ .cse287 1)) (.cse280 (+ .cse284 1)) (.cse159 (div .cse164 4)) (.cse160 (div .cse165 4)) (.cse107 (= (mod .cse307 2) 0)) (.cse341 (< .cse307 0)) (.cse123 (+ .cse124 1)) (.cse135 (+ .cse134 1)) (.cse342 (< .cse306 0)) (.cse131 (= (mod .cse306 2) 0))) (let ((.cse226 (= .cse134 1)) (.cse133 (and .cse342 (not .cse131))) (.cse220 (= .cse135 1)) (.cse130 (not .cse342)) (.cse201 (= .cse123 1)) (.cse109 (not .cse341)) (.cse104 (and .cse341 (not .cse107))) (.cse207 (= .cse124 1)) (.cse330 (< .cse144 0)) (.cse112 (= (mod .cse144 2) 0)) (.cse117 (= (mod .cse145 2) 0)) (.cse331 (< .cse145 0)) (.cse162 (+ .cse160 1)) (.cse158 (- .cse159)) (.cse156 (+ .cse159 1)) (.cse332 (< .cse280 0)) (.cse241 (= (mod .cse280 2) 0)) (.cse248 (= (mod .cse284 2) 0)) (.cse333 (< .cse284 0)) (.cse267 (= (mod .cse288 2) 0)) (.cse334 (< .cse288 0)) (.cse257 (= (mod .cse287 2) 0)) (.cse335 (< .cse287 0)) (.cse321 (div .cse280 2)) (.cse320 (div |ULTIMATE.start_main_~d~0#1| 8)) (.cse316 (div .cse144 4)) (.cse310 (div .cse288 2)) (.cse90 (+ .cse33 |ULTIMATE.start_main_~A~0#1|)) (.cse10 (+ |ULTIMATE.start_main_~A~0#1| .cse29)) (.cse302 (= .cse306 1)) (.cse297 (= .cse307 1)) (.cse181 (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (.cse101 (not .cse338)) (.cse139 (and (or .cse136 (= (+ .cse214 .cse339) |ULTIMATE.start_main_~A~0#1|)) (or .cse125 .cse126 (= |ULTIMATE.start_main_~A~0#1| (+ .cse340 .cse214))))) (.cse127 (and (or (= (+ .cse339 .cse216) |ULTIMATE.start_main_~A~0#1|) .cse136) (or (= (+ .cse340 .cse216) |ULTIMATE.start_main_~A~0#1|) .cse125 .cse126))) (.cse115 (and (not .cse75) .cse338)) (.cse141 (not .cse1)) (.cse85 (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)) (.cse296 (+ |ULTIMATE.start_main_~r~0#1| .cse30)) (.cse327 (+ (- 1) .cse326)) (.cse72 (>= |ULTIMATE.start_main_~r~0#1| .cse145)) (.cse114 (>= |ULTIMATE.start_main_~r~0#1| .cse144)) (.cse328 (+ (- 1) .cse329))) (let ((.cse286 (+ .cse214 .cse329)) (.cse289 (+ .cse214 .cse328)) (.cse23 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse161 (+ |ULTIMATE.start_main_~q~0#1| .cse165)) (.cse140 (not .cse114)) (.cse128 (not .cse72)) (.cse299 (* (+ .cse218 .cse124) |ULTIMATE.start_main_~B~0#1|)) (.cse298 (* (+ .cse123 .cse218) |ULTIMATE.start_main_~B~0#1|)) (.cse283 (+ .cse326 .cse216)) (.cse301 (* (+ .cse134 .cse233) |ULTIMATE.start_main_~B~0#1|)) (.cse278 (+ .cse327 .cse216)) (.cse300 (* (+ .cse135 .cse233) |ULTIMATE.start_main_~B~0#1|)) (.cse291 (+ .cse296 .cse337)) (.cse293 (+ .cse296 .cse336)) (.cse77 (or .cse141 .cse85)) (.cse20 (or .cse127 .cse115)) (.cse22 (or .cse101 .cse139 .cse75)) (.cse43 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse45 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)) (.cse46 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse24 (= |ULTIMATE.start_main_~A~0#1| (+ .cse296 (* |ULTIMATE.start_main_~B~0#1| .cse181)))) (.cse18 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse142 (and (or (not .cse302) .cse136) (or .cse125 .cse126 (not .cse297)))) (.cse5 (div .cse10 2)) (.cse16 (< .cse90 0)) (.cse309 (= (mod (+ |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0)) (.cse230 (div |ULTIMATE.start_main_~p~0#1| 8)) (.cse224 (div .cse135 2)) (.cse221 (= (mod .cse135 2) 0)) (.cse312 (< .cse135 0)) (.cse311 (- .cse310)) (.cse315 (- .cse316)) (.cse227 (= (mod .cse134 2) 0)) (.cse317 (< .cse134 0)) (.cse319 (- .cse320)) (.cse322 (- .cse321)) (.cse209 (div .cse307 4)) (.cse203 (div .cse123 2)) (.cse205 (= (mod .cse123 2) 0)) (.cse324 (< .cse123 0)) (.cse210 (= (mod .cse124 2) 0)) (.cse325 (< .cse124 0)) (.cse259 (and (not .cse257) .cse335)) (.cse254 (not .cse335)) (.cse314 (+ .cse316 1)) (.cse261 (>= .cse214 .cse287)) (.cse266 (not .cse334)) (.cse313 (+ .cse310 1)) (.cse262 (and (not .cse267) .cse334)) (.cse269 (>= .cse214 .cse288)) (.cse247 (and (not .cse248) .cse333)) (.cse251 (not .cse333)) (.cse318 (+ .cse320 1)) (.cse244 (>= .cse216 .cse284)) (.cse234 (and .cse332 (not .cse241))) (.cse240 (not .cse332)) (.cse323 (+ .cse321 1)) (.cse243 (>= .cse216 .cse280)) (.cse192 (>= .cse296 .cse159)) (.cse185 (>= .cse296 .cse156)) (.cse154 (+ (- 1) .cse158)) (.cse292 (+ .cse181 1)) (.cse200 (= 1 .cse162)) (.cse196 (= .cse160 1)) (.cse166 (>= |ULTIMATE.start_main_~r~0#1| .cse164)) (.cse21 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse65 (not (>= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|))) (.cse119 (not .cse331)) (.cse120 (and (not .cse117) .cse331)) (.cse102 (and .cse330 (not .cse112))) (.cse113 (not .cse330)) (.cse294 (and (or (not .cse201) .cse107 .cse109) (or .cse104 (not .cse207)))) (.cse277 (and (or (not .cse226) .cse133) (or (not .cse220) .cse130 .cse131))) (.cse155 (+ (- .cse164) |ULTIMATE.start_main_~r~0#1|)) (.cse143 (* |ULTIMATE.start_main_~B~0#1| 1)) (.cse91 (* 2 |ULTIMATE.start_main_~B~0#1|))) (let ((.cse44 (* 2 .cse91)) (.cse111 (not (>= |ULTIMATE.start_main_~r~0#1| .cse288))) (.cse110 (+ .cse328 |ULTIMATE.start_main_~r~0#1|)) (.cse103 (not (>= |ULTIMATE.start_main_~r~0#1| .cse287))) (.cse105 (+ |ULTIMATE.start_main_~r~0#1| .cse329)) (.cse118 (not (>= |ULTIMATE.start_main_~r~0#1| .cse280))) (.cse116 (+ .cse327 |ULTIMATE.start_main_~r~0#1|)) (.cse122 (+ .cse326 |ULTIMATE.start_main_~r~0#1|)) (.cse121 (not (>= |ULTIMATE.start_main_~r~0#1| .cse284))) (.cse146 (= (+ |ULTIMATE.start_main_~r~0#1| (* .cse143 |ULTIMATE.start_main_~q~0#1|)) |ULTIMATE.start_main_~A~0#1|)) (.cse150 (>= .cse155 |ULTIMATE.start_main_~d~0#1|)) (.cse179 (not (>= .cse296 .cse287))) (.cse180 (+ .cse296 .cse329)) (.cse178 (not (>= .cse296 .cse288))) (.cse177 (+ .cse328 .cse296)) (.cse175 (not (>= .cse296 .cse280))) (.cse174 (+ .cse296 .cse327)) (.cse170 (not (>= .cse296 .cse284))) (.cse171 (+ .cse326 .cse296)) (.cse147 (and (or .cse294 .cse297 .cse125 .cse126) (or .cse277 .cse136 .cse302))) (.cse148 (and (or .cse102 (not (= .cse143 .cse287))) (or (not (= .cse143 .cse288)) .cse112 .cse113))) (.cse149 (and (or .cse117 (not (= .cse143 .cse280)) .cse119) (or .cse120 (not (= .cse143 .cse284))))) (.cse184 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse143 .cse181) .cse296))) (.cse137 (or .cse141 (= (+ .cse296 (* |ULTIMATE.start_main_~d~0#1| .cse181)) |ULTIMATE.start_main_~A~0#1|) .cse65)) (.cse38 (or .cse21 (and .cse21 (<= 1 |ULTIMATE.start_main_~d~0#1|)))) (.cse138 (or (and (or .cse115 (= (+ (+ .cse296 .cse158) (* .cse159 .cse292)) |ULTIMATE.start_main_~A~0#1|) (not .cse192)) (or .cse101 (not .cse185) (= (+ (+ .cse154 .cse296) (* .cse156 .cse292)) |ULTIMATE.start_main_~A~0#1|) .cse75)) (and (or (not .cse200) .cse125 .cse126) (or (not .cse196) .cse136)) .cse166)) (.cse217 (and (or .cse120 (and (or (not (= .cse143 .cse320)) .cse247) (or .cse248 .cse251 (not (= .cse143 .cse318)))) .cse244) (or .cse117 (and (or (not (= .cse143 .cse321)) .cse234) (or .cse240 .cse241 (not (= .cse143 .cse323)))) .cse119 .cse243))) (.cse213 (and (or (and (or (not (= .cse143 .cse316)) .cse259) (or .cse254 (not (= .cse143 .cse314)) .cse257)) .cse102 .cse261) (or (and (or .cse266 .cse267 (not (= .cse143 .cse313))) (or .cse262 (not (= .cse143 .cse310)))) .cse112 .cse113 .cse269))) (.cse211 (not .cse325)) (.cse208 (and (not .cse210) .cse325)) (.cse206 (not .cse324)) (.cse202 (and (not .cse205) .cse324)) (.cse204 (+ .cse203 1)) (.cse212 (+ .cse209 1)) (.cse239 (not (>= .cse216 .cse323))) (.cse242 (+ (+ (- 1) .cse322) .cse216)) (.cse235 (+ .cse216 .cse322)) (.cse238 (not (>= .cse216 .cse321))) (.cse246 (+ .cse216 .cse319)) (.cse245 (not (>= .cse216 .cse320))) (.cse250 (+ (+ (- 1) .cse319) .cse216)) (.cse249 (not (>= .cse216 .cse318))) (.cse231 (and (not .cse227) .cse317)) (.cse229 (not .cse317)) (.cse258 (+ .cse315 .cse214)) (.cse260 (not (>= .cse214 .cse316))) (.cse255 (+ .cse214 (+ (- 1) .cse315))) (.cse256 (not (>= .cse214 .cse314))) (.cse268 (not (>= .cse214 .cse313))) (.cse265 (+ .cse214 (+ (- 1) .cse311))) (.cse222 (not .cse312)) (.cse225 (and (not .cse221) .cse312)) (.cse264 (+ .cse214 .cse311)) (.cse263 (not (>= .cse214 .cse310))) (.cse223 (+ 1 .cse224)) (.cse228 (+ .cse230 1)) (.cse88 (* 2 1)) (.cse35 (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse6 (or (not .cse16) .cse309)) (.cse11 (+ .cse5 1)) (.cse15 (not .cse309)) (.cse70 (or .cse142 (and (or (= .cse145 |ULTIMATE.start_main_~B~0#1|) .cse115) (or .cse101 (= |ULTIMATE.start_main_~B~0#1| .cse144) .cse75)))) (.cse71 (let ((.cse308 (or .cse142 (and (or .cse101 .cse75 (= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| .cse144)) |ULTIMATE.start_main_~A~0#1|)) (or .cse115 (= |ULTIMATE.start_main_~A~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* .cse145 |ULTIMATE.start_main_~q~0#1|)))))))) (or (and .cse20 .cse21 .cse22 .cse77 .cse308 .cse43 .cse45 .cse46 .cse24 .cse18) (and .cse20 .cse21 .cse22 .cse308 .cse43 .cse45 .cse46 .cse24 .cse85 .cse18)))) (.cse32 (or .cse1 (let ((.cse305 (* (+ .cse181 .cse307) |ULTIMATE.start_main_~B~0#1|)) (.cse304 (* (+ .cse181 .cse306) |ULTIMATE.start_main_~B~0#1|))) (and (or (and (or (= (+ .cse304 .cse291) |ULTIMATE.start_main_~A~0#1|) .cse136) (or .cse125 .cse126 (= |ULTIMATE.start_main_~A~0#1| (+ .cse291 .cse305)))) .cse115) (or .cse101 (and (or .cse125 (= |ULTIMATE.start_main_~A~0#1| (+ .cse293 .cse305)) .cse126) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse293 .cse304)) .cse136)) .cse75))))) (.cse34 (or (and (or .cse297 .cse125 .cse126 (and (or .cse117 .cse119 (and (or .cse107 (= (+ .cse278 .cse298) |ULTIMATE.start_main_~A~0#1|) .cse109) (or .cse104 (= |ULTIMATE.start_main_~A~0#1| (+ .cse299 .cse278))))) (or .cse120 (and (or .cse104 (= (+ .cse299 .cse283) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse298 .cse283)) .cse107 .cse109))))) (or (and (or .cse120 (and (or (= (+ .cse301 .cse283) |ULTIMATE.start_main_~A~0#1|) .cse133) (or (= (+ .cse283 .cse300) |ULTIMATE.start_main_~A~0#1|) .cse130 .cse131))) (or (and (or .cse133 (= (+ .cse301 .cse278) |ULTIMATE.start_main_~A~0#1|)) (or .cse130 .cse131 (= |ULTIMATE.start_main_~A~0#1| (+ .cse278 .cse300)))) .cse117 .cse119)) .cse136 .cse302)) .cse115)) (.cse73 (<= 2 .cse145)) (.cse36 (or .cse1 (and .cse20 .cse22))) (.cse78 (or .cse142 (let ((.cse303 (+ |ULTIMATE.start_main_~q~0#1| 1))) (and (or .cse101 .cse140 .cse75 (= |ULTIMATE.start_main_~A~0#1| (+ .cse214 (* .cse303 .cse144)))) (or .cse128 .cse115 (= (+ (* .cse145 .cse303) .cse216) |ULTIMATE.start_main_~A~0#1|)))))) (.cse37 (or (= .cse165 1) (= |ULTIMATE.start_main_~A~0#1| (+ (+ .cse155 .cse30) (* |ULTIMATE.start_main_~B~0#1| (+ .cse161 |ULTIMATE.start_main_~p~0#1|)))))) (.cse74 (or .cse141 .cse23)) (.cse40 (or .cse101 .cse75 (and (or .cse297 .cse125 .cse126 (and (or (and (or (= (+ .cse298 .cse289) |ULTIMATE.start_main_~A~0#1|) .cse107 .cse109) (or .cse104 (= |ULTIMATE.start_main_~A~0#1| (+ .cse299 .cse289)))) .cse112 .cse113) (or .cse102 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse286 .cse298)) .cse107 .cse109) (or .cse104 (= (+ .cse286 .cse299) |ULTIMATE.start_main_~A~0#1|)))))) (or (and (or (and (or .cse130 .cse131 (= (+ .cse286 .cse300) |ULTIMATE.start_main_~A~0#1|)) (or .cse133 (= |ULTIMATE.start_main_~A~0#1| (+ .cse286 .cse301)))) .cse102) (or .cse112 .cse113 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse289 .cse300)) .cse130 .cse131) (or (= (+ .cse301 .cse289) |ULTIMATE.start_main_~A~0#1|) .cse133)))) .cse136 .cse302)))) (.cse169 (>= .cse296 .cse145)) (.cse176 (>= .cse296 .cse144)) (.cse69 (* |ULTIMATE.start_main_~B~0#1| 4))) (let ((.cse0 (= (+ 4 0) |ULTIMATE.start_main_~q~0#1|)) (.cse2 (= .cse90 .cse69)) (.cse25 (= (+ |ULTIMATE.start_main_~p~0#1| 0) |ULTIMATE.start_main_~q~0#1|)) (.cse42 (<= 8 |ULTIMATE.start_main_~p~0#1|)) (.cse47 (let ((.cse281 (not .cse243)) (.cse282 (not .cse244)) (.cse285 (not .cse261)) (.cse290 (not .cse269))) (let ((.cse274 (or .cse294 .cse125 (let ((.cse295 (+ .cse218 1))) (and (or .cse115 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse278 (* .cse295 .cse280))) .cse117 .cse119 .cse281) (or .cse120 .cse282 (= (+ (* .cse295 .cse284) .cse283) |ULTIMATE.start_main_~A~0#1|)))) (or .cse101 (and (or .cse285 (= |ULTIMATE.start_main_~A~0#1| (+ .cse286 (* .cse295 .cse287))) .cse102) (or .cse290 .cse112 .cse113 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse295 .cse288) .cse289)))) .cse75))) .cse126)) (.cse275 (or .cse142 (and (or (not .cse169) .cse115 (= (+ .cse291 (* .cse145 .cse292)) |ULTIMATE.start_main_~A~0#1|)) (or .cse101 (not .cse176) (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse292 .cse144) .cse293)) .cse75)))) (.cse276 (or .cse277 (let ((.cse279 (+ .cse233 1))) (and (or .cse115 (and (or (= (+ .cse278 (* .cse279 .cse280)) |ULTIMATE.start_main_~A~0#1|) .cse117 .cse119 .cse281) (or .cse120 .cse282 (= (+ .cse283 (* .cse279 .cse284)) |ULTIMATE.start_main_~A~0#1|)))) (or .cse101 (and (or .cse285 .cse102 (= |ULTIMATE.start_main_~A~0#1| (+ .cse286 (* .cse279 .cse287)))) (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse279 .cse288) .cse289)) .cse290 .cse112 .cse113)) .cse75))) .cse136))) (or (and .cse70 .cse71 .cse21 .cse32 .cse72 .cse77 .cse34 .cse73 .cse36 .cse274 .cse78 .cse275 .cse24 .cse276 .cse37 .cse74 .cse40 .cse75) (and .cse70 .cse71 .cse21 .cse32 .cse72 .cse34 .cse73 .cse36 .cse274 .cse78 .cse275 .cse24 .cse276 .cse37 .cse85 .cse74 .cse40 .cse75))))) (.cse61 (or (and (= |ULTIMATE.start_main_~d~0#1| .cse5) .cse6) (and (= |ULTIMATE.start_main_~d~0#1| .cse11) .cse15 .cse16))) (.cse19 (= .cse35 |ULTIMATE.start_main_~A~0#1|)) (.cse62 (= |ULTIMATE.start_main_~d~0#1| .cse91)) (.cse64 (= 2 |ULTIMATE.start_main_~p~0#1|)) (.cse41 (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|)) (.cse39 (* 2 .cse88)) (.cse89 (= |ULTIMATE.start_main_~p~0#1| .cse88)) (.cse81 (or (let ((.cse270 (* |ULTIMATE.start_main_~B~0#1| (+ .cse233 .cse230))) (.cse271 (* |ULTIMATE.start_main_~B~0#1| (+ .cse228 .cse233))) (.cse273 (* |ULTIMATE.start_main_~B~0#1| (+ .cse223 .cse233))) (.cse272 (* (+ .cse233 .cse224) |ULTIMATE.start_main_~B~0#1|))) (and (or (and (or (and (or .cse120 (and (or .cse248 .cse249 (and (or (= (+ .cse250 .cse270) |ULTIMATE.start_main_~A~0#1|) .cse231) (or (= (+ .cse250 .cse271) |ULTIMATE.start_main_~A~0#1|) .cse227 .cse229)) .cse251) (or .cse245 (and (or .cse227 .cse229 (= |ULTIMATE.start_main_~A~0#1| (+ .cse246 .cse271))) (or (= (+ .cse246 .cse270) |ULTIMATE.start_main_~A~0#1|) .cse231)) .cse247)) .cse244) (or (and (or (and (or .cse227 .cse229 (= |ULTIMATE.start_main_~A~0#1| (+ .cse235 .cse271))) (or .cse231 (= (+ .cse235 .cse270) |ULTIMATE.start_main_~A~0#1|))) .cse234 .cse238) (or .cse239 .cse240 .cse241 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse242 .cse270)) .cse231) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse242 .cse271)) .cse227 .cse229)))) .cse117 .cse119 .cse243)) .cse133) (or .cse130 .cse131 (and (or (and (or .cse239 .cse240 .cse241 (and (or .cse225 (= (+ .cse272 .cse242) |ULTIMATE.start_main_~A~0#1|)) (or .cse221 .cse222 (= |ULTIMATE.start_main_~A~0#1| (+ .cse273 .cse242))))) (or .cse234 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse235 .cse272)) .cse225) (or .cse221 .cse222 (= |ULTIMATE.start_main_~A~0#1| (+ .cse235 .cse273)))) .cse238)) .cse117 .cse119 .cse243) (or .cse120 (and (or (and (or .cse221 (= (+ .cse246 .cse273) |ULTIMATE.start_main_~A~0#1|) .cse222) (or .cse225 (= (+ .cse246 .cse272) |ULTIMATE.start_main_~A~0#1|))) .cse245 .cse247) (or .cse248 (and (or .cse221 .cse222 (= |ULTIMATE.start_main_~A~0#1| (+ .cse273 .cse250))) (or (= (+ .cse272 .cse250) |ULTIMATE.start_main_~A~0#1|) .cse225)) .cse249 .cse251)) .cse244)))) .cse115) (or .cse101 (and (or (and (or .cse102 .cse261 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse270 .cse258)) .cse231) (or .cse227 (= (+ .cse271 .cse258) |ULTIMATE.start_main_~A~0#1|) .cse229)) .cse259 .cse260) (or .cse254 .cse256 (and (or (= (+ .cse255 .cse270) |ULTIMATE.start_main_~A~0#1|) .cse231) (or .cse227 (= |ULTIMATE.start_main_~A~0#1| (+ .cse255 .cse271)) .cse229)) .cse257))) (or (and (or .cse266 (and (or .cse227 (= |ULTIMATE.start_main_~A~0#1| (+ .cse265 .cse271)) .cse229) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse265 .cse270)) .cse231)) .cse267 .cse268) (or .cse262 .cse263 (and (or .cse231 (= (+ .cse264 .cse270) |ULTIMATE.start_main_~A~0#1|)) (or .cse227 (= (+ .cse264 .cse271) |ULTIMATE.start_main_~A~0#1|) .cse229)))) .cse112 .cse113 .cse269)) .cse133) (or (and (or (and (or (and (or .cse225 (= (+ .cse272 .cse258) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse273 .cse258) |ULTIMATE.start_main_~A~0#1|) .cse221 .cse222)) .cse259 .cse260) (or .cse254 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse255 .cse273)) .cse221 .cse222) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse255 .cse272)) .cse225)) .cse256 .cse257)) .cse102 .cse261) (or (and (or .cse266 .cse267 .cse268 (and (or .cse221 .cse222 (= |ULTIMATE.start_main_~A~0#1| (+ .cse265 .cse273))) (or .cse225 (= |ULTIMATE.start_main_~A~0#1| (+ .cse265 .cse272))))) (or (and (or (= (+ .cse264 .cse273) |ULTIMATE.start_main_~A~0#1|) .cse221 .cse222) (or .cse225 (= (+ .cse264 .cse272) |ULTIMATE.start_main_~A~0#1|))) .cse262 .cse263)) .cse112 .cse113 .cse269)) .cse130 .cse131)) .cse75))) .cse136)) (.cse82 (or (let ((.cse252 (* (+ .cse212 .cse218) |ULTIMATE.start_main_~B~0#1|)) (.cse253 (* (+ .cse218 .cse209) |ULTIMATE.start_main_~B~0#1|)) (.cse237 (* |ULTIMATE.start_main_~B~0#1| (+ .cse204 .cse218))) (.cse236 (* |ULTIMATE.start_main_~B~0#1| (+ .cse218 .cse203)))) (and (or .cse115 (and (or .cse107 (and (or (and (or .cse234 (and (or .cse202 (= |ULTIMATE.start_main_~A~0#1| (+ .cse235 .cse236))) (or .cse205 (= (+ .cse237 .cse235) |ULTIMATE.start_main_~A~0#1|) .cse206)) .cse238) (or .cse239 .cse240 .cse241 (and (or (= (+ .cse242 .cse236) |ULTIMATE.start_main_~A~0#1|) .cse202) (or .cse205 (= |ULTIMATE.start_main_~A~0#1| (+ .cse237 .cse242)) .cse206)))) .cse117 .cse119 .cse243) (or .cse120 .cse244 (and (or .cse245 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse246 .cse236)) .cse202) (or .cse205 .cse206 (= (+ .cse246 .cse237) |ULTIMATE.start_main_~A~0#1|))) .cse247) (or .cse248 .cse249 (and (or .cse205 .cse206 (= |ULTIMATE.start_main_~A~0#1| (+ .cse237 .cse250))) (or .cse202 (= (+ .cse236 .cse250) |ULTIMATE.start_main_~A~0#1|))) .cse251)))) .cse109) (or .cse104 (and (or (and (or (and (or .cse210 (= (+ .cse242 .cse252) |ULTIMATE.start_main_~A~0#1|) .cse211) (or .cse208 (= (+ .cse253 .cse242) |ULTIMATE.start_main_~A~0#1|))) .cse239 .cse240 .cse241) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse235 .cse253)) .cse208) (or .cse210 .cse211 (= |ULTIMATE.start_main_~A~0#1| (+ .cse235 .cse252)))) .cse234 .cse238)) .cse117 .cse119 .cse243) (or .cse120 (and (or .cse248 .cse249 .cse251 (and (or .cse208 (= (+ .cse253 .cse250) |ULTIMATE.start_main_~A~0#1|)) (or .cse210 .cse211 (= (+ .cse252 .cse250) |ULTIMATE.start_main_~A~0#1|)))) (or .cse245 .cse247 (and (or .cse210 .cse211 (= (+ .cse246 .cse252) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse246 .cse253) |ULTIMATE.start_main_~A~0#1|) .cse208)))) .cse244))))) (or .cse101 (and (or .cse104 (and (or .cse102 (and (or .cse254 (and (or (= (+ .cse255 .cse252) |ULTIMATE.start_main_~A~0#1|) .cse210 .cse211) (or .cse208 (= |ULTIMATE.start_main_~A~0#1| (+ .cse255 .cse253)))) .cse256 .cse257) (or (and (or .cse210 (= (+ .cse252 .cse258) |ULTIMATE.start_main_~A~0#1|) .cse211) (or .cse208 (= |ULTIMATE.start_main_~A~0#1| (+ .cse253 .cse258)))) .cse259 .cse260)) .cse261) (or (and (or .cse262 .cse263 (and (or .cse210 (= |ULTIMATE.start_main_~A~0#1| (+ .cse264 .cse252)) .cse211) (or .cse208 (= (+ .cse264 .cse253) |ULTIMATE.start_main_~A~0#1|)))) (or (and (or .cse210 (= (+ .cse265 .cse252) |ULTIMATE.start_main_~A~0#1|) .cse211) (or .cse208 (= |ULTIMATE.start_main_~A~0#1| (+ .cse265 .cse253)))) .cse266 .cse267 .cse268)) .cse112 .cse113 .cse269))) (or .cse107 (and (or .cse112 (and (or .cse266 (and (or .cse205 .cse206 (= (+ .cse265 .cse237) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse265 .cse236)) .cse202)) .cse267 .cse268) (or .cse262 (and (or .cse205 (= (+ .cse264 .cse237) |ULTIMATE.start_main_~A~0#1|) .cse206) (or .cse202 (= (+ .cse264 .cse236) |ULTIMATE.start_main_~A~0#1|))) .cse263)) .cse113 .cse269) (or (and (or .cse254 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse237 .cse255)) .cse205 .cse206) (or .cse202 (= |ULTIMATE.start_main_~A~0#1| (+ .cse255 .cse236)))) .cse256 .cse257) (or (and (or (= (+ .cse237 .cse258) |ULTIMATE.start_main_~A~0#1|) .cse205 .cse206) (or .cse202 (= |ULTIMATE.start_main_~A~0#1| (+ .cse236 .cse258)))) .cse259 .cse260)) .cse102 .cse261)) .cse109)) .cse75))) .cse125 .cse126)) (.cse83 (or (and (or .cse220 (and (or .cse221 .cse222 (not (= .cse223 1))) (or (not (= 1 .cse224)) .cse225)) .cse130 .cse131) (or .cse226 (and (or .cse227 (not (= .cse228 1)) .cse229) (or (not (= .cse230 1)) .cse231)) .cse133)) (let ((.cse232 (* .cse143 .cse233))) (and (or (= (+ .cse232 .cse216) |ULTIMATE.start_main_~A~0#1|) .cse115 .cse217) (or .cse101 .cse213 (= (+ .cse214 .cse232) |ULTIMATE.start_main_~A~0#1|) .cse75))) .cse136)) (.cse58 (let ((.cse219 (<= 2 |ULTIMATE.start_main_~p~0#1|))) (or (and .cse21 .cse77 .cse219 .cse24 .cse37 .cse38) (and .cse21 .cse219 .cse24 .cse137 .cse37 .cse38 .cse138)))) (.cse86 (or (and (or .cse107 .cse201 .cse109 (and (or .cse202 (not (= .cse203 1))) (or (not (= .cse204 1)) .cse205 .cse206))) (or .cse104 .cse207 (and (or .cse208 (not (= .cse209 1))) (or .cse210 .cse211 (not (= .cse212 1)))))) .cse125 (let ((.cse215 (* .cse218 .cse143))) (and (or .cse101 .cse213 (= |ULTIMATE.start_main_~A~0#1| (+ .cse214 .cse215)) .cse75) (or .cse115 (= (+ .cse216 .cse215) |ULTIMATE.start_main_~A~0#1|) .cse217))) .cse126)) (.cse52 (or (and (or .cse101 .cse185 (let ((.cse188 (< .cse156 0)) (.cse186 (= (mod .cse156 2) 0)) (.cse187 (div .cse156 2))) (and (or .cse186 (not (= (+ .cse187 1) .cse143)) (not .cse188)) (or (and .cse188 (not .cse186)) (not (= .cse143 .cse187))))) .cse75) (or (let ((.cse189 (= (mod .cse159 2) 0)) (.cse191 (< .cse159 0)) (.cse190 (div .cse164 8))) (and (or .cse189 (not (= (+ .cse190 1) .cse143)) (not .cse191)) (or (and (not .cse189) .cse191) (not (= .cse143 .cse190))))) .cse115 .cse192)) .cse65 (and (or (let ((.cse195 (div .cse165 8)) (.cse193 (= (mod .cse160 2) 0)) (.cse194 (< .cse160 0))) (and (or .cse193 (not .cse194) (not (= (+ .cse195 1) 1))) (or (not (= .cse195 1)) (and (not .cse193) .cse194)))) .cse196 .cse136) (or .cse125 .cse126 (let ((.cse197 (= (mod .cse162 2) 0)) (.cse198 (< .cse162 0)) (.cse199 (div .cse162 2))) (and (or (and (not .cse197) .cse198) (not (= .cse199 1))) (or .cse197 (not .cse198) (not (= (+ .cse199 1) 1))))) .cse200)) .cse184)) (.cse80 (or .cse147 (and (or .cse101 .cse176 .cse148 .cse75) (or .cse149 .cse115 .cse169)) .cse184)) (.cse53 (or .cse125 (let ((.cse182 (* (+ .cse123 .cse181) |ULTIMATE.start_main_~B~0#1|)) (.cse183 (* (+ .cse181 .cse124) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse101 (and (or .cse179 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse182 .cse180)) .cse107 .cse109) (or .cse104 (= (+ .cse183 .cse180) |ULTIMATE.start_main_~A~0#1|))) .cse102) (or .cse178 (and (or .cse107 (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse182)) .cse109) (or .cse104 (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse183)))) .cse112 .cse113)) .cse176 .cse75) (or (and (or .cse175 .cse117 (and (or .cse107 .cse109 (= |ULTIMATE.start_main_~A~0#1| (+ .cse174 .cse182))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse174 .cse183)) .cse104)) .cse119) (or .cse120 .cse170 (and (or .cse107 (= |ULTIMATE.start_main_~A~0#1| (+ .cse171 .cse182)) .cse109) (or (= (+ .cse183 .cse171) |ULTIMATE.start_main_~A~0#1|) .cse104)))) .cse115 .cse169))) .cse126)) (.cse54 (or (let ((.cse172 (* (+ .cse134 .cse181) |ULTIMATE.start_main_~B~0#1|)) (.cse173 (* (+ .cse181 .cse135) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse115 .cse169 (and (or .cse120 .cse170 (and (or .cse133 (= (+ .cse171 .cse172) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse173 .cse171) |ULTIMATE.start_main_~A~0#1|) .cse130 .cse131))) (or (and (or .cse130 .cse131 (= (+ .cse173 .cse174) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse174 .cse172)) .cse133)) .cse175 .cse117 .cse119))) (or .cse101 .cse176 (and (or (and (or (= (+ .cse177 .cse173) |ULTIMATE.start_main_~A~0#1|) .cse130 .cse131) (or (= (+ .cse177 .cse172) |ULTIMATE.start_main_~A~0#1|) .cse133)) .cse178 .cse112 .cse113) (or .cse179 (and (or (= (+ .cse172 .cse180) |ULTIMATE.start_main_~A~0#1|) .cse133) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse173 .cse180)) .cse130 .cse131)) .cse102)) .cse75))) .cse136)) (.cse56 (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse143 .cse161) .cse155)) .cse150 .cse1 (not .cse166) (let ((.cse167 (div (* |ULTIMATE.start_main_~p~0#1| 4) 8))) (and (or (not (= .cse167 1)) .cse136) (or .cse125 .cse126 (not (= (+ .cse167 1) 1))))) (let ((.cse168 (div (* |ULTIMATE.start_main_~d~0#1| 4) 8))) (and (or (not (= .cse143 .cse168)) .cse115) (or .cse101 (not (= (+ .cse168 1) .cse143)) .cse75))))) (.cse57 (let ((.cse163 (+ (- (* .cse164 2)) |ULTIMATE.start_main_~r~0#1|))) (or (not (>= .cse163 |ULTIMATE.start_main_~d~0#1|)) (>= .cse163 .cse164) (= (+ (+ .cse163 .cse30) (* (+ |ULTIMATE.start_main_~p~0#1| (+ |ULTIMATE.start_main_~q~0#1| (* 2 .cse165))) |ULTIMATE.start_main_~B~0#1|)) |ULTIMATE.start_main_~A~0#1|)))) (.cse59 (or .cse150 (let ((.cse153 (* (+ .cse161 .cse162) |ULTIMATE.start_main_~B~0#1|)) (.cse151 (* |ULTIMATE.start_main_~B~0#1| (+ .cse160 .cse161)))) (and (or .cse101 (let ((.cse152 (+ .cse154 .cse155))) (and (or (= (+ .cse151 .cse152) |ULTIMATE.start_main_~A~0#1|) .cse136) (or (= (+ .cse153 .cse152) |ULTIMATE.start_main_~A~0#1|) .cse125 .cse126))) (not (>= .cse155 .cse156)) .cse75) (or (let ((.cse157 (+ .cse158 .cse155))) (and (or .cse125 (= |ULTIMATE.start_main_~A~0#1| (+ .cse153 .cse157)) .cse126) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse157 .cse151)) .cse136))) .cse115 (not (>= .cse155 .cse159))))))) (.cse76 (<= 4 |ULTIMATE.start_main_~p~0#1|)) (.cse49 (or .cse147 .cse146 (and (or .cse101 .cse148 .cse114 .cse75) (or .cse72 .cse149 .cse115)))) (.cse51 (or .cse142 (and (or .cse101 (not (= .cse143 .cse144)) .cse75) (or (not (= .cse145 .cse143)) .cse115)) .cse1 .cse146)) (.cse55 (or .cse141 (not .cse45) .cse85)) (.cse79 (<= 2 |ULTIMATE.start_main_~d~0#1|)) (.cse48 (or .cse65 .cse24)) (.cse50 (or .cse101 .cse139 .cse140 .cse75)) (.cse3 (>= |ULTIMATE.start_main_~p~0#1| 1)) (.cse4 (or (and .cse21 .cse137 .cse38 .cse138) (and .cse21 .cse38))) (.cse84 (or (let ((.cse129 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse135))) (.cse132 (* |ULTIMATE.start_main_~B~0#1| (+ .cse134 |ULTIMATE.start_main_~q~0#1|)))) (and (or .cse101 (and (or .cse111 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse110 .cse129)) .cse130 .cse131) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse132 .cse110)) .cse133)) .cse112 .cse113) (or .cse102 .cse103 (and (or (= (+ .cse132 .cse105) |ULTIMATE.start_main_~A~0#1|) .cse133) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse105 .cse129)) .cse130 .cse131)))) .cse114 .cse75) (or .cse72 .cse115 (and (or .cse117 .cse118 .cse119 (and (or .cse130 (= |ULTIMATE.start_main_~A~0#1| (+ .cse116 .cse129)) .cse131) (or .cse133 (= |ULTIMATE.start_main_~A~0#1| (+ .cse116 .cse132))))) (or .cse120 (and (or (= (+ .cse122 .cse129) |ULTIMATE.start_main_~A~0#1|) .cse130 .cse131) (or (= (+ .cse122 .cse132) |ULTIMATE.start_main_~A~0#1|) .cse133)) .cse121))))) .cse136)) (.cse17 (>= |ULTIMATE.start_main_~A~0#1| .cse44)) (.cse60 (or .cse127 .cse128 .cse115)) (.cse87 (or (let ((.cse106 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse124))) (.cse108 (* |ULTIMATE.start_main_~B~0#1| (+ .cse123 |ULTIMATE.start_main_~q~0#1|)))) (and (or .cse101 (and (or .cse102 .cse103 (and (or .cse104 (= (+ .cse105 .cse106) |ULTIMATE.start_main_~A~0#1|)) (or .cse107 (= |ULTIMATE.start_main_~A~0#1| (+ .cse108 .cse105)) .cse109))) (or (and (or .cse104 (= |ULTIMATE.start_main_~A~0#1| (+ .cse110 .cse106))) (or .cse107 (= (+ .cse108 .cse110) |ULTIMATE.start_main_~A~0#1|) .cse109)) .cse111 .cse112 .cse113)) .cse114 .cse75) (or .cse72 .cse115 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse116 .cse108)) .cse107 .cse109) (or .cse104 (= (+ .cse116 .cse106) |ULTIMATE.start_main_~A~0#1|))) .cse117 .cse118 .cse119) (or .cse120 .cse121 (and (or .cse104 (= (+ .cse122 .cse106) |ULTIMATE.start_main_~A~0#1|)) (or .cse107 (= |ULTIMATE.start_main_~A~0#1| (+ .cse122 .cse108)) .cse109))))))) .cse125 .cse126))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (or (and (not (>= |ULTIMATE.start_main_~r~0#1| .cse5)) .cse6 (let ((.cse9 (= (mod .cse5 2) 0)) (.cse7 (< .cse5 0)) (.cse8 (div .cse10 4))) (or (and .cse7 (= (+ .cse8 1) |ULTIMATE.start_main_~d~0#1|) (not .cse9)) (and (or .cse9 (not .cse7)) (= |ULTIMATE.start_main_~d~0#1| .cse8))))) (and (not (>= |ULTIMATE.start_main_~r~0#1| .cse11)) (let ((.cse13 (= (mod .cse11 2) 0)) (.cse12 (< .cse11 0)) (.cse14 (div .cse11 2))) (or (and .cse12 (not .cse13) (= (+ .cse14 1) |ULTIMATE.start_main_~d~0#1|)) (and (or .cse13 (not .cse12)) (= .cse14 |ULTIMATE.start_main_~d~0#1|)))) .cse15 .cse16)) .cse17 .cse18) (and .cse19 (= |ULTIMATE.start_main_~d~0#1| 1) .cse20 .cse21 .cse22 .cse1 .cse23 (= |ULTIMATE.start_main_~r~0#1| (+ (- |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~A~0#1|)) .cse24 .cse18 (= |ULTIMATE.start_main_~q~0#1| (+ 0 1)) .cse25) (let ((.cse31 (+ |ULTIMATE.start_main_~A~0#1| (* (- 1) .cse35)))) (and (let ((.cse28 (< .cse31 0)) (.cse26 (div (+ |ULTIMATE.start_main_~A~0#1| .cse29 .cse30) 2)) (.cse27 (= (mod (+ |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0))) (or (and (= .cse26 |ULTIMATE.start_main_~d~0#1|) (or .cse27 (not .cse28))) (and .cse28 (= |ULTIMATE.start_main_~d~0#1| (+ .cse26 1)) (not .cse27)))) .cse32 .cse1 (= |ULTIMATE.start_main_~B~0#1| (+ (* (- 2) |ULTIMATE.start_main_~B~0#1|) .cse33 |ULTIMATE.start_main_~A~0#1|)) (= 2 .cse31) .cse34 (>= .cse35 |ULTIMATE.start_main_~d~0#1|) .cse36 .cse24 (= (+ (- 2) |ULTIMATE.start_main_~q~0#1|) 1) .cse37 .cse18 .cse38 (not (>= (+ .cse35 .cse31) .cse39)) .cse40 (= (+ (* (- 1) 2) .cse41) 0))) (and .cse21 .cse42 (= (* 2 .cse39) |ULTIMATE.start_main_~p~0#1|) .cse43 (>= |ULTIMATE.start_main_~r~0#1| .cse44) .cse45 .cse46 (= (* .cse44 2) |ULTIMATE.start_main_~d~0#1|) .cse18 .cse47) (and .cse21 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse45 .cse57 .cse18 .cse58 .cse59 .cse60) (and .cse1 .cse23 .cse43 .cse46 .cse18) (let ((.cse63 (+ |ULTIMATE.start_main_~r~0#1| .cse69))) (and .cse0 .cse61 .cse2 .cse62 (= .cse63 |ULTIMATE.start_main_~A~0#1|) .cse64 (>= .cse63 .cse44) .cse65 .cse45 (= |ULTIMATE.start_main_~q~0#1| 4) (let ((.cse67 (= (mod |ULTIMATE.start_main_~q~0#1| 2) 0)) (.cse68 (< |ULTIMATE.start_main_~q~0#1| 0)) (.cse66 (div |ULTIMATE.start_main_~q~0#1| 2))) (or (and (= .cse66 |ULTIMATE.start_main_~p~0#1|) (or .cse67 (not .cse68))) (and (not .cse67) .cse68 (= (+ .cse66 1) |ULTIMATE.start_main_~p~0#1|)))) .cse17 .cse18 .cse58)) (and .cse70 .cse71 .cse72 (= .cse44 |ULTIMATE.start_main_~d~0#1|) .cse73 (= |ULTIMATE.start_main_~p~0#1| .cse39) .cse43 (= |ULTIMATE.start_main_~d~0#1| .cse39) .cse65 .cse46 .cse18 .cse74 .cse75) (and .cse76 (= |ULTIMATE.start_main_~p~0#1| 4) .cse19 .cse21 .cse32 .cse77 .cse36 .cse78 (= |ULTIMATE.start_main_~d~0#1| .cse69) .cse79 .cse45 .cse24 (= (+ |ULTIMATE.start_main_~A~0#1| .cse30) |ULTIMATE.start_main_~r~0#1|) .cse17 .cse37 .cse18 .cse74 .cse25 (>= .cse35 .cse44)) (and .cse21 (or (and .cse80 .cse81 .cse21 .cse48 .cse49 .cse50 .cse42 .cse51 .cse53 .cse82 .cse54 .cse56 .cse45 .cse46 .cse57 .cse83 .cse84 .cse85 .cse18 .cse47 .cse59 .cse86 .cse60 .cse87) (and .cse81 .cse21 .cse48 .cse77 .cse49 .cse50 .cse42 .cse51 .cse52 .cse53 .cse82 .cse54 .cse56 .cse45 .cse46 .cse57 .cse83 .cse84 .cse18 .cse47 .cse59 .cse86 .cse60 .cse87)) .cse45 .cse46 .cse18) (and .cse62 (= |ULTIMATE.start_main_~d~0#1| .cse88) .cse43 .cse45 .cse46 .cse18 .cse89) (and .cse21 .cse49 .cse51 .cse55 .cse45 .cse18 .cse58) (and .cse61 .cse1 (= (+ (* (- 1) .cse88) |ULTIMATE.start_main_~q~0#1|) 0) .cse18 .cse38 (= .cse90 .cse91)) (and .cse19 .cse21 .cse77 .cse62 .cse64 .cse79 .cse24 (= .cse41 0) .cse18 .cse74 (= 2 |ULTIMATE.start_main_~d~0#1|) (not (>= .cse35 .cse39)) .cse89) (and .cse21 (let ((.cse92 (or (and .cse21 .cse48 .cse3 .cse4 .cse57) (and .cse21 .cse48 .cse3 .cse53 .cse54 .cse4 .cse57 .cse59) (and .cse21 .cse3 .cse4)))) (or (and .cse49 .cse51 .cse52 .cse55 .cse56 .cse92 .cse45 .cse18) (and .cse49 .cse51 .cse55 .cse92 .cse45 .cse18))) .cse45 .cse18) (and .cse80 .cse81 .cse21 .cse48 .cse77 .cse49 .cse50 .cse51 .cse53 .cse82 .cse54 .cse56 .cse45 .cse57 .cse83 .cse84 .cse18 .cse58 .cse59 .cse86 .cse60 .cse87) (and .cse21 (or (and .cse21 .cse48 .cse49 .cse50 .cse3 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse45 .cse4 .cse57 .cse18 .cse59 .cse60) (and .cse80 .cse21 .cse48 .cse49 .cse50 .cse3 .cse51 .cse53 .cse54 .cse55 .cse56 .cse45 .cse4 .cse57 .cse18 .cse59 .cse60)) .cse45 .cse18) (and .cse21 .cse49 .cse3 .cse51 .cse55 .cse45 .cse4 .cse84 .cse18 .cse87) (and .cse76 .cse21 .cse32 .cse77 .cse49 .cse36 .cse51 .cse78 .cse55 .cse79 .cse45 .cse24 .cse84 .cse37 .cse18 .cse74 .cse87) (let ((.cse99 (* |ULTIMATE.start_main_~B~0#1| (- 4)))) (let ((.cse100 (+ .cse99 |ULTIMATE.start_main_~A~0#1|))) (and .cse1 .cse23 (let ((.cse98 (+ .cse99 .cse33 |ULTIMATE.start_main_~A~0#1|))) (let ((.cse97 (+ .cse98 |ULTIMATE.start_main_~r~0#1|))) (let ((.cse93 (not (>= .cse97 .cse91))) (.cse94 (= .cse98 |ULTIMATE.start_main_~B~0#1|)) (.cse95 (= (+ |ULTIMATE.start_main_~q~0#1| (- 4)) 1)) (.cse96 (>= .cse97 .cse98))) (or (and .cse93 .cse48 .cse50 .cse94 .cse3 .cse95 .cse96 .cse4 .cse17 .cse18 .cse60) (and .cse93 .cse48 .cse50 .cse94 .cse3 .cse95 .cse96 .cse4 .cse84 .cse17 .cse18 .cse60 .cse87))))) .cse45 (>= (+ .cse69 .cse100) .cse44) (not (>= .cse100 .cse91)) (= |ULTIMATE.start_main_~r~0#1| (+ .cse30 .cse100)) (= |ULTIMATE.start_main_~q~0#1| (+ |ULTIMATE.start_main_~p~0#1| 4)) .cse18)))))))))))) [2023-02-17 02:08:32,430 INFO L899 garLoopResultBuilder]: For program point L37(lines 34 42) no Hoare annotation was computed. [2023-02-17 02:08:32,430 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-17 02:08:32,431 INFO L895 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (let ((.cse27 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse30 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse21 (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (let ((.cse11 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (.cse28 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse3 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse4 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse5 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse15 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse7 (div |ULTIMATE.start_main_~d~0#1| 2)) (.cse18 (and .cse30 (not .cse21))) (.cse22 (not .cse30)) (.cse26 (+ .cse27 1))) (let ((.cse6 (and (or (not (= .cse27 1)) .cse18) (or .cse21 .cse22 (not (= .cse26 1))))) (.cse10 (+ .cse7 1)) (.cse0 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse1 (let ((.cse29 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|))) (or (and .cse3 .cse29 .cse4 .cse5) (and .cse15 .cse29)))) (.cse9 (not .cse28)) (.cse8 (and (not .cse11) .cse28))) (let ((.cse12 (let ((.cse13 (let ((.cse20 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse27))) (.cse23 (* (+ |ULTIMATE.start_main_~q~0#1| .cse26) |ULTIMATE.start_main_~B~0#1|)) (.cse24 (- .cse7))) (let ((.cse14 (or (let ((.cse25 (+ |ULTIMATE.start_main_~r~0#1| .cse24))) (and (or (= (+ .cse20 .cse25) |ULTIMATE.start_main_~A~0#1|) .cse18) (or (= (+ .cse23 .cse25) |ULTIMATE.start_main_~A~0#1|) .cse21 .cse22))) .cse8)) (.cse16 (or .cse9 (let ((.cse19 (+ |ULTIMATE.start_main_~r~0#1| (+ (- 1) .cse24)))) (and (or .cse18 (= (+ .cse19 .cse20) |ULTIMATE.start_main_~A~0#1|)) (or .cse21 .cse22 (= |ULTIMATE.start_main_~A~0#1| (+ .cse23 .cse19))))) .cse11)) (.cse17 (= |ULTIMATE.start_main_~A~0#1| (+ (+ |ULTIMATE.start_main_~r~0#1| (- |ULTIMATE.start_main_~d~0#1|)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)))))) (or (and .cse14 .cse15 .cse16 .cse1 .cse17) (and .cse15 .cse1 .cse17) (and .cse14 .cse16 .cse1 (= |ULTIMATE.start_main_~r~0#1| (+ (- |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~A~0#1|)) .cse17 .cse5 (= |ULTIMATE.start_main_~q~0#1| (+ 0 1)))))))) (or (and (or .cse6 (and (or .cse9 .cse11 (= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| .cse10)) |ULTIMATE.start_main_~A~0#1|)) (or .cse8 (= |ULTIMATE.start_main_~A~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* .cse7 |ULTIMATE.start_main_~q~0#1|)))))) (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) .cse13) (and (= (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~d~0#1| 1) .cse0 (= (+ |ULTIMATE.start_main_~p~0#1| 0) |ULTIMATE.start_main_~q~0#1|) .cse13)))) (.cse2 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (or .cse6 (and (or (= .cse7 |ULTIMATE.start_main_~B~0#1|) .cse8) (or .cse9 (= |ULTIMATE.start_main_~B~0#1| .cse10) .cse11))) .cse12 .cse2) (and .cse0 .cse2 .cse4 .cse5) (and .cse0 .cse12 .cse2 .cse5)))))) [2023-02-17 02:08:32,431 INFO L899 garLoopResultBuilder]: For program point L46(lines 44 56) no Hoare annotation was computed. [2023-02-17 02:08:32,431 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-17 02:08:32,434 INFO L895 garLoopResultBuilder]: At program point L34-2(lines 34 42) the Hoare annotation is: (let ((.cse195 (div |ULTIMATE.start_main_~d~0#1| 2)) (.cse270 (div |ULTIMATE.start_main_~p~0#1| 2))) (let ((.cse237 (+ .cse270 1)) (.cse272 (- .cse195))) (let ((.cse271 (+ (- 1) .cse272)) (.cse109 (+ |ULTIMATE.start_main_~q~0#1| .cse237)) (.cse138 (+ |ULTIMATE.start_main_~q~0#1| .cse270)) (.cse282 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse43 (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (let ((.cse194 (+ .cse195 1)) (.cse89 (div .cse237 2)) (.cse123 (div |ULTIMATE.start_main_~p~0#1| 4)) (.cse141 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse15 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (.cse107 (+ |ULTIMATE.start_main_~r~0#1| .cse272)) (.cse42 (and .cse282 (not .cse43))) (.cse280 (* |ULTIMATE.start_main_~B~0#1| .cse138)) (.cse44 (not .cse282)) (.cse281 (* .cse109 |ULTIMATE.start_main_~B~0#1|)) (.cse105 (+ |ULTIMATE.start_main_~r~0#1| .cse271)) (.cse279 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse140 (- |ULTIMATE.start_main_~d~0#1|))) (let ((.cse226 (= .cse270 1)) (.cse224 (= .cse237 1)) (.cse5 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse24 (+ |ULTIMATE.start_main_~r~0#1| .cse140)) (.cse154 (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (.cse23 (not .cse279)) (.cse197 (and (or .cse42 (= (+ .cse105 .cse280) |ULTIMATE.start_main_~A~0#1|)) (or .cse43 .cse44 (= |ULTIMATE.start_main_~A~0#1| (+ .cse281 .cse105))))) (.cse90 (and (or (= (+ .cse280 .cse107) |ULTIMATE.start_main_~A~0#1|) .cse42) (or (= (+ .cse281 .cse107) |ULTIMATE.start_main_~A~0#1|) .cse43 .cse44))) (.cse35 (and (not .cse15) .cse279)) (.cse275 (not .cse141)) (.cse67 (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)) (.cse124 (+ .cse123 1)) (.cse277 (< .cse270 0)) (.cse120 (= (mod .cse270 2) 0)) (.cse73 (= (mod .cse237 2) 0)) (.cse278 (< .cse237 0)) (.cse88 (+ .cse89 1)) (.cse221 (div .cse194 2)) (.cse220 (div |ULTIMATE.start_main_~d~0#1| 4))) (let ((.cse219 (+ .cse220 1)) (.cse222 (+ .cse221 1)) (.cse230 (- .cse221)) (.cse227 (- .cse220)) (.cse82 (= (mod .cse195 2) 0)) (.cse273 (< .cse195 0)) (.cse274 (< .cse194 0)) (.cse78 (= (mod .cse194 2) 0)) (.cse92 (= .cse88 1)) (.cse75 (not .cse278)) (.cse70 (and .cse278 (not .cse73))) (.cse98 (= .cse89 1)) (.cse10 (>= |ULTIMATE.start_main_~r~0#1| .cse195)) (.cse80 (>= |ULTIMATE.start_main_~r~0#1| .cse194)) (.cse131 (= .cse123 1)) (.cse122 (and .cse277 (not .cse120))) (.cse125 (= .cse124 1)) (.cse119 (not .cse277)) (.cse41 (* 2 |ULTIMATE.start_main_~p~0#1|)) (.cse33 (* 2 |ULTIMATE.start_main_~d~0#1|)) (.cse238 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse18 (or .cse275 .cse67)) (.cse266 (or .cse90 .cse35)) (.cse0 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse267 (or .cse23 .cse197 .cse15)) (.cse3 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse4 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)) (.cse199 (= |ULTIMATE.start_main_~A~0#1| (+ .cse24 (* |ULTIMATE.start_main_~B~0#1| .cse154)))) (.cse6 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse7 (or .cse5 (and (= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0) (not .cse5)))) (.cse193 (and (or (not .cse226) .cse42) (or .cse43 .cse44 (not .cse224))))) (let ((.cse1 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse218 (>= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse8 (let ((.cse276 (or .cse193 (and (or .cse23 .cse15 (= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| .cse194)) |ULTIMATE.start_main_~A~0#1|)) (or .cse35 (= |ULTIMATE.start_main_~A~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* .cse195 |ULTIMATE.start_main_~q~0#1|)))))))) (or (and .cse266 .cse0 .cse267 .cse18 .cse276 .cse3 .cse4 .cse5 .cse199 .cse6 .cse7) (and .cse266 .cse0 .cse267 .cse276 .cse3 .cse4 .cse5 .cse199 .cse67 .cse6 .cse7)))) (.cse9 (or .cse193 (and (or (= .cse195 |ULTIMATE.start_main_~B~0#1|) .cse35) (or .cse23 (= |ULTIMATE.start_main_~B~0#1| .cse194) .cse15)))) (.cse12 (<= 2 .cse195)) (.cse14 (or .cse275 .cse238)) (.cse115 (+ (- .cse33) |ULTIMATE.start_main_~r~0#1|)) (.cse117 (+ |ULTIMATE.start_main_~q~0#1| .cse41)) (.cse225 (and (or (not .cse131) .cse122) (or (not .cse125) .cse119 .cse120))) (.cse66 (>= .cse24 .cse195)) (.cse63 (>= .cse24 .cse194)) (.cse198 (not .cse80)) (.cse91 (not .cse10)) (.cse223 (and (or (not .cse92) .cse73 .cse75) (or .cse70 (not .cse98)))) (.cse68 (and .cse274 (not .cse78))) (.cse79 (not .cse274)) (.cse85 (and (not .cse82) .cse273)) (.cse84 (not .cse273)) (.cse228 (+ (- 1) .cse227)) (.cse229 (+ (- 1) .cse230)) (.cse190 (>= .cse105 .cse222)) (.cse182 (>= .cse105 .cse221)) (.cse165 (>= .cse107 .cse220)) (.cse164 (>= .cse107 .cse219)) (.cse2 (* 2 1))) (let ((.cse21 (<= 8 |ULTIMATE.start_main_~p~0#1|)) (.cse13 (* 2 .cse2)) (.cse55 (let ((.cse256 (not .cse164)) (.cse257 (not .cse165)) (.cse259 (not .cse182)) (.cse251 (+ .cse105 .cse230)) (.cse260 (not .cse190)) (.cse249 (+ .cse105 .cse229)) (.cse250 (* (+ .cse109 .cse89) |ULTIMATE.start_main_~B~0#1|)) (.cse248 (* (+ .cse88 .cse109) |ULTIMATE.start_main_~B~0#1|)) (.cse258 (+ .cse227 .cse107)) (.cse253 (* (+ .cse123 .cse138) |ULTIMATE.start_main_~B~0#1|)) (.cse254 (+ .cse228 .cse107)) (.cse252 (* (+ .cse124 .cse138) |ULTIMATE.start_main_~B~0#1|)) (.cse261 (+ .cse24 .cse272)) (.cse263 (+ .cse24 .cse271))) (let ((.cse241 (or .cse141 (let ((.cse269 (* (+ .cse154 .cse237) |ULTIMATE.start_main_~B~0#1|)) (.cse268 (* (+ .cse154 .cse270) |ULTIMATE.start_main_~B~0#1|))) (and (or (and (or (= (+ .cse268 .cse261) |ULTIMATE.start_main_~A~0#1|) .cse42) (or .cse43 .cse44 (= |ULTIMATE.start_main_~A~0#1| (+ .cse261 .cse269)))) .cse35) (or .cse23 (and (or .cse43 (= |ULTIMATE.start_main_~A~0#1| (+ .cse263 .cse269)) .cse44) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse263 .cse268)) .cse42)) .cse15))))) (.cse242 (or (and (or .cse224 .cse43 .cse44 (and (or .cse82 .cse84 (and (or .cse73 (= (+ .cse254 .cse248) |ULTIMATE.start_main_~A~0#1|) .cse75) (or .cse70 (= |ULTIMATE.start_main_~A~0#1| (+ .cse250 .cse254))))) (or .cse85 (and (or .cse70 (= (+ .cse250 .cse258) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse248 .cse258)) .cse73 .cse75))))) (or (and (or .cse85 (and (or (= (+ .cse253 .cse258) |ULTIMATE.start_main_~A~0#1|) .cse122) (or (= (+ .cse258 .cse252) |ULTIMATE.start_main_~A~0#1|) .cse119 .cse120))) (or (and (or .cse122 (= (+ .cse253 .cse254) |ULTIMATE.start_main_~A~0#1|)) (or .cse119 .cse120 (= |ULTIMATE.start_main_~A~0#1| (+ .cse254 .cse252)))) .cse82 .cse84)) .cse42 .cse226)) .cse35)) (.cse243 (or .cse141 (and .cse266 .cse267))) (.cse239 (or .cse223 .cse43 (let ((.cse265 (+ .cse109 1))) (and (or .cse35 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse254 (* .cse265 .cse219))) .cse82 .cse84 .cse256) (or .cse85 .cse257 (= (+ (* .cse265 .cse220) .cse258) |ULTIMATE.start_main_~A~0#1|)))) (or .cse23 (and (or .cse259 (= |ULTIMATE.start_main_~A~0#1| (+ .cse251 (* .cse265 .cse221))) .cse68) (or .cse260 .cse78 .cse79 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse265 .cse222) .cse249)))) .cse15))) .cse44)) (.cse244 (or .cse193 (let ((.cse264 (+ |ULTIMATE.start_main_~q~0#1| 1))) (and (or .cse23 .cse198 .cse15 (= |ULTIMATE.start_main_~A~0#1| (+ .cse105 (* .cse264 .cse194)))) (or .cse91 .cse35 (= (+ (* .cse195 .cse264) .cse107) |ULTIMATE.start_main_~A~0#1|)))))) (.cse245 (or .cse193 (let ((.cse262 (+ .cse154 1))) (and (or (not .cse66) .cse35 (= (+ .cse261 (* .cse195 .cse262)) |ULTIMATE.start_main_~A~0#1|)) (or .cse23 (not .cse63) (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse262 .cse194) .cse263)) .cse15))))) (.cse240 (or .cse225 (let ((.cse255 (+ .cse138 1))) (and (or .cse35 (and (or (= (+ .cse254 (* .cse255 .cse219)) |ULTIMATE.start_main_~A~0#1|) .cse82 .cse84 .cse256) (or .cse85 .cse257 (= (+ .cse258 (* .cse255 .cse220)) |ULTIMATE.start_main_~A~0#1|)))) (or .cse23 (and (or .cse259 .cse68 (= |ULTIMATE.start_main_~A~0#1| (+ .cse251 (* .cse255 .cse221)))) (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse255 .cse222) .cse249)) .cse260 .cse78 .cse79)) .cse15))) .cse42)) (.cse246 (or (= .cse41 1) (= |ULTIMATE.start_main_~A~0#1| (+ (+ .cse115 .cse140) (* |ULTIMATE.start_main_~B~0#1| (+ .cse117 |ULTIMATE.start_main_~p~0#1|)))))) (.cse247 (or .cse23 .cse15 (and (or .cse224 .cse43 .cse44 (and (or (and (or (= (+ .cse248 .cse249) |ULTIMATE.start_main_~A~0#1|) .cse73 .cse75) (or .cse70 (= |ULTIMATE.start_main_~A~0#1| (+ .cse250 .cse249)))) .cse78 .cse79) (or .cse68 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse251 .cse248)) .cse73 .cse75) (or .cse70 (= (+ .cse251 .cse250) |ULTIMATE.start_main_~A~0#1|)))))) (or (and (or (and (or .cse119 .cse120 (= (+ .cse251 .cse252) |ULTIMATE.start_main_~A~0#1|)) (or .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ .cse251 .cse253)))) .cse68) (or .cse78 .cse79 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse249 .cse252)) .cse119 .cse120) (or (= (+ .cse253 .cse249) |ULTIMATE.start_main_~A~0#1|) .cse122)))) .cse42 .cse226))))) (or (and (or .cse218 (and .cse239 .cse240)) .cse8 .cse9 .cse0 .cse241 .cse10 .cse18 .cse242 .cse12 .cse243 .cse244 .cse245 .cse199 .cse246 .cse14 .cse247 .cse15) (and .cse8 .cse9 .cse0 .cse241 .cse10 .cse18 .cse242 .cse12 .cse243 .cse239 .cse244 .cse245 .cse199 .cse240 .cse246 .cse14 .cse247 .cse15) (and .cse8 .cse9 .cse0 .cse241 .cse10 .cse242 .cse12 .cse243 .cse239 .cse244 .cse245 .cse199 .cse240 .cse246 .cse67 .cse14 .cse247 .cse15))))) (.cse11 (* 2 .cse1))) (or (and .cse0 (= |ULTIMATE.start_main_~d~0#1| .cse1) (= |ULTIMATE.start_main_~d~0#1| .cse2) (<= 2 |ULTIMATE.start_main_~p~0#1|) (<= 2 |ULTIMATE.start_main_~d~0#1|) .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_main_~p~0#1| .cse2)) (and (<= 4 |ULTIMATE.start_main_~p~0#1|) .cse8 .cse9 .cse0 .cse10 (= .cse11 |ULTIMATE.start_main_~d~0#1|) .cse12 (= |ULTIMATE.start_main_~p~0#1| .cse13) .cse3 (= |ULTIMATE.start_main_~d~0#1| .cse13) .cse4 .cse5 .cse6 .cse14 .cse15) (and .cse0 (let ((.cse233 (< .cse219 0)) (.cse162 (= (mod .cse219 2) 0)) (.cse169 (= (mod .cse220 2) 0)) (.cse234 (< .cse220 0)) (.cse188 (= (mod .cse222 2) 0)) (.cse235 (< .cse222 0)) (.cse178 (= (mod .cse221 2) 0)) (.cse236 (< .cse221 0)) (.cse215 (div .cse219 2)) (.cse214 (div |ULTIMATE.start_main_~d~0#1| 8)) (.cse210 (div .cse194 4)) (.cse204 (div .cse222 2))) (let ((.cse135 (div |ULTIMATE.start_main_~p~0#1| 8)) (.cse129 (div .cse124 2)) (.cse126 (= (mod .cse124 2) 0)) (.cse206 (< .cse124 0)) (.cse205 (- .cse204)) (.cse209 (- .cse210)) (.cse132 (= (mod .cse123 2) 0)) (.cse211 (< .cse123 0)) (.cse213 (- .cse214)) (.cse216 (- .cse215)) (.cse100 (div .cse237 4)) (.cse94 (div .cse88 2)) (.cse96 (= (mod .cse88 2) 0)) (.cse231 (< .cse88 0)) (.cse101 (= (mod .cse89 2) 0)) (.cse232 (< .cse89 0)) (.cse180 (and (not .cse178) .cse236)) (.cse175 (not .cse236)) (.cse208 (+ .cse210 1)) (.cse187 (not .cse235)) (.cse207 (+ .cse204 1)) (.cse183 (and (not .cse188) .cse235)) (.cse168 (and (not .cse169) .cse234)) (.cse172 (not .cse234)) (.cse212 (+ .cse214 1)) (.cse155 (and .cse233 (not .cse162))) (.cse161 (not .cse233)) (.cse28 (* |ULTIMATE.start_main_~B~0#1| 1)) (.cse217 (+ .cse215 1)) (.cse40 (div .cse41 4)) (.cse34 (div .cse33 4))) (let ((.cse25 (+ .cse34 1)) (.cse48 (+ .cse40 1)) (.cse77 (not (>= |ULTIMATE.start_main_~r~0#1| .cse222))) (.cse76 (+ .cse229 |ULTIMATE.start_main_~r~0#1|)) (.cse69 (not (>= |ULTIMATE.start_main_~r~0#1| .cse221))) (.cse71 (+ |ULTIMATE.start_main_~r~0#1| .cse230)) (.cse83 (not (>= |ULTIMATE.start_main_~r~0#1| .cse219))) (.cse81 (+ .cse228 |ULTIMATE.start_main_~r~0#1|)) (.cse87 (+ .cse227 |ULTIMATE.start_main_~r~0#1|)) (.cse86 (not (>= |ULTIMATE.start_main_~r~0#1| .cse220))) (.cse108 (and (or .cse85 (and (or (not (= .cse28 .cse214)) .cse168) (or .cse169 .cse172 (not (= .cse28 .cse212)))) .cse165) (or .cse82 (and (or (not (= .cse28 .cse215)) .cse155) (or .cse161 .cse162 (not (= .cse28 .cse217)))) .cse84 .cse164))) (.cse104 (and (or (and (or (not (= .cse28 .cse210)) .cse180) (or .cse175 (not (= .cse28 .cse208)) .cse178)) .cse68 .cse182) (or (and (or .cse187 .cse188 (not (= .cse28 .cse207))) (or .cse183 (not (= .cse28 .cse204)))) .cse78 .cse79 .cse190))) (.cse110 (>= .cse115 |ULTIMATE.start_main_~d~0#1|)) (.cse102 (not .cse232)) (.cse99 (and (not .cse101) .cse232)) (.cse97 (not .cse231)) (.cse93 (and (not .cse96) .cse231)) (.cse95 (+ .cse94 1)) (.cse103 (+ .cse100 1)) (.cse152 (not (>= .cse24 .cse221))) (.cse153 (+ .cse24 .cse230)) (.cse151 (not (>= .cse24 .cse222))) (.cse150 (+ .cse229 .cse24)) (.cse149 (not (>= .cse24 .cse219))) (.cse148 (+ .cse24 .cse228)) (.cse144 (not (>= .cse24 .cse220))) (.cse145 (+ .cse227 .cse24)) (.cse62 (and (or .cse223 .cse224 .cse43 .cse44) (or .cse225 .cse42 .cse226))) (.cse196 (= (+ |ULTIMATE.start_main_~r~0#1| (* .cse28 |ULTIMATE.start_main_~q~0#1|)) |ULTIMATE.start_main_~A~0#1|)) (.cse64 (and (or .cse68 (not (= .cse28 .cse221))) (or (not (= .cse28 .cse222)) .cse78 .cse79))) (.cse65 (and (or .cse82 (not (= .cse28 .cse219)) .cse84) (or .cse85 (not (= .cse28 .cse220))))) (.cse36 (not .cse218)) (.cse160 (not (>= .cse107 .cse217))) (.cse163 (+ (+ (- 1) .cse216) .cse107)) (.cse156 (+ .cse107 .cse216)) (.cse159 (not (>= .cse107 .cse215))) (.cse167 (+ .cse107 .cse213)) (.cse166 (not (>= .cse107 .cse214))) (.cse171 (+ (+ (- 1) .cse213) .cse107)) (.cse170 (not (>= .cse107 .cse212))) (.cse136 (and (not .cse132) .cse211)) (.cse134 (not .cse211)) (.cse179 (+ .cse209 .cse105)) (.cse181 (not (>= .cse105 .cse210))) (.cse176 (+ .cse105 (+ (- 1) .cse209))) (.cse177 (not (>= .cse105 .cse208))) (.cse189 (not (>= .cse105 .cse207))) (.cse186 (+ .cse105 (+ (- 1) .cse205))) (.cse127 (not .cse206)) (.cse130 (and (not .cse126) .cse206)) (.cse185 (+ .cse105 .cse205)) (.cse184 (not (>= .cse105 .cse204))) (.cse128 (+ 1 .cse129)) (.cse133 (+ .cse135 1))) (let ((.cse49 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse28 .cse154) .cse24))) (.cse16 (or (let ((.cse200 (* |ULTIMATE.start_main_~B~0#1| (+ .cse138 .cse135))) (.cse201 (* |ULTIMATE.start_main_~B~0#1| (+ .cse133 .cse138))) (.cse203 (* |ULTIMATE.start_main_~B~0#1| (+ .cse128 .cse138))) (.cse202 (* (+ .cse138 .cse129) |ULTIMATE.start_main_~B~0#1|))) (and (or (and (or (and (or .cse85 (and (or .cse169 .cse170 (and (or (= (+ .cse171 .cse200) |ULTIMATE.start_main_~A~0#1|) .cse136) (or (= (+ .cse171 .cse201) |ULTIMATE.start_main_~A~0#1|) .cse132 .cse134)) .cse172) (or .cse166 (and (or .cse132 .cse134 (= |ULTIMATE.start_main_~A~0#1| (+ .cse167 .cse201))) (or (= (+ .cse167 .cse200) |ULTIMATE.start_main_~A~0#1|) .cse136)) .cse168)) .cse165) (or (and (or (and (or .cse132 .cse134 (= |ULTIMATE.start_main_~A~0#1| (+ .cse156 .cse201))) (or .cse136 (= (+ .cse156 .cse200) |ULTIMATE.start_main_~A~0#1|))) .cse155 .cse159) (or .cse160 .cse161 .cse162 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse163 .cse200)) .cse136) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse163 .cse201)) .cse132 .cse134)))) .cse82 .cse84 .cse164)) .cse122) (or .cse119 .cse120 (and (or (and (or .cse160 .cse161 .cse162 (and (or .cse130 (= (+ .cse202 .cse163) |ULTIMATE.start_main_~A~0#1|)) (or .cse126 .cse127 (= |ULTIMATE.start_main_~A~0#1| (+ .cse203 .cse163))))) (or .cse155 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse156 .cse202)) .cse130) (or .cse126 .cse127 (= |ULTIMATE.start_main_~A~0#1| (+ .cse156 .cse203)))) .cse159)) .cse82 .cse84 .cse164) (or .cse85 (and (or (and (or .cse126 (= (+ .cse167 .cse203) |ULTIMATE.start_main_~A~0#1|) .cse127) (or .cse130 (= (+ .cse167 .cse202) |ULTIMATE.start_main_~A~0#1|))) .cse166 .cse168) (or .cse169 (and (or .cse126 .cse127 (= |ULTIMATE.start_main_~A~0#1| (+ .cse203 .cse171))) (or (= (+ .cse202 .cse171) |ULTIMATE.start_main_~A~0#1|) .cse130)) .cse170 .cse172)) .cse165)))) .cse35) (or .cse23 (and (or (and (or .cse68 .cse182 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse200 .cse179)) .cse136) (or .cse132 (= (+ .cse201 .cse179) |ULTIMATE.start_main_~A~0#1|) .cse134)) .cse180 .cse181) (or .cse175 .cse177 (and (or (= (+ .cse176 .cse200) |ULTIMATE.start_main_~A~0#1|) .cse136) (or .cse132 (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse201)) .cse134)) .cse178))) (or (and (or .cse187 (and (or .cse132 (= |ULTIMATE.start_main_~A~0#1| (+ .cse186 .cse201)) .cse134) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse186 .cse200)) .cse136)) .cse188 .cse189) (or .cse183 .cse184 (and (or .cse136 (= (+ .cse185 .cse200) |ULTIMATE.start_main_~A~0#1|)) (or .cse132 (= (+ .cse185 .cse201) |ULTIMATE.start_main_~A~0#1|) .cse134)))) .cse78 .cse79 .cse190)) .cse122) (or (and (or (and (or (and (or .cse130 (= (+ .cse202 .cse179) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse203 .cse179) |ULTIMATE.start_main_~A~0#1|) .cse126 .cse127)) .cse180 .cse181) (or .cse175 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse203)) .cse126 .cse127) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse202)) .cse130)) .cse177 .cse178)) .cse68 .cse182) (or (and (or .cse187 .cse188 .cse189 (and (or .cse126 .cse127 (= |ULTIMATE.start_main_~A~0#1| (+ .cse186 .cse203))) (or .cse130 (= |ULTIMATE.start_main_~A~0#1| (+ .cse186 .cse202))))) (or (and (or (= (+ .cse185 .cse203) |ULTIMATE.start_main_~A~0#1|) .cse126 .cse127) (or .cse130 (= (+ .cse185 .cse202) |ULTIMATE.start_main_~A~0#1|))) .cse183 .cse184)) .cse78 .cse79 .cse190)) .cse119 .cse120)) .cse15))) .cse42)) (.cse17 (or .cse36 .cse199)) (.cse19 (or .cse62 .cse196 (and (or .cse23 .cse64 .cse80 .cse15) (or .cse10 .cse65 .cse35)))) (.cse20 (or .cse23 .cse197 .cse198 .cse15)) (.cse22 (or .cse193 (and (or .cse23 (not (= .cse28 .cse194)) .cse15) (or (not (= .cse195 .cse28)) .cse35)) .cse141 .cse196)) (.cse50 (or .cse43 (let ((.cse191 (* (+ .cse88 .cse154) |ULTIMATE.start_main_~B~0#1|)) (.cse192 (* (+ .cse154 .cse89) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse23 (and (or .cse152 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse191 .cse153)) .cse73 .cse75) (or .cse70 (= (+ .cse192 .cse153) |ULTIMATE.start_main_~A~0#1|))) .cse68) (or .cse151 (and (or .cse73 (= |ULTIMATE.start_main_~A~0#1| (+ .cse150 .cse191)) .cse75) (or .cse70 (= |ULTIMATE.start_main_~A~0#1| (+ .cse150 .cse192)))) .cse78 .cse79)) .cse63 .cse15) (or (and (or .cse149 .cse82 (and (or .cse73 .cse75 (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse191))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse192)) .cse70)) .cse84) (or .cse85 .cse144 (and (or .cse73 (= |ULTIMATE.start_main_~A~0#1| (+ .cse145 .cse191)) .cse75) (or (= (+ .cse192 .cse145) |ULTIMATE.start_main_~A~0#1|) .cse70)))) .cse35 .cse66))) .cse44)) (.cse51 (or (let ((.cse173 (* (+ .cse103 .cse109) |ULTIMATE.start_main_~B~0#1|)) (.cse174 (* (+ .cse109 .cse100) |ULTIMATE.start_main_~B~0#1|)) (.cse158 (* |ULTIMATE.start_main_~B~0#1| (+ .cse95 .cse109))) (.cse157 (* |ULTIMATE.start_main_~B~0#1| (+ .cse109 .cse94)))) (and (or .cse35 (and (or .cse73 (and (or (and (or .cse155 (and (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ .cse156 .cse157))) (or .cse96 (= (+ .cse158 .cse156) |ULTIMATE.start_main_~A~0#1|) .cse97)) .cse159) (or .cse160 .cse161 .cse162 (and (or (= (+ .cse163 .cse157) |ULTIMATE.start_main_~A~0#1|) .cse93) (or .cse96 (= |ULTIMATE.start_main_~A~0#1| (+ .cse158 .cse163)) .cse97)))) .cse82 .cse84 .cse164) (or .cse85 .cse165 (and (or .cse166 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse167 .cse157)) .cse93) (or .cse96 .cse97 (= (+ .cse167 .cse158) |ULTIMATE.start_main_~A~0#1|))) .cse168) (or .cse169 .cse170 (and (or .cse96 .cse97 (= |ULTIMATE.start_main_~A~0#1| (+ .cse158 .cse171))) (or .cse93 (= (+ .cse157 .cse171) |ULTIMATE.start_main_~A~0#1|))) .cse172)))) .cse75) (or .cse70 (and (or (and (or (and (or .cse101 (= (+ .cse163 .cse173) |ULTIMATE.start_main_~A~0#1|) .cse102) (or .cse99 (= (+ .cse174 .cse163) |ULTIMATE.start_main_~A~0#1|))) .cse160 .cse161 .cse162) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse156 .cse174)) .cse99) (or .cse101 .cse102 (= |ULTIMATE.start_main_~A~0#1| (+ .cse156 .cse173)))) .cse155 .cse159)) .cse82 .cse84 .cse164) (or .cse85 (and (or .cse169 .cse170 .cse172 (and (or .cse99 (= (+ .cse174 .cse171) |ULTIMATE.start_main_~A~0#1|)) (or .cse101 .cse102 (= (+ .cse173 .cse171) |ULTIMATE.start_main_~A~0#1|)))) (or .cse166 .cse168 (and (or .cse101 .cse102 (= (+ .cse167 .cse173) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse167 .cse174) |ULTIMATE.start_main_~A~0#1|) .cse99)))) .cse165))))) (or .cse23 (and (or .cse70 (and (or .cse68 (and (or .cse175 (and (or (= (+ .cse176 .cse173) |ULTIMATE.start_main_~A~0#1|) .cse101 .cse102) (or .cse99 (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse174)))) .cse177 .cse178) (or (and (or .cse101 (= (+ .cse173 .cse179) |ULTIMATE.start_main_~A~0#1|) .cse102) (or .cse99 (= |ULTIMATE.start_main_~A~0#1| (+ .cse174 .cse179)))) .cse180 .cse181)) .cse182) (or (and (or .cse183 .cse184 (and (or .cse101 (= |ULTIMATE.start_main_~A~0#1| (+ .cse185 .cse173)) .cse102) (or .cse99 (= (+ .cse185 .cse174) |ULTIMATE.start_main_~A~0#1|)))) (or (and (or .cse101 (= (+ .cse186 .cse173) |ULTIMATE.start_main_~A~0#1|) .cse102) (or .cse99 (= |ULTIMATE.start_main_~A~0#1| (+ .cse186 .cse174)))) .cse187 .cse188 .cse189)) .cse78 .cse79 .cse190))) (or .cse73 (and (or .cse78 (and (or .cse187 (and (or .cse96 .cse97 (= (+ .cse186 .cse158) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse186 .cse157)) .cse93)) .cse188 .cse189) (or .cse183 (and (or .cse96 (= (+ .cse185 .cse158) |ULTIMATE.start_main_~A~0#1|) .cse97) (or .cse93 (= (+ .cse185 .cse157) |ULTIMATE.start_main_~A~0#1|))) .cse184)) .cse79 .cse190) (or (and (or .cse175 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse158 .cse176)) .cse96 .cse97) (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse157)))) .cse177 .cse178) (or (and (or (= (+ .cse158 .cse179) |ULTIMATE.start_main_~A~0#1|) .cse96 .cse97) (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ .cse157 .cse179)))) .cse180 .cse181)) .cse68 .cse182)) .cse75)) .cse15))) .cse43 .cse44)) (.cse52 (or (let ((.cse146 (* (+ .cse123 .cse154) |ULTIMATE.start_main_~B~0#1|)) (.cse147 (* (+ .cse154 .cse124) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse35 .cse66 (and (or .cse85 .cse144 (and (or .cse122 (= (+ .cse145 .cse146) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse147 .cse145) |ULTIMATE.start_main_~A~0#1|) .cse119 .cse120))) (or (and (or .cse119 .cse120 (= (+ .cse147 .cse148) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse146)) .cse122)) .cse149 .cse82 .cse84))) (or .cse23 .cse63 (and (or (and (or (= (+ .cse150 .cse147) |ULTIMATE.start_main_~A~0#1|) .cse119 .cse120) (or (= (+ .cse150 .cse146) |ULTIMATE.start_main_~A~0#1|) .cse122)) .cse151 .cse78 .cse79) (or .cse152 (and (or (= (+ .cse146 .cse153) |ULTIMATE.start_main_~A~0#1|) .cse122) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse147 .cse153)) .cse119 .cse120)) .cse68)) .cse15))) .cse42)) (.cse53 (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse28 .cse117) .cse115)) .cse110 .cse141 (not (>= |ULTIMATE.start_main_~r~0#1| .cse33)) (let ((.cse142 (div (* |ULTIMATE.start_main_~p~0#1| 4) 8))) (and (or (not (= .cse142 1)) .cse42) (or .cse43 .cse44 (not (= (+ .cse142 1) 1))))) (let ((.cse143 (div (* |ULTIMATE.start_main_~d~0#1| 4) 8))) (and (or (not (= .cse28 .cse143)) .cse35) (or .cse23 (not (= (+ .cse143 1) .cse28)) .cse15))))) (.cse54 (let ((.cse139 (+ (- (* .cse33 2)) |ULTIMATE.start_main_~r~0#1|))) (or (not (>= .cse139 |ULTIMATE.start_main_~d~0#1|)) (>= .cse139 .cse33) (= (+ (+ .cse139 .cse140) (* (+ |ULTIMATE.start_main_~p~0#1| (+ |ULTIMATE.start_main_~q~0#1| (* 2 .cse41))) |ULTIMATE.start_main_~B~0#1|)) |ULTIMATE.start_main_~A~0#1|)))) (.cse56 (or (and (or .cse125 (and (or .cse126 .cse127 (not (= .cse128 1))) (or (not (= 1 .cse129)) .cse130)) .cse119 .cse120) (or .cse131 (and (or .cse132 (not (= .cse133 1)) .cse134) (or (not (= .cse135 1)) .cse136)) .cse122)) (let ((.cse137 (* .cse28 .cse138))) (and (or (= (+ .cse137 .cse107) |ULTIMATE.start_main_~A~0#1|) .cse35 .cse108) (or .cse23 .cse104 (= (+ .cse105 .cse137) |ULTIMATE.start_main_~A~0#1|) .cse15))) .cse42)) (.cse57 (or (let ((.cse118 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse124))) (.cse121 (* |ULTIMATE.start_main_~B~0#1| (+ .cse123 |ULTIMATE.start_main_~q~0#1|)))) (and (or .cse23 (and (or .cse77 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse76 .cse118)) .cse119 .cse120) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse121 .cse76)) .cse122)) .cse78 .cse79) (or .cse68 .cse69 (and (or (= (+ .cse121 .cse71) |ULTIMATE.start_main_~A~0#1|) .cse122) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse118)) .cse119 .cse120)))) .cse80 .cse15) (or .cse10 .cse35 (and (or .cse82 .cse83 .cse84 (and (or .cse119 (= |ULTIMATE.start_main_~A~0#1| (+ .cse81 .cse118)) .cse120) (or .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ .cse81 .cse121))))) (or .cse85 (and (or (= (+ .cse87 .cse118) |ULTIMATE.start_main_~A~0#1|) .cse119 .cse120) (or (= (+ .cse87 .cse121) |ULTIMATE.start_main_~A~0#1|) .cse122)) .cse86))))) .cse42)) (.cse58 (or .cse110 (let ((.cse113 (* (+ .cse117 .cse48) |ULTIMATE.start_main_~B~0#1|)) (.cse111 (* |ULTIMATE.start_main_~B~0#1| (+ .cse40 .cse117))) (.cse114 (- .cse34))) (and (or .cse23 (let ((.cse112 (+ (+ (- 1) .cse114) .cse115))) (and (or (= (+ .cse111 .cse112) |ULTIMATE.start_main_~A~0#1|) .cse42) (or (= (+ .cse113 .cse112) |ULTIMATE.start_main_~A~0#1|) .cse43 .cse44))) (not (>= .cse115 .cse25)) .cse15) (or (let ((.cse116 (+ .cse114 .cse115))) (and (or .cse43 (= |ULTIMATE.start_main_~A~0#1| (+ .cse113 .cse116)) .cse44) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse116 .cse111)) .cse42))) .cse35 (not (>= .cse115 .cse34))))))) (.cse59 (or (and (or .cse73 .cse92 .cse75 (and (or .cse93 (not (= .cse94 1))) (or (not (= .cse95 1)) .cse96 .cse97))) (or .cse70 .cse98 (and (or .cse99 (not (= .cse100 1))) (or .cse101 .cse102 (not (= .cse103 1)))))) .cse43 (let ((.cse106 (* .cse109 .cse28))) (and (or .cse23 .cse104 (= |ULTIMATE.start_main_~A~0#1| (+ .cse105 .cse106)) .cse15) (or .cse35 (= (+ .cse107 .cse106) |ULTIMATE.start_main_~A~0#1|) .cse108))) .cse44)) (.cse60 (or .cse90 .cse91 .cse35)) (.cse61 (or (let ((.cse72 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse89))) (.cse74 (* |ULTIMATE.start_main_~B~0#1| (+ .cse88 |ULTIMATE.start_main_~q~0#1|)))) (and (or .cse23 (and (or .cse68 .cse69 (and (or .cse70 (= (+ .cse71 .cse72) |ULTIMATE.start_main_~A~0#1|)) (or .cse73 (= |ULTIMATE.start_main_~A~0#1| (+ .cse74 .cse71)) .cse75))) (or (and (or .cse70 (= |ULTIMATE.start_main_~A~0#1| (+ .cse76 .cse72))) (or .cse73 (= (+ .cse74 .cse76) |ULTIMATE.start_main_~A~0#1|) .cse75)) .cse77 .cse78 .cse79)) .cse80 .cse15) (or .cse10 .cse35 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse81 .cse74)) .cse73 .cse75) (or .cse70 (= (+ .cse81 .cse72) |ULTIMATE.start_main_~A~0#1|))) .cse82 .cse83 .cse84) (or .cse85 .cse86 (and (or .cse70 (= (+ .cse87 .cse72) |ULTIMATE.start_main_~A~0#1|)) (or .cse73 (= |ULTIMATE.start_main_~A~0#1| (+ .cse87 .cse74)) .cse75))))))) .cse43 .cse44))) (or (and .cse16 .cse0 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (or (and (or .cse23 (>= .cse24 .cse25) (let ((.cse29 (< .cse25 0)) (.cse26 (= (mod .cse25 2) 0)) (.cse27 (div .cse25 2))) (and (or .cse26 (not (= (+ .cse27 1) .cse28)) (not .cse29)) (or (and .cse29 (not .cse26)) (not (= .cse28 .cse27))))) .cse15) (or (let ((.cse30 (= (mod .cse34 2) 0)) (.cse32 (< .cse34 0)) (.cse31 (div .cse33 8))) (and (or .cse30 (not (= (+ .cse31 1) .cse28)) (not .cse32)) (or (and (not .cse30) .cse32) (not (= .cse28 .cse31))))) .cse35 (>= .cse24 .cse34))) .cse36 (and (or (let ((.cse39 (div .cse41 8)) (.cse37 (= (mod .cse40 2) 0)) (.cse38 (< .cse40 0))) (and (or .cse37 (not .cse38) (not (= (+ .cse39 1) 1))) (or (not (= .cse39 1)) (and (not .cse37) .cse38)))) (= .cse40 1) .cse42) (or .cse43 .cse44 (let ((.cse45 (= (mod .cse48 2) 0)) (.cse46 (< .cse48 0)) (.cse47 (div .cse48 2))) (and (or (and (not .cse45) .cse46) (not (= .cse47 1))) (or .cse45 (not .cse46) (not (= (+ .cse47 1) 1))))) (= 1 .cse48))) .cse49) .cse50 .cse51 .cse52 .cse53 .cse4 .cse5 .cse54 .cse55 .cse56 .cse57 .cse6 .cse58 .cse59 .cse60 .cse61) (and (or .cse62 (and (or .cse23 .cse63 .cse64 .cse15) (or .cse65 .cse35 .cse66)) .cse49) .cse16 .cse0 .cse17 .cse19 .cse20 .cse21 .cse22 .cse50 .cse51 .cse52 .cse53 .cse4 .cse5 .cse54 .cse55 .cse56 .cse57 .cse67 .cse6 .cse58 .cse59 .cse60 .cse61)))))) .cse4 .cse5 .cse6) (and (= |ULTIMATE.start_main_~d~0#1| 1) .cse0 .cse141 (>= |ULTIMATE.start_main_~p~0#1| 1) .cse238 .cse3 (<= 1 |ULTIMATE.start_main_~d~0#1|) .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse21 (= (* 2 .cse13) |ULTIMATE.start_main_~p~0#1|) .cse3 (>= |ULTIMATE.start_main_~r~0#1| .cse11) .cse4 .cse5 .cse55 (= (* .cse11 2) |ULTIMATE.start_main_~d~0#1|) .cse6)))))))))) [2023-02-17 02:08:32,434 INFO L899 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2023-02-17 02:08:32,436 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse195 (div |ULTIMATE.start_main_~d~0#1| 2)) (.cse270 (div |ULTIMATE.start_main_~p~0#1| 2))) (let ((.cse237 (+ .cse270 1)) (.cse272 (- .cse195))) (let ((.cse271 (+ (- 1) .cse272)) (.cse109 (+ |ULTIMATE.start_main_~q~0#1| .cse237)) (.cse138 (+ |ULTIMATE.start_main_~q~0#1| .cse270)) (.cse282 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse43 (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (let ((.cse194 (+ .cse195 1)) (.cse89 (div .cse237 2)) (.cse123 (div |ULTIMATE.start_main_~p~0#1| 4)) (.cse141 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse15 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (.cse107 (+ |ULTIMATE.start_main_~r~0#1| .cse272)) (.cse42 (and .cse282 (not .cse43))) (.cse280 (* |ULTIMATE.start_main_~B~0#1| .cse138)) (.cse44 (not .cse282)) (.cse281 (* .cse109 |ULTIMATE.start_main_~B~0#1|)) (.cse105 (+ |ULTIMATE.start_main_~r~0#1| .cse271)) (.cse279 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse140 (- |ULTIMATE.start_main_~d~0#1|))) (let ((.cse226 (= .cse270 1)) (.cse224 (= .cse237 1)) (.cse5 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse24 (+ |ULTIMATE.start_main_~r~0#1| .cse140)) (.cse154 (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (.cse23 (not .cse279)) (.cse197 (and (or .cse42 (= (+ .cse105 .cse280) |ULTIMATE.start_main_~A~0#1|)) (or .cse43 .cse44 (= |ULTIMATE.start_main_~A~0#1| (+ .cse281 .cse105))))) (.cse90 (and (or (= (+ .cse280 .cse107) |ULTIMATE.start_main_~A~0#1|) .cse42) (or (= (+ .cse281 .cse107) |ULTIMATE.start_main_~A~0#1|) .cse43 .cse44))) (.cse35 (and (not .cse15) .cse279)) (.cse275 (not .cse141)) (.cse67 (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)) (.cse124 (+ .cse123 1)) (.cse277 (< .cse270 0)) (.cse120 (= (mod .cse270 2) 0)) (.cse73 (= (mod .cse237 2) 0)) (.cse278 (< .cse237 0)) (.cse88 (+ .cse89 1)) (.cse221 (div .cse194 2)) (.cse220 (div |ULTIMATE.start_main_~d~0#1| 4))) (let ((.cse219 (+ .cse220 1)) (.cse222 (+ .cse221 1)) (.cse230 (- .cse221)) (.cse227 (- .cse220)) (.cse82 (= (mod .cse195 2) 0)) (.cse273 (< .cse195 0)) (.cse274 (< .cse194 0)) (.cse78 (= (mod .cse194 2) 0)) (.cse92 (= .cse88 1)) (.cse75 (not .cse278)) (.cse70 (and .cse278 (not .cse73))) (.cse98 (= .cse89 1)) (.cse10 (>= |ULTIMATE.start_main_~r~0#1| .cse195)) (.cse80 (>= |ULTIMATE.start_main_~r~0#1| .cse194)) (.cse131 (= .cse123 1)) (.cse122 (and .cse277 (not .cse120))) (.cse125 (= .cse124 1)) (.cse119 (not .cse277)) (.cse41 (* 2 |ULTIMATE.start_main_~p~0#1|)) (.cse33 (* 2 |ULTIMATE.start_main_~d~0#1|)) (.cse238 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse18 (or .cse275 .cse67)) (.cse266 (or .cse90 .cse35)) (.cse0 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse267 (or .cse23 .cse197 .cse15)) (.cse3 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse4 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)) (.cse199 (= |ULTIMATE.start_main_~A~0#1| (+ .cse24 (* |ULTIMATE.start_main_~B~0#1| .cse154)))) (.cse6 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse7 (or .cse5 (and (= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0) (not .cse5)))) (.cse193 (and (or (not .cse226) .cse42) (or .cse43 .cse44 (not .cse224))))) (let ((.cse1 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse218 (>= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse8 (let ((.cse276 (or .cse193 (and (or .cse23 .cse15 (= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| .cse194)) |ULTIMATE.start_main_~A~0#1|)) (or .cse35 (= |ULTIMATE.start_main_~A~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* .cse195 |ULTIMATE.start_main_~q~0#1|)))))))) (or (and .cse266 .cse0 .cse267 .cse18 .cse276 .cse3 .cse4 .cse5 .cse199 .cse6 .cse7) (and .cse266 .cse0 .cse267 .cse276 .cse3 .cse4 .cse5 .cse199 .cse67 .cse6 .cse7)))) (.cse9 (or .cse193 (and (or (= .cse195 |ULTIMATE.start_main_~B~0#1|) .cse35) (or .cse23 (= |ULTIMATE.start_main_~B~0#1| .cse194) .cse15)))) (.cse12 (<= 2 .cse195)) (.cse14 (or .cse275 .cse238)) (.cse115 (+ (- .cse33) |ULTIMATE.start_main_~r~0#1|)) (.cse117 (+ |ULTIMATE.start_main_~q~0#1| .cse41)) (.cse225 (and (or (not .cse131) .cse122) (or (not .cse125) .cse119 .cse120))) (.cse66 (>= .cse24 .cse195)) (.cse63 (>= .cse24 .cse194)) (.cse198 (not .cse80)) (.cse91 (not .cse10)) (.cse223 (and (or (not .cse92) .cse73 .cse75) (or .cse70 (not .cse98)))) (.cse68 (and .cse274 (not .cse78))) (.cse79 (not .cse274)) (.cse85 (and (not .cse82) .cse273)) (.cse84 (not .cse273)) (.cse228 (+ (- 1) .cse227)) (.cse229 (+ (- 1) .cse230)) (.cse190 (>= .cse105 .cse222)) (.cse182 (>= .cse105 .cse221)) (.cse165 (>= .cse107 .cse220)) (.cse164 (>= .cse107 .cse219)) (.cse2 (* 2 1))) (let ((.cse21 (<= 8 |ULTIMATE.start_main_~p~0#1|)) (.cse13 (* 2 .cse2)) (.cse55 (let ((.cse256 (not .cse164)) (.cse257 (not .cse165)) (.cse259 (not .cse182)) (.cse251 (+ .cse105 .cse230)) (.cse260 (not .cse190)) (.cse249 (+ .cse105 .cse229)) (.cse250 (* (+ .cse109 .cse89) |ULTIMATE.start_main_~B~0#1|)) (.cse248 (* (+ .cse88 .cse109) |ULTIMATE.start_main_~B~0#1|)) (.cse258 (+ .cse227 .cse107)) (.cse253 (* (+ .cse123 .cse138) |ULTIMATE.start_main_~B~0#1|)) (.cse254 (+ .cse228 .cse107)) (.cse252 (* (+ .cse124 .cse138) |ULTIMATE.start_main_~B~0#1|)) (.cse261 (+ .cse24 .cse272)) (.cse263 (+ .cse24 .cse271))) (let ((.cse241 (or .cse141 (let ((.cse269 (* (+ .cse154 .cse237) |ULTIMATE.start_main_~B~0#1|)) (.cse268 (* (+ .cse154 .cse270) |ULTIMATE.start_main_~B~0#1|))) (and (or (and (or (= (+ .cse268 .cse261) |ULTIMATE.start_main_~A~0#1|) .cse42) (or .cse43 .cse44 (= |ULTIMATE.start_main_~A~0#1| (+ .cse261 .cse269)))) .cse35) (or .cse23 (and (or .cse43 (= |ULTIMATE.start_main_~A~0#1| (+ .cse263 .cse269)) .cse44) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse263 .cse268)) .cse42)) .cse15))))) (.cse242 (or (and (or .cse224 .cse43 .cse44 (and (or .cse82 .cse84 (and (or .cse73 (= (+ .cse254 .cse248) |ULTIMATE.start_main_~A~0#1|) .cse75) (or .cse70 (= |ULTIMATE.start_main_~A~0#1| (+ .cse250 .cse254))))) (or .cse85 (and (or .cse70 (= (+ .cse250 .cse258) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse248 .cse258)) .cse73 .cse75))))) (or (and (or .cse85 (and (or (= (+ .cse253 .cse258) |ULTIMATE.start_main_~A~0#1|) .cse122) (or (= (+ .cse258 .cse252) |ULTIMATE.start_main_~A~0#1|) .cse119 .cse120))) (or (and (or .cse122 (= (+ .cse253 .cse254) |ULTIMATE.start_main_~A~0#1|)) (or .cse119 .cse120 (= |ULTIMATE.start_main_~A~0#1| (+ .cse254 .cse252)))) .cse82 .cse84)) .cse42 .cse226)) .cse35)) (.cse243 (or .cse141 (and .cse266 .cse267))) (.cse239 (or .cse223 .cse43 (let ((.cse265 (+ .cse109 1))) (and (or .cse35 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse254 (* .cse265 .cse219))) .cse82 .cse84 .cse256) (or .cse85 .cse257 (= (+ (* .cse265 .cse220) .cse258) |ULTIMATE.start_main_~A~0#1|)))) (or .cse23 (and (or .cse259 (= |ULTIMATE.start_main_~A~0#1| (+ .cse251 (* .cse265 .cse221))) .cse68) (or .cse260 .cse78 .cse79 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse265 .cse222) .cse249)))) .cse15))) .cse44)) (.cse244 (or .cse193 (let ((.cse264 (+ |ULTIMATE.start_main_~q~0#1| 1))) (and (or .cse23 .cse198 .cse15 (= |ULTIMATE.start_main_~A~0#1| (+ .cse105 (* .cse264 .cse194)))) (or .cse91 .cse35 (= (+ (* .cse195 .cse264) .cse107) |ULTIMATE.start_main_~A~0#1|)))))) (.cse245 (or .cse193 (let ((.cse262 (+ .cse154 1))) (and (or (not .cse66) .cse35 (= (+ .cse261 (* .cse195 .cse262)) |ULTIMATE.start_main_~A~0#1|)) (or .cse23 (not .cse63) (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse262 .cse194) .cse263)) .cse15))))) (.cse240 (or .cse225 (let ((.cse255 (+ .cse138 1))) (and (or .cse35 (and (or (= (+ .cse254 (* .cse255 .cse219)) |ULTIMATE.start_main_~A~0#1|) .cse82 .cse84 .cse256) (or .cse85 .cse257 (= (+ .cse258 (* .cse255 .cse220)) |ULTIMATE.start_main_~A~0#1|)))) (or .cse23 (and (or .cse259 .cse68 (= |ULTIMATE.start_main_~A~0#1| (+ .cse251 (* .cse255 .cse221)))) (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse255 .cse222) .cse249)) .cse260 .cse78 .cse79)) .cse15))) .cse42)) (.cse246 (or (= .cse41 1) (= |ULTIMATE.start_main_~A~0#1| (+ (+ .cse115 .cse140) (* |ULTIMATE.start_main_~B~0#1| (+ .cse117 |ULTIMATE.start_main_~p~0#1|)))))) (.cse247 (or .cse23 .cse15 (and (or .cse224 .cse43 .cse44 (and (or (and (or (= (+ .cse248 .cse249) |ULTIMATE.start_main_~A~0#1|) .cse73 .cse75) (or .cse70 (= |ULTIMATE.start_main_~A~0#1| (+ .cse250 .cse249)))) .cse78 .cse79) (or .cse68 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse251 .cse248)) .cse73 .cse75) (or .cse70 (= (+ .cse251 .cse250) |ULTIMATE.start_main_~A~0#1|)))))) (or (and (or (and (or .cse119 .cse120 (= (+ .cse251 .cse252) |ULTIMATE.start_main_~A~0#1|)) (or .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ .cse251 .cse253)))) .cse68) (or .cse78 .cse79 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse249 .cse252)) .cse119 .cse120) (or (= (+ .cse253 .cse249) |ULTIMATE.start_main_~A~0#1|) .cse122)))) .cse42 .cse226))))) (or (and (or .cse218 (and .cse239 .cse240)) .cse8 .cse9 .cse0 .cse241 .cse10 .cse18 .cse242 .cse12 .cse243 .cse244 .cse245 .cse199 .cse246 .cse14 .cse247 .cse15) (and .cse8 .cse9 .cse0 .cse241 .cse10 .cse18 .cse242 .cse12 .cse243 .cse239 .cse244 .cse245 .cse199 .cse240 .cse246 .cse14 .cse247 .cse15) (and .cse8 .cse9 .cse0 .cse241 .cse10 .cse242 .cse12 .cse243 .cse239 .cse244 .cse245 .cse199 .cse240 .cse246 .cse67 .cse14 .cse247 .cse15))))) (.cse11 (* 2 .cse1))) (or (and .cse0 (= |ULTIMATE.start_main_~d~0#1| .cse1) (= |ULTIMATE.start_main_~d~0#1| .cse2) (<= 2 |ULTIMATE.start_main_~p~0#1|) (<= 2 |ULTIMATE.start_main_~d~0#1|) .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_main_~p~0#1| .cse2)) (and (<= 4 |ULTIMATE.start_main_~p~0#1|) .cse8 .cse9 .cse0 .cse10 (= .cse11 |ULTIMATE.start_main_~d~0#1|) .cse12 (= |ULTIMATE.start_main_~p~0#1| .cse13) .cse3 (= |ULTIMATE.start_main_~d~0#1| .cse13) .cse4 .cse5 .cse6 .cse14 .cse15) (and .cse0 (let ((.cse233 (< .cse219 0)) (.cse162 (= (mod .cse219 2) 0)) (.cse169 (= (mod .cse220 2) 0)) (.cse234 (< .cse220 0)) (.cse188 (= (mod .cse222 2) 0)) (.cse235 (< .cse222 0)) (.cse178 (= (mod .cse221 2) 0)) (.cse236 (< .cse221 0)) (.cse215 (div .cse219 2)) (.cse214 (div |ULTIMATE.start_main_~d~0#1| 8)) (.cse210 (div .cse194 4)) (.cse204 (div .cse222 2))) (let ((.cse135 (div |ULTIMATE.start_main_~p~0#1| 8)) (.cse129 (div .cse124 2)) (.cse126 (= (mod .cse124 2) 0)) (.cse206 (< .cse124 0)) (.cse205 (- .cse204)) (.cse209 (- .cse210)) (.cse132 (= (mod .cse123 2) 0)) (.cse211 (< .cse123 0)) (.cse213 (- .cse214)) (.cse216 (- .cse215)) (.cse100 (div .cse237 4)) (.cse94 (div .cse88 2)) (.cse96 (= (mod .cse88 2) 0)) (.cse231 (< .cse88 0)) (.cse101 (= (mod .cse89 2) 0)) (.cse232 (< .cse89 0)) (.cse180 (and (not .cse178) .cse236)) (.cse175 (not .cse236)) (.cse208 (+ .cse210 1)) (.cse187 (not .cse235)) (.cse207 (+ .cse204 1)) (.cse183 (and (not .cse188) .cse235)) (.cse168 (and (not .cse169) .cse234)) (.cse172 (not .cse234)) (.cse212 (+ .cse214 1)) (.cse155 (and .cse233 (not .cse162))) (.cse161 (not .cse233)) (.cse28 (* |ULTIMATE.start_main_~B~0#1| 1)) (.cse217 (+ .cse215 1)) (.cse40 (div .cse41 4)) (.cse34 (div .cse33 4))) (let ((.cse25 (+ .cse34 1)) (.cse48 (+ .cse40 1)) (.cse77 (not (>= |ULTIMATE.start_main_~r~0#1| .cse222))) (.cse76 (+ .cse229 |ULTIMATE.start_main_~r~0#1|)) (.cse69 (not (>= |ULTIMATE.start_main_~r~0#1| .cse221))) (.cse71 (+ |ULTIMATE.start_main_~r~0#1| .cse230)) (.cse83 (not (>= |ULTIMATE.start_main_~r~0#1| .cse219))) (.cse81 (+ .cse228 |ULTIMATE.start_main_~r~0#1|)) (.cse87 (+ .cse227 |ULTIMATE.start_main_~r~0#1|)) (.cse86 (not (>= |ULTIMATE.start_main_~r~0#1| .cse220))) (.cse108 (and (or .cse85 (and (or (not (= .cse28 .cse214)) .cse168) (or .cse169 .cse172 (not (= .cse28 .cse212)))) .cse165) (or .cse82 (and (or (not (= .cse28 .cse215)) .cse155) (or .cse161 .cse162 (not (= .cse28 .cse217)))) .cse84 .cse164))) (.cse104 (and (or (and (or (not (= .cse28 .cse210)) .cse180) (or .cse175 (not (= .cse28 .cse208)) .cse178)) .cse68 .cse182) (or (and (or .cse187 .cse188 (not (= .cse28 .cse207))) (or .cse183 (not (= .cse28 .cse204)))) .cse78 .cse79 .cse190))) (.cse110 (>= .cse115 |ULTIMATE.start_main_~d~0#1|)) (.cse102 (not .cse232)) (.cse99 (and (not .cse101) .cse232)) (.cse97 (not .cse231)) (.cse93 (and (not .cse96) .cse231)) (.cse95 (+ .cse94 1)) (.cse103 (+ .cse100 1)) (.cse152 (not (>= .cse24 .cse221))) (.cse153 (+ .cse24 .cse230)) (.cse151 (not (>= .cse24 .cse222))) (.cse150 (+ .cse229 .cse24)) (.cse149 (not (>= .cse24 .cse219))) (.cse148 (+ .cse24 .cse228)) (.cse144 (not (>= .cse24 .cse220))) (.cse145 (+ .cse227 .cse24)) (.cse62 (and (or .cse223 .cse224 .cse43 .cse44) (or .cse225 .cse42 .cse226))) (.cse196 (= (+ |ULTIMATE.start_main_~r~0#1| (* .cse28 |ULTIMATE.start_main_~q~0#1|)) |ULTIMATE.start_main_~A~0#1|)) (.cse64 (and (or .cse68 (not (= .cse28 .cse221))) (or (not (= .cse28 .cse222)) .cse78 .cse79))) (.cse65 (and (or .cse82 (not (= .cse28 .cse219)) .cse84) (or .cse85 (not (= .cse28 .cse220))))) (.cse36 (not .cse218)) (.cse160 (not (>= .cse107 .cse217))) (.cse163 (+ (+ (- 1) .cse216) .cse107)) (.cse156 (+ .cse107 .cse216)) (.cse159 (not (>= .cse107 .cse215))) (.cse167 (+ .cse107 .cse213)) (.cse166 (not (>= .cse107 .cse214))) (.cse171 (+ (+ (- 1) .cse213) .cse107)) (.cse170 (not (>= .cse107 .cse212))) (.cse136 (and (not .cse132) .cse211)) (.cse134 (not .cse211)) (.cse179 (+ .cse209 .cse105)) (.cse181 (not (>= .cse105 .cse210))) (.cse176 (+ .cse105 (+ (- 1) .cse209))) (.cse177 (not (>= .cse105 .cse208))) (.cse189 (not (>= .cse105 .cse207))) (.cse186 (+ .cse105 (+ (- 1) .cse205))) (.cse127 (not .cse206)) (.cse130 (and (not .cse126) .cse206)) (.cse185 (+ .cse105 .cse205)) (.cse184 (not (>= .cse105 .cse204))) (.cse128 (+ 1 .cse129)) (.cse133 (+ .cse135 1))) (let ((.cse49 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse28 .cse154) .cse24))) (.cse16 (or (let ((.cse200 (* |ULTIMATE.start_main_~B~0#1| (+ .cse138 .cse135))) (.cse201 (* |ULTIMATE.start_main_~B~0#1| (+ .cse133 .cse138))) (.cse203 (* |ULTIMATE.start_main_~B~0#1| (+ .cse128 .cse138))) (.cse202 (* (+ .cse138 .cse129) |ULTIMATE.start_main_~B~0#1|))) (and (or (and (or (and (or .cse85 (and (or .cse169 .cse170 (and (or (= (+ .cse171 .cse200) |ULTIMATE.start_main_~A~0#1|) .cse136) (or (= (+ .cse171 .cse201) |ULTIMATE.start_main_~A~0#1|) .cse132 .cse134)) .cse172) (or .cse166 (and (or .cse132 .cse134 (= |ULTIMATE.start_main_~A~0#1| (+ .cse167 .cse201))) (or (= (+ .cse167 .cse200) |ULTIMATE.start_main_~A~0#1|) .cse136)) .cse168)) .cse165) (or (and (or (and (or .cse132 .cse134 (= |ULTIMATE.start_main_~A~0#1| (+ .cse156 .cse201))) (or .cse136 (= (+ .cse156 .cse200) |ULTIMATE.start_main_~A~0#1|))) .cse155 .cse159) (or .cse160 .cse161 .cse162 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse163 .cse200)) .cse136) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse163 .cse201)) .cse132 .cse134)))) .cse82 .cse84 .cse164)) .cse122) (or .cse119 .cse120 (and (or (and (or .cse160 .cse161 .cse162 (and (or .cse130 (= (+ .cse202 .cse163) |ULTIMATE.start_main_~A~0#1|)) (or .cse126 .cse127 (= |ULTIMATE.start_main_~A~0#1| (+ .cse203 .cse163))))) (or .cse155 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse156 .cse202)) .cse130) (or .cse126 .cse127 (= |ULTIMATE.start_main_~A~0#1| (+ .cse156 .cse203)))) .cse159)) .cse82 .cse84 .cse164) (or .cse85 (and (or (and (or .cse126 (= (+ .cse167 .cse203) |ULTIMATE.start_main_~A~0#1|) .cse127) (or .cse130 (= (+ .cse167 .cse202) |ULTIMATE.start_main_~A~0#1|))) .cse166 .cse168) (or .cse169 (and (or .cse126 .cse127 (= |ULTIMATE.start_main_~A~0#1| (+ .cse203 .cse171))) (or (= (+ .cse202 .cse171) |ULTIMATE.start_main_~A~0#1|) .cse130)) .cse170 .cse172)) .cse165)))) .cse35) (or .cse23 (and (or (and (or .cse68 .cse182 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse200 .cse179)) .cse136) (or .cse132 (= (+ .cse201 .cse179) |ULTIMATE.start_main_~A~0#1|) .cse134)) .cse180 .cse181) (or .cse175 .cse177 (and (or (= (+ .cse176 .cse200) |ULTIMATE.start_main_~A~0#1|) .cse136) (or .cse132 (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse201)) .cse134)) .cse178))) (or (and (or .cse187 (and (or .cse132 (= |ULTIMATE.start_main_~A~0#1| (+ .cse186 .cse201)) .cse134) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse186 .cse200)) .cse136)) .cse188 .cse189) (or .cse183 .cse184 (and (or .cse136 (= (+ .cse185 .cse200) |ULTIMATE.start_main_~A~0#1|)) (or .cse132 (= (+ .cse185 .cse201) |ULTIMATE.start_main_~A~0#1|) .cse134)))) .cse78 .cse79 .cse190)) .cse122) (or (and (or (and (or (and (or .cse130 (= (+ .cse202 .cse179) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse203 .cse179) |ULTIMATE.start_main_~A~0#1|) .cse126 .cse127)) .cse180 .cse181) (or .cse175 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse203)) .cse126 .cse127) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse202)) .cse130)) .cse177 .cse178)) .cse68 .cse182) (or (and (or .cse187 .cse188 .cse189 (and (or .cse126 .cse127 (= |ULTIMATE.start_main_~A~0#1| (+ .cse186 .cse203))) (or .cse130 (= |ULTIMATE.start_main_~A~0#1| (+ .cse186 .cse202))))) (or (and (or (= (+ .cse185 .cse203) |ULTIMATE.start_main_~A~0#1|) .cse126 .cse127) (or .cse130 (= (+ .cse185 .cse202) |ULTIMATE.start_main_~A~0#1|))) .cse183 .cse184)) .cse78 .cse79 .cse190)) .cse119 .cse120)) .cse15))) .cse42)) (.cse17 (or .cse36 .cse199)) (.cse19 (or .cse62 .cse196 (and (or .cse23 .cse64 .cse80 .cse15) (or .cse10 .cse65 .cse35)))) (.cse20 (or .cse23 .cse197 .cse198 .cse15)) (.cse22 (or .cse193 (and (or .cse23 (not (= .cse28 .cse194)) .cse15) (or (not (= .cse195 .cse28)) .cse35)) .cse141 .cse196)) (.cse50 (or .cse43 (let ((.cse191 (* (+ .cse88 .cse154) |ULTIMATE.start_main_~B~0#1|)) (.cse192 (* (+ .cse154 .cse89) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse23 (and (or .cse152 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse191 .cse153)) .cse73 .cse75) (or .cse70 (= (+ .cse192 .cse153) |ULTIMATE.start_main_~A~0#1|))) .cse68) (or .cse151 (and (or .cse73 (= |ULTIMATE.start_main_~A~0#1| (+ .cse150 .cse191)) .cse75) (or .cse70 (= |ULTIMATE.start_main_~A~0#1| (+ .cse150 .cse192)))) .cse78 .cse79)) .cse63 .cse15) (or (and (or .cse149 .cse82 (and (or .cse73 .cse75 (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse191))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse192)) .cse70)) .cse84) (or .cse85 .cse144 (and (or .cse73 (= |ULTIMATE.start_main_~A~0#1| (+ .cse145 .cse191)) .cse75) (or (= (+ .cse192 .cse145) |ULTIMATE.start_main_~A~0#1|) .cse70)))) .cse35 .cse66))) .cse44)) (.cse51 (or (let ((.cse173 (* (+ .cse103 .cse109) |ULTIMATE.start_main_~B~0#1|)) (.cse174 (* (+ .cse109 .cse100) |ULTIMATE.start_main_~B~0#1|)) (.cse158 (* |ULTIMATE.start_main_~B~0#1| (+ .cse95 .cse109))) (.cse157 (* |ULTIMATE.start_main_~B~0#1| (+ .cse109 .cse94)))) (and (or .cse35 (and (or .cse73 (and (or (and (or .cse155 (and (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ .cse156 .cse157))) (or .cse96 (= (+ .cse158 .cse156) |ULTIMATE.start_main_~A~0#1|) .cse97)) .cse159) (or .cse160 .cse161 .cse162 (and (or (= (+ .cse163 .cse157) |ULTIMATE.start_main_~A~0#1|) .cse93) (or .cse96 (= |ULTIMATE.start_main_~A~0#1| (+ .cse158 .cse163)) .cse97)))) .cse82 .cse84 .cse164) (or .cse85 .cse165 (and (or .cse166 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse167 .cse157)) .cse93) (or .cse96 .cse97 (= (+ .cse167 .cse158) |ULTIMATE.start_main_~A~0#1|))) .cse168) (or .cse169 .cse170 (and (or .cse96 .cse97 (= |ULTIMATE.start_main_~A~0#1| (+ .cse158 .cse171))) (or .cse93 (= (+ .cse157 .cse171) |ULTIMATE.start_main_~A~0#1|))) .cse172)))) .cse75) (or .cse70 (and (or (and (or (and (or .cse101 (= (+ .cse163 .cse173) |ULTIMATE.start_main_~A~0#1|) .cse102) (or .cse99 (= (+ .cse174 .cse163) |ULTIMATE.start_main_~A~0#1|))) .cse160 .cse161 .cse162) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse156 .cse174)) .cse99) (or .cse101 .cse102 (= |ULTIMATE.start_main_~A~0#1| (+ .cse156 .cse173)))) .cse155 .cse159)) .cse82 .cse84 .cse164) (or .cse85 (and (or .cse169 .cse170 .cse172 (and (or .cse99 (= (+ .cse174 .cse171) |ULTIMATE.start_main_~A~0#1|)) (or .cse101 .cse102 (= (+ .cse173 .cse171) |ULTIMATE.start_main_~A~0#1|)))) (or .cse166 .cse168 (and (or .cse101 .cse102 (= (+ .cse167 .cse173) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse167 .cse174) |ULTIMATE.start_main_~A~0#1|) .cse99)))) .cse165))))) (or .cse23 (and (or .cse70 (and (or .cse68 (and (or .cse175 (and (or (= (+ .cse176 .cse173) |ULTIMATE.start_main_~A~0#1|) .cse101 .cse102) (or .cse99 (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse174)))) .cse177 .cse178) (or (and (or .cse101 (= (+ .cse173 .cse179) |ULTIMATE.start_main_~A~0#1|) .cse102) (or .cse99 (= |ULTIMATE.start_main_~A~0#1| (+ .cse174 .cse179)))) .cse180 .cse181)) .cse182) (or (and (or .cse183 .cse184 (and (or .cse101 (= |ULTIMATE.start_main_~A~0#1| (+ .cse185 .cse173)) .cse102) (or .cse99 (= (+ .cse185 .cse174) |ULTIMATE.start_main_~A~0#1|)))) (or (and (or .cse101 (= (+ .cse186 .cse173) |ULTIMATE.start_main_~A~0#1|) .cse102) (or .cse99 (= |ULTIMATE.start_main_~A~0#1| (+ .cse186 .cse174)))) .cse187 .cse188 .cse189)) .cse78 .cse79 .cse190))) (or .cse73 (and (or .cse78 (and (or .cse187 (and (or .cse96 .cse97 (= (+ .cse186 .cse158) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse186 .cse157)) .cse93)) .cse188 .cse189) (or .cse183 (and (or .cse96 (= (+ .cse185 .cse158) |ULTIMATE.start_main_~A~0#1|) .cse97) (or .cse93 (= (+ .cse185 .cse157) |ULTIMATE.start_main_~A~0#1|))) .cse184)) .cse79 .cse190) (or (and (or .cse175 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse158 .cse176)) .cse96 .cse97) (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse157)))) .cse177 .cse178) (or (and (or (= (+ .cse158 .cse179) |ULTIMATE.start_main_~A~0#1|) .cse96 .cse97) (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ .cse157 .cse179)))) .cse180 .cse181)) .cse68 .cse182)) .cse75)) .cse15))) .cse43 .cse44)) (.cse52 (or (let ((.cse146 (* (+ .cse123 .cse154) |ULTIMATE.start_main_~B~0#1|)) (.cse147 (* (+ .cse154 .cse124) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse35 .cse66 (and (or .cse85 .cse144 (and (or .cse122 (= (+ .cse145 .cse146) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse147 .cse145) |ULTIMATE.start_main_~A~0#1|) .cse119 .cse120))) (or (and (or .cse119 .cse120 (= (+ .cse147 .cse148) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse146)) .cse122)) .cse149 .cse82 .cse84))) (or .cse23 .cse63 (and (or (and (or (= (+ .cse150 .cse147) |ULTIMATE.start_main_~A~0#1|) .cse119 .cse120) (or (= (+ .cse150 .cse146) |ULTIMATE.start_main_~A~0#1|) .cse122)) .cse151 .cse78 .cse79) (or .cse152 (and (or (= (+ .cse146 .cse153) |ULTIMATE.start_main_~A~0#1|) .cse122) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse147 .cse153)) .cse119 .cse120)) .cse68)) .cse15))) .cse42)) (.cse53 (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse28 .cse117) .cse115)) .cse110 .cse141 (not (>= |ULTIMATE.start_main_~r~0#1| .cse33)) (let ((.cse142 (div (* |ULTIMATE.start_main_~p~0#1| 4) 8))) (and (or (not (= .cse142 1)) .cse42) (or .cse43 .cse44 (not (= (+ .cse142 1) 1))))) (let ((.cse143 (div (* |ULTIMATE.start_main_~d~0#1| 4) 8))) (and (or (not (= .cse28 .cse143)) .cse35) (or .cse23 (not (= (+ .cse143 1) .cse28)) .cse15))))) (.cse54 (let ((.cse139 (+ (- (* .cse33 2)) |ULTIMATE.start_main_~r~0#1|))) (or (not (>= .cse139 |ULTIMATE.start_main_~d~0#1|)) (>= .cse139 .cse33) (= (+ (+ .cse139 .cse140) (* (+ |ULTIMATE.start_main_~p~0#1| (+ |ULTIMATE.start_main_~q~0#1| (* 2 .cse41))) |ULTIMATE.start_main_~B~0#1|)) |ULTIMATE.start_main_~A~0#1|)))) (.cse56 (or (and (or .cse125 (and (or .cse126 .cse127 (not (= .cse128 1))) (or (not (= 1 .cse129)) .cse130)) .cse119 .cse120) (or .cse131 (and (or .cse132 (not (= .cse133 1)) .cse134) (or (not (= .cse135 1)) .cse136)) .cse122)) (let ((.cse137 (* .cse28 .cse138))) (and (or (= (+ .cse137 .cse107) |ULTIMATE.start_main_~A~0#1|) .cse35 .cse108) (or .cse23 .cse104 (= (+ .cse105 .cse137) |ULTIMATE.start_main_~A~0#1|) .cse15))) .cse42)) (.cse57 (or (let ((.cse118 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse124))) (.cse121 (* |ULTIMATE.start_main_~B~0#1| (+ .cse123 |ULTIMATE.start_main_~q~0#1|)))) (and (or .cse23 (and (or .cse77 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse76 .cse118)) .cse119 .cse120) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse121 .cse76)) .cse122)) .cse78 .cse79) (or .cse68 .cse69 (and (or (= (+ .cse121 .cse71) |ULTIMATE.start_main_~A~0#1|) .cse122) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse118)) .cse119 .cse120)))) .cse80 .cse15) (or .cse10 .cse35 (and (or .cse82 .cse83 .cse84 (and (or .cse119 (= |ULTIMATE.start_main_~A~0#1| (+ .cse81 .cse118)) .cse120) (or .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ .cse81 .cse121))))) (or .cse85 (and (or (= (+ .cse87 .cse118) |ULTIMATE.start_main_~A~0#1|) .cse119 .cse120) (or (= (+ .cse87 .cse121) |ULTIMATE.start_main_~A~0#1|) .cse122)) .cse86))))) .cse42)) (.cse58 (or .cse110 (let ((.cse113 (* (+ .cse117 .cse48) |ULTIMATE.start_main_~B~0#1|)) (.cse111 (* |ULTIMATE.start_main_~B~0#1| (+ .cse40 .cse117))) (.cse114 (- .cse34))) (and (or .cse23 (let ((.cse112 (+ (+ (- 1) .cse114) .cse115))) (and (or (= (+ .cse111 .cse112) |ULTIMATE.start_main_~A~0#1|) .cse42) (or (= (+ .cse113 .cse112) |ULTIMATE.start_main_~A~0#1|) .cse43 .cse44))) (not (>= .cse115 .cse25)) .cse15) (or (let ((.cse116 (+ .cse114 .cse115))) (and (or .cse43 (= |ULTIMATE.start_main_~A~0#1| (+ .cse113 .cse116)) .cse44) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse116 .cse111)) .cse42))) .cse35 (not (>= .cse115 .cse34))))))) (.cse59 (or (and (or .cse73 .cse92 .cse75 (and (or .cse93 (not (= .cse94 1))) (or (not (= .cse95 1)) .cse96 .cse97))) (or .cse70 .cse98 (and (or .cse99 (not (= .cse100 1))) (or .cse101 .cse102 (not (= .cse103 1)))))) .cse43 (let ((.cse106 (* .cse109 .cse28))) (and (or .cse23 .cse104 (= |ULTIMATE.start_main_~A~0#1| (+ .cse105 .cse106)) .cse15) (or .cse35 (= (+ .cse107 .cse106) |ULTIMATE.start_main_~A~0#1|) .cse108))) .cse44)) (.cse60 (or .cse90 .cse91 .cse35)) (.cse61 (or (let ((.cse72 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse89))) (.cse74 (* |ULTIMATE.start_main_~B~0#1| (+ .cse88 |ULTIMATE.start_main_~q~0#1|)))) (and (or .cse23 (and (or .cse68 .cse69 (and (or .cse70 (= (+ .cse71 .cse72) |ULTIMATE.start_main_~A~0#1|)) (or .cse73 (= |ULTIMATE.start_main_~A~0#1| (+ .cse74 .cse71)) .cse75))) (or (and (or .cse70 (= |ULTIMATE.start_main_~A~0#1| (+ .cse76 .cse72))) (or .cse73 (= (+ .cse74 .cse76) |ULTIMATE.start_main_~A~0#1|) .cse75)) .cse77 .cse78 .cse79)) .cse80 .cse15) (or .cse10 .cse35 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse81 .cse74)) .cse73 .cse75) (or .cse70 (= (+ .cse81 .cse72) |ULTIMATE.start_main_~A~0#1|))) .cse82 .cse83 .cse84) (or .cse85 .cse86 (and (or .cse70 (= (+ .cse87 .cse72) |ULTIMATE.start_main_~A~0#1|)) (or .cse73 (= |ULTIMATE.start_main_~A~0#1| (+ .cse87 .cse74)) .cse75))))))) .cse43 .cse44))) (or (and .cse16 .cse0 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (or (and (or .cse23 (>= .cse24 .cse25) (let ((.cse29 (< .cse25 0)) (.cse26 (= (mod .cse25 2) 0)) (.cse27 (div .cse25 2))) (and (or .cse26 (not (= (+ .cse27 1) .cse28)) (not .cse29)) (or (and .cse29 (not .cse26)) (not (= .cse28 .cse27))))) .cse15) (or (let ((.cse30 (= (mod .cse34 2) 0)) (.cse32 (< .cse34 0)) (.cse31 (div .cse33 8))) (and (or .cse30 (not (= (+ .cse31 1) .cse28)) (not .cse32)) (or (and (not .cse30) .cse32) (not (= .cse28 .cse31))))) .cse35 (>= .cse24 .cse34))) .cse36 (and (or (let ((.cse39 (div .cse41 8)) (.cse37 (= (mod .cse40 2) 0)) (.cse38 (< .cse40 0))) (and (or .cse37 (not .cse38) (not (= (+ .cse39 1) 1))) (or (not (= .cse39 1)) (and (not .cse37) .cse38)))) (= .cse40 1) .cse42) (or .cse43 .cse44 (let ((.cse45 (= (mod .cse48 2) 0)) (.cse46 (< .cse48 0)) (.cse47 (div .cse48 2))) (and (or (and (not .cse45) .cse46) (not (= .cse47 1))) (or .cse45 (not .cse46) (not (= (+ .cse47 1) 1))))) (= 1 .cse48))) .cse49) .cse50 .cse51 .cse52 .cse53 .cse4 .cse5 .cse54 .cse55 .cse56 .cse57 .cse6 .cse58 .cse59 .cse60 .cse61) (and (or .cse62 (and (or .cse23 .cse63 .cse64 .cse15) (or .cse65 .cse35 .cse66)) .cse49) .cse16 .cse0 .cse17 .cse19 .cse20 .cse21 .cse22 .cse50 .cse51 .cse52 .cse53 .cse4 .cse5 .cse54 .cse55 .cse56 .cse57 .cse67 .cse6 .cse58 .cse59 .cse60 .cse61)))))) .cse4 .cse5 .cse6) (and (= |ULTIMATE.start_main_~d~0#1| 1) .cse0 .cse141 (>= |ULTIMATE.start_main_~p~0#1| 1) .cse238 .cse3 (<= 1 |ULTIMATE.start_main_~d~0#1|) .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse21 (= (* 2 .cse13) |ULTIMATE.start_main_~p~0#1|) .cse3 (>= |ULTIMATE.start_main_~r~0#1| .cse11) .cse4 .cse5 .cse55 (= (* .cse11 2) |ULTIMATE.start_main_~d~0#1|) .cse6)))))))))) [2023-02-17 02:08:32,439 INFO L895 garLoopResultBuilder]: At program point L35-1(line 35) the Hoare annotation is: (let ((.cse195 (div |ULTIMATE.start_main_~d~0#1| 2)) (.cse270 (div |ULTIMATE.start_main_~p~0#1| 2))) (let ((.cse237 (+ .cse270 1)) (.cse272 (- .cse195))) (let ((.cse271 (+ (- 1) .cse272)) (.cse109 (+ |ULTIMATE.start_main_~q~0#1| .cse237)) (.cse138 (+ |ULTIMATE.start_main_~q~0#1| .cse270)) (.cse282 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse43 (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (let ((.cse194 (+ .cse195 1)) (.cse89 (div .cse237 2)) (.cse123 (div |ULTIMATE.start_main_~p~0#1| 4)) (.cse141 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse15 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (.cse107 (+ |ULTIMATE.start_main_~r~0#1| .cse272)) (.cse42 (and .cse282 (not .cse43))) (.cse280 (* |ULTIMATE.start_main_~B~0#1| .cse138)) (.cse44 (not .cse282)) (.cse281 (* .cse109 |ULTIMATE.start_main_~B~0#1|)) (.cse105 (+ |ULTIMATE.start_main_~r~0#1| .cse271)) (.cse279 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse140 (- |ULTIMATE.start_main_~d~0#1|))) (let ((.cse226 (= .cse270 1)) (.cse224 (= .cse237 1)) (.cse5 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse24 (+ |ULTIMATE.start_main_~r~0#1| .cse140)) (.cse154 (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (.cse23 (not .cse279)) (.cse197 (and (or .cse42 (= (+ .cse105 .cse280) |ULTIMATE.start_main_~A~0#1|)) (or .cse43 .cse44 (= |ULTIMATE.start_main_~A~0#1| (+ .cse281 .cse105))))) (.cse90 (and (or (= (+ .cse280 .cse107) |ULTIMATE.start_main_~A~0#1|) .cse42) (or (= (+ .cse281 .cse107) |ULTIMATE.start_main_~A~0#1|) .cse43 .cse44))) (.cse35 (and (not .cse15) .cse279)) (.cse275 (not .cse141)) (.cse67 (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)) (.cse124 (+ .cse123 1)) (.cse277 (< .cse270 0)) (.cse120 (= (mod .cse270 2) 0)) (.cse73 (= (mod .cse237 2) 0)) (.cse278 (< .cse237 0)) (.cse88 (+ .cse89 1)) (.cse221 (div .cse194 2)) (.cse220 (div |ULTIMATE.start_main_~d~0#1| 4))) (let ((.cse219 (+ .cse220 1)) (.cse222 (+ .cse221 1)) (.cse230 (- .cse221)) (.cse227 (- .cse220)) (.cse82 (= (mod .cse195 2) 0)) (.cse273 (< .cse195 0)) (.cse274 (< .cse194 0)) (.cse78 (= (mod .cse194 2) 0)) (.cse92 (= .cse88 1)) (.cse75 (not .cse278)) (.cse70 (and .cse278 (not .cse73))) (.cse98 (= .cse89 1)) (.cse10 (>= |ULTIMATE.start_main_~r~0#1| .cse195)) (.cse80 (>= |ULTIMATE.start_main_~r~0#1| .cse194)) (.cse131 (= .cse123 1)) (.cse122 (and .cse277 (not .cse120))) (.cse125 (= .cse124 1)) (.cse119 (not .cse277)) (.cse41 (* 2 |ULTIMATE.start_main_~p~0#1|)) (.cse33 (* 2 |ULTIMATE.start_main_~d~0#1|)) (.cse238 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse18 (or .cse275 .cse67)) (.cse266 (or .cse90 .cse35)) (.cse0 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse267 (or .cse23 .cse197 .cse15)) (.cse3 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse4 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)) (.cse199 (= |ULTIMATE.start_main_~A~0#1| (+ .cse24 (* |ULTIMATE.start_main_~B~0#1| .cse154)))) (.cse6 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse7 (or .cse5 (and (= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0) (not .cse5)))) (.cse193 (and (or (not .cse226) .cse42) (or .cse43 .cse44 (not .cse224))))) (let ((.cse1 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse218 (>= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse8 (let ((.cse276 (or .cse193 (and (or .cse23 .cse15 (= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| .cse194)) |ULTIMATE.start_main_~A~0#1|)) (or .cse35 (= |ULTIMATE.start_main_~A~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* .cse195 |ULTIMATE.start_main_~q~0#1|)))))))) (or (and .cse266 .cse0 .cse267 .cse18 .cse276 .cse3 .cse4 .cse5 .cse199 .cse6 .cse7) (and .cse266 .cse0 .cse267 .cse276 .cse3 .cse4 .cse5 .cse199 .cse67 .cse6 .cse7)))) (.cse9 (or .cse193 (and (or (= .cse195 |ULTIMATE.start_main_~B~0#1|) .cse35) (or .cse23 (= |ULTIMATE.start_main_~B~0#1| .cse194) .cse15)))) (.cse12 (<= 2 .cse195)) (.cse14 (or .cse275 .cse238)) (.cse115 (+ (- .cse33) |ULTIMATE.start_main_~r~0#1|)) (.cse117 (+ |ULTIMATE.start_main_~q~0#1| .cse41)) (.cse225 (and (or (not .cse131) .cse122) (or (not .cse125) .cse119 .cse120))) (.cse66 (>= .cse24 .cse195)) (.cse63 (>= .cse24 .cse194)) (.cse198 (not .cse80)) (.cse91 (not .cse10)) (.cse223 (and (or (not .cse92) .cse73 .cse75) (or .cse70 (not .cse98)))) (.cse68 (and .cse274 (not .cse78))) (.cse79 (not .cse274)) (.cse85 (and (not .cse82) .cse273)) (.cse84 (not .cse273)) (.cse228 (+ (- 1) .cse227)) (.cse229 (+ (- 1) .cse230)) (.cse190 (>= .cse105 .cse222)) (.cse182 (>= .cse105 .cse221)) (.cse165 (>= .cse107 .cse220)) (.cse164 (>= .cse107 .cse219)) (.cse2 (* 2 1))) (let ((.cse21 (<= 8 |ULTIMATE.start_main_~p~0#1|)) (.cse13 (* 2 .cse2)) (.cse55 (let ((.cse256 (not .cse164)) (.cse257 (not .cse165)) (.cse259 (not .cse182)) (.cse251 (+ .cse105 .cse230)) (.cse260 (not .cse190)) (.cse249 (+ .cse105 .cse229)) (.cse250 (* (+ .cse109 .cse89) |ULTIMATE.start_main_~B~0#1|)) (.cse248 (* (+ .cse88 .cse109) |ULTIMATE.start_main_~B~0#1|)) (.cse258 (+ .cse227 .cse107)) (.cse253 (* (+ .cse123 .cse138) |ULTIMATE.start_main_~B~0#1|)) (.cse254 (+ .cse228 .cse107)) (.cse252 (* (+ .cse124 .cse138) |ULTIMATE.start_main_~B~0#1|)) (.cse261 (+ .cse24 .cse272)) (.cse263 (+ .cse24 .cse271))) (let ((.cse241 (or .cse141 (let ((.cse269 (* (+ .cse154 .cse237) |ULTIMATE.start_main_~B~0#1|)) (.cse268 (* (+ .cse154 .cse270) |ULTIMATE.start_main_~B~0#1|))) (and (or (and (or (= (+ .cse268 .cse261) |ULTIMATE.start_main_~A~0#1|) .cse42) (or .cse43 .cse44 (= |ULTIMATE.start_main_~A~0#1| (+ .cse261 .cse269)))) .cse35) (or .cse23 (and (or .cse43 (= |ULTIMATE.start_main_~A~0#1| (+ .cse263 .cse269)) .cse44) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse263 .cse268)) .cse42)) .cse15))))) (.cse242 (or (and (or .cse224 .cse43 .cse44 (and (or .cse82 .cse84 (and (or .cse73 (= (+ .cse254 .cse248) |ULTIMATE.start_main_~A~0#1|) .cse75) (or .cse70 (= |ULTIMATE.start_main_~A~0#1| (+ .cse250 .cse254))))) (or .cse85 (and (or .cse70 (= (+ .cse250 .cse258) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse248 .cse258)) .cse73 .cse75))))) (or (and (or .cse85 (and (or (= (+ .cse253 .cse258) |ULTIMATE.start_main_~A~0#1|) .cse122) (or (= (+ .cse258 .cse252) |ULTIMATE.start_main_~A~0#1|) .cse119 .cse120))) (or (and (or .cse122 (= (+ .cse253 .cse254) |ULTIMATE.start_main_~A~0#1|)) (or .cse119 .cse120 (= |ULTIMATE.start_main_~A~0#1| (+ .cse254 .cse252)))) .cse82 .cse84)) .cse42 .cse226)) .cse35)) (.cse243 (or .cse141 (and .cse266 .cse267))) (.cse239 (or .cse223 .cse43 (let ((.cse265 (+ .cse109 1))) (and (or .cse35 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse254 (* .cse265 .cse219))) .cse82 .cse84 .cse256) (or .cse85 .cse257 (= (+ (* .cse265 .cse220) .cse258) |ULTIMATE.start_main_~A~0#1|)))) (or .cse23 (and (or .cse259 (= |ULTIMATE.start_main_~A~0#1| (+ .cse251 (* .cse265 .cse221))) .cse68) (or .cse260 .cse78 .cse79 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse265 .cse222) .cse249)))) .cse15))) .cse44)) (.cse244 (or .cse193 (let ((.cse264 (+ |ULTIMATE.start_main_~q~0#1| 1))) (and (or .cse23 .cse198 .cse15 (= |ULTIMATE.start_main_~A~0#1| (+ .cse105 (* .cse264 .cse194)))) (or .cse91 .cse35 (= (+ (* .cse195 .cse264) .cse107) |ULTIMATE.start_main_~A~0#1|)))))) (.cse245 (or .cse193 (let ((.cse262 (+ .cse154 1))) (and (or (not .cse66) .cse35 (= (+ .cse261 (* .cse195 .cse262)) |ULTIMATE.start_main_~A~0#1|)) (or .cse23 (not .cse63) (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse262 .cse194) .cse263)) .cse15))))) (.cse240 (or .cse225 (let ((.cse255 (+ .cse138 1))) (and (or .cse35 (and (or (= (+ .cse254 (* .cse255 .cse219)) |ULTIMATE.start_main_~A~0#1|) .cse82 .cse84 .cse256) (or .cse85 .cse257 (= (+ .cse258 (* .cse255 .cse220)) |ULTIMATE.start_main_~A~0#1|)))) (or .cse23 (and (or .cse259 .cse68 (= |ULTIMATE.start_main_~A~0#1| (+ .cse251 (* .cse255 .cse221)))) (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse255 .cse222) .cse249)) .cse260 .cse78 .cse79)) .cse15))) .cse42)) (.cse246 (or (= .cse41 1) (= |ULTIMATE.start_main_~A~0#1| (+ (+ .cse115 .cse140) (* |ULTIMATE.start_main_~B~0#1| (+ .cse117 |ULTIMATE.start_main_~p~0#1|)))))) (.cse247 (or .cse23 .cse15 (and (or .cse224 .cse43 .cse44 (and (or (and (or (= (+ .cse248 .cse249) |ULTIMATE.start_main_~A~0#1|) .cse73 .cse75) (or .cse70 (= |ULTIMATE.start_main_~A~0#1| (+ .cse250 .cse249)))) .cse78 .cse79) (or .cse68 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse251 .cse248)) .cse73 .cse75) (or .cse70 (= (+ .cse251 .cse250) |ULTIMATE.start_main_~A~0#1|)))))) (or (and (or (and (or .cse119 .cse120 (= (+ .cse251 .cse252) |ULTIMATE.start_main_~A~0#1|)) (or .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ .cse251 .cse253)))) .cse68) (or .cse78 .cse79 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse249 .cse252)) .cse119 .cse120) (or (= (+ .cse253 .cse249) |ULTIMATE.start_main_~A~0#1|) .cse122)))) .cse42 .cse226))))) (or (and (or .cse218 (and .cse239 .cse240)) .cse8 .cse9 .cse0 .cse241 .cse10 .cse18 .cse242 .cse12 .cse243 .cse244 .cse245 .cse199 .cse246 .cse14 .cse247 .cse15) (and .cse8 .cse9 .cse0 .cse241 .cse10 .cse18 .cse242 .cse12 .cse243 .cse239 .cse244 .cse245 .cse199 .cse240 .cse246 .cse14 .cse247 .cse15) (and .cse8 .cse9 .cse0 .cse241 .cse10 .cse242 .cse12 .cse243 .cse239 .cse244 .cse245 .cse199 .cse240 .cse246 .cse67 .cse14 .cse247 .cse15))))) (.cse11 (* 2 .cse1))) (or (and .cse0 (= |ULTIMATE.start_main_~d~0#1| .cse1) (= |ULTIMATE.start_main_~d~0#1| .cse2) (<= 2 |ULTIMATE.start_main_~p~0#1|) (<= 2 |ULTIMATE.start_main_~d~0#1|) .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_main_~p~0#1| .cse2)) (and (<= 4 |ULTIMATE.start_main_~p~0#1|) .cse8 .cse9 .cse0 .cse10 (= .cse11 |ULTIMATE.start_main_~d~0#1|) .cse12 (= |ULTIMATE.start_main_~p~0#1| .cse13) .cse3 (= |ULTIMATE.start_main_~d~0#1| .cse13) .cse4 .cse5 .cse6 .cse14 .cse15) (and .cse0 (let ((.cse233 (< .cse219 0)) (.cse162 (= (mod .cse219 2) 0)) (.cse169 (= (mod .cse220 2) 0)) (.cse234 (< .cse220 0)) (.cse188 (= (mod .cse222 2) 0)) (.cse235 (< .cse222 0)) (.cse178 (= (mod .cse221 2) 0)) (.cse236 (< .cse221 0)) (.cse215 (div .cse219 2)) (.cse214 (div |ULTIMATE.start_main_~d~0#1| 8)) (.cse210 (div .cse194 4)) (.cse204 (div .cse222 2))) (let ((.cse135 (div |ULTIMATE.start_main_~p~0#1| 8)) (.cse129 (div .cse124 2)) (.cse126 (= (mod .cse124 2) 0)) (.cse206 (< .cse124 0)) (.cse205 (- .cse204)) (.cse209 (- .cse210)) (.cse132 (= (mod .cse123 2) 0)) (.cse211 (< .cse123 0)) (.cse213 (- .cse214)) (.cse216 (- .cse215)) (.cse100 (div .cse237 4)) (.cse94 (div .cse88 2)) (.cse96 (= (mod .cse88 2) 0)) (.cse231 (< .cse88 0)) (.cse101 (= (mod .cse89 2) 0)) (.cse232 (< .cse89 0)) (.cse180 (and (not .cse178) .cse236)) (.cse175 (not .cse236)) (.cse208 (+ .cse210 1)) (.cse187 (not .cse235)) (.cse207 (+ .cse204 1)) (.cse183 (and (not .cse188) .cse235)) (.cse168 (and (not .cse169) .cse234)) (.cse172 (not .cse234)) (.cse212 (+ .cse214 1)) (.cse155 (and .cse233 (not .cse162))) (.cse161 (not .cse233)) (.cse28 (* |ULTIMATE.start_main_~B~0#1| 1)) (.cse217 (+ .cse215 1)) (.cse40 (div .cse41 4)) (.cse34 (div .cse33 4))) (let ((.cse25 (+ .cse34 1)) (.cse48 (+ .cse40 1)) (.cse77 (not (>= |ULTIMATE.start_main_~r~0#1| .cse222))) (.cse76 (+ .cse229 |ULTIMATE.start_main_~r~0#1|)) (.cse69 (not (>= |ULTIMATE.start_main_~r~0#1| .cse221))) (.cse71 (+ |ULTIMATE.start_main_~r~0#1| .cse230)) (.cse83 (not (>= |ULTIMATE.start_main_~r~0#1| .cse219))) (.cse81 (+ .cse228 |ULTIMATE.start_main_~r~0#1|)) (.cse87 (+ .cse227 |ULTIMATE.start_main_~r~0#1|)) (.cse86 (not (>= |ULTIMATE.start_main_~r~0#1| .cse220))) (.cse108 (and (or .cse85 (and (or (not (= .cse28 .cse214)) .cse168) (or .cse169 .cse172 (not (= .cse28 .cse212)))) .cse165) (or .cse82 (and (or (not (= .cse28 .cse215)) .cse155) (or .cse161 .cse162 (not (= .cse28 .cse217)))) .cse84 .cse164))) (.cse104 (and (or (and (or (not (= .cse28 .cse210)) .cse180) (or .cse175 (not (= .cse28 .cse208)) .cse178)) .cse68 .cse182) (or (and (or .cse187 .cse188 (not (= .cse28 .cse207))) (or .cse183 (not (= .cse28 .cse204)))) .cse78 .cse79 .cse190))) (.cse110 (>= .cse115 |ULTIMATE.start_main_~d~0#1|)) (.cse102 (not .cse232)) (.cse99 (and (not .cse101) .cse232)) (.cse97 (not .cse231)) (.cse93 (and (not .cse96) .cse231)) (.cse95 (+ .cse94 1)) (.cse103 (+ .cse100 1)) (.cse152 (not (>= .cse24 .cse221))) (.cse153 (+ .cse24 .cse230)) (.cse151 (not (>= .cse24 .cse222))) (.cse150 (+ .cse229 .cse24)) (.cse149 (not (>= .cse24 .cse219))) (.cse148 (+ .cse24 .cse228)) (.cse144 (not (>= .cse24 .cse220))) (.cse145 (+ .cse227 .cse24)) (.cse62 (and (or .cse223 .cse224 .cse43 .cse44) (or .cse225 .cse42 .cse226))) (.cse196 (= (+ |ULTIMATE.start_main_~r~0#1| (* .cse28 |ULTIMATE.start_main_~q~0#1|)) |ULTIMATE.start_main_~A~0#1|)) (.cse64 (and (or .cse68 (not (= .cse28 .cse221))) (or (not (= .cse28 .cse222)) .cse78 .cse79))) (.cse65 (and (or .cse82 (not (= .cse28 .cse219)) .cse84) (or .cse85 (not (= .cse28 .cse220))))) (.cse36 (not .cse218)) (.cse160 (not (>= .cse107 .cse217))) (.cse163 (+ (+ (- 1) .cse216) .cse107)) (.cse156 (+ .cse107 .cse216)) (.cse159 (not (>= .cse107 .cse215))) (.cse167 (+ .cse107 .cse213)) (.cse166 (not (>= .cse107 .cse214))) (.cse171 (+ (+ (- 1) .cse213) .cse107)) (.cse170 (not (>= .cse107 .cse212))) (.cse136 (and (not .cse132) .cse211)) (.cse134 (not .cse211)) (.cse179 (+ .cse209 .cse105)) (.cse181 (not (>= .cse105 .cse210))) (.cse176 (+ .cse105 (+ (- 1) .cse209))) (.cse177 (not (>= .cse105 .cse208))) (.cse189 (not (>= .cse105 .cse207))) (.cse186 (+ .cse105 (+ (- 1) .cse205))) (.cse127 (not .cse206)) (.cse130 (and (not .cse126) .cse206)) (.cse185 (+ .cse105 .cse205)) (.cse184 (not (>= .cse105 .cse204))) (.cse128 (+ 1 .cse129)) (.cse133 (+ .cse135 1))) (let ((.cse49 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse28 .cse154) .cse24))) (.cse16 (or (let ((.cse200 (* |ULTIMATE.start_main_~B~0#1| (+ .cse138 .cse135))) (.cse201 (* |ULTIMATE.start_main_~B~0#1| (+ .cse133 .cse138))) (.cse203 (* |ULTIMATE.start_main_~B~0#1| (+ .cse128 .cse138))) (.cse202 (* (+ .cse138 .cse129) |ULTIMATE.start_main_~B~0#1|))) (and (or (and (or (and (or .cse85 (and (or .cse169 .cse170 (and (or (= (+ .cse171 .cse200) |ULTIMATE.start_main_~A~0#1|) .cse136) (or (= (+ .cse171 .cse201) |ULTIMATE.start_main_~A~0#1|) .cse132 .cse134)) .cse172) (or .cse166 (and (or .cse132 .cse134 (= |ULTIMATE.start_main_~A~0#1| (+ .cse167 .cse201))) (or (= (+ .cse167 .cse200) |ULTIMATE.start_main_~A~0#1|) .cse136)) .cse168)) .cse165) (or (and (or (and (or .cse132 .cse134 (= |ULTIMATE.start_main_~A~0#1| (+ .cse156 .cse201))) (or .cse136 (= (+ .cse156 .cse200) |ULTIMATE.start_main_~A~0#1|))) .cse155 .cse159) (or .cse160 .cse161 .cse162 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse163 .cse200)) .cse136) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse163 .cse201)) .cse132 .cse134)))) .cse82 .cse84 .cse164)) .cse122) (or .cse119 .cse120 (and (or (and (or .cse160 .cse161 .cse162 (and (or .cse130 (= (+ .cse202 .cse163) |ULTIMATE.start_main_~A~0#1|)) (or .cse126 .cse127 (= |ULTIMATE.start_main_~A~0#1| (+ .cse203 .cse163))))) (or .cse155 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse156 .cse202)) .cse130) (or .cse126 .cse127 (= |ULTIMATE.start_main_~A~0#1| (+ .cse156 .cse203)))) .cse159)) .cse82 .cse84 .cse164) (or .cse85 (and (or (and (or .cse126 (= (+ .cse167 .cse203) |ULTIMATE.start_main_~A~0#1|) .cse127) (or .cse130 (= (+ .cse167 .cse202) |ULTIMATE.start_main_~A~0#1|))) .cse166 .cse168) (or .cse169 (and (or .cse126 .cse127 (= |ULTIMATE.start_main_~A~0#1| (+ .cse203 .cse171))) (or (= (+ .cse202 .cse171) |ULTIMATE.start_main_~A~0#1|) .cse130)) .cse170 .cse172)) .cse165)))) .cse35) (or .cse23 (and (or (and (or .cse68 .cse182 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse200 .cse179)) .cse136) (or .cse132 (= (+ .cse201 .cse179) |ULTIMATE.start_main_~A~0#1|) .cse134)) .cse180 .cse181) (or .cse175 .cse177 (and (or (= (+ .cse176 .cse200) |ULTIMATE.start_main_~A~0#1|) .cse136) (or .cse132 (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse201)) .cse134)) .cse178))) (or (and (or .cse187 (and (or .cse132 (= |ULTIMATE.start_main_~A~0#1| (+ .cse186 .cse201)) .cse134) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse186 .cse200)) .cse136)) .cse188 .cse189) (or .cse183 .cse184 (and (or .cse136 (= (+ .cse185 .cse200) |ULTIMATE.start_main_~A~0#1|)) (or .cse132 (= (+ .cse185 .cse201) |ULTIMATE.start_main_~A~0#1|) .cse134)))) .cse78 .cse79 .cse190)) .cse122) (or (and (or (and (or (and (or .cse130 (= (+ .cse202 .cse179) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse203 .cse179) |ULTIMATE.start_main_~A~0#1|) .cse126 .cse127)) .cse180 .cse181) (or .cse175 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse203)) .cse126 .cse127) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse202)) .cse130)) .cse177 .cse178)) .cse68 .cse182) (or (and (or .cse187 .cse188 .cse189 (and (or .cse126 .cse127 (= |ULTIMATE.start_main_~A~0#1| (+ .cse186 .cse203))) (or .cse130 (= |ULTIMATE.start_main_~A~0#1| (+ .cse186 .cse202))))) (or (and (or (= (+ .cse185 .cse203) |ULTIMATE.start_main_~A~0#1|) .cse126 .cse127) (or .cse130 (= (+ .cse185 .cse202) |ULTIMATE.start_main_~A~0#1|))) .cse183 .cse184)) .cse78 .cse79 .cse190)) .cse119 .cse120)) .cse15))) .cse42)) (.cse17 (or .cse36 .cse199)) (.cse19 (or .cse62 .cse196 (and (or .cse23 .cse64 .cse80 .cse15) (or .cse10 .cse65 .cse35)))) (.cse20 (or .cse23 .cse197 .cse198 .cse15)) (.cse22 (or .cse193 (and (or .cse23 (not (= .cse28 .cse194)) .cse15) (or (not (= .cse195 .cse28)) .cse35)) .cse141 .cse196)) (.cse50 (or .cse43 (let ((.cse191 (* (+ .cse88 .cse154) |ULTIMATE.start_main_~B~0#1|)) (.cse192 (* (+ .cse154 .cse89) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse23 (and (or .cse152 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse191 .cse153)) .cse73 .cse75) (or .cse70 (= (+ .cse192 .cse153) |ULTIMATE.start_main_~A~0#1|))) .cse68) (or .cse151 (and (or .cse73 (= |ULTIMATE.start_main_~A~0#1| (+ .cse150 .cse191)) .cse75) (or .cse70 (= |ULTIMATE.start_main_~A~0#1| (+ .cse150 .cse192)))) .cse78 .cse79)) .cse63 .cse15) (or (and (or .cse149 .cse82 (and (or .cse73 .cse75 (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse191))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse192)) .cse70)) .cse84) (or .cse85 .cse144 (and (or .cse73 (= |ULTIMATE.start_main_~A~0#1| (+ .cse145 .cse191)) .cse75) (or (= (+ .cse192 .cse145) |ULTIMATE.start_main_~A~0#1|) .cse70)))) .cse35 .cse66))) .cse44)) (.cse51 (or (let ((.cse173 (* (+ .cse103 .cse109) |ULTIMATE.start_main_~B~0#1|)) (.cse174 (* (+ .cse109 .cse100) |ULTIMATE.start_main_~B~0#1|)) (.cse158 (* |ULTIMATE.start_main_~B~0#1| (+ .cse95 .cse109))) (.cse157 (* |ULTIMATE.start_main_~B~0#1| (+ .cse109 .cse94)))) (and (or .cse35 (and (or .cse73 (and (or (and (or .cse155 (and (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ .cse156 .cse157))) (or .cse96 (= (+ .cse158 .cse156) |ULTIMATE.start_main_~A~0#1|) .cse97)) .cse159) (or .cse160 .cse161 .cse162 (and (or (= (+ .cse163 .cse157) |ULTIMATE.start_main_~A~0#1|) .cse93) (or .cse96 (= |ULTIMATE.start_main_~A~0#1| (+ .cse158 .cse163)) .cse97)))) .cse82 .cse84 .cse164) (or .cse85 .cse165 (and (or .cse166 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse167 .cse157)) .cse93) (or .cse96 .cse97 (= (+ .cse167 .cse158) |ULTIMATE.start_main_~A~0#1|))) .cse168) (or .cse169 .cse170 (and (or .cse96 .cse97 (= |ULTIMATE.start_main_~A~0#1| (+ .cse158 .cse171))) (or .cse93 (= (+ .cse157 .cse171) |ULTIMATE.start_main_~A~0#1|))) .cse172)))) .cse75) (or .cse70 (and (or (and (or (and (or .cse101 (= (+ .cse163 .cse173) |ULTIMATE.start_main_~A~0#1|) .cse102) (or .cse99 (= (+ .cse174 .cse163) |ULTIMATE.start_main_~A~0#1|))) .cse160 .cse161 .cse162) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse156 .cse174)) .cse99) (or .cse101 .cse102 (= |ULTIMATE.start_main_~A~0#1| (+ .cse156 .cse173)))) .cse155 .cse159)) .cse82 .cse84 .cse164) (or .cse85 (and (or .cse169 .cse170 .cse172 (and (or .cse99 (= (+ .cse174 .cse171) |ULTIMATE.start_main_~A~0#1|)) (or .cse101 .cse102 (= (+ .cse173 .cse171) |ULTIMATE.start_main_~A~0#1|)))) (or .cse166 .cse168 (and (or .cse101 .cse102 (= (+ .cse167 .cse173) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse167 .cse174) |ULTIMATE.start_main_~A~0#1|) .cse99)))) .cse165))))) (or .cse23 (and (or .cse70 (and (or .cse68 (and (or .cse175 (and (or (= (+ .cse176 .cse173) |ULTIMATE.start_main_~A~0#1|) .cse101 .cse102) (or .cse99 (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse174)))) .cse177 .cse178) (or (and (or .cse101 (= (+ .cse173 .cse179) |ULTIMATE.start_main_~A~0#1|) .cse102) (or .cse99 (= |ULTIMATE.start_main_~A~0#1| (+ .cse174 .cse179)))) .cse180 .cse181)) .cse182) (or (and (or .cse183 .cse184 (and (or .cse101 (= |ULTIMATE.start_main_~A~0#1| (+ .cse185 .cse173)) .cse102) (or .cse99 (= (+ .cse185 .cse174) |ULTIMATE.start_main_~A~0#1|)))) (or (and (or .cse101 (= (+ .cse186 .cse173) |ULTIMATE.start_main_~A~0#1|) .cse102) (or .cse99 (= |ULTIMATE.start_main_~A~0#1| (+ .cse186 .cse174)))) .cse187 .cse188 .cse189)) .cse78 .cse79 .cse190))) (or .cse73 (and (or .cse78 (and (or .cse187 (and (or .cse96 .cse97 (= (+ .cse186 .cse158) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse186 .cse157)) .cse93)) .cse188 .cse189) (or .cse183 (and (or .cse96 (= (+ .cse185 .cse158) |ULTIMATE.start_main_~A~0#1|) .cse97) (or .cse93 (= (+ .cse185 .cse157) |ULTIMATE.start_main_~A~0#1|))) .cse184)) .cse79 .cse190) (or (and (or .cse175 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse158 .cse176)) .cse96 .cse97) (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse157)))) .cse177 .cse178) (or (and (or (= (+ .cse158 .cse179) |ULTIMATE.start_main_~A~0#1|) .cse96 .cse97) (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ .cse157 .cse179)))) .cse180 .cse181)) .cse68 .cse182)) .cse75)) .cse15))) .cse43 .cse44)) (.cse52 (or (let ((.cse146 (* (+ .cse123 .cse154) |ULTIMATE.start_main_~B~0#1|)) (.cse147 (* (+ .cse154 .cse124) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse35 .cse66 (and (or .cse85 .cse144 (and (or .cse122 (= (+ .cse145 .cse146) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse147 .cse145) |ULTIMATE.start_main_~A~0#1|) .cse119 .cse120))) (or (and (or .cse119 .cse120 (= (+ .cse147 .cse148) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse146)) .cse122)) .cse149 .cse82 .cse84))) (or .cse23 .cse63 (and (or (and (or (= (+ .cse150 .cse147) |ULTIMATE.start_main_~A~0#1|) .cse119 .cse120) (or (= (+ .cse150 .cse146) |ULTIMATE.start_main_~A~0#1|) .cse122)) .cse151 .cse78 .cse79) (or .cse152 (and (or (= (+ .cse146 .cse153) |ULTIMATE.start_main_~A~0#1|) .cse122) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse147 .cse153)) .cse119 .cse120)) .cse68)) .cse15))) .cse42)) (.cse53 (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse28 .cse117) .cse115)) .cse110 .cse141 (not (>= |ULTIMATE.start_main_~r~0#1| .cse33)) (let ((.cse142 (div (* |ULTIMATE.start_main_~p~0#1| 4) 8))) (and (or (not (= .cse142 1)) .cse42) (or .cse43 .cse44 (not (= (+ .cse142 1) 1))))) (let ((.cse143 (div (* |ULTIMATE.start_main_~d~0#1| 4) 8))) (and (or (not (= .cse28 .cse143)) .cse35) (or .cse23 (not (= (+ .cse143 1) .cse28)) .cse15))))) (.cse54 (let ((.cse139 (+ (- (* .cse33 2)) |ULTIMATE.start_main_~r~0#1|))) (or (not (>= .cse139 |ULTIMATE.start_main_~d~0#1|)) (>= .cse139 .cse33) (= (+ (+ .cse139 .cse140) (* (+ |ULTIMATE.start_main_~p~0#1| (+ |ULTIMATE.start_main_~q~0#1| (* 2 .cse41))) |ULTIMATE.start_main_~B~0#1|)) |ULTIMATE.start_main_~A~0#1|)))) (.cse56 (or (and (or .cse125 (and (or .cse126 .cse127 (not (= .cse128 1))) (or (not (= 1 .cse129)) .cse130)) .cse119 .cse120) (or .cse131 (and (or .cse132 (not (= .cse133 1)) .cse134) (or (not (= .cse135 1)) .cse136)) .cse122)) (let ((.cse137 (* .cse28 .cse138))) (and (or (= (+ .cse137 .cse107) |ULTIMATE.start_main_~A~0#1|) .cse35 .cse108) (or .cse23 .cse104 (= (+ .cse105 .cse137) |ULTIMATE.start_main_~A~0#1|) .cse15))) .cse42)) (.cse57 (or (let ((.cse118 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse124))) (.cse121 (* |ULTIMATE.start_main_~B~0#1| (+ .cse123 |ULTIMATE.start_main_~q~0#1|)))) (and (or .cse23 (and (or .cse77 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse76 .cse118)) .cse119 .cse120) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse121 .cse76)) .cse122)) .cse78 .cse79) (or .cse68 .cse69 (and (or (= (+ .cse121 .cse71) |ULTIMATE.start_main_~A~0#1|) .cse122) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse118)) .cse119 .cse120)))) .cse80 .cse15) (or .cse10 .cse35 (and (or .cse82 .cse83 .cse84 (and (or .cse119 (= |ULTIMATE.start_main_~A~0#1| (+ .cse81 .cse118)) .cse120) (or .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ .cse81 .cse121))))) (or .cse85 (and (or (= (+ .cse87 .cse118) |ULTIMATE.start_main_~A~0#1|) .cse119 .cse120) (or (= (+ .cse87 .cse121) |ULTIMATE.start_main_~A~0#1|) .cse122)) .cse86))))) .cse42)) (.cse58 (or .cse110 (let ((.cse113 (* (+ .cse117 .cse48) |ULTIMATE.start_main_~B~0#1|)) (.cse111 (* |ULTIMATE.start_main_~B~0#1| (+ .cse40 .cse117))) (.cse114 (- .cse34))) (and (or .cse23 (let ((.cse112 (+ (+ (- 1) .cse114) .cse115))) (and (or (= (+ .cse111 .cse112) |ULTIMATE.start_main_~A~0#1|) .cse42) (or (= (+ .cse113 .cse112) |ULTIMATE.start_main_~A~0#1|) .cse43 .cse44))) (not (>= .cse115 .cse25)) .cse15) (or (let ((.cse116 (+ .cse114 .cse115))) (and (or .cse43 (= |ULTIMATE.start_main_~A~0#1| (+ .cse113 .cse116)) .cse44) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse116 .cse111)) .cse42))) .cse35 (not (>= .cse115 .cse34))))))) (.cse59 (or (and (or .cse73 .cse92 .cse75 (and (or .cse93 (not (= .cse94 1))) (or (not (= .cse95 1)) .cse96 .cse97))) (or .cse70 .cse98 (and (or .cse99 (not (= .cse100 1))) (or .cse101 .cse102 (not (= .cse103 1)))))) .cse43 (let ((.cse106 (* .cse109 .cse28))) (and (or .cse23 .cse104 (= |ULTIMATE.start_main_~A~0#1| (+ .cse105 .cse106)) .cse15) (or .cse35 (= (+ .cse107 .cse106) |ULTIMATE.start_main_~A~0#1|) .cse108))) .cse44)) (.cse60 (or .cse90 .cse91 .cse35)) (.cse61 (or (let ((.cse72 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse89))) (.cse74 (* |ULTIMATE.start_main_~B~0#1| (+ .cse88 |ULTIMATE.start_main_~q~0#1|)))) (and (or .cse23 (and (or .cse68 .cse69 (and (or .cse70 (= (+ .cse71 .cse72) |ULTIMATE.start_main_~A~0#1|)) (or .cse73 (= |ULTIMATE.start_main_~A~0#1| (+ .cse74 .cse71)) .cse75))) (or (and (or .cse70 (= |ULTIMATE.start_main_~A~0#1| (+ .cse76 .cse72))) (or .cse73 (= (+ .cse74 .cse76) |ULTIMATE.start_main_~A~0#1|) .cse75)) .cse77 .cse78 .cse79)) .cse80 .cse15) (or .cse10 .cse35 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse81 .cse74)) .cse73 .cse75) (or .cse70 (= (+ .cse81 .cse72) |ULTIMATE.start_main_~A~0#1|))) .cse82 .cse83 .cse84) (or .cse85 .cse86 (and (or .cse70 (= (+ .cse87 .cse72) |ULTIMATE.start_main_~A~0#1|)) (or .cse73 (= |ULTIMATE.start_main_~A~0#1| (+ .cse87 .cse74)) .cse75))))))) .cse43 .cse44))) (or (and .cse16 .cse0 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (or (and (or .cse23 (>= .cse24 .cse25) (let ((.cse29 (< .cse25 0)) (.cse26 (= (mod .cse25 2) 0)) (.cse27 (div .cse25 2))) (and (or .cse26 (not (= (+ .cse27 1) .cse28)) (not .cse29)) (or (and .cse29 (not .cse26)) (not (= .cse28 .cse27))))) .cse15) (or (let ((.cse30 (= (mod .cse34 2) 0)) (.cse32 (< .cse34 0)) (.cse31 (div .cse33 8))) (and (or .cse30 (not (= (+ .cse31 1) .cse28)) (not .cse32)) (or (and (not .cse30) .cse32) (not (= .cse28 .cse31))))) .cse35 (>= .cse24 .cse34))) .cse36 (and (or (let ((.cse39 (div .cse41 8)) (.cse37 (= (mod .cse40 2) 0)) (.cse38 (< .cse40 0))) (and (or .cse37 (not .cse38) (not (= (+ .cse39 1) 1))) (or (not (= .cse39 1)) (and (not .cse37) .cse38)))) (= .cse40 1) .cse42) (or .cse43 .cse44 (let ((.cse45 (= (mod .cse48 2) 0)) (.cse46 (< .cse48 0)) (.cse47 (div .cse48 2))) (and (or (and (not .cse45) .cse46) (not (= .cse47 1))) (or .cse45 (not .cse46) (not (= (+ .cse47 1) 1))))) (= 1 .cse48))) .cse49) .cse50 .cse51 .cse52 .cse53 .cse4 .cse5 .cse54 .cse55 .cse56 .cse57 .cse6 .cse58 .cse59 .cse60 .cse61) (and (or .cse62 (and (or .cse23 .cse63 .cse64 .cse15) (or .cse65 .cse35 .cse66)) .cse49) .cse16 .cse0 .cse17 .cse19 .cse20 .cse21 .cse22 .cse50 .cse51 .cse52 .cse53 .cse4 .cse5 .cse54 .cse55 .cse56 .cse57 .cse67 .cse6 .cse58 .cse59 .cse60 .cse61)))))) .cse4 .cse5 .cse6) (and (= |ULTIMATE.start_main_~d~0#1| 1) .cse0 .cse141 (>= |ULTIMATE.start_main_~p~0#1| 1) .cse238 .cse3 (<= 1 |ULTIMATE.start_main_~d~0#1|) .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse21 (= (* 2 .cse13) |ULTIMATE.start_main_~p~0#1|) .cse3 (>= |ULTIMATE.start_main_~r~0#1| .cse11) .cse4 .cse5 .cse55 (= (* .cse11 2) |ULTIMATE.start_main_~d~0#1|) .cse6)))))))))) [2023-02-17 02:08:32,439 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2023-02-17 02:08:32,439 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2023-02-17 02:08:32,439 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2023-02-17 02:08:32,439 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2023-02-17 02:08:32,439 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 14 20) the Hoare annotation is: true [2023-02-17 02:08:32,439 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2023-02-17 02:08:32,442 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-17 02:08:32,443 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 02:08:32,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 02:08:32 BoogieIcfgContainer [2023-02-17 02:08:32,625 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 02:08:32,626 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 02:08:32,626 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 02:08:32,626 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 02:08:32,626 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 02:07:01" (3/4) ... [2023-02-17 02:08:32,628 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-17 02:08:32,633 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-17 02:08:32,637 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2023-02-17 02:08:32,637 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-02-17 02:08:32,637 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-02-17 02:08:32,637 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-17 02:08:32,637 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-17 02:08:32,707 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 02:08:32,707 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 02:08:32,708 INFO L158 Benchmark]: Toolchain (without parser) took 91571.28ms. Allocated memory was 165.7MB in the beginning and 302.0MB in the end (delta: 136.3MB). Free memory was 130.1MB in the beginning and 106.2MB in the end (delta: 23.9MB). Peak memory consumption was 160.2MB. Max. memory is 16.1GB. [2023-02-17 02:08:32,708 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 119.5MB. Free memory was 95.3MB in the beginning and 95.2MB in the end (delta: 69.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 02:08:32,708 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.74ms. Allocated memory is still 165.7MB. Free memory was 129.7MB in the beginning and 119.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 02:08:32,709 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.11ms. Allocated memory is still 165.7MB. Free memory was 119.2MB in the beginning and 117.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 02:08:32,709 INFO L158 Benchmark]: Boogie Preprocessor took 17.14ms. Allocated memory is still 165.7MB. Free memory was 117.8MB in the beginning and 116.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 02:08:32,709 INFO L158 Benchmark]: RCFGBuilder took 294.28ms. Allocated memory is still 165.7MB. Free memory was 116.4MB in the beginning and 134.2MB in the end (delta: -17.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 02:08:32,709 INFO L158 Benchmark]: TraceAbstraction took 90972.64ms. Allocated memory was 165.7MB in the beginning and 302.0MB in the end (delta: 136.3MB). Free memory was 133.7MB in the beginning and 114.6MB in the end (delta: 19.2MB). Peak memory consumption was 181.5MB. Max. memory is 16.1GB. [2023-02-17 02:08:32,709 INFO L158 Benchmark]: Witness Printer took 81.56ms. Allocated memory is still 302.0MB. Free memory was 114.6MB in the beginning and 106.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-17 02:08:32,714 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.14ms. Allocated memory is still 119.5MB. Free memory was 95.3MB in the beginning and 95.2MB in the end (delta: 69.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 180.74ms. Allocated memory is still 165.7MB. Free memory was 129.7MB in the beginning and 119.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.11ms. Allocated memory is still 165.7MB. Free memory was 119.2MB in the beginning and 117.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.14ms. Allocated memory is still 165.7MB. Free memory was 117.8MB in the beginning and 116.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 294.28ms. Allocated memory is still 165.7MB. Free memory was 116.4MB in the beginning and 134.2MB in the end (delta: -17.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 90972.64ms. Allocated memory was 165.7MB in the beginning and 302.0MB in the end (delta: 136.3MB). Free memory was 133.7MB in the beginning and 114.6MB in the end (delta: 19.2MB). Peak memory consumption was 181.5MB. Max. memory is 16.1GB. * Witness Printer took 81.56ms. Allocated memory is still 302.0MB. Free memory was 114.6MB in the beginning and 106.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. 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: 90.7s, OverallIterations: 16, TraceHistogramMax: 21, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 69.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 12 mSolverCounterUnknown, 545 SdHoareTripleChecker+Valid, 56.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 493 mSDsluCounter, 1589 SdHoareTripleChecker+Invalid, 56.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1127 mSDsCounter, 781 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5292 IncrementalHoareTripleChecker+Invalid, 6085 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 781 mSolverCounterUnsat, 462 mSDtfsCounter, 5292 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1982 GetRequests, 1690 SyntacticMatches, 21 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1093 ImplicationChecksByTransitivity, 20.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=198occurred in iteration=14, InterpolantAutomatonStates: 194, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 95 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 160 PreInvPairs, 261 NumberOfFragments, 637425 HoareAnnotationTreeSize, 160 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 16.2s InterpolantComputationTime, 1148 NumberOfCodeBlocks, 1013 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1902 ConstructedInterpolants, 0 QuantifiedInterpolants, 109252 SizeOfPredicates, 63 NumberOfNonLiveVariables, 2573 ConjunctsInSsa, 419 ConjunctsInUnsatCore, 26 InterpolantComputations, 4 PerfectInterpolantSequences, 8420/9424 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: (((((((((((((((((((((((((((((((((((((((((((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p / 2 + 1 == 1) || p % 2 == 0) || !(p < 0)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || ((((!(d < 0) || r + -d >= d / 2 + 1) || (((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || !(B * 1 == (d / 2 + 1) / 2)) && ((!(B * 1 == (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || d % 2 == 0) && (((((d / 2 % 2 == 0 || !(B * 1 == d / 4 + 1)) || !(d / 2 < 0)) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || !(B * 1 == d / 4))) || (!(d % 2 == 0) && d < 0)) || r + -d >= d / 2))) || A == B * 1 * (p + q) + (r + -d)) && A == B * q + r) && (!(r >= d) || A == r + -d + B * (p + q))) && (((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || !(r >= d / 2 + 1)) || d % 2 == 0)) && p >= 1) && (((((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || !(B * 1 == d / 2 + 1)) || d % 2 == 0) && (!(d / 2 == B * 1) || (!(d % 2 == 0) && d < 0)))) || p == 1) || r + B * 1 * q == A)) && ((p % 2 == 0 || ((((!(d < 0) || (((!(r + -d >= (d / 2 + 1) / 2) || (((A == ((p / 2 + 1) / 2 + 1 + (p + q)) * B + (r + -d + -((d / 2 + 1) / 2)) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (p + q + (p / 2 + 1) / 2) * B + (r + -d + -((d / 2 + 1) / 2)) == A))) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((!(r + -d >= (d / 2 + 1) / 2 + 1) || ((((p / 2 + 1) % 2 == 0 || A == -1 + -((d / 2 + 1) / 2) + (r + -d) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == -1 + -((d / 2 + 1) / 2) + (r + -d) + (p + q + (p / 2 + 1) / 2) * B))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || r + -d >= d / 2 + 1) || d % 2 == 0) && ((((((!(r + -d >= d / 4 + 1) || d / 2 % 2 == 0) || ((((p / 2 + 1) % 2 == 0 || !(p / 2 + 1 < 0)) || A == r + -d + (-1 + -(d / 4)) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) && (A == r + -d + (-1 + -(d / 4)) + (p + q + (p / 2 + 1) / 2) * B || (p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0))))) || !(d / 2 < 0)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -d >= d / 4)) || ((((p / 2 + 1) % 2 == 0 || A == -(d / 4) + (r + -d) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) || !(p / 2 + 1 < 0)) && ((p + q + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -d)) == A || (p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)))))) || (!(d % 2 == 0) && d < 0)) || r + -d >= d / 2))) || !(p < 0))) && (((((!(d % 2 == 0) && d < 0) || r + -d >= d / 2) || ((((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -d >= d / 4)) || (((p / 2 < 0 && !(p / 2 % 2 == 0)) || -(d / 4) + (r + -d) + (p / 4 + (p + q)) * B == A) && (((p + q + (p / 4 + 1)) * B + (-(d / 4) + (r + -d)) == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && ((((((!(p / 2 < 0) || p / 2 % 2 == 0) || (p + q + (p / 4 + 1)) * B + (r + -d + (-1 + -(d / 4))) == A) && (A == r + -d + (-1 + -(d / 4)) + (p / 4 + (p + q)) * B || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || !(r + -d >= d / 4 + 1)) || d / 2 % 2 == 0) || !(d / 2 < 0)))) && (((!(d < 0) || r + -d >= d / 2 + 1) || (((((((-1 + -((d / 2 + 1) / 2) + (r + -d) + (p + q + (p / 4 + 1)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0) && (-1 + -((d / 2 + 1) / 2) + (r + -d) + (p / 4 + (p + q)) * B == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || !(r + -d >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((!(r + -d >= (d / 2 + 1) / 2) || (((p / 4 + (p + q)) * B + (r + -d + -((d / 2 + 1) / 2)) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((A == (p + q + (p / 4 + 1)) * B + (r + -d + -((d / 2 + 1) / 2)) || !(p / 2 < 0)) || p / 2 % 2 == 0))) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))))) || d % 2 == 0)) || (p < 0 && !(p % 2 == 0)))) && ((!(p == 1) || !(B * p == d)) || d * q + r == A)) && (((((A == B * 1 * (q + 2 * p) + (-(2 * d) + r) || -(2 * d) + r >= d) || p == 1) || !(r >= 2 * d)) || ((!(p * 4 / 8 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p * 4 / 8 + 1 == 1)))) || ((!(B * 1 == d * 4 / 8) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || !(d * 4 / 8 + 1 == B * 1)) || d % 2 == 0)))) && B * p == d) && ((!(-(2 * d * 2) + r >= d) || -(2 * d * 2) + r >= 2 * d) || -(2 * d * 2) + r + -d + (p + (q + 2 * (2 * p))) * B == A)) && ((!(p == 1) || r + -d + d * (p + q) == A) || !(r >= d))) && B == 1) && (A == B * q + r || (A == B * q + r && 1 <= d))) && (-(2 * d) + r >= d || ((((!(d < 0) || ((B * (2 * p / 4 + (q + 2 * p)) + (-1 + -(2 * d / 4) + (-(2 * d) + r)) == A || (p < 0 && !(p % 2 == 0))) && (((q + 2 * p + (2 * p / 4 + 1)) * B + (-1 + -(2 * d / 4) + (-(2 * d) + r)) == A || p % 2 == 0) || !(p < 0)))) || !(-(2 * d) + r >= 2 * d / 4 + 1)) || d % 2 == 0) && (((((p % 2 == 0 || A == (q + 2 * p + (2 * p / 4 + 1)) * B + (-(2 * d / 4) + (-(2 * d) + r))) || !(p < 0)) && (A == -(2 * d / 4) + (-(2 * d) + r) + B * (2 * p / 4 + (q + 2 * p)) || (p < 0 && !(p % 2 == 0)))) || (!(d % 2 == 0) && d < 0)) || !(-(2 * d) + r >= 2 * d / 4))))) && ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || !(r >= d / 2)) || (!(d % 2 == 0) && d < 0))) && ((((((!(d % 2 == 0) && d < 0) || r + -d + -(2 * d / 4) + 2 * d / 4 * (p + q + 1) == A) || !(r + -d >= 2 * d / 4)) && (((!(d < 0) || !(r + -d >= 2 * d / 4 + 1)) || -1 + -(2 * d / 4) + (r + -d) + (2 * d / 4 + 1) * (p + q + 1) == A) || d % 2 == 0)) || (((!(1 == 2 * p / 4 + 1) || p % 2 == 0) || !(p < 0)) && (!(2 * p / 4 == 1) || (p < 0 && !(p % 2 == 0))))) || r >= 2 * d)) || ((((((((((((((((((((((((((((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p / 2 + 1 == 1) || p % 2 == 0) || !(p < 0)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || ((((!(d < 0) || r + -d >= d / 2 + 1) || (((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || !(B * 1 == (d / 2 + 1) / 2)) && ((!(B * 1 == (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || d % 2 == 0) && (((((d / 2 % 2 == 0 || !(B * 1 == d / 4 + 1)) || !(d / 2 < 0)) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || !(B * 1 == d / 4))) || (!(d % 2 == 0) && d < 0)) || r + -d >= d / 2))) || A == B * 1 * (p + q) + (r + -d)) && (((((((((!(d / 2 % 2 == 0) && d / 2 < 0) || ((((d / 4 % 2 == 0 || !(r + -(d / 2) >= d / 8 + 1)) || ((-1 + -(d / 8) + (r + -(d / 2)) + B * (q + p / 2 + p / 8) == A || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((-1 + -(d / 8) + (r + -(d / 2)) + B * (p / 8 + 1 + (q + p / 2)) == A || p / 4 % 2 == 0) || !(p / 4 < 0)))) || !(d / 4 < 0)) && ((!(r + -(d / 2) >= d / 8) || (((p / 4 % 2 == 0 || !(p / 4 < 0)) || A == r + -(d / 2) + -(d / 8) + B * (p / 8 + 1 + (q + p / 2))) && (r + -(d / 2) + -(d / 8) + B * (q + p / 2 + p / 8) == A || (!(p / 4 % 2 == 0) && p / 4 < 0)))) || (!(d / 4 % 2 == 0) && d / 4 < 0)))) || r + -(d / 2) >= d / 4) && (((((((((p / 4 % 2 == 0 || !(p / 4 < 0)) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + B * (p / 8 + 1 + (q + p / 2))) && ((!(p / 4 % 2 == 0) && p / 4 < 0) || r + -(d / 2) + -((d / 4 + 1) / 2) + B * (q + p / 2 + p / 8) == A)) || (d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0))) || !(r + -(d / 2) >= (d / 4 + 1) / 2)) && (((!(r + -(d / 2) >= (d / 4 + 1) / 2 + 1) || !(d / 4 + 1 < 0)) || (d / 4 + 1) % 2 == 0) || ((A == -1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + B * (q + p / 2 + p / 8) || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((A == -1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + B * (p / 8 + 1 + (q + p / 2)) || p / 4 % 2 == 0) || !(p / 4 < 0))))) || d / 2 % 2 == 0) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1)) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 2 < 0) || p / 2 % 2 == 0) || ((((((((!(r + -(d / 2) >= (d / 4 + 1) / 2 + 1) || !(d / 4 + 1 < 0)) || (d / 4 + 1) % 2 == 0) || (((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || (q + p / 2 + (p / 4 + 1) / 2) * B + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2))) == A) && (((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2)))))) && (((d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0)) || ((A == r + -(d / 2) + -((d / 4 + 1) / 2) + (q + p / 2 + (p / 4 + 1) / 2) * B || (!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0)) && (((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2))))) || !(r + -(d / 2) >= (d / 4 + 1) / 2))) || d / 2 % 2 == 0) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || (((((((p / 4 + 1) % 2 == 0 || r + -(d / 2) + -(d / 8) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) == A) || !(p / 4 + 1 < 0)) && ((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || r + -(d / 2) + -(d / 8) + (q + p / 2 + (p / 4 + 1) / 2) * B == A)) || !(r + -(d / 2) >= d / 8)) || (!(d / 4 % 2 == 0) && d / 4 < 0)) && (((d / 4 % 2 == 0 || ((((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) + (-1 + -(d / 8) + (r + -(d / 2)))) && ((q + p / 2 + (p / 4 + 1) / 2) * B + (-1 + -(d / 8) + (r + -(d / 2))) == A || (!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0)))) || !(r + -(d / 2) >= d / 8 + 1)) || !(d / 4 < 0)))) || r + -(d / 2) >= d / 4)))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || ((((((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (((((A == B * (q + p / 2 + p / 8) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((p / 4 % 2 == 0 || B * (p / 8 + 1 + (q + p / 2)) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A) || !(p / 4 < 0))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 4)) && (((!((d / 2 + 1) / 2 < 0) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 4 + 1)) || ((r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (q + p / 2 + p / 8) == A || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((p / 4 % 2 == 0 || A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (p / 8 + 1 + (q + p / 2))) || !(p / 4 < 0)))) || (d / 2 + 1) / 2 % 2 == 0))) && (((((((!((d / 2 + 1) / 2 + 1 < 0) || (((p / 4 % 2 == 0 || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (p / 8 + 1 + (q + p / 2))) || !(p / 4 < 0)) && (A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (q + p / 2 + p / 8) || (!(p / 4 % 2 == 0) && p / 4 < 0)))) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || !(r + (-1 + -(d / 2)) >= ((d / 2 + 1) / 2 + 1) / 2 + 1)) && (((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || !(r + (-1 + -(d / 2)) >= ((d / 2 + 1) / 2 + 1) / 2)) || (((!(p / 4 % 2 == 0) && p / 4 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (q + p / 2 + p / 8) == A) && ((p / 4 % 2 == 0 || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (p / 8 + 1 + (q + p / 2)) == A) || !(p / 4 < 0))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1)) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && (((((((((((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || (q + p / 2 + (p / 4 + 1) / 2) * B + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A) && ((B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A || (p / 4 + 1) % 2 == 0) || !(p / 4 + 1 < 0))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 4)) && (((!((d / 2 + 1) / 2 < 0) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) || (p / 4 + 1) % 2 == 0) || !(p / 4 + 1 < 0)) && (A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + (q + p / 2 + (p / 4 + 1) / 2) * B || (!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0)))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 4 + 1)) || (d / 2 + 1) / 2 % 2 == 0)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) && (((((((!((d / 2 + 1) / 2 + 1 < 0) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || !(r + (-1 + -(d / 2)) >= ((d / 2 + 1) / 2 + 1) / 2 + 1)) || ((((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2))) && ((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + (q + p / 2 + (p / 4 + 1) / 2) * B))) && (((((r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) == A || (p / 4 + 1) % 2 == 0) || !(p / 4 + 1 < 0)) && ((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + (q + p / 2 + (p / 4 + 1) / 2) * B == A)) || (!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0)) || !(r + (-1 + -(d / 2)) >= ((d / 2 + 1) / 2 + 1) / 2))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1)) || !(p / 2 < 0)) || p / 2 % 2 == 0))) || d % 2 == 0)) || (p < 0 && !(p % 2 == 0)))) && A == B * q + r) && (!(r >= d) || A == r + -d + B * (p + q))) && (!(p == 1) || d * q + r == A)) && (((((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p / 2 + 1 == 1) || p % 2 == 0) || !(p < 0)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || r + B * 1 * q == A) || ((((!(d < 0) || (((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || !(B * 1 == (d / 2 + 1) / 2)) && ((!(B * 1 == (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (((d / 2 % 2 == 0 || !(B * 1 == d / 4 + 1)) || !(d / 2 < 0)) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || !(B * 1 == d / 4)))) || (!(d % 2 == 0) && d < 0))))) && (((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || !(r >= d / 2 + 1)) || d % 2 == 0)) && (((((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || !(B * 1 == d / 2 + 1)) || d % 2 == 0) && (!(d / 2 == B * 1) || (!(d % 2 == 0) && d < 0)))) || p == 1) || r + B * 1 * q == A)) && ((p % 2 == 0 || ((((!(d < 0) || (((!(r + -d >= (d / 2 + 1) / 2) || (((A == ((p / 2 + 1) / 2 + 1 + (p + q)) * B + (r + -d + -((d / 2 + 1) / 2)) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (p + q + (p / 2 + 1) / 2) * B + (r + -d + -((d / 2 + 1) / 2)) == A))) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((!(r + -d >= (d / 2 + 1) / 2 + 1) || ((((p / 2 + 1) % 2 == 0 || A == -1 + -((d / 2 + 1) / 2) + (r + -d) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == -1 + -((d / 2 + 1) / 2) + (r + -d) + (p + q + (p / 2 + 1) / 2) * B))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || r + -d >= d / 2 + 1) || d % 2 == 0) && ((((((!(r + -d >= d / 4 + 1) || d / 2 % 2 == 0) || ((((p / 2 + 1) % 2 == 0 || !(p / 2 + 1 < 0)) || A == r + -d + (-1 + -(d / 4)) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) && (A == r + -d + (-1 + -(d / 4)) + (p + q + (p / 2 + 1) / 2) * B || (p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0))))) || !(d / 2 < 0)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -d >= d / 4)) || ((((p / 2 + 1) % 2 == 0 || A == -(d / 4) + (r + -d) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) || !(p / 2 + 1 < 0)) && ((p + q + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -d)) == A || (p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)))))) || (!(d % 2 == 0) && d < 0)) || r + -d >= d / 2))) || !(p < 0))) && (((((!(d % 2 == 0) && d < 0) || ((((p / 2 + 1) % 2 == 0 || ((((((((d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0)) || (((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2)) && ((((p / 2 + 1) / 2 + 1) % 2 == 0 || B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (r + -(d / 2) + -((d / 4 + 1) / 2)) == A) || !((p / 2 + 1) / 2 + 1 < 0)))) || !(r + -(d / 2) >= (d / 4 + 1) / 2)) && (((!(r + -(d / 2) >= (d / 4 + 1) / 2 + 1) || !(d / 4 + 1 < 0)) || (d / 4 + 1) % 2 == 0) || ((-1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) == A || (!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0)) && ((((p / 2 + 1) / 2 + 1) % 2 == 0 || A == B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2)))) || !((p / 2 + 1) / 2 + 1 < 0))))) || d / 2 % 2 == 0) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || r + -(d / 2) >= d / 4) || (((!(r + -(d / 2) >= d / 8) || ((A == r + -(d / 2) + -(d / 8) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) || (!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0)) && ((((p / 2 + 1) / 2 + 1) % 2 == 0 || !((p / 2 + 1) / 2 + 1 < 0)) || r + -(d / 2) + -(d / 8) + B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) == A))) || (!(d / 4 % 2 == 0) && d / 4 < 0)) && (((d / 4 % 2 == 0 || !(r + -(d / 2) >= d / 8 + 1)) || (((((p / 2 + 1) / 2 + 1) % 2 == 0 || !((p / 2 + 1) / 2 + 1 < 0)) || A == B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (-1 + -(d / 8) + (r + -(d / 2)))) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) + (-1 + -(d / 8) + (r + -(d / 2))) == A))) || !(d / 4 < 0)))))) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || ((((((((((((p / 2 + 1) / 2 % 2 == 0 || -1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2))) == A)) || !(r + -(d / 2) >= (d / 4 + 1) / 2 + 1)) || !(d / 4 + 1 < 0)) || (d / 4 + 1) % 2 == 0) && ((((A == r + -(d / 2) + -((d / 4 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B || (!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0)) && (((p / 2 + 1) / 2 % 2 == 0 || !((p / 2 + 1) / 2 < 0)) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B)) || (d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0))) || !(r + -(d / 2) >= (d / 4 + 1) / 2))) || d / 2 % 2 == 0) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || ((((d / 4 % 2 == 0 || !(r + -(d / 2) >= d / 8 + 1)) || !(d / 4 < 0)) || (((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B + (-1 + -(d / 8) + (r + -(d / 2))) == A) && (((p / 2 + 1) / 2 % 2 == 0 || !((p / 2 + 1) / 2 < 0)) || ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B + (-1 + -(d / 8) + (r + -(d / 2))) == A))) && ((!(r + -(d / 2) >= d / 8) || (!(d / 4 % 2 == 0) && d / 4 < 0)) || ((((p / 2 + 1) / 2 % 2 == 0 || !((p / 2 + 1) / 2 < 0)) || r + -(d / 2) + -(d / 8) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A) && (r + -(d / 2) + -(d / 8) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B == A || (!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0)))))) || r + -(d / 2) >= d / 4))))) && ((!(d < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || ((((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || ((((!((d / 2 + 1) / 2 < 0) || (((r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A || (p / 2 + 1) / 2 % 2 == 0) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 4 + 1)) || (d / 2 + 1) / 2 % 2 == 0) && ((((((p / 2 + 1) / 2 % 2 == 0 || ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 4)))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) && (((((((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || !(r + (-1 + -(d / 2)) >= ((d / 2 + 1) / 2 + 1) / 2)) || ((((p / 2 + 1) / 2 % 2 == 0 || A == r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B == A))) && (((((((p / 2 + 1) / 2 % 2 == 0 || r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B)) || !((d / 2 + 1) / 2 + 1 < 0)) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || !(r + (-1 + -(d / 2)) >= ((d / 2 + 1) / 2 + 1) / 2 + 1))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1))) && (((p / 2 + 1) % 2 == 0 || (((((d / 2 + 1) % 2 == 0 || ((((!((d / 2 + 1) / 2 + 1 < 0) || (((((p / 2 + 1) / 2 + 1) % 2 == 0 || !((p / 2 + 1) / 2 + 1 < 0)) || r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) == A) && (A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) || (!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0)))) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || !(r + (-1 + -(d / 2)) >= ((d / 2 + 1) / 2 + 1) / 2 + 1)) && (((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || (((((p / 2 + 1) / 2 + 1) % 2 == 0 || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) == A) || !((p / 2 + 1) / 2 + 1 < 0)) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) == A))) || !(r + (-1 + -(d / 2)) >= ((d / 2 + 1) / 2 + 1) / 2)))) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) && ((((((!((d / 2 + 1) / 2 < 0) || (((A == B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))) || ((p / 2 + 1) / 2 + 1) % 2 == 0) || !((p / 2 + 1) / 2 + 1 < 0)) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2)))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 4 + 1)) || (d / 2 + 1) / 2 % 2 == 0) && (((((B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A || ((p / 2 + 1) / 2 + 1) % 2 == 0) || !((p / 2 + 1) / 2 + 1 < 0)) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || A == B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 4))) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2))) || !(p / 2 + 1 < 0)))) || d % 2 == 0)) || p % 2 == 0) || !(p < 0))) && 2 <= p) && (((((!(d % 2 == 0) && d < 0) || r + -d >= d / 2) || ((((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -d >= d / 4)) || (((p / 2 < 0 && !(p / 2 % 2 == 0)) || -(d / 4) + (r + -d) + (p / 4 + (p + q)) * B == A) && (((p + q + (p / 4 + 1)) * B + (-(d / 4) + (r + -d)) == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && ((((((!(p / 2 < 0) || p / 2 % 2 == 0) || (p + q + (p / 4 + 1)) * B + (r + -d + (-1 + -(d / 4))) == A) && (A == r + -d + (-1 + -(d / 4)) + (p / 4 + (p + q)) * B || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || !(r + -d >= d / 4 + 1)) || d / 2 % 2 == 0) || !(d / 2 < 0)))) && (((!(d < 0) || r + -d >= d / 2 + 1) || (((((((-1 + -((d / 2 + 1) / 2) + (r + -d) + (p + q + (p / 4 + 1)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0) && (-1 + -((d / 2 + 1) / 2) + (r + -d) + (p / 4 + (p + q)) * B == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || !(r + -d >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((!(r + -d >= (d / 2 + 1) / 2) || (((p / 4 + (p + q)) * B + (r + -d + -((d / 2 + 1) / 2)) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((A == (p + q + (p / 4 + 1)) * B + (r + -d + -((d / 2 + 1) / 2)) || !(p / 2 < 0)) || p / 2 % 2 == 0))) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))))) || d % 2 == 0)) || (p < 0 && !(p % 2 == 0)))) && (((((A == B * 1 * (q + 2 * p) + (-(2 * d) + r) || -(2 * d) + r >= d) || p == 1) || !(r >= 2 * d)) || ((!(p * 4 / 8 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p * 4 / 8 + 1 == 1)))) || ((!(B * 1 == d * 4 / 8) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || !(d * 4 / 8 + 1 == B * 1)) || d % 2 == 0)))) && B * p == d) && A == r + -d + B * (p + q)) && ((!(-(2 * d * 2) + r >= d) || -(2 * d * 2) + r >= 2 * d) || -(2 * d * 2) + r + -d + (p + (q + 2 * (2 * p))) * B == A)) && ((((((p / 4 + 1 == 1 || ((((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || !(1 + (p / 4 + 1) / 2 == 1)) && (!(1 == (p / 4 + 1) / 2) || (!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0)))) || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 == 1 || (((p / 4 % 2 == 0 || !(p / 8 + 1 == 1)) || !(p / 4 < 0)) && (!(p / 8 == 1) || (!(p / 4 % 2 == 0) && p / 4 < 0)))) || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || (((B * 1 * (q + p / 2) + (r + -(d / 2)) == A || (!(d % 2 == 0) && d < 0)) || ((((!(d / 2 % 2 == 0) && d / 2 < 0) || ((!(B * 1 == d / 8) || (!(d / 4 % 2 == 0) && d / 4 < 0)) && ((d / 4 % 2 == 0 || !(d / 4 < 0)) || !(B * 1 == d / 8 + 1)))) || r + -(d / 2) >= d / 4) && (((d / 2 % 2 == 0 || ((!(B * 1 == (d / 4 + 1) / 2) || (d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0))) && ((!(d / 4 + 1 < 0) || (d / 4 + 1) % 2 == 0) || !(B * 1 == (d / 4 + 1) / 2 + 1)))) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1))) && (((!(d < 0) || (((((!(B * 1 == (d / 2 + 1) / 4) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) && ((!((d / 2 + 1) / 2 < 0) || !(B * 1 == (d / 2 + 1) / 4 + 1)) || (d / 2 + 1) / 2 % 2 == 0)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) && ((((((!((d / 2 + 1) / 2 + 1 < 0) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2 + 1)) && ((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1))) || r + (-1 + -(d / 2)) + B * 1 * (q + p / 2) == A) || d % 2 == 0))) || (p < 0 && !(p % 2 == 0)))) && (((((!(d < 0) || ((((!(r >= (d / 2 + 1) / 2 + 1) || (((A == -1 + -((d / 2 + 1) / 2) + r + B * (q + (p / 4 + 1)) || !(p / 2 < 0)) || p / 2 % 2 == 0) && (A == B * (p / 4 + q) + (-1 + -((d / 2 + 1) / 2) + r) || (p / 2 < 0 && !(p / 2 % 2 == 0))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && (((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || !(r >= (d / 2 + 1) / 2)) || ((B * (p / 4 + q) + (r + -((d / 2 + 1) / 2)) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((A == r + -((d / 2 + 1) / 2) + B * (q + (p / 4 + 1)) || !(p / 2 < 0)) || p / 2 % 2 == 0))))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (!(d % 2 == 0) && d < 0)) || ((((d / 2 % 2 == 0 || !(r >= d / 4 + 1)) || !(d / 2 < 0)) || (((!(p / 2 < 0) || A == -1 + -(d / 4) + r + B * (q + (p / 4 + 1))) || p / 2 % 2 == 0) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == -1 + -(d / 4) + r + B * (p / 4 + q)))) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || (((-(d / 4) + r + B * (q + (p / 4 + 1)) == A || !(p / 2 < 0)) || p / 2 % 2 == 0) && (-(d / 4) + r + B * (p / 4 + q) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))))) || !(r >= d / 4))))) || (p < 0 && !(p % 2 == 0)))) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && B == 1) && (-(2 * d) + r >= d || ((((!(d < 0) || ((B * (2 * p / 4 + (q + 2 * p)) + (-1 + -(2 * d / 4) + (-(2 * d) + r)) == A || (p < 0 && !(p % 2 == 0))) && (((q + 2 * p + (2 * p / 4 + 1)) * B + (-1 + -(2 * d / 4) + (-(2 * d) + r)) == A || p % 2 == 0) || !(p < 0)))) || !(-(2 * d) + r >= 2 * d / 4 + 1)) || d % 2 == 0) && (((((p % 2 == 0 || A == (q + 2 * p + (2 * p / 4 + 1)) * B + (-(2 * d / 4) + (-(2 * d) + r))) || !(p < 0)) && (A == -(2 * d / 4) + (-(2 * d) + r) + B * (2 * p / 4 + (q + 2 * p)) || (p < 0 && !(p % 2 == 0)))) || (!(d % 2 == 0) && d < 0)) || !(-(2 * d) + r >= 2 * d / 4))))) && ((((((((p / 2 + 1) % 2 == 0 || (p / 2 + 1) / 2 + 1 == 1) || !(p / 2 + 1 < 0)) || (((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || !(((p / 2 + 1) / 2 + 1) / 2 == 1)) && ((!(((p / 2 + 1) / 2 + 1) / 2 + 1 == 1) || ((p / 2 + 1) / 2 + 1) % 2 == 0) || !((p / 2 + 1) / 2 + 1 < 0)))) && (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (p / 2 + 1) / 2 == 1) || (((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || !((p / 2 + 1) / 4 == 1)) && (((p / 2 + 1) / 2 % 2 == 0 || !((p / 2 + 1) / 2 < 0)) || !((p / 2 + 1) / 4 + 1 == 1))))) || p % 2 == 0) || ((((!(d < 0) || (((((!(B * 1 == (d / 2 + 1) / 4) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) && ((!((d / 2 + 1) / 2 < 0) || !(B * 1 == (d / 2 + 1) / 4 + 1)) || (d / 2 + 1) / 2 % 2 == 0)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) && ((((((!((d / 2 + 1) / 2 + 1 < 0) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2 + 1)) && ((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1))) || A == r + (-1 + -(d / 2)) + (q + (p / 2 + 1)) * (B * 1)) || d % 2 == 0) && (((!(d % 2 == 0) && d < 0) || r + -(d / 2) + (q + (p / 2 + 1)) * (B * 1) == A) || ((((!(d / 2 % 2 == 0) && d / 2 < 0) || ((!(B * 1 == d / 8) || (!(d / 4 % 2 == 0) && d / 4 < 0)) && ((d / 4 % 2 == 0 || !(d / 4 < 0)) || !(B * 1 == d / 8 + 1)))) || r + -(d / 2) >= d / 4) && (((d / 2 % 2 == 0 || ((!(B * 1 == (d / 4 + 1) / 2) || (d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0))) && ((!(d / 4 + 1 < 0) || (d / 4 + 1) % 2 == 0) || !(B * 1 == (d / 4 + 1) / 2 + 1)))) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1))))) || !(p < 0))) && ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || !(r >= d / 2)) || (!(d % 2 == 0) && d < 0))) && ((((((!(d < 0) || ((((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || !(r >= (d / 2 + 1) / 2)) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + -((d / 2 + 1) / 2) + B * (q + (p / 2 + 1) / 2) == A) && (((p / 2 + 1) % 2 == 0 || A == B * ((p / 2 + 1) / 2 + 1 + q) + (r + -((d / 2 + 1) / 2))) || !(p / 2 + 1 < 0)))) && ((((((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == -1 + -((d / 2 + 1) / 2) + r + B * (q + (p / 2 + 1) / 2)) && (((p / 2 + 1) % 2 == 0 || B * ((p / 2 + 1) / 2 + 1 + q) + (-1 + -((d / 2 + 1) / 2) + r) == A) || !(p / 2 + 1 < 0))) || !(r >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (!(d % 2 == 0) && d < 0)) || (((((((A == -1 + -(d / 4) + r + B * ((p / 2 + 1) / 2 + 1 + q) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || -1 + -(d / 4) + r + B * (q + (p / 2 + 1) / 2) == A)) || d / 2 % 2 == 0) || !(r >= d / 4 + 1)) || !(d / 2 < 0)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r >= d / 4)) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || -(d / 4) + r + B * (q + (p / 2 + 1) / 2) == A) && (((p / 2 + 1) % 2 == 0 || A == -(d / 4) + r + B * ((p / 2 + 1) / 2 + 1 + q)) || !(p / 2 + 1 < 0))))))) || p % 2 == 0) || !(p < 0)))) || (((((((((((((((((A + -r + -d) / 2 == d && ((A + d + r) % 2 == 0 || !(A + -1 * (d + r) < 0))) || ((A + -1 * (d + r) < 0 && d == (A + -r + -d) / 2 + 1) && !((A + d + r) % 2 == 0))) && (p == 1 || (((((p + q + p / 2) * B + (r + -d + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || A == r + -d + -(d / 2) + (p + q + (p / 2 + 1)) * B)) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p % 2 == 0 || A == r + -d + (-1 + -(d / 2)) + (p + q + (p / 2 + 1)) * B) || !(p < 0)) && (A == r + -d + (-1 + -(d / 2)) + (p + q + p / 2) * B || (p < 0 && !(p % 2 == 0))))) || d % 2 == 0)))) && p == 1) && B == -2 * B + -1 * r + A) && 2 == A + -1 * (d + r)) && (((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || ((((p / 2 + 1) % 2 == 0 || -1 + -(d / 4) + (r + -(d / 2)) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B == A) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-1 + -(d / 4) + (r + -(d / 2)))))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -(d / 2))) == A) && ((A == ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (-(d / 4) + (r + -(d / 2))) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)))))) && (((((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 4 + (q + p / 2)) * B + (-(d / 4) + (r + -(d / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((-(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((p / 2 < 0 && !(p / 2 % 2 == 0)) || (p / 4 + (q + p / 2)) * B + (-1 + -(d / 4) + (r + -(d / 2))) == A) && ((!(p / 2 < 0) || p / 2 % 2 == 0) || A == -1 + -(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B)) || d / 2 % 2 == 0) || !(d / 2 < 0))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || (!(d % 2 == 0) && d < 0))) && d + r >= d) && (p == 1 || ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)))) && A == r + -d + B * (p + q)) && -2 + q == 1) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && B == 1) && !(d + r + (A + -1 * (d + r)) >= 2 * (2 * 1))) && ((!(d < 0) || d % 2 == 0) || ((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || ((((((((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B == A))))) && (((((((!(p / 2 < 0) || p / 2 % 2 == 0) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + 1 + (q + p / 2)) * B == A) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + (q + p / 2)) * B)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((d / 2 + 1) % 2 == 0 || !(d / 2 + 1 < 0)) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)) + (p / 4 + 1 + (q + p / 2)) * B || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 + (q + p / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)))) && -1 * 2 + (-1 * p + q) == 0)) || ((((A == B * q + r && p >= 1) && ((!(p == 1) || !(B * p == d)) || d * q + r == A)) && B * p == d) && B == 1)) || (((((((((A == B * q + r && 8 <= p) && 2 * (2 * (2 * 1)) == p) && q == 0) && r >= 2 * (2 * B)) && B * p == d) && A == r) && 2 * (2 * B) * 2 == d) && B == 1) && (((((((((((((((((((((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((d / 2 == B || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || B == d / 2 + 1) || d % 2 == 0))) && (((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && B == 1) || ((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && d * q + r == A) && B == 1))) && A == B * q + r) && (p == 1 || (((((p + q + p / 2) * B + (r + -d + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || A == r + -d + -(d / 2) + (p + q + (p / 2 + 1)) * B)) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p % 2 == 0 || A == r + -d + (-1 + -(d / 2)) + (p + q + (p / 2 + 1)) * B) || !(p < 0)) && (A == r + -d + (-1 + -(d / 2)) + (p + q + p / 2) * B || (p < 0 && !(p % 2 == 0))))) || d % 2 == 0)))) && r >= d / 2) && (!(p == 1) || d * q + r == A)) && (((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || ((((p / 2 + 1) % 2 == 0 || -1 + -(d / 4) + (r + -(d / 2)) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B == A) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-1 + -(d / 4) + (r + -(d / 2)))))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -(d / 2))) == A) && ((A == ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (-(d / 4) + (r + -(d / 2))) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)))))) && (((((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 4 + (q + p / 2)) * B + (-(d / 4) + (r + -(d / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((-(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((p / 2 < 0 && !(p / 2 % 2 == 0)) || (p / 4 + (q + p / 2)) * B + (-1 + -(d / 4) + (r + -(d / 2))) == A) && ((!(p / 2 < 0) || p / 2 % 2 == 0) || A == -1 + -(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B)) || d / 2 % 2 == 0) || !(d / 2 < 0))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || (!(d % 2 == 0) && d < 0))) && 2 <= d / 2) && (p == 1 || ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)))) && ((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p % 2 == 0) || (((!(d % 2 == 0) && d < 0) || ((((A == -1 + -(d / 4) + (r + -(d / 2)) + (q + (p / 2 + 1) + 1) * (d / 4 + 1) || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || (q + (p / 2 + 1) + 1) * (d / 4) + (-(d / 4) + (r + -(d / 2))) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || A == (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))))) || d % 2 == 0))) || !(p < 0))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((((!(d < 0) || !(r >= d / 2 + 1)) || d % 2 == 0) || A == r + (-1 + -(d / 2)) + (q + 1) * (d / 2 + 1)) && ((!(r >= d / 2) || (!(d % 2 == 0) && d < 0)) || d / 2 * (q + 1) + (r + -(d / 2)) == A)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(r + -d >= d / 2) || (!(d % 2 == 0) && d < 0)) || r + -d + -(d / 2) + d / 2 * (p + q + 1) == A) && (((!(d < 0) || !(r + -d >= d / 2 + 1)) || A == (p + q + 1) * (d / 2 + 1) + (r + -d + (-1 + -(d / 2)))) || d % 2 == 0)))) && A == r + -d + B * (p + q)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (((!(d % 2 == 0) && d < 0) || ((((-1 + -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4 + 1) == A || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + p / 2 + 1) * ((d / 2 + 1) / 2)) && (((A == (q + p / 2 + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || d % 2 == 0))) || (p < 0 && !(p % 2 == 0)))) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && (!(p == 1) || B == d)) && ((!(d < 0) || d % 2 == 0) || ((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || ((((((((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B == A))))) && (((((((!(p / 2 < 0) || p / 2 % 2 == 0) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + 1 + (q + p / 2)) * B == A) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + (q + p / 2)) * B)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((d / 2 + 1) % 2 == 0 || !(d / 2 + 1 < 0)) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)) + (p / 4 + 1 + (q + p / 2)) * B || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 + (q + p / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)))) && d % 2 == 0) || ((((((((((((((((((((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((d / 2 == B || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || B == d / 2 + 1) || d % 2 == 0))) && (((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && B == 1) || ((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && d * q + r == A) && B == 1))) && A == B * q + r) && (p == 1 || (((((p + q + p / 2) * B + (r + -d + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || A == r + -d + -(d / 2) + (p + q + (p / 2 + 1)) * B)) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p % 2 == 0 || A == r + -d + (-1 + -(d / 2)) + (p + q + (p / 2 + 1)) * B) || !(p < 0)) && (A == r + -d + (-1 + -(d / 2)) + (p + q + p / 2) * B || (p < 0 && !(p % 2 == 0))))) || d % 2 == 0)))) && r >= d / 2) && (((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || ((((p / 2 + 1) % 2 == 0 || -1 + -(d / 4) + (r + -(d / 2)) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B == A) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-1 + -(d / 4) + (r + -(d / 2)))))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -(d / 2))) == A) && ((A == ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (-(d / 4) + (r + -(d / 2))) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)))))) && (((((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 4 + (q + p / 2)) * B + (-(d / 4) + (r + -(d / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((-(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((p / 2 < 0 && !(p / 2 % 2 == 0)) || (p / 4 + (q + p / 2)) * B + (-1 + -(d / 4) + (r + -(d / 2))) == A) && ((!(p / 2 < 0) || p / 2 % 2 == 0) || A == -1 + -(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B)) || d / 2 % 2 == 0) || !(d / 2 < 0))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || (!(d % 2 == 0) && d < 0))) && 2 <= d / 2) && (p == 1 || ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)))) && ((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p % 2 == 0) || (((!(d % 2 == 0) && d < 0) || ((((A == -1 + -(d / 4) + (r + -(d / 2)) + (q + (p / 2 + 1) + 1) * (d / 4 + 1) || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || (q + (p / 2 + 1) + 1) * (d / 4) + (-(d / 4) + (r + -(d / 2))) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || A == (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))))) || d % 2 == 0))) || !(p < 0))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((((!(d < 0) || !(r >= d / 2 + 1)) || d % 2 == 0) || A == r + (-1 + -(d / 2)) + (q + 1) * (d / 2 + 1)) && ((!(r >= d / 2) || (!(d % 2 == 0) && d < 0)) || d / 2 * (q + 1) + (r + -(d / 2)) == A)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(r + -d >= d / 2) || (!(d % 2 == 0) && d < 0)) || r + -d + -(d / 2) + d / 2 * (p + q + 1) == A) && (((!(d < 0) || !(r + -d >= d / 2 + 1)) || A == (p + q + 1) * (d / 2 + 1) + (r + -d + (-1 + -(d / 2)))) || d % 2 == 0)))) && A == r + -d + B * (p + q)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (((!(d % 2 == 0) && d < 0) || ((((-1 + -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4 + 1) == A || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + p / 2 + 1) * ((d / 2 + 1) / 2)) && (((A == (q + p / 2 + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || d % 2 == 0))) || (p < 0 && !(p % 2 == 0)))) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && d * q + r == A) && (!(p == 1) || B == d)) && ((!(d < 0) || d % 2 == 0) || ((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || ((((((((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B == A))))) && (((((((!(p / 2 < 0) || p / 2 % 2 == 0) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + 1 + (q + p / 2)) * B == A) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + (q + p / 2)) * B)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((d / 2 + 1) % 2 == 0 || !(d / 2 + 1 < 0)) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)) + (p / 4 + 1 + (q + p / 2)) * B || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 + (q + p / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)))) && d % 2 == 0)))) || ((((((((((d + r == A && d == 1) && (((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0))) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && p == 1) && B == d) && r == -B + A) && A == r + -d + B * (p + q)) && B == 1) && q == 0 + 1) && p + 0 == q)) || ((((((A == B * q + r && (!(r >= d) || A == r + -d + B * (p + q))) && p >= 1) && ((!(p == 1) || !(B * p == d)) || d * q + r == A)) && B * p == d) && ((!(-(2 * d * 2) + r >= d) || -(2 * d * 2) + r >= 2 * d) || -(2 * d * 2) + r + -d + (p + (q + 2 * (2 * p))) * B == A)) && B == 1)) || (((((((((((((((((A == B * q + r && (!(r >= d) || A == r + -d + B * (p + q))) && (((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || !(r >= d / 2 + 1)) || d % 2 == 0)) && p >= 1) && (((((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || !(B * 1 == d / 2 + 1)) || d % 2 == 0) && (!(d / 2 == B * 1) || (!(d % 2 == 0) && d < 0)))) || p == 1) || r + B * 1 * q == A)) && (((((((!(d < 0) || r + -d >= 2 * d / 4 + 1) || ((((2 * d / 4 + 1) % 2 == 0 || !((2 * d / 4 + 1) / 2 + 1 == B * 1)) || !(2 * d / 4 + 1 < 0)) && ((2 * d / 4 + 1 < 0 && !((2 * d / 4 + 1) % 2 == 0)) || !(B * 1 == (2 * d / 4 + 1) / 2)))) || d % 2 == 0) && (((((2 * d / 4 % 2 == 0 || !(2 * d / 8 + 1 == B * 1)) || !(2 * d / 4 < 0)) && ((!(2 * d / 4 % 2 == 0) && 2 * d / 4 < 0) || !(B * 1 == 2 * d / 8))) || (!(d % 2 == 0) && d < 0)) || r + -d >= 2 * d / 4)) || !(r >= d)) || ((((((2 * p / 4 % 2 == 0 || !(2 * p / 4 < 0)) || !(2 * p / 8 + 1 == 1)) && (!(2 * p / 8 == 1) || (!(2 * p / 4 % 2 == 0) && 2 * p / 4 < 0))) || 2 * p / 4 == 1) || (p < 0 && !(p % 2 == 0))) && (((p % 2 == 0 || !(p < 0)) || (((!((2 * p / 4 + 1) % 2 == 0) && 2 * p / 4 + 1 < 0) || !((2 * p / 4 + 1) / 2 == 1)) && (((2 * p / 4 + 1) % 2 == 0 || !(2 * p / 4 + 1 < 0)) || !((2 * p / 4 + 1) / 2 + 1 == 1)))) || 1 == 2 * p / 4 + 1))) || A == B * 1 * (p + q) + (r + -d))) && ((p % 2 == 0 || ((((!(d < 0) || (((!(r + -d >= (d / 2 + 1) / 2) || (((A == ((p / 2 + 1) / 2 + 1 + (p + q)) * B + (r + -d + -((d / 2 + 1) / 2)) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (p + q + (p / 2 + 1) / 2) * B + (r + -d + -((d / 2 + 1) / 2)) == A))) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((!(r + -d >= (d / 2 + 1) / 2 + 1) || ((((p / 2 + 1) % 2 == 0 || A == -1 + -((d / 2 + 1) / 2) + (r + -d) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == -1 + -((d / 2 + 1) / 2) + (r + -d) + (p + q + (p / 2 + 1) / 2) * B))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || r + -d >= d / 2 + 1) || d % 2 == 0) && ((((((!(r + -d >= d / 4 + 1) || d / 2 % 2 == 0) || ((((p / 2 + 1) % 2 == 0 || !(p / 2 + 1 < 0)) || A == r + -d + (-1 + -(d / 4)) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) && (A == r + -d + (-1 + -(d / 4)) + (p + q + (p / 2 + 1) / 2) * B || (p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0))))) || !(d / 2 < 0)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -d >= d / 4)) || ((((p / 2 + 1) % 2 == 0 || A == -(d / 4) + (r + -d) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) || !(p / 2 + 1 < 0)) && ((p + q + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -d)) == A || (p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)))))) || (!(d % 2 == 0) && d < 0)) || r + -d >= d / 2))) || !(p < 0))) && (((((!(d % 2 == 0) && d < 0) || r + -d >= d / 2) || ((((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -d >= d / 4)) || (((p / 2 < 0 && !(p / 2 % 2 == 0)) || -(d / 4) + (r + -d) + (p / 4 + (p + q)) * B == A) && (((p + q + (p / 4 + 1)) * B + (-(d / 4) + (r + -d)) == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && ((((((!(p / 2 < 0) || p / 2 % 2 == 0) || (p + q + (p / 4 + 1)) * B + (r + -d + (-1 + -(d / 4))) == A) && (A == r + -d + (-1 + -(d / 4)) + (p / 4 + (p + q)) * B || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || !(r + -d >= d / 4 + 1)) || d / 2 % 2 == 0) || !(d / 2 < 0)))) && (((!(d < 0) || r + -d >= d / 2 + 1) || (((((((-1 + -((d / 2 + 1) / 2) + (r + -d) + (p + q + (p / 4 + 1)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0) && (-1 + -((d / 2 + 1) / 2) + (r + -d) + (p / 4 + (p + q)) * B == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || !(r + -d >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((!(r + -d >= (d / 2 + 1) / 2) || (((p / 4 + (p + q)) * B + (r + -d + -((d / 2 + 1) / 2)) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((A == (p + q + (p / 4 + 1)) * B + (r + -d + -((d / 2 + 1) / 2)) || !(p / 2 < 0)) || p / 2 % 2 == 0))) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))))) || d % 2 == 0)) || (p < 0 && !(p % 2 == 0)))) && ((!(p == 1) || !(B * p == d)) || d * q + r == A)) && (((((A == B * 1 * (q + 2 * p) + (-(2 * d) + r) || -(2 * d) + r >= d) || p == 1) || !(r >= 2 * d)) || ((!(p * 4 / 8 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p * 4 / 8 + 1 == 1)))) || ((!(B * 1 == d * 4 / 8) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || !(d * 4 / 8 + 1 == B * 1)) || d % 2 == 0)))) && B * p == d) && ((!(-(2 * d * 2) + r >= d) || -(2 * d * 2) + r >= 2 * d) || -(2 * d * 2) + r + -d + (p + (q + 2 * (2 * p))) * B == A)) && ((!(p == 1) || r + -d + d * (p + q) == A) || !(r >= d))) && B == 1) && (A == B * q + r || (A == B * q + r && 1 <= d))) && (-(2 * d) + r >= d || ((((!(d < 0) || ((B * (2 * p / 4 + (q + 2 * p)) + (-1 + -(2 * d / 4) + (-(2 * d) + r)) == A || (p < 0 && !(p % 2 == 0))) && (((q + 2 * p + (2 * p / 4 + 1)) * B + (-1 + -(2 * d / 4) + (-(2 * d) + r)) == A || p % 2 == 0) || !(p < 0)))) || !(-(2 * d) + r >= 2 * d / 4 + 1)) || d % 2 == 0) && (((((p % 2 == 0 || A == (q + 2 * p + (2 * p / 4 + 1)) * B + (-(2 * d / 4) + (-(2 * d) + r))) || !(p < 0)) && (A == -(2 * d / 4) + (-(2 * d) + r) + B * (2 * p / 4 + (q + 2 * p)) || (p < 0 && !(p % 2 == 0)))) || (!(d % 2 == 0) && d < 0)) || !(-(2 * d) + r >= 2 * d / 4))))) && ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || !(r >= d / 2)) || (!(d % 2 == 0) && d < 0))) && ((((((!(d % 2 == 0) && d < 0) || r + -d + -(2 * d / 4) + 2 * d / 4 * (p + q + 1) == A) || !(r + -d >= 2 * d / 4)) && (((!(d < 0) || !(r + -d >= 2 * d / 4 + 1)) || -1 + -(2 * d / 4) + (r + -d) + (2 * d / 4 + 1) * (p + q + 1) == A) || d % 2 == 0)) || (((!(1 == 2 * p / 4 + 1) || p % 2 == 0) || !(p < 0)) && (!(2 * p / 4 == 1) || (p < 0 && !(p % 2 == 0))))) || r >= 2 * d))) || ((((p == 1 && B == d) && q == 0) && A == r) && B == 1)) || (((((((A == B * q + r && (!(p == 1) || d * q + r == A)) && 2 <= p) && ((!(p == 1) || !(B * p == d)) || d * q + r == A)) && B * p == d) && A == r + -d + B * (p + q)) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && B == 1)) || (((((((((((((((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((d / 2 == B || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || B == d / 2 + 1) || d % 2 == 0))) && (((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && B == 1) || ((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && d * q + r == A) && B == 1))) && r >= d / 2) && 2 * (2 * B) == d) && 2 <= d / 2) && p == 2 * (2 * 1)) && q == 0) && d == 2 * (2 * 1)) && !(r >= d)) && A == r) && B == 1) && (!(p == 1) || B == d)) && d % 2 == 0)) || (((((((((((((((((((A == B * q + r && (!(r >= d) || A == r + -d + B * (p + q))) && (((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || !(r >= d / 2 + 1)) || d % 2 == 0)) && (((((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || !(B * 1 == d / 2 + 1)) || d % 2 == 0) && (!(d / 2 == B * 1) || (!(d % 2 == 0) && d < 0)))) || p == 1) || r + B * 1 * q == A)) && (((((((!(d < 0) || r + -d >= 2 * d / 4 + 1) || ((((2 * d / 4 + 1) % 2 == 0 || !((2 * d / 4 + 1) / 2 + 1 == B * 1)) || !(2 * d / 4 + 1 < 0)) && ((2 * d / 4 + 1 < 0 && !((2 * d / 4 + 1) % 2 == 0)) || !(B * 1 == (2 * d / 4 + 1) / 2)))) || d % 2 == 0) && (((((2 * d / 4 % 2 == 0 || !(2 * d / 8 + 1 == B * 1)) || !(2 * d / 4 < 0)) && ((!(2 * d / 4 % 2 == 0) && 2 * d / 4 < 0) || !(B * 1 == 2 * d / 8))) || (!(d % 2 == 0) && d < 0)) || r + -d >= 2 * d / 4)) || !(r >= d)) || ((((((2 * p / 4 % 2 == 0 || !(2 * p / 4 < 0)) || !(2 * p / 8 + 1 == 1)) && (!(2 * p / 8 == 1) || (!(2 * p / 4 % 2 == 0) && 2 * p / 4 < 0))) || 2 * p / 4 == 1) || (p < 0 && !(p % 2 == 0))) && (((p % 2 == 0 || !(p < 0)) || (((!((2 * p / 4 + 1) % 2 == 0) && 2 * p / 4 + 1 < 0) || !((2 * p / 4 + 1) / 2 == 1)) && (((2 * p / 4 + 1) % 2 == 0 || !(2 * p / 4 + 1 < 0)) || !((2 * p / 4 + 1) / 2 + 1 == 1)))) || 1 == 2 * p / 4 + 1))) || A == B * 1 * (p + q) + (r + -d))) && ((p % 2 == 0 || ((((!(d < 0) || (((!(r + -d >= (d / 2 + 1) / 2) || (((A == ((p / 2 + 1) / 2 + 1 + (p + q)) * B + (r + -d + -((d / 2 + 1) / 2)) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (p + q + (p / 2 + 1) / 2) * B + (r + -d + -((d / 2 + 1) / 2)) == A))) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((!(r + -d >= (d / 2 + 1) / 2 + 1) || ((((p / 2 + 1) % 2 == 0 || A == -1 + -((d / 2 + 1) / 2) + (r + -d) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == -1 + -((d / 2 + 1) / 2) + (r + -d) + (p + q + (p / 2 + 1) / 2) * B))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || r + -d >= d / 2 + 1) || d % 2 == 0) && ((((((!(r + -d >= d / 4 + 1) || d / 2 % 2 == 0) || ((((p / 2 + 1) % 2 == 0 || !(p / 2 + 1 < 0)) || A == r + -d + (-1 + -(d / 4)) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) && (A == r + -d + (-1 + -(d / 4)) + (p + q + (p / 2 + 1) / 2) * B || (p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0))))) || !(d / 2 < 0)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -d >= d / 4)) || ((((p / 2 + 1) % 2 == 0 || A == -(d / 4) + (r + -d) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) || !(p / 2 + 1 < 0)) && ((p + q + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -d)) == A || (p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)))))) || (!(d % 2 == 0) && d < 0)) || r + -d >= d / 2))) || !(p < 0))) && 2 <= p) && (((((!(d % 2 == 0) && d < 0) || r + -d >= d / 2) || ((((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -d >= d / 4)) || (((p / 2 < 0 && !(p / 2 % 2 == 0)) || -(d / 4) + (r + -d) + (p / 4 + (p + q)) * B == A) && (((p + q + (p / 4 + 1)) * B + (-(d / 4) + (r + -d)) == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && ((((((!(p / 2 < 0) || p / 2 % 2 == 0) || (p + q + (p / 4 + 1)) * B + (r + -d + (-1 + -(d / 4))) == A) && (A == r + -d + (-1 + -(d / 4)) + (p / 4 + (p + q)) * B || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || !(r + -d >= d / 4 + 1)) || d / 2 % 2 == 0) || !(d / 2 < 0)))) && (((!(d < 0) || r + -d >= d / 2 + 1) || (((((((-1 + -((d / 2 + 1) / 2) + (r + -d) + (p + q + (p / 4 + 1)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0) && (-1 + -((d / 2 + 1) / 2) + (r + -d) + (p / 4 + (p + q)) * B == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || !(r + -d >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((!(r + -d >= (d / 2 + 1) / 2) || (((p / 4 + (p + q)) * B + (r + -d + -((d / 2 + 1) / 2)) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((A == (p + q + (p / 4 + 1)) * B + (r + -d + -((d / 2 + 1) / 2)) || !(p / 2 < 0)) || p / 2 % 2 == 0))) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))))) || d % 2 == 0)) || (p < 0 && !(p % 2 == 0)))) && ((!(p == 1) || !(B * p == d)) || d * q + r == A)) && (((((A == B * 1 * (q + 2 * p) + (-(2 * d) + r) || -(2 * d) + r >= d) || p == 1) || !(r >= 2 * d)) || ((!(p * 4 / 8 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p * 4 / 8 + 1 == 1)))) || ((!(B * 1 == d * 4 / 8) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || !(d * 4 / 8 + 1 == B * 1)) || d % 2 == 0)))) && B * p == d) && A == r + -d + B * (p + q)) && ((!(-(2 * d * 2) + r >= d) || -(2 * d * 2) + r >= 2 * d) || -(2 * d * 2) + r + -d + (p + (q + 2 * (2 * p))) * B == A)) && ((!(p == 1) || r + -d + d * (p + q) == A) || !(r >= d))) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && B == 1) && (A == B * q + r || (A == B * q + r && 1 <= d))) && (-(2 * d) + r >= d || ((((!(d < 0) || ((B * (2 * p / 4 + (q + 2 * p)) + (-1 + -(2 * d / 4) + (-(2 * d) + r)) == A || (p < 0 && !(p % 2 == 0))) && (((q + 2 * p + (2 * p / 4 + 1)) * B + (-1 + -(2 * d / 4) + (-(2 * d) + r)) == A || p % 2 == 0) || !(p < 0)))) || !(-(2 * d) + r >= 2 * d / 4 + 1)) || d % 2 == 0) && (((((p % 2 == 0 || A == (q + 2 * p + (2 * p / 4 + 1)) * B + (-(2 * d / 4) + (-(2 * d) + r))) || !(p < 0)) && (A == -(2 * d / 4) + (-(2 * d) + r) + B * (2 * p / 4 + (q + 2 * p)) || (p < 0 && !(p % 2 == 0)))) || (!(d % 2 == 0) && d < 0)) || !(-(2 * d) + r >= 2 * d / 4))))) && ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || !(r >= d / 2)) || (!(d % 2 == 0) && d < 0))) && ((((((!(d % 2 == 0) && d < 0) || r + -d + -(2 * d / 4) + 2 * d / 4 * (p + q + 1) == A) || !(r + -d >= 2 * d / 4)) && (((!(d < 0) || !(r + -d >= 2 * d / 4 + 1)) || -1 + -(2 * d / 4) + (r + -d) + (2 * d / 4 + 1) * (p + q + 1) == A) || d % 2 == 0)) || (((!(1 == 2 * p / 4 + 1) || p % 2 == 0) || !(p < 0)) && (!(2 * p / 4 == 1) || (p < 0 && !(p % 2 == 0))))) || r >= 2 * d))) || (((((((((((((((4 <= p && A == B * q + r) && (p == 1 || (((((p + q + p / 2) * B + (r + -d + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || A == r + -d + -(d / 2) + (p + q + (p / 2 + 1)) * B)) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p % 2 == 0 || A == r + -d + (-1 + -(d / 2)) + (p + q + (p / 2 + 1)) * B) || !(p < 0)) && (A == r + -d + (-1 + -(d / 2)) + (p + q + p / 2) * B || (p < 0 && !(p % 2 == 0))))) || d % 2 == 0)))) && (!(p == 1) || d * q + r == A)) && (((((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p / 2 + 1 == 1) || p % 2 == 0) || !(p < 0)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || r + B * 1 * q == A) || ((((!(d < 0) || (((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || !(B * 1 == (d / 2 + 1) / 2)) && ((!(B * 1 == (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (((d / 2 % 2 == 0 || !(B * 1 == d / 4 + 1)) || !(d / 2 < 0)) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || !(B * 1 == d / 4)))) || (!(d % 2 == 0) && d < 0))))) && (p == 1 || ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((((!(d < 0) || !(r >= d / 2 + 1)) || d % 2 == 0) || A == r + (-1 + -(d / 2)) + (q + 1) * (d / 2 + 1)) && ((!(r >= d / 2) || (!(d % 2 == 0) && d < 0)) || d / 2 * (q + 1) + (r + -(d / 2)) == A)))) && ((!(p == 1) || !(B * p == d)) || d * q + r == A)) && 2 <= d) && B * p == d) && A == r + -d + B * (p + q)) && (((((!(d < 0) || ((((!(r >= (d / 2 + 1) / 2 + 1) || (((A == -1 + -((d / 2 + 1) / 2) + r + B * (q + (p / 4 + 1)) || !(p / 2 < 0)) || p / 2 % 2 == 0) && (A == B * (p / 4 + q) + (-1 + -((d / 2 + 1) / 2) + r) || (p / 2 < 0 && !(p / 2 % 2 == 0))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && (((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || !(r >= (d / 2 + 1) / 2)) || ((B * (p / 4 + q) + (r + -((d / 2 + 1) / 2)) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((A == r + -((d / 2 + 1) / 2) + B * (q + (p / 4 + 1)) || !(p / 2 < 0)) || p / 2 % 2 == 0))))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (!(d % 2 == 0) && d < 0)) || ((((d / 2 % 2 == 0 || !(r >= d / 4 + 1)) || !(d / 2 < 0)) || (((!(p / 2 < 0) || A == -1 + -(d / 4) + r + B * (q + (p / 4 + 1))) || p / 2 % 2 == 0) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == -1 + -(d / 4) + r + B * (p / 4 + q)))) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || (((-(d / 4) + r + B * (q + (p / 4 + 1)) == A || !(p / 2 < 0)) || p / 2 % 2 == 0) && (-(d / 4) + r + B * (p / 4 + q) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))))) || !(r >= d / 4))))) || (p < 0 && !(p % 2 == 0)))) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && B == 1) && (!(p == 1) || B == d)) && ((((((!(d < 0) || ((((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || !(r >= (d / 2 + 1) / 2)) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + -((d / 2 + 1) / 2) + B * (q + (p / 2 + 1) / 2) == A) && (((p / 2 + 1) % 2 == 0 || A == B * ((p / 2 + 1) / 2 + 1 + q) + (r + -((d / 2 + 1) / 2))) || !(p / 2 + 1 < 0)))) && ((((((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == -1 + -((d / 2 + 1) / 2) + r + B * (q + (p / 2 + 1) / 2)) && (((p / 2 + 1) % 2 == 0 || B * ((p / 2 + 1) / 2 + 1 + q) + (-1 + -((d / 2 + 1) / 2) + r) == A) || !(p / 2 + 1 < 0))) || !(r >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (!(d % 2 == 0) && d < 0)) || (((((((A == -1 + -(d / 4) + r + B * ((p / 2 + 1) / 2 + 1 + q) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || -1 + -(d / 4) + r + B * (q + (p / 2 + 1) / 2) == A)) || d / 2 % 2 == 0) || !(r >= d / 4 + 1)) || !(d / 2 < 0)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r >= d / 4)) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || -(d / 4) + r + B * (q + (p / 2 + 1) / 2) == A) && (((p / 2 + 1) % 2 == 0 || A == -(d / 4) + r + B * ((p / 2 + 1) / 2 + 1 + q)) || !(p / 2 + 1 < 0))))))) || p % 2 == 0) || !(p < 0)))) || ((((((((((((((((((4 <= p && p == 4) && d + r == A) && A == B * q + r) && (p == 1 || (((((p + q + p / 2) * B + (r + -d + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || A == r + -d + -(d / 2) + (p + q + (p / 2 + 1)) * B)) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p % 2 == 0 || A == r + -d + (-1 + -(d / 2)) + (p + q + (p / 2 + 1)) * B) || !(p < 0)) && (A == r + -d + (-1 + -(d / 2)) + (p + q + p / 2) * B || (p < 0 && !(p % 2 == 0))))) || d % 2 == 0)))) && (!(p == 1) || d * q + r == A)) && (p == 1 || ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((((!(d < 0) || !(r >= d / 2 + 1)) || d % 2 == 0) || A == r + (-1 + -(d / 2)) + (q + 1) * (d / 2 + 1)) && ((!(r >= d / 2) || (!(d % 2 == 0) && d < 0)) || d / 2 * (q + 1) + (r + -(d / 2)) == A)))) && d == B * 4) && 2 <= d) && B * p == d) && A == r + -d + B * (p + q)) && A + -d == r) && A >= 2 * (2 * B)) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && B == 1) && (!(p == 1) || B == d)) && p + 0 == q) && d + r >= 2 * (2 * B))) || ((((A == B * q + r && (((((((((((((((((((((((((((((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p / 2 + 1 == 1) || p % 2 == 0) || !(p < 0)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || ((((!(d < 0) || r + -d >= d / 2 + 1) || (((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || !(B * 1 == (d / 2 + 1) / 2)) && ((!(B * 1 == (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || d % 2 == 0) && (((((d / 2 % 2 == 0 || !(B * 1 == d / 4 + 1)) || !(d / 2 < 0)) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || !(B * 1 == d / 4))) || (!(d % 2 == 0) && d < 0)) || r + -d >= d / 2))) || A == B * 1 * (p + q) + (r + -d)) && (((((((((!(d / 2 % 2 == 0) && d / 2 < 0) || ((((d / 4 % 2 == 0 || !(r + -(d / 2) >= d / 8 + 1)) || ((-1 + -(d / 8) + (r + -(d / 2)) + B * (q + p / 2 + p / 8) == A || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((-1 + -(d / 8) + (r + -(d / 2)) + B * (p / 8 + 1 + (q + p / 2)) == A || p / 4 % 2 == 0) || !(p / 4 < 0)))) || !(d / 4 < 0)) && ((!(r + -(d / 2) >= d / 8) || (((p / 4 % 2 == 0 || !(p / 4 < 0)) || A == r + -(d / 2) + -(d / 8) + B * (p / 8 + 1 + (q + p / 2))) && (r + -(d / 2) + -(d / 8) + B * (q + p / 2 + p / 8) == A || (!(p / 4 % 2 == 0) && p / 4 < 0)))) || (!(d / 4 % 2 == 0) && d / 4 < 0)))) || r + -(d / 2) >= d / 4) && (((((((((p / 4 % 2 == 0 || !(p / 4 < 0)) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + B * (p / 8 + 1 + (q + p / 2))) && ((!(p / 4 % 2 == 0) && p / 4 < 0) || r + -(d / 2) + -((d / 4 + 1) / 2) + B * (q + p / 2 + p / 8) == A)) || (d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0))) || !(r + -(d / 2) >= (d / 4 + 1) / 2)) && (((!(r + -(d / 2) >= (d / 4 + 1) / 2 + 1) || !(d / 4 + 1 < 0)) || (d / 4 + 1) % 2 == 0) || ((A == -1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + B * (q + p / 2 + p / 8) || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((A == -1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + B * (p / 8 + 1 + (q + p / 2)) || p / 4 % 2 == 0) || !(p / 4 < 0))))) || d / 2 % 2 == 0) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1)) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 2 < 0) || p / 2 % 2 == 0) || ((((((((!(r + -(d / 2) >= (d / 4 + 1) / 2 + 1) || !(d / 4 + 1 < 0)) || (d / 4 + 1) % 2 == 0) || (((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || (q + p / 2 + (p / 4 + 1) / 2) * B + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2))) == A) && (((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2)))))) && (((d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0)) || ((A == r + -(d / 2) + -((d / 4 + 1) / 2) + (q + p / 2 + (p / 4 + 1) / 2) * B || (!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0)) && (((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2))))) || !(r + -(d / 2) >= (d / 4 + 1) / 2))) || d / 2 % 2 == 0) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || (((((((p / 4 + 1) % 2 == 0 || r + -(d / 2) + -(d / 8) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) == A) || !(p / 4 + 1 < 0)) && ((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || r + -(d / 2) + -(d / 8) + (q + p / 2 + (p / 4 + 1) / 2) * B == A)) || !(r + -(d / 2) >= d / 8)) || (!(d / 4 % 2 == 0) && d / 4 < 0)) && (((d / 4 % 2 == 0 || ((((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) + (-1 + -(d / 8) + (r + -(d / 2)))) && ((q + p / 2 + (p / 4 + 1) / 2) * B + (-1 + -(d / 8) + (r + -(d / 2))) == A || (!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0)))) || !(r + -(d / 2) >= d / 8 + 1)) || !(d / 4 < 0)))) || r + -(d / 2) >= d / 4)))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || ((((((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (((((A == B * (q + p / 2 + p / 8) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((p / 4 % 2 == 0 || B * (p / 8 + 1 + (q + p / 2)) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A) || !(p / 4 < 0))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 4)) && (((!((d / 2 + 1) / 2 < 0) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 4 + 1)) || ((r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (q + p / 2 + p / 8) == A || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((p / 4 % 2 == 0 || A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (p / 8 + 1 + (q + p / 2))) || !(p / 4 < 0)))) || (d / 2 + 1) / 2 % 2 == 0))) && (((((((!((d / 2 + 1) / 2 + 1 < 0) || (((p / 4 % 2 == 0 || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (p / 8 + 1 + (q + p / 2))) || !(p / 4 < 0)) && (A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (q + p / 2 + p / 8) || (!(p / 4 % 2 == 0) && p / 4 < 0)))) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || !(r + (-1 + -(d / 2)) >= ((d / 2 + 1) / 2 + 1) / 2 + 1)) && (((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || !(r + (-1 + -(d / 2)) >= ((d / 2 + 1) / 2 + 1) / 2)) || (((!(p / 4 % 2 == 0) && p / 4 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (q + p / 2 + p / 8) == A) && ((p / 4 % 2 == 0 || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (p / 8 + 1 + (q + p / 2)) == A) || !(p / 4 < 0))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1)) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && (((((((((((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || (q + p / 2 + (p / 4 + 1) / 2) * B + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A) && ((B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A || (p / 4 + 1) % 2 == 0) || !(p / 4 + 1 < 0))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 4)) && (((!((d / 2 + 1) / 2 < 0) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) || (p / 4 + 1) % 2 == 0) || !(p / 4 + 1 < 0)) && (A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + (q + p / 2 + (p / 4 + 1) / 2) * B || (!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0)))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 4 + 1)) || (d / 2 + 1) / 2 % 2 == 0)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) && (((((((!((d / 2 + 1) / 2 + 1 < 0) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || !(r + (-1 + -(d / 2)) >= ((d / 2 + 1) / 2 + 1) / 2 + 1)) || ((((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2))) && ((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + (q + p / 2 + (p / 4 + 1) / 2) * B))) && (((((r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) == A || (p / 4 + 1) % 2 == 0) || !(p / 4 + 1 < 0)) && ((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + (q + p / 2 + (p / 4 + 1) / 2) * B == A)) || (!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0)) || !(r + (-1 + -(d / 2)) >= ((d / 2 + 1) / 2 + 1) / 2))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1)) || !(p / 2 < 0)) || p / 2 % 2 == 0))) || d % 2 == 0)) || (p < 0 && !(p % 2 == 0)))) && A == B * q + r) && (!(r >= d) || A == r + -d + B * (p + q))) && (((((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p / 2 + 1 == 1) || p % 2 == 0) || !(p < 0)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || r + B * 1 * q == A) || ((((!(d < 0) || (((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || !(B * 1 == (d / 2 + 1) / 2)) && ((!(B * 1 == (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (((d / 2 % 2 == 0 || !(B * 1 == d / 4 + 1)) || !(d / 2 < 0)) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || !(B * 1 == d / 4)))) || (!(d % 2 == 0) && d < 0))))) && (((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || !(r >= d / 2 + 1)) || d % 2 == 0)) && 8 <= p) && (((((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || !(B * 1 == d / 2 + 1)) || d % 2 == 0) && (!(d / 2 == B * 1) || (!(d % 2 == 0) && d < 0)))) || p == 1) || r + B * 1 * q == A)) && ((p % 2 == 0 || ((((!(d < 0) || (((!(r + -d >= (d / 2 + 1) / 2) || (((A == ((p / 2 + 1) / 2 + 1 + (p + q)) * B + (r + -d + -((d / 2 + 1) / 2)) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (p + q + (p / 2 + 1) / 2) * B + (r + -d + -((d / 2 + 1) / 2)) == A))) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((!(r + -d >= (d / 2 + 1) / 2 + 1) || ((((p / 2 + 1) % 2 == 0 || A == -1 + -((d / 2 + 1) / 2) + (r + -d) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == -1 + -((d / 2 + 1) / 2) + (r + -d) + (p + q + (p / 2 + 1) / 2) * B))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || r + -d >= d / 2 + 1) || d % 2 == 0) && ((((((!(r + -d >= d / 4 + 1) || d / 2 % 2 == 0) || ((((p / 2 + 1) % 2 == 0 || !(p / 2 + 1 < 0)) || A == r + -d + (-1 + -(d / 4)) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) && (A == r + -d + (-1 + -(d / 4)) + (p + q + (p / 2 + 1) / 2) * B || (p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0))))) || !(d / 2 < 0)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -d >= d / 4)) || ((((p / 2 + 1) % 2 == 0 || A == -(d / 4) + (r + -d) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) || !(p / 2 + 1 < 0)) && ((p + q + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -d)) == A || (p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)))))) || (!(d % 2 == 0) && d < 0)) || r + -d >= d / 2))) || !(p < 0))) && (((((!(d % 2 == 0) && d < 0) || ((((p / 2 + 1) % 2 == 0 || ((((((((d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0)) || (((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2)) && ((((p / 2 + 1) / 2 + 1) % 2 == 0 || B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (r + -(d / 2) + -((d / 4 + 1) / 2)) == A) || !((p / 2 + 1) / 2 + 1 < 0)))) || !(r + -(d / 2) >= (d / 4 + 1) / 2)) && (((!(r + -(d / 2) >= (d / 4 + 1) / 2 + 1) || !(d / 4 + 1 < 0)) || (d / 4 + 1) % 2 == 0) || ((-1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) == A || (!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0)) && ((((p / 2 + 1) / 2 + 1) % 2 == 0 || A == B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2)))) || !((p / 2 + 1) / 2 + 1 < 0))))) || d / 2 % 2 == 0) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || r + -(d / 2) >= d / 4) || (((!(r + -(d / 2) >= d / 8) || ((A == r + -(d / 2) + -(d / 8) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) || (!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0)) && ((((p / 2 + 1) / 2 + 1) % 2 == 0 || !((p / 2 + 1) / 2 + 1 < 0)) || r + -(d / 2) + -(d / 8) + B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) == A))) || (!(d / 4 % 2 == 0) && d / 4 < 0)) && (((d / 4 % 2 == 0 || !(r + -(d / 2) >= d / 8 + 1)) || (((((p / 2 + 1) / 2 + 1) % 2 == 0 || !((p / 2 + 1) / 2 + 1 < 0)) || A == B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (-1 + -(d / 8) + (r + -(d / 2)))) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) + (-1 + -(d / 8) + (r + -(d / 2))) == A))) || !(d / 4 < 0)))))) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || ((((((((((((p / 2 + 1) / 2 % 2 == 0 || -1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2))) == A)) || !(r + -(d / 2) >= (d / 4 + 1) / 2 + 1)) || !(d / 4 + 1 < 0)) || (d / 4 + 1) % 2 == 0) && ((((A == r + -(d / 2) + -((d / 4 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B || (!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0)) && (((p / 2 + 1) / 2 % 2 == 0 || !((p / 2 + 1) / 2 < 0)) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B)) || (d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0))) || !(r + -(d / 2) >= (d / 4 + 1) / 2))) || d / 2 % 2 == 0) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || ((((d / 4 % 2 == 0 || !(r + -(d / 2) >= d / 8 + 1)) || !(d / 4 < 0)) || (((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B + (-1 + -(d / 8) + (r + -(d / 2))) == A) && (((p / 2 + 1) / 2 % 2 == 0 || !((p / 2 + 1) / 2 < 0)) || ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B + (-1 + -(d / 8) + (r + -(d / 2))) == A))) && ((!(r + -(d / 2) >= d / 8) || (!(d / 4 % 2 == 0) && d / 4 < 0)) || ((((p / 2 + 1) / 2 % 2 == 0 || !((p / 2 + 1) / 2 < 0)) || r + -(d / 2) + -(d / 8) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A) && (r + -(d / 2) + -(d / 8) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B == A || (!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0)))))) || r + -(d / 2) >= d / 4))))) && ((!(d < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || ((((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || ((((!((d / 2 + 1) / 2 < 0) || (((r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A || (p / 2 + 1) / 2 % 2 == 0) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 4 + 1)) || (d / 2 + 1) / 2 % 2 == 0) && ((((((p / 2 + 1) / 2 % 2 == 0 || ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 4)))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) && (((((((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || !(r + (-1 + -(d / 2)) >= ((d / 2 + 1) / 2 + 1) / 2)) || ((((p / 2 + 1) / 2 % 2 == 0 || A == r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B == A))) && (((((((p / 2 + 1) / 2 % 2 == 0 || r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B)) || !((d / 2 + 1) / 2 + 1 < 0)) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || !(r + (-1 + -(d / 2)) >= ((d / 2 + 1) / 2 + 1) / 2 + 1))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1))) && (((p / 2 + 1) % 2 == 0 || (((((d / 2 + 1) % 2 == 0 || ((((!((d / 2 + 1) / 2 + 1 < 0) || (((((p / 2 + 1) / 2 + 1) % 2 == 0 || !((p / 2 + 1) / 2 + 1 < 0)) || r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) == A) && (A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) || (!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0)))) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || !(r + (-1 + -(d / 2)) >= ((d / 2 + 1) / 2 + 1) / 2 + 1)) && (((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || (((((p / 2 + 1) / 2 + 1) % 2 == 0 || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) == A) || !((p / 2 + 1) / 2 + 1 < 0)) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) == A))) || !(r + (-1 + -(d / 2)) >= ((d / 2 + 1) / 2 + 1) / 2)))) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) && ((((((!((d / 2 + 1) / 2 < 0) || (((A == B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))) || ((p / 2 + 1) / 2 + 1) % 2 == 0) || !((p / 2 + 1) / 2 + 1 < 0)) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2)))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 4 + 1)) || (d / 2 + 1) / 2 % 2 == 0) && (((((B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A || ((p / 2 + 1) / 2 + 1) % 2 == 0) || !((p / 2 + 1) / 2 + 1 < 0)) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || A == B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 4))) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2))) || !(p / 2 + 1 < 0)))) || d % 2 == 0)) || p % 2 == 0) || !(p < 0))) && (((((!(d % 2 == 0) && d < 0) || r + -d >= d / 2) || ((((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -d >= d / 4)) || (((p / 2 < 0 && !(p / 2 % 2 == 0)) || -(d / 4) + (r + -d) + (p / 4 + (p + q)) * B == A) && (((p + q + (p / 4 + 1)) * B + (-(d / 4) + (r + -d)) == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && ((((((!(p / 2 < 0) || p / 2 % 2 == 0) || (p + q + (p / 4 + 1)) * B + (r + -d + (-1 + -(d / 4))) == A) && (A == r + -d + (-1 + -(d / 4)) + (p / 4 + (p + q)) * B || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || !(r + -d >= d / 4 + 1)) || d / 2 % 2 == 0) || !(d / 2 < 0)))) && (((!(d < 0) || r + -d >= d / 2 + 1) || (((((((-1 + -((d / 2 + 1) / 2) + (r + -d) + (p + q + (p / 4 + 1)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0) && (-1 + -((d / 2 + 1) / 2) + (r + -d) + (p / 4 + (p + q)) * B == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || !(r + -d >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((!(r + -d >= (d / 2 + 1) / 2) || (((p / 4 + (p + q)) * B + (r + -d + -((d / 2 + 1) / 2)) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((A == (p + q + (p / 4 + 1)) * B + (r + -d + -((d / 2 + 1) / 2)) || !(p / 2 < 0)) || p / 2 % 2 == 0))) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))))) || d % 2 == 0)) || (p < 0 && !(p % 2 == 0)))) && (((((A == B * 1 * (q + 2 * p) + (-(2 * d) + r) || -(2 * d) + r >= d) || p == 1) || !(r >= 2 * d)) || ((!(p * 4 / 8 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p * 4 / 8 + 1 == 1)))) || ((!(B * 1 == d * 4 / 8) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || !(d * 4 / 8 + 1 == B * 1)) || d % 2 == 0)))) && B * p == d) && A == r) && ((!(-(2 * d * 2) + r >= d) || -(2 * d * 2) + r >= 2 * d) || -(2 * d * 2) + r + -d + (p + (q + 2 * (2 * p))) * B == A)) && ((((((p / 4 + 1 == 1 || ((((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || !(1 + (p / 4 + 1) / 2 == 1)) && (!(1 == (p / 4 + 1) / 2) || (!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0)))) || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 == 1 || (((p / 4 % 2 == 0 || !(p / 8 + 1 == 1)) || !(p / 4 < 0)) && (!(p / 8 == 1) || (!(p / 4 % 2 == 0) && p / 4 < 0)))) || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || (((B * 1 * (q + p / 2) + (r + -(d / 2)) == A || (!(d % 2 == 0) && d < 0)) || ((((!(d / 2 % 2 == 0) && d / 2 < 0) || ((!(B * 1 == d / 8) || (!(d / 4 % 2 == 0) && d / 4 < 0)) && ((d / 4 % 2 == 0 || !(d / 4 < 0)) || !(B * 1 == d / 8 + 1)))) || r + -(d / 2) >= d / 4) && (((d / 2 % 2 == 0 || ((!(B * 1 == (d / 4 + 1) / 2) || (d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0))) && ((!(d / 4 + 1 < 0) || (d / 4 + 1) % 2 == 0) || !(B * 1 == (d / 4 + 1) / 2 + 1)))) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1))) && (((!(d < 0) || (((((!(B * 1 == (d / 2 + 1) / 4) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) && ((!((d / 2 + 1) / 2 < 0) || !(B * 1 == (d / 2 + 1) / 4 + 1)) || (d / 2 + 1) / 2 % 2 == 0)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) && ((((((!((d / 2 + 1) / 2 + 1 < 0) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2 + 1)) && ((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1))) || r + (-1 + -(d / 2)) + B * 1 * (q + p / 2) == A) || d % 2 == 0))) || (p < 0 && !(p % 2 == 0)))) && (((((!(d < 0) || ((((!(r >= (d / 2 + 1) / 2 + 1) || (((A == -1 + -((d / 2 + 1) / 2) + r + B * (q + (p / 4 + 1)) || !(p / 2 < 0)) || p / 2 % 2 == 0) && (A == B * (p / 4 + q) + (-1 + -((d / 2 + 1) / 2) + r) || (p / 2 < 0 && !(p / 2 % 2 == 0))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && (((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || !(r >= (d / 2 + 1) / 2)) || ((B * (p / 4 + q) + (r + -((d / 2 + 1) / 2)) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((A == r + -((d / 2 + 1) / 2) + B * (q + (p / 4 + 1)) || !(p / 2 < 0)) || p / 2 % 2 == 0))))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (!(d % 2 == 0) && d < 0)) || ((((d / 2 % 2 == 0 || !(r >= d / 4 + 1)) || !(d / 2 < 0)) || (((!(p / 2 < 0) || A == -1 + -(d / 4) + r + B * (q + (p / 4 + 1))) || p / 2 % 2 == 0) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == -1 + -(d / 4) + r + B * (p / 4 + q)))) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || (((-(d / 4) + r + B * (q + (p / 4 + 1)) == A || !(p / 2 < 0)) || p / 2 % 2 == 0) && (-(d / 4) + r + B * (p / 4 + q) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))))) || !(r >= d / 4))))) || (p < 0 && !(p % 2 == 0)))) && d * q + r == A) && B == 1) && (((((((((((((((((((((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((d / 2 == B || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || B == d / 2 + 1) || d % 2 == 0))) && (((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && B == 1) || ((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && d * q + r == A) && B == 1))) && A == B * q + r) && (p == 1 || (((((p + q + p / 2) * B + (r + -d + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || A == r + -d + -(d / 2) + (p + q + (p / 2 + 1)) * B)) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p % 2 == 0 || A == r + -d + (-1 + -(d / 2)) + (p + q + (p / 2 + 1)) * B) || !(p < 0)) && (A == r + -d + (-1 + -(d / 2)) + (p + q + p / 2) * B || (p < 0 && !(p % 2 == 0))))) || d % 2 == 0)))) && r >= d / 2) && (!(p == 1) || d * q + r == A)) && (((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || ((((p / 2 + 1) % 2 == 0 || -1 + -(d / 4) + (r + -(d / 2)) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B == A) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-1 + -(d / 4) + (r + -(d / 2)))))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -(d / 2))) == A) && ((A == ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (-(d / 4) + (r + -(d / 2))) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)))))) && (((((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 4 + (q + p / 2)) * B + (-(d / 4) + (r + -(d / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((-(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((p / 2 < 0 && !(p / 2 % 2 == 0)) || (p / 4 + (q + p / 2)) * B + (-1 + -(d / 4) + (r + -(d / 2))) == A) && ((!(p / 2 < 0) || p / 2 % 2 == 0) || A == -1 + -(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B)) || d / 2 % 2 == 0) || !(d / 2 < 0))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || (!(d % 2 == 0) && d < 0))) && 2 <= d / 2) && (p == 1 || ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)))) && ((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p % 2 == 0) || (((!(d % 2 == 0) && d < 0) || ((((A == -1 + -(d / 4) + (r + -(d / 2)) + (q + (p / 2 + 1) + 1) * (d / 4 + 1) || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || (q + (p / 2 + 1) + 1) * (d / 4) + (-(d / 4) + (r + -(d / 2))) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || A == (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))))) || d % 2 == 0))) || !(p < 0))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((((!(d < 0) || !(r >= d / 2 + 1)) || d % 2 == 0) || A == r + (-1 + -(d / 2)) + (q + 1) * (d / 2 + 1)) && ((!(r >= d / 2) || (!(d % 2 == 0) && d < 0)) || d / 2 * (q + 1) + (r + -(d / 2)) == A)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(r + -d >= d / 2) || (!(d % 2 == 0) && d < 0)) || r + -d + -(d / 2) + d / 2 * (p + q + 1) == A) && (((!(d < 0) || !(r + -d >= d / 2 + 1)) || A == (p + q + 1) * (d / 2 + 1) + (r + -d + (-1 + -(d / 2)))) || d % 2 == 0)))) && A == r + -d + B * (p + q)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (((!(d % 2 == 0) && d < 0) || ((((-1 + -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4 + 1) == A || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + p / 2 + 1) * ((d / 2 + 1) / 2)) && (((A == (q + p / 2 + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || d % 2 == 0))) || (p < 0 && !(p % 2 == 0)))) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && (!(p == 1) || B == d)) && ((!(d < 0) || d % 2 == 0) || ((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || ((((((((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B == A))))) && (((((((!(p / 2 < 0) || p / 2 % 2 == 0) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + 1 + (q + p / 2)) * B == A) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + (q + p / 2)) * B)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((d / 2 + 1) % 2 == 0 || !(d / 2 + 1 < 0)) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)) + (p / 4 + 1 + (q + p / 2)) * B || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 + (q + p / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)))) && d % 2 == 0) || ((((((((((((((((((((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((d / 2 == B || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || B == d / 2 + 1) || d % 2 == 0))) && (((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && B == 1) || ((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && d * q + r == A) && B == 1))) && A == B * q + r) && (p == 1 || (((((p + q + p / 2) * B + (r + -d + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || A == r + -d + -(d / 2) + (p + q + (p / 2 + 1)) * B)) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p % 2 == 0 || A == r + -d + (-1 + -(d / 2)) + (p + q + (p / 2 + 1)) * B) || !(p < 0)) && (A == r + -d + (-1 + -(d / 2)) + (p + q + p / 2) * B || (p < 0 && !(p % 2 == 0))))) || d % 2 == 0)))) && r >= d / 2) && (((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || ((((p / 2 + 1) % 2 == 0 || -1 + -(d / 4) + (r + -(d / 2)) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B == A) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-1 + -(d / 4) + (r + -(d / 2)))))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -(d / 2))) == A) && ((A == ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (-(d / 4) + (r + -(d / 2))) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)))))) && (((((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 4 + (q + p / 2)) * B + (-(d / 4) + (r + -(d / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((-(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((p / 2 < 0 && !(p / 2 % 2 == 0)) || (p / 4 + (q + p / 2)) * B + (-1 + -(d / 4) + (r + -(d / 2))) == A) && ((!(p / 2 < 0) || p / 2 % 2 == 0) || A == -1 + -(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B)) || d / 2 % 2 == 0) || !(d / 2 < 0))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || (!(d % 2 == 0) && d < 0))) && 2 <= d / 2) && (p == 1 || ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)))) && ((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p % 2 == 0) || (((!(d % 2 == 0) && d < 0) || ((((A == -1 + -(d / 4) + (r + -(d / 2)) + (q + (p / 2 + 1) + 1) * (d / 4 + 1) || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || (q + (p / 2 + 1) + 1) * (d / 4) + (-(d / 4) + (r + -(d / 2))) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || A == (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))))) || d % 2 == 0))) || !(p < 0))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((((!(d < 0) || !(r >= d / 2 + 1)) || d % 2 == 0) || A == r + (-1 + -(d / 2)) + (q + 1) * (d / 2 + 1)) && ((!(r >= d / 2) || (!(d % 2 == 0) && d < 0)) || d / 2 * (q + 1) + (r + -(d / 2)) == A)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(r + -d >= d / 2) || (!(d % 2 == 0) && d < 0)) || r + -d + -(d / 2) + d / 2 * (p + q + 1) == A) && (((!(d < 0) || !(r + -d >= d / 2 + 1)) || A == (p + q + 1) * (d / 2 + 1) + (r + -d + (-1 + -(d / 2)))) || d % 2 == 0)))) && A == r + -d + B * (p + q)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (((!(d % 2 == 0) && d < 0) || ((((-1 + -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4 + 1) == A || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + p / 2 + 1) * ((d / 2 + 1) / 2)) && (((A == (q + p / 2 + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || d % 2 == 0))) || (p < 0 && !(p % 2 == 0)))) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && d * q + r == A) && (!(p == 1) || B == d)) && ((!(d < 0) || d % 2 == 0) || ((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || ((((((((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B == A))))) && (((((((!(p / 2 < 0) || p / 2 % 2 == 0) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + 1 + (q + p / 2)) * B == A) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + (q + p / 2)) * B)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((d / 2 + 1) % 2 == 0 || !(d / 2 + 1 < 0)) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)) + (p / 4 + 1 + (q + p / 2)) * B || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 + (q + p / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)))) && d % 2 == 0))) && (-(2 * d) + r >= d || ((((!(d < 0) || ((B * (2 * p / 4 + (q + 2 * p)) + (-1 + -(2 * d / 4) + (-(2 * d) + r)) == A || (p < 0 && !(p % 2 == 0))) && (((q + 2 * p + (2 * p / 4 + 1)) * B + (-1 + -(2 * d / 4) + (-(2 * d) + r)) == A || p % 2 == 0) || !(p < 0)))) || !(-(2 * d) + r >= 2 * d / 4 + 1)) || d % 2 == 0) && (((((p % 2 == 0 || A == (q + 2 * p + (2 * p / 4 + 1)) * B + (-(2 * d / 4) + (-(2 * d) + r))) || !(p < 0)) && (A == -(2 * d / 4) + (-(2 * d) + r) + B * (2 * p / 4 + (q + 2 * p)) || (p < 0 && !(p % 2 == 0)))) || (!(d % 2 == 0) && d < 0)) || !(-(2 * d) + r >= 2 * d / 4))))) && ((((((((p / 2 + 1) % 2 == 0 || (p / 2 + 1) / 2 + 1 == 1) || !(p / 2 + 1 < 0)) || (((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || !(((p / 2 + 1) / 2 + 1) / 2 == 1)) && ((!(((p / 2 + 1) / 2 + 1) / 2 + 1 == 1) || ((p / 2 + 1) / 2 + 1) % 2 == 0) || !((p / 2 + 1) / 2 + 1 < 0)))) && (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (p / 2 + 1) / 2 == 1) || (((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || !((p / 2 + 1) / 4 == 1)) && (((p / 2 + 1) / 2 % 2 == 0 || !((p / 2 + 1) / 2 < 0)) || !((p / 2 + 1) / 4 + 1 == 1))))) || p % 2 == 0) || ((((!(d < 0) || (((((!(B * 1 == (d / 2 + 1) / 4) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) && ((!((d / 2 + 1) / 2 < 0) || !(B * 1 == (d / 2 + 1) / 4 + 1)) || (d / 2 + 1) / 2 % 2 == 0)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) && ((((((!((d / 2 + 1) / 2 + 1 < 0) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2 + 1)) && ((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1))) || A == r + (-1 + -(d / 2)) + (q + (p / 2 + 1)) * (B * 1)) || d % 2 == 0) && (((!(d % 2 == 0) && d < 0) || r + -(d / 2) + (q + (p / 2 + 1)) * (B * 1) == A) || ((((!(d / 2 % 2 == 0) && d / 2 < 0) || ((!(B * 1 == d / 8) || (!(d / 4 % 2 == 0) && d / 4 < 0)) && ((d / 4 % 2 == 0 || !(d / 4 < 0)) || !(B * 1 == d / 8 + 1)))) || r + -(d / 2) >= d / 4) && (((d / 2 % 2 == 0 || ((!(B * 1 == (d / 4 + 1) / 2) || (d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0))) && ((!(d / 4 + 1 < 0) || (d / 4 + 1) % 2 == 0) || !(B * 1 == (d / 4 + 1) / 2 + 1)))) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1))))) || !(p < 0))) && ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || !(r >= d / 2)) || (!(d % 2 == 0) && d < 0))) && ((((((!(d < 0) || ((((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || !(r >= (d / 2 + 1) / 2)) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + -((d / 2 + 1) / 2) + B * (q + (p / 2 + 1) / 2) == A) && (((p / 2 + 1) % 2 == 0 || A == B * ((p / 2 + 1) / 2 + 1 + q) + (r + -((d / 2 + 1) / 2))) || !(p / 2 + 1 < 0)))) && ((((((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == -1 + -((d / 2 + 1) / 2) + r + B * (q + (p / 2 + 1) / 2)) && (((p / 2 + 1) % 2 == 0 || B * ((p / 2 + 1) / 2 + 1 + q) + (-1 + -((d / 2 + 1) / 2) + r) == A) || !(p / 2 + 1 < 0))) || !(r >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (!(d % 2 == 0) && d < 0)) || (((((((A == -1 + -(d / 4) + r + B * ((p / 2 + 1) / 2 + 1 + q) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || -1 + -(d / 4) + r + B * (q + (p / 2 + 1) / 2) == A)) || d / 2 % 2 == 0) || !(r >= d / 4 + 1)) || !(d / 2 < 0)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r >= d / 4)) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || -(d / 4) + r + B * (q + (p / 2 + 1) / 2) == A) && (((p / 2 + 1) % 2 == 0 || A == -(d / 4) + r + B * ((p / 2 + 1) / 2 + 1 + q)) || !(p / 2 + 1 < 0))))))) || p % 2 == 0) || !(p < 0))) || ((((((((((((((((((((((((((((((((!(d / 2 % 2 == 0) && d / 2 < 0) || ((((d / 4 % 2 == 0 || !(r + -(d / 2) >= d / 8 + 1)) || ((-1 + -(d / 8) + (r + -(d / 2)) + B * (q + p / 2 + p / 8) == A || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((-1 + -(d / 8) + (r + -(d / 2)) + B * (p / 8 + 1 + (q + p / 2)) == A || p / 4 % 2 == 0) || !(p / 4 < 0)))) || !(d / 4 < 0)) && ((!(r + -(d / 2) >= d / 8) || (((p / 4 % 2 == 0 || !(p / 4 < 0)) || A == r + -(d / 2) + -(d / 8) + B * (p / 8 + 1 + (q + p / 2))) && (r + -(d / 2) + -(d / 8) + B * (q + p / 2 + p / 8) == A || (!(p / 4 % 2 == 0) && p / 4 < 0)))) || (!(d / 4 % 2 == 0) && d / 4 < 0)))) || r + -(d / 2) >= d / 4) && (((((((((p / 4 % 2 == 0 || !(p / 4 < 0)) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + B * (p / 8 + 1 + (q + p / 2))) && ((!(p / 4 % 2 == 0) && p / 4 < 0) || r + -(d / 2) + -((d / 4 + 1) / 2) + B * (q + p / 2 + p / 8) == A)) || (d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0))) || !(r + -(d / 2) >= (d / 4 + 1) / 2)) && (((!(r + -(d / 2) >= (d / 4 + 1) / 2 + 1) || !(d / 4 + 1 < 0)) || (d / 4 + 1) % 2 == 0) || ((A == -1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + B * (q + p / 2 + p / 8) || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((A == -1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + B * (p / 8 + 1 + (q + p / 2)) || p / 4 % 2 == 0) || !(p / 4 < 0))))) || d / 2 % 2 == 0) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1)) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 2 < 0) || p / 2 % 2 == 0) || ((((((((!(r + -(d / 2) >= (d / 4 + 1) / 2 + 1) || !(d / 4 + 1 < 0)) || (d / 4 + 1) % 2 == 0) || (((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || (q + p / 2 + (p / 4 + 1) / 2) * B + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2))) == A) && (((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2)))))) && (((d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0)) || ((A == r + -(d / 2) + -((d / 4 + 1) / 2) + (q + p / 2 + (p / 4 + 1) / 2) * B || (!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0)) && (((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2))))) || !(r + -(d / 2) >= (d / 4 + 1) / 2))) || d / 2 % 2 == 0) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || (((((((p / 4 + 1) % 2 == 0 || r + -(d / 2) + -(d / 8) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) == A) || !(p / 4 + 1 < 0)) && ((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || r + -(d / 2) + -(d / 8) + (q + p / 2 + (p / 4 + 1) / 2) * B == A)) || !(r + -(d / 2) >= d / 8)) || (!(d / 4 % 2 == 0) && d / 4 < 0)) && (((d / 4 % 2 == 0 || ((((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) + (-1 + -(d / 8) + (r + -(d / 2)))) && ((q + p / 2 + (p / 4 + 1) / 2) * B + (-1 + -(d / 8) + (r + -(d / 2))) == A || (!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0)))) || !(r + -(d / 2) >= d / 8 + 1)) || !(d / 4 < 0)))) || r + -(d / 2) >= d / 4)))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || ((((((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (((((A == B * (q + p / 2 + p / 8) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((p / 4 % 2 == 0 || B * (p / 8 + 1 + (q + p / 2)) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A) || !(p / 4 < 0))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 4)) && (((!((d / 2 + 1) / 2 < 0) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 4 + 1)) || ((r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (q + p / 2 + p / 8) == A || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((p / 4 % 2 == 0 || A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (p / 8 + 1 + (q + p / 2))) || !(p / 4 < 0)))) || (d / 2 + 1) / 2 % 2 == 0))) && (((((((!((d / 2 + 1) / 2 + 1 < 0) || (((p / 4 % 2 == 0 || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (p / 8 + 1 + (q + p / 2))) || !(p / 4 < 0)) && (A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (q + p / 2 + p / 8) || (!(p / 4 % 2 == 0) && p / 4 < 0)))) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || !(r + (-1 + -(d / 2)) >= ((d / 2 + 1) / 2 + 1) / 2 + 1)) && (((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || !(r + (-1 + -(d / 2)) >= ((d / 2 + 1) / 2 + 1) / 2)) || (((!(p / 4 % 2 == 0) && p / 4 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (q + p / 2 + p / 8) == A) && ((p / 4 % 2 == 0 || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (p / 8 + 1 + (q + p / 2)) == A) || !(p / 4 < 0))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1)) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && (((((((((((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || (q + p / 2 + (p / 4 + 1) / 2) * B + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A) && ((B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A || (p / 4 + 1) % 2 == 0) || !(p / 4 + 1 < 0))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 4)) && (((!((d / 2 + 1) / 2 < 0) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) || (p / 4 + 1) % 2 == 0) || !(p / 4 + 1 < 0)) && (A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + (q + p / 2 + (p / 4 + 1) / 2) * B || (!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0)))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 4 + 1)) || (d / 2 + 1) / 2 % 2 == 0)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) && (((((((!((d / 2 + 1) / 2 + 1 < 0) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || !(r + (-1 + -(d / 2)) >= ((d / 2 + 1) / 2 + 1) / 2 + 1)) || ((((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2))) && ((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + (q + p / 2 + (p / 4 + 1) / 2) * B))) && (((((r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) == A || (p / 4 + 1) % 2 == 0) || !(p / 4 + 1 < 0)) && ((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + (q + p / 2 + (p / 4 + 1) / 2) * B == A)) || (!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0)) || !(r + (-1 + -(d / 2)) >= ((d / 2 + 1) / 2 + 1) / 2))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1)) || !(p / 2 < 0)) || p / 2 % 2 == 0))) || d % 2 == 0)) || (p < 0 && !(p % 2 == 0))) && A == B * q + r) && (!(r >= d) || A == r + -d + B * (p + q))) && (!(p == 1) || d * q + r == A)) && (((((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p / 2 + 1 == 1) || p % 2 == 0) || !(p < 0)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || r + B * 1 * q == A) || ((((!(d < 0) || (((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || !(B * 1 == (d / 2 + 1) / 2)) && ((!(B * 1 == (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (((d / 2 % 2 == 0 || !(B * 1 == d / 4 + 1)) || !(d / 2 < 0)) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || !(B * 1 == d / 4)))) || (!(d % 2 == 0) && d < 0))))) && (((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || !(r >= d / 2 + 1)) || d % 2 == 0)) && 8 <= p) && (((((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || !(B * 1 == d / 2 + 1)) || d % 2 == 0) && (!(d / 2 == B * 1) || (!(d % 2 == 0) && d < 0)))) || p == 1) || r + B * 1 * q == A)) && (((((((!(d < 0) || r + -d >= 2 * d / 4 + 1) || ((((2 * d / 4 + 1) % 2 == 0 || !((2 * d / 4 + 1) / 2 + 1 == B * 1)) || !(2 * d / 4 + 1 < 0)) && ((2 * d / 4 + 1 < 0 && !((2 * d / 4 + 1) % 2 == 0)) || !(B * 1 == (2 * d / 4 + 1) / 2)))) || d % 2 == 0) && (((((2 * d / 4 % 2 == 0 || !(2 * d / 8 + 1 == B * 1)) || !(2 * d / 4 < 0)) && ((!(2 * d / 4 % 2 == 0) && 2 * d / 4 < 0) || !(B * 1 == 2 * d / 8))) || (!(d % 2 == 0) && d < 0)) || r + -d >= 2 * d / 4)) || !(r >= d)) || ((((((2 * p / 4 % 2 == 0 || !(2 * p / 4 < 0)) || !(2 * p / 8 + 1 == 1)) && (!(2 * p / 8 == 1) || (!(2 * p / 4 % 2 == 0) && 2 * p / 4 < 0))) || 2 * p / 4 == 1) || (p < 0 && !(p % 2 == 0))) && (((p % 2 == 0 || !(p < 0)) || (((!((2 * p / 4 + 1) % 2 == 0) && 2 * p / 4 + 1 < 0) || !((2 * p / 4 + 1) / 2 == 1)) && (((2 * p / 4 + 1) % 2 == 0 || !(2 * p / 4 + 1 < 0)) || !((2 * p / 4 + 1) / 2 + 1 == 1)))) || 1 == 2 * p / 4 + 1))) || A == B * 1 * (p + q) + (r + -d))) && ((p % 2 == 0 || ((((!(d < 0) || (((!(r + -d >= (d / 2 + 1) / 2) || (((A == ((p / 2 + 1) / 2 + 1 + (p + q)) * B + (r + -d + -((d / 2 + 1) / 2)) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (p + q + (p / 2 + 1) / 2) * B + (r + -d + -((d / 2 + 1) / 2)) == A))) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((!(r + -d >= (d / 2 + 1) / 2 + 1) || ((((p / 2 + 1) % 2 == 0 || A == -1 + -((d / 2 + 1) / 2) + (r + -d) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == -1 + -((d / 2 + 1) / 2) + (r + -d) + (p + q + (p / 2 + 1) / 2) * B))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || r + -d >= d / 2 + 1) || d % 2 == 0) && ((((((!(r + -d >= d / 4 + 1) || d / 2 % 2 == 0) || ((((p / 2 + 1) % 2 == 0 || !(p / 2 + 1 < 0)) || A == r + -d + (-1 + -(d / 4)) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) && (A == r + -d + (-1 + -(d / 4)) + (p + q + (p / 2 + 1) / 2) * B || (p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0))))) || !(d / 2 < 0)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -d >= d / 4)) || ((((p / 2 + 1) % 2 == 0 || A == -(d / 4) + (r + -d) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) || !(p / 2 + 1 < 0)) && ((p + q + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -d)) == A || (p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)))))) || (!(d % 2 == 0) && d < 0)) || r + -d >= d / 2))) || !(p < 0))) && (((((!(d % 2 == 0) && d < 0) || ((((p / 2 + 1) % 2 == 0 || ((((((((d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0)) || (((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2)) && ((((p / 2 + 1) / 2 + 1) % 2 == 0 || B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (r + -(d / 2) + -((d / 4 + 1) / 2)) == A) || !((p / 2 + 1) / 2 + 1 < 0)))) || !(r + -(d / 2) >= (d / 4 + 1) / 2)) && (((!(r + -(d / 2) >= (d / 4 + 1) / 2 + 1) || !(d / 4 + 1 < 0)) || (d / 4 + 1) % 2 == 0) || ((-1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) == A || (!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0)) && ((((p / 2 + 1) / 2 + 1) % 2 == 0 || A == B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2)))) || !((p / 2 + 1) / 2 + 1 < 0))))) || d / 2 % 2 == 0) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || r + -(d / 2) >= d / 4) || (((!(r + -(d / 2) >= d / 8) || ((A == r + -(d / 2) + -(d / 8) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) || (!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0)) && ((((p / 2 + 1) / 2 + 1) % 2 == 0 || !((p / 2 + 1) / 2 + 1 < 0)) || r + -(d / 2) + -(d / 8) + B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) == A))) || (!(d / 4 % 2 == 0) && d / 4 < 0)) && (((d / 4 % 2 == 0 || !(r + -(d / 2) >= d / 8 + 1)) || (((((p / 2 + 1) / 2 + 1) % 2 == 0 || !((p / 2 + 1) / 2 + 1 < 0)) || A == B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (-1 + -(d / 8) + (r + -(d / 2)))) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) + (-1 + -(d / 8) + (r + -(d / 2))) == A))) || !(d / 4 < 0)))))) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || ((((((((((((p / 2 + 1) / 2 % 2 == 0 || -1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2))) == A)) || !(r + -(d / 2) >= (d / 4 + 1) / 2 + 1)) || !(d / 4 + 1 < 0)) || (d / 4 + 1) % 2 == 0) && ((((A == r + -(d / 2) + -((d / 4 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B || (!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0)) && (((p / 2 + 1) / 2 % 2 == 0 || !((p / 2 + 1) / 2 < 0)) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B)) || (d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0))) || !(r + -(d / 2) >= (d / 4 + 1) / 2))) || d / 2 % 2 == 0) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || ((((d / 4 % 2 == 0 || !(r + -(d / 2) >= d / 8 + 1)) || !(d / 4 < 0)) || (((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B + (-1 + -(d / 8) + (r + -(d / 2))) == A) && (((p / 2 + 1) / 2 % 2 == 0 || !((p / 2 + 1) / 2 < 0)) || ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B + (-1 + -(d / 8) + (r + -(d / 2))) == A))) && ((!(r + -(d / 2) >= d / 8) || (!(d / 4 % 2 == 0) && d / 4 < 0)) || ((((p / 2 + 1) / 2 % 2 == 0 || !((p / 2 + 1) / 2 < 0)) || r + -(d / 2) + -(d / 8) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A) && (r + -(d / 2) + -(d / 8) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B == A || (!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0)))))) || r + -(d / 2) >= d / 4))))) && ((!(d < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || ((((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || ((((!((d / 2 + 1) / 2 < 0) || (((r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A || (p / 2 + 1) / 2 % 2 == 0) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 4 + 1)) || (d / 2 + 1) / 2 % 2 == 0) && ((((((p / 2 + 1) / 2 % 2 == 0 || ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 4)))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) && (((((((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || !(r + (-1 + -(d / 2)) >= ((d / 2 + 1) / 2 + 1) / 2)) || ((((p / 2 + 1) / 2 % 2 == 0 || A == r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B == A))) && (((((((p / 2 + 1) / 2 % 2 == 0 || r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B)) || !((d / 2 + 1) / 2 + 1 < 0)) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || !(r + (-1 + -(d / 2)) >= ((d / 2 + 1) / 2 + 1) / 2 + 1))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1))) && (((p / 2 + 1) % 2 == 0 || (((((d / 2 + 1) % 2 == 0 || ((((!((d / 2 + 1) / 2 + 1 < 0) || (((((p / 2 + 1) / 2 + 1) % 2 == 0 || !((p / 2 + 1) / 2 + 1 < 0)) || r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) == A) && (A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) || (!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0)))) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || !(r + (-1 + -(d / 2)) >= ((d / 2 + 1) / 2 + 1) / 2 + 1)) && (((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || (((((p / 2 + 1) / 2 + 1) % 2 == 0 || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) == A) || !((p / 2 + 1) / 2 + 1 < 0)) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) == A))) || !(r + (-1 + -(d / 2)) >= ((d / 2 + 1) / 2 + 1) / 2)))) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) && ((((((!((d / 2 + 1) / 2 < 0) || (((A == B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))) || ((p / 2 + 1) / 2 + 1) % 2 == 0) || !((p / 2 + 1) / 2 + 1 < 0)) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2)))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 4 + 1)) || (d / 2 + 1) / 2 % 2 == 0) && (((((B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A || ((p / 2 + 1) / 2 + 1) % 2 == 0) || !((p / 2 + 1) / 2 + 1 < 0)) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || A == B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 4))) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2))) || !(p / 2 + 1 < 0)))) || d % 2 == 0)) || p % 2 == 0) || !(p < 0))) && (((((!(d % 2 == 0) && d < 0) || r + -d >= d / 2) || ((((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -d >= d / 4)) || (((p / 2 < 0 && !(p / 2 % 2 == 0)) || -(d / 4) + (r + -d) + (p / 4 + (p + q)) * B == A) && (((p + q + (p / 4 + 1)) * B + (-(d / 4) + (r + -d)) == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && ((((((!(p / 2 < 0) || p / 2 % 2 == 0) || (p + q + (p / 4 + 1)) * B + (r + -d + (-1 + -(d / 4))) == A) && (A == r + -d + (-1 + -(d / 4)) + (p / 4 + (p + q)) * B || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || !(r + -d >= d / 4 + 1)) || d / 2 % 2 == 0) || !(d / 2 < 0)))) && (((!(d < 0) || r + -d >= d / 2 + 1) || (((((((-1 + -((d / 2 + 1) / 2) + (r + -d) + (p + q + (p / 4 + 1)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0) && (-1 + -((d / 2 + 1) / 2) + (r + -d) + (p / 4 + (p + q)) * B == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || !(r + -d >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((!(r + -d >= (d / 2 + 1) / 2) || (((p / 4 + (p + q)) * B + (r + -d + -((d / 2 + 1) / 2)) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((A == (p + q + (p / 4 + 1)) * B + (r + -d + -((d / 2 + 1) / 2)) || !(p / 2 < 0)) || p / 2 % 2 == 0))) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))))) || d % 2 == 0)) || (p < 0 && !(p % 2 == 0)))) && (((((A == B * 1 * (q + 2 * p) + (-(2 * d) + r) || -(2 * d) + r >= d) || p == 1) || !(r >= 2 * d)) || ((!(p * 4 / 8 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p * 4 / 8 + 1 == 1)))) || ((!(B * 1 == d * 4 / 8) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || !(d * 4 / 8 + 1 == B * 1)) || d % 2 == 0)))) && B * p == d) && A == r) && ((!(-(2 * d * 2) + r >= d) || -(2 * d * 2) + r >= 2 * d) || -(2 * d * 2) + r + -d + (p + (q + 2 * (2 * p))) * B == A)) && ((((((p / 4 + 1 == 1 || ((((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || !(1 + (p / 4 + 1) / 2 == 1)) && (!(1 == (p / 4 + 1) / 2) || (!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0)))) || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 == 1 || (((p / 4 % 2 == 0 || !(p / 8 + 1 == 1)) || !(p / 4 < 0)) && (!(p / 8 == 1) || (!(p / 4 % 2 == 0) && p / 4 < 0)))) || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || (((B * 1 * (q + p / 2) + (r + -(d / 2)) == A || (!(d % 2 == 0) && d < 0)) || ((((!(d / 2 % 2 == 0) && d / 2 < 0) || ((!(B * 1 == d / 8) || (!(d / 4 % 2 == 0) && d / 4 < 0)) && ((d / 4 % 2 == 0 || !(d / 4 < 0)) || !(B * 1 == d / 8 + 1)))) || r + -(d / 2) >= d / 4) && (((d / 2 % 2 == 0 || ((!(B * 1 == (d / 4 + 1) / 2) || (d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0))) && ((!(d / 4 + 1 < 0) || (d / 4 + 1) % 2 == 0) || !(B * 1 == (d / 4 + 1) / 2 + 1)))) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1))) && (((!(d < 0) || (((((!(B * 1 == (d / 2 + 1) / 4) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) && ((!((d / 2 + 1) / 2 < 0) || !(B * 1 == (d / 2 + 1) / 4 + 1)) || (d / 2 + 1) / 2 % 2 == 0)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) && ((((((!((d / 2 + 1) / 2 + 1 < 0) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2 + 1)) && ((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1))) || r + (-1 + -(d / 2)) + B * 1 * (q + p / 2) == A) || d % 2 == 0))) || (p < 0 && !(p % 2 == 0)))) && (((((!(d < 0) || ((((!(r >= (d / 2 + 1) / 2 + 1) || (((A == -1 + -((d / 2 + 1) / 2) + r + B * (q + (p / 4 + 1)) || !(p / 2 < 0)) || p / 2 % 2 == 0) && (A == B * (p / 4 + q) + (-1 + -((d / 2 + 1) / 2) + r) || (p / 2 < 0 && !(p / 2 % 2 == 0))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && (((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || !(r >= (d / 2 + 1) / 2)) || ((B * (p / 4 + q) + (r + -((d / 2 + 1) / 2)) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((A == r + -((d / 2 + 1) / 2) + B * (q + (p / 4 + 1)) || !(p / 2 < 0)) || p / 2 % 2 == 0))))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (!(d % 2 == 0) && d < 0)) || ((((d / 2 % 2 == 0 || !(r >= d / 4 + 1)) || !(d / 2 < 0)) || (((!(p / 2 < 0) || A == -1 + -(d / 4) + r + B * (q + (p / 4 + 1))) || p / 2 % 2 == 0) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == -1 + -(d / 4) + r + B * (p / 4 + q)))) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || (((-(d / 4) + r + B * (q + (p / 4 + 1)) == A || !(p / 2 < 0)) || p / 2 % 2 == 0) && (-(d / 4) + r + B * (p / 4 + q) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))))) || !(r >= d / 4))))) || (p < 0 && !(p % 2 == 0)))) && B == 1) && (((((((((((((((((((((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((d / 2 == B || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || B == d / 2 + 1) || d % 2 == 0))) && (((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && B == 1) || ((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && d * q + r == A) && B == 1))) && A == B * q + r) && (p == 1 || (((((p + q + p / 2) * B + (r + -d + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || A == r + -d + -(d / 2) + (p + q + (p / 2 + 1)) * B)) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p % 2 == 0 || A == r + -d + (-1 + -(d / 2)) + (p + q + (p / 2 + 1)) * B) || !(p < 0)) && (A == r + -d + (-1 + -(d / 2)) + (p + q + p / 2) * B || (p < 0 && !(p % 2 == 0))))) || d % 2 == 0)))) && r >= d / 2) && (!(p == 1) || d * q + r == A)) && (((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || ((((p / 2 + 1) % 2 == 0 || -1 + -(d / 4) + (r + -(d / 2)) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B == A) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-1 + -(d / 4) + (r + -(d / 2)))))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -(d / 2))) == A) && ((A == ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (-(d / 4) + (r + -(d / 2))) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)))))) && (((((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 4 + (q + p / 2)) * B + (-(d / 4) + (r + -(d / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((-(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((p / 2 < 0 && !(p / 2 % 2 == 0)) || (p / 4 + (q + p / 2)) * B + (-1 + -(d / 4) + (r + -(d / 2))) == A) && ((!(p / 2 < 0) || p / 2 % 2 == 0) || A == -1 + -(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B)) || d / 2 % 2 == 0) || !(d / 2 < 0))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || (!(d % 2 == 0) && d < 0))) && 2 <= d / 2) && (p == 1 || ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)))) && ((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p % 2 == 0) || (((!(d % 2 == 0) && d < 0) || ((((A == -1 + -(d / 4) + (r + -(d / 2)) + (q + (p / 2 + 1) + 1) * (d / 4 + 1) || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || (q + (p / 2 + 1) + 1) * (d / 4) + (-(d / 4) + (r + -(d / 2))) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || A == (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))))) || d % 2 == 0))) || !(p < 0))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((((!(d < 0) || !(r >= d / 2 + 1)) || d % 2 == 0) || A == r + (-1 + -(d / 2)) + (q + 1) * (d / 2 + 1)) && ((!(r >= d / 2) || (!(d % 2 == 0) && d < 0)) || d / 2 * (q + 1) + (r + -(d / 2)) == A)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(r + -d >= d / 2) || (!(d % 2 == 0) && d < 0)) || r + -d + -(d / 2) + d / 2 * (p + q + 1) == A) && (((!(d < 0) || !(r + -d >= d / 2 + 1)) || A == (p + q + 1) * (d / 2 + 1) + (r + -d + (-1 + -(d / 2)))) || d % 2 == 0)))) && A == r + -d + B * (p + q)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (((!(d % 2 == 0) && d < 0) || ((((-1 + -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4 + 1) == A || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + p / 2 + 1) * ((d / 2 + 1) / 2)) && (((A == (q + p / 2 + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || d % 2 == 0))) || (p < 0 && !(p % 2 == 0)))) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && (!(p == 1) || B == d)) && ((!(d < 0) || d % 2 == 0) || ((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || ((((((((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B == A))))) && (((((((!(p / 2 < 0) || p / 2 % 2 == 0) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + 1 + (q + p / 2)) * B == A) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + (q + p / 2)) * B)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((d / 2 + 1) % 2 == 0 || !(d / 2 + 1 < 0)) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)) + (p / 4 + 1 + (q + p / 2)) * B || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 + (q + p / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)))) && d % 2 == 0) || ((((((((((((((((((((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((d / 2 == B || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || B == d / 2 + 1) || d % 2 == 0))) && (((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && B == 1) || ((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && d * q + r == A) && B == 1))) && A == B * q + r) && (p == 1 || (((((p + q + p / 2) * B + (r + -d + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || A == r + -d + -(d / 2) + (p + q + (p / 2 + 1)) * B)) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p % 2 == 0 || A == r + -d + (-1 + -(d / 2)) + (p + q + (p / 2 + 1)) * B) || !(p < 0)) && (A == r + -d + (-1 + -(d / 2)) + (p + q + p / 2) * B || (p < 0 && !(p % 2 == 0))))) || d % 2 == 0)))) && r >= d / 2) && (((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || ((((p / 2 + 1) % 2 == 0 || -1 + -(d / 4) + (r + -(d / 2)) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B == A) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-1 + -(d / 4) + (r + -(d / 2)))))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -(d / 2))) == A) && ((A == ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (-(d / 4) + (r + -(d / 2))) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)))))) && (((((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 4 + (q + p / 2)) * B + (-(d / 4) + (r + -(d / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((-(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((p / 2 < 0 && !(p / 2 % 2 == 0)) || (p / 4 + (q + p / 2)) * B + (-1 + -(d / 4) + (r + -(d / 2))) == A) && ((!(p / 2 < 0) || p / 2 % 2 == 0) || A == -1 + -(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B)) || d / 2 % 2 == 0) || !(d / 2 < 0))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || (!(d % 2 == 0) && d < 0))) && 2 <= d / 2) && (p == 1 || ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)))) && ((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p % 2 == 0) || (((!(d % 2 == 0) && d < 0) || ((((A == -1 + -(d / 4) + (r + -(d / 2)) + (q + (p / 2 + 1) + 1) * (d / 4 + 1) || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || (q + (p / 2 + 1) + 1) * (d / 4) + (-(d / 4) + (r + -(d / 2))) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || A == (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))))) || d % 2 == 0))) || !(p < 0))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((((!(d < 0) || !(r >= d / 2 + 1)) || d % 2 == 0) || A == r + (-1 + -(d / 2)) + (q + 1) * (d / 2 + 1)) && ((!(r >= d / 2) || (!(d % 2 == 0) && d < 0)) || d / 2 * (q + 1) + (r + -(d / 2)) == A)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(r + -d >= d / 2) || (!(d % 2 == 0) && d < 0)) || r + -d + -(d / 2) + d / 2 * (p + q + 1) == A) && (((!(d < 0) || !(r + -d >= d / 2 + 1)) || A == (p + q + 1) * (d / 2 + 1) + (r + -d + (-1 + -(d / 2)))) || d % 2 == 0)))) && A == r + -d + B * (p + q)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (((!(d % 2 == 0) && d < 0) || ((((-1 + -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4 + 1) == A || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + p / 2 + 1) * ((d / 2 + 1) / 2)) && (((A == (q + p / 2 + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || d % 2 == 0))) || (p < 0 && !(p % 2 == 0)))) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && d * q + r == A) && (!(p == 1) || B == d)) && ((!(d < 0) || d % 2 == 0) || ((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || ((((((((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B == A))))) && (((((((!(p / 2 < 0) || p / 2 % 2 == 0) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + 1 + (q + p / 2)) * B == A) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + (q + p / 2)) * B)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((d / 2 + 1) % 2 == 0 || !(d / 2 + 1 < 0)) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)) + (p / 4 + 1 + (q + p / 2)) * B || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 + (q + p / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)))) && d % 2 == 0))) && (-(2 * d) + r >= d || ((((!(d < 0) || ((B * (2 * p / 4 + (q + 2 * p)) + (-1 + -(2 * d / 4) + (-(2 * d) + r)) == A || (p < 0 && !(p % 2 == 0))) && (((q + 2 * p + (2 * p / 4 + 1)) * B + (-1 + -(2 * d / 4) + (-(2 * d) + r)) == A || p % 2 == 0) || !(p < 0)))) || !(-(2 * d) + r >= 2 * d / 4 + 1)) || d % 2 == 0) && (((((p % 2 == 0 || A == (q + 2 * p + (2 * p / 4 + 1)) * B + (-(2 * d / 4) + (-(2 * d) + r))) || !(p < 0)) && (A == -(2 * d / 4) + (-(2 * d) + r) + B * (2 * p / 4 + (q + 2 * p)) || (p < 0 && !(p % 2 == 0)))) || (!(d % 2 == 0) && d < 0)) || !(-(2 * d) + r >= 2 * d / 4))))) && ((((((((p / 2 + 1) % 2 == 0 || (p / 2 + 1) / 2 + 1 == 1) || !(p / 2 + 1 < 0)) || (((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || !(((p / 2 + 1) / 2 + 1) / 2 == 1)) && ((!(((p / 2 + 1) / 2 + 1) / 2 + 1 == 1) || ((p / 2 + 1) / 2 + 1) % 2 == 0) || !((p / 2 + 1) / 2 + 1 < 0)))) && (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (p / 2 + 1) / 2 == 1) || (((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || !((p / 2 + 1) / 4 == 1)) && (((p / 2 + 1) / 2 % 2 == 0 || !((p / 2 + 1) / 2 < 0)) || !((p / 2 + 1) / 4 + 1 == 1))))) || p % 2 == 0) || ((((!(d < 0) || (((((!(B * 1 == (d / 2 + 1) / 4) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) && ((!((d / 2 + 1) / 2 < 0) || !(B * 1 == (d / 2 + 1) / 4 + 1)) || (d / 2 + 1) / 2 % 2 == 0)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) && ((((((!((d / 2 + 1) / 2 + 1 < 0) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2 + 1)) && ((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1))) || A == r + (-1 + -(d / 2)) + (q + (p / 2 + 1)) * (B * 1)) || d % 2 == 0) && (((!(d % 2 == 0) && d < 0) || r + -(d / 2) + (q + (p / 2 + 1)) * (B * 1) == A) || ((((!(d / 2 % 2 == 0) && d / 2 < 0) || ((!(B * 1 == d / 8) || (!(d / 4 % 2 == 0) && d / 4 < 0)) && ((d / 4 % 2 == 0 || !(d / 4 < 0)) || !(B * 1 == d / 8 + 1)))) || r + -(d / 2) >= d / 4) && (((d / 2 % 2 == 0 || ((!(B * 1 == (d / 4 + 1) / 2) || (d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0))) && ((!(d / 4 + 1 < 0) || (d / 4 + 1) % 2 == 0) || !(B * 1 == (d / 4 + 1) / 2 + 1)))) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1))))) || !(p < 0))) && ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || !(r >= d / 2)) || (!(d % 2 == 0) && d < 0))) && ((((((!(d < 0) || ((((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || !(r >= (d / 2 + 1) / 2)) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + -((d / 2 + 1) / 2) + B * (q + (p / 2 + 1) / 2) == A) && (((p / 2 + 1) % 2 == 0 || A == B * ((p / 2 + 1) / 2 + 1 + q) + (r + -((d / 2 + 1) / 2))) || !(p / 2 + 1 < 0)))) && ((((((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == -1 + -((d / 2 + 1) / 2) + r + B * (q + (p / 2 + 1) / 2)) && (((p / 2 + 1) % 2 == 0 || B * ((p / 2 + 1) / 2 + 1 + q) + (-1 + -((d / 2 + 1) / 2) + r) == A) || !(p / 2 + 1 < 0))) || !(r >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (!(d % 2 == 0) && d < 0)) || (((((((A == -1 + -(d / 4) + r + B * ((p / 2 + 1) / 2 + 1 + q) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || -1 + -(d / 4) + r + B * (q + (p / 2 + 1) / 2) == A)) || d / 2 % 2 == 0) || !(r >= d / 4 + 1)) || !(d / 2 < 0)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r >= d / 4)) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || -(d / 4) + r + B * (q + (p / 2 + 1) / 2) == A) && (((p / 2 + 1) % 2 == 0 || A == -(d / 4) + r + B * ((p / 2 + 1) / 2 + 1 + q)) || !(p / 2 + 1 < 0))))))) || p % 2 == 0) || !(p < 0))))) && B * p == d) && A == r) && B == 1)) || ((((((d == 2 * B && d == 2 * 1) && q == 0) && B * p == d) && A == r) && B == 1) && p == 2 * 1)) || ((((((((((4 + 0 == q && A == B * q + r) && p == 1) && -1 * r + A == B * 4) && p >= 1) && (((!(r >= (A + -r) / 2) && (!(-1 * r + A < 0) || (A + r) % 2 == 0)) && ((((A + -r) / 2 < 0 && (A + -r) / 4 + 1 == d) && !((A + -r) / 2 % 2 == 0)) || (((A + -r) / 2 % 2 == 0 || !((A + -r) / 2 < 0)) && d == (A + -r) / 4))) || (((!(r >= (A + -r) / 2 + 1) && ((((A + -r) / 2 + 1 < 0 && !(((A + -r) / 2 + 1) % 2 == 0)) && ((A + -r) / 2 + 1) / 2 + 1 == d) || ((((A + -r) / 2 + 1) % 2 == 0 || !((A + -r) / 2 + 1 < 0)) && ((A + -r) / 2 + 1) / 2 == d))) && !((A + r) % 2 == 0)) && -1 * r + A < 0))) && ((!(p == 1) || r + -d + d * (p + q) == A) || !(r >= d))) && A >= 2 * (2 * B)) && B == 1) && (A == B * q + r || (A == B * q + r && 1 <= d))) && ((((((!(d % 2 == 0) && d < 0) || r + -d + -(2 * d / 4) + 2 * d / 4 * (p + q + 1) == A) || !(r + -d >= 2 * d / 4)) && (((!(d < 0) || !(r + -d >= 2 * d / 4 + 1)) || -1 + -(2 * d / 4) + (r + -d) + (2 * d / 4 + 1) * (p + q + 1) == A) || d % 2 == 0)) || (((!(1 == 2 * p / 4 + 1) || p % 2 == 0) || !(p < 0)) && (!(2 * p / 4 == 1) || (p < 0 && !(p % 2 == 0))))) || r >= 2 * d))) || (((((((((((((((A == B * q + r && (!(r >= d) || A == r + -d + B * (p + q))) && p >= 1) && (((((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || !(B * 1 == d / 2 + 1)) || d % 2 == 0) && (!(d / 2 == B * 1) || (!(d % 2 == 0) && d < 0)))) || p == 1) || r + B * 1 * q == A)) && (((((((!(d < 0) || r + -d >= 2 * d / 4 + 1) || ((((2 * d / 4 + 1) % 2 == 0 || !((2 * d / 4 + 1) / 2 + 1 == B * 1)) || !(2 * d / 4 + 1 < 0)) && ((2 * d / 4 + 1 < 0 && !((2 * d / 4 + 1) % 2 == 0)) || !(B * 1 == (2 * d / 4 + 1) / 2)))) || d % 2 == 0) && (((((2 * d / 4 % 2 == 0 || !(2 * d / 8 + 1 == B * 1)) || !(2 * d / 4 < 0)) && ((!(2 * d / 4 % 2 == 0) && 2 * d / 4 < 0) || !(B * 1 == 2 * d / 8))) || (!(d % 2 == 0) && d < 0)) || r + -d >= 2 * d / 4)) || !(r >= d)) || ((((((2 * p / 4 % 2 == 0 || !(2 * p / 4 < 0)) || !(2 * p / 8 + 1 == 1)) && (!(2 * p / 8 == 1) || (!(2 * p / 4 % 2 == 0) && 2 * p / 4 < 0))) || 2 * p / 4 == 1) || (p < 0 && !(p % 2 == 0))) && (((p % 2 == 0 || !(p < 0)) || (((!((2 * p / 4 + 1) % 2 == 0) && 2 * p / 4 + 1 < 0) || !((2 * p / 4 + 1) / 2 == 1)) && (((2 * p / 4 + 1) % 2 == 0 || !(2 * p / 4 + 1 < 0)) || !((2 * p / 4 + 1) / 2 + 1 == 1)))) || 1 == 2 * p / 4 + 1))) || A == B * 1 * (p + q) + (r + -d))) && ((p % 2 == 0 || ((((!(d < 0) || (((!(r + -d >= (d / 2 + 1) / 2) || (((A == ((p / 2 + 1) / 2 + 1 + (p + q)) * B + (r + -d + -((d / 2 + 1) / 2)) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (p + q + (p / 2 + 1) / 2) * B + (r + -d + -((d / 2 + 1) / 2)) == A))) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((!(r + -d >= (d / 2 + 1) / 2 + 1) || ((((p / 2 + 1) % 2 == 0 || A == -1 + -((d / 2 + 1) / 2) + (r + -d) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == -1 + -((d / 2 + 1) / 2) + (r + -d) + (p + q + (p / 2 + 1) / 2) * B))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || r + -d >= d / 2 + 1) || d % 2 == 0) && ((((((!(r + -d >= d / 4 + 1) || d / 2 % 2 == 0) || ((((p / 2 + 1) % 2 == 0 || !(p / 2 + 1 < 0)) || A == r + -d + (-1 + -(d / 4)) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) && (A == r + -d + (-1 + -(d / 4)) + (p + q + (p / 2 + 1) / 2) * B || (p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0))))) || !(d / 2 < 0)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -d >= d / 4)) || ((((p / 2 + 1) % 2 == 0 || A == -(d / 4) + (r + -d) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) || !(p / 2 + 1 < 0)) && ((p + q + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -d)) == A || (p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)))))) || (!(d % 2 == 0) && d < 0)) || r + -d >= d / 2))) || !(p < 0))) && (((((!(d % 2 == 0) && d < 0) || r + -d >= d / 2) || ((((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -d >= d / 4)) || (((p / 2 < 0 && !(p / 2 % 2 == 0)) || -(d / 4) + (r + -d) + (p / 4 + (p + q)) * B == A) && (((p + q + (p / 4 + 1)) * B + (-(d / 4) + (r + -d)) == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && ((((((!(p / 2 < 0) || p / 2 % 2 == 0) || (p + q + (p / 4 + 1)) * B + (r + -d + (-1 + -(d / 4))) == A) && (A == r + -d + (-1 + -(d / 4)) + (p / 4 + (p + q)) * B || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || !(r + -d >= d / 4 + 1)) || d / 2 % 2 == 0) || !(d / 2 < 0)))) && (((!(d < 0) || r + -d >= d / 2 + 1) || (((((((-1 + -((d / 2 + 1) / 2) + (r + -d) + (p + q + (p / 4 + 1)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0) && (-1 + -((d / 2 + 1) / 2) + (r + -d) + (p / 4 + (p + q)) * B == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || !(r + -d >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((!(r + -d >= (d / 2 + 1) / 2) || (((p / 4 + (p + q)) * B + (r + -d + -((d / 2 + 1) / 2)) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((A == (p + q + (p / 4 + 1)) * B + (r + -d + -((d / 2 + 1) / 2)) || !(p / 2 < 0)) || p / 2 % 2 == 0))) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))))) || d % 2 == 0)) || (p < 0 && !(p % 2 == 0)))) && ((!(p == 1) || !(B * p == d)) || d * q + r == A)) && (((((A == B * 1 * (q + 2 * p) + (-(2 * d) + r) || -(2 * d) + r >= d) || p == 1) || !(r >= 2 * d)) || ((!(p * 4 / 8 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p * 4 / 8 + 1 == 1)))) || ((!(B * 1 == d * 4 / 8) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || !(d * 4 / 8 + 1 == B * 1)) || d % 2 == 0)))) && B * p == d) && ((!(-(2 * d * 2) + r >= d) || -(2 * d * 2) + r >= 2 * d) || -(2 * d * 2) + r + -d + (p + (q + 2 * (2 * p))) * B == A)) && ((!(p == 1) || r + -d + d * (p + q) == A) || !(r >= d))) && B == 1) && (A == B * q + r || (A == B * q + r && 1 <= d))) && (-(2 * d) + r >= d || ((((!(d < 0) || ((B * (2 * p / 4 + (q + 2 * p)) + (-1 + -(2 * d / 4) + (-(2 * d) + r)) == A || (p < 0 && !(p % 2 == 0))) && (((q + 2 * p + (2 * p / 4 + 1)) * B + (-1 + -(2 * d / 4) + (-(2 * d) + r)) == A || p % 2 == 0) || !(p < 0)))) || !(-(2 * d) + r >= 2 * d / 4 + 1)) || d % 2 == 0) && (((((p % 2 == 0 || A == (q + 2 * p + (2 * p / 4 + 1)) * B + (-(2 * d / 4) + (-(2 * d) + r))) || !(p < 0)) && (A == -(2 * d / 4) + (-(2 * d) + r) + B * (2 * p / 4 + (q + 2 * p)) || (p < 0 && !(p % 2 == 0)))) || (!(d % 2 == 0) && d < 0)) || !(-(2 * d) + r >= 2 * d / 4))))) && ((((((!(d % 2 == 0) && d < 0) || r + -d + -(2 * d / 4) + 2 * d / 4 * (p + q + 1) == A) || !(r + -d >= 2 * d / 4)) && (((!(d < 0) || !(r + -d >= 2 * d / 4 + 1)) || -1 + -(2 * d / 4) + (r + -d) + (2 * d / 4 + 1) * (p + q + 1) == A) || d % 2 == 0)) || (((!(1 == 2 * p / 4 + 1) || p % 2 == 0) || !(p < 0)) && (!(2 * p / 4 == 1) || (p < 0 && !(p % 2 == 0))))) || r >= 2 * d))) || (((((((d == (A + -r) / 2 && (!(-1 * r + A < 0) || (A + r) % 2 == 0)) || ((d == (A + -r) / 2 + 1 && !((A + r) % 2 == 0)) && -1 * r + A < 0)) && p == 1) && -1 * (2 * 1) + q == 0) && B == 1) && (A == B * q + r || (A == B * q + r && 1 <= d))) && -1 * r + A == 2 * B)) || ((((((((((((d + r == A && A == B * q + r) && (!(p == 1) || d * q + r == A)) && d == 2 * B) && 2 == p) && 2 <= d) && A == r + -d + B * (p + q)) && -1 * p + q == 0) && B == 1) && (!(p == 1) || B == d)) && 2 == d) && !(d + r >= 2 * (2 * 1))) && p == 2 * 1)) || (((((((((((((((((((4 + 0 == q && A == B * q + r) && ((d == (A + -r) / 2 && (!(-1 * r + A < 0) || (A + r) % 2 == 0)) || ((d == (A + -r) / 2 + 1 && !((A + r) % 2 == 0)) && -1 * r + A < 0))) && -1 * r + A == B * 4) && d == 2 * B) && r + B * 4 == A) && 2 == p) && 2 <= p) && r + B * 4 >= 2 * (2 * B)) && !(r >= d)) && B * p == d) && q == 4) && ((q / 2 == p && (q % 2 == 0 || !(q < 0))) || ((!(q % 2 == 0) && q < 0) && q / 2 + 1 == p))) && A == r + -d + B * (p + q)) && ((!(p == 1) || r + -d + d * (p + q) == A) || !(r >= d))) && A >= 2 * (2 * B)) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && B == 1) && (A == B * q + r || (A == B * q + r && 1 <= d))) && ((((((!(d % 2 == 0) && d < 0) || r + -d + -(2 * d / 4) + 2 * d / 4 * (p + q + 1) == A) || !(r + -d >= 2 * d / 4)) && (((!(d < 0) || !(r + -d >= 2 * d / 4 + 1)) || -1 + -(2 * d / 4) + (r + -d) + (2 * d / 4 + 1) * (p + q + 1) == A) || d % 2 == 0)) || (((!(1 == 2 * p / 4 + 1) || p % 2 == 0) || !(p < 0)) && (!(2 * p / 4 == 1) || (p < 0 && !(p % 2 == 0))))) || r >= 2 * d))) || (((((((A == B * q + r && (((((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p / 2 + 1 == 1) || p % 2 == 0) || !(p < 0)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || r + B * 1 * q == A) || ((((!(d < 0) || (((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || !(B * 1 == (d / 2 + 1) / 2)) && ((!(B * 1 == (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (((d / 2 % 2 == 0 || !(B * 1 == d / 4 + 1)) || !(d / 2 < 0)) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || !(B * 1 == d / 4)))) || (!(d % 2 == 0) && d < 0))))) && p >= 1) && ((!(p == 1) || !(B * p == d)) || d * q + r == A)) && B * p == d) && (((((!(d < 0) || ((((!(r >= (d / 2 + 1) / 2 + 1) || (((A == -1 + -((d / 2 + 1) / 2) + r + B * (q + (p / 4 + 1)) || !(p / 2 < 0)) || p / 2 % 2 == 0) && (A == B * (p / 4 + q) + (-1 + -((d / 2 + 1) / 2) + r) || (p / 2 < 0 && !(p / 2 % 2 == 0))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && (((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || !(r >= (d / 2 + 1) / 2)) || ((B * (p / 4 + q) + (r + -((d / 2 + 1) / 2)) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((A == r + -((d / 2 + 1) / 2) + B * (q + (p / 4 + 1)) || !(p / 2 < 0)) || p / 2 % 2 == 0))))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (!(d % 2 == 0) && d < 0)) || ((((d / 2 % 2 == 0 || !(r >= d / 4 + 1)) || !(d / 2 < 0)) || (((!(p / 2 < 0) || A == -1 + -(d / 4) + r + B * (q + (p / 4 + 1))) || p / 2 % 2 == 0) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == -1 + -(d / 4) + r + B * (p / 4 + q)))) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || (((-(d / 4) + r + B * (q + (p / 4 + 1)) == A || !(p / 2 < 0)) || p / 2 % 2 == 0) && (-(d / 4) + r + B * (p / 4 + q) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))))) || !(r >= d / 4))))) || (p < 0 && !(p % 2 == 0)))) && B == 1) && ((((((!(d < 0) || ((((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || !(r >= (d / 2 + 1) / 2)) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + -((d / 2 + 1) / 2) + B * (q + (p / 2 + 1) / 2) == A) && (((p / 2 + 1) % 2 == 0 || A == B * ((p / 2 + 1) / 2 + 1 + q) + (r + -((d / 2 + 1) / 2))) || !(p / 2 + 1 < 0)))) && ((((((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == -1 + -((d / 2 + 1) / 2) + r + B * (q + (p / 2 + 1) / 2)) && (((p / 2 + 1) % 2 == 0 || B * ((p / 2 + 1) / 2 + 1 + q) + (-1 + -((d / 2 + 1) / 2) + r) == A) || !(p / 2 + 1 < 0))) || !(r >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (!(d % 2 == 0) && d < 0)) || (((((((A == -1 + -(d / 4) + r + B * ((p / 2 + 1) / 2 + 1 + q) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || -1 + -(d / 4) + r + B * (q + (p / 2 + 1) / 2) == A)) || d / 2 % 2 == 0) || !(r >= d / 4 + 1)) || !(d / 2 < 0)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r >= d / 4)) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || -(d / 4) + r + B * (q + (p / 2 + 1) / 2) == A) && (((p / 2 + 1) % 2 == 0 || A == -(d / 4) + r + B * ((p / 2 + 1) / 2 + 1 + q)) || !(p / 2 + 1 < 0))))))) || p % 2 == 0) || !(p < 0)))) || ((((((((((((((((((!(B * -4 + -1 * r + A + r >= 2 * B) && (!(r >= d) || A == r + -d + B * (p + q))) && p == 1) && (((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || !(r >= d / 2 + 1)) || d % 2 == 0)) && B * -4 + -1 * r + A == B) && p >= 1) && B == d) && q + -4 == 1) && B * -4 + -1 * r + A + r >= B * -4 + -1 * r + A) && B * p == d) && B * 4 + (B * -4 + A) >= 2 * (2 * B)) && (((((!(d < 0) || ((((!(r >= (d / 2 + 1) / 2 + 1) || (((A == -1 + -((d / 2 + 1) / 2) + r + B * (q + (p / 4 + 1)) || !(p / 2 < 0)) || p / 2 % 2 == 0) && (A == B * (p / 4 + q) + (-1 + -((d / 2 + 1) / 2) + r) || (p / 2 < 0 && !(p / 2 % 2 == 0))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && (((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || !(r >= (d / 2 + 1) / 2)) || ((B * (p / 4 + q) + (r + -((d / 2 + 1) / 2)) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((A == r + -((d / 2 + 1) / 2) + B * (q + (p / 4 + 1)) || !(p / 2 < 0)) || p / 2 % 2 == 0))))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (!(d % 2 == 0) && d < 0)) || ((((d / 2 % 2 == 0 || !(r >= d / 4 + 1)) || !(d / 2 < 0)) || (((!(p / 2 < 0) || A == -1 + -(d / 4) + r + B * (q + (p / 4 + 1))) || p / 2 % 2 == 0) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == -1 + -(d / 4) + r + B * (p / 4 + q)))) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || (((-(d / 4) + r + B * (q + (p / 4 + 1)) == A || !(p / 2 < 0)) || p / 2 % 2 == 0) && (-(d / 4) + r + B * (p / 4 + q) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))))) || !(r >= d / 4))))) || (p < 0 && !(p % 2 == 0)))) && A >= 2 * (2 * B)) && !(B * -4 + A >= 2 * B)) && r == -d + (B * -4 + A)) && q == p + 4) && B == 1) && ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || !(r >= d / 2)) || (!(d % 2 == 0) && d < 0))) && ((((((!(d < 0) || ((((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || !(r >= (d / 2 + 1) / 2)) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + -((d / 2 + 1) / 2) + B * (q + (p / 2 + 1) / 2) == A) && (((p / 2 + 1) % 2 == 0 || A == B * ((p / 2 + 1) / 2 + 1 + q) + (r + -((d / 2 + 1) / 2))) || !(p / 2 + 1 < 0)))) && ((((((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == -1 + -((d / 2 + 1) / 2) + r + B * (q + (p / 2 + 1) / 2)) && (((p / 2 + 1) % 2 == 0 || B * ((p / 2 + 1) / 2 + 1 + q) + (-1 + -((d / 2 + 1) / 2) + r) == A) || !(p / 2 + 1 < 0))) || !(r >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (!(d % 2 == 0) && d < 0)) || (((((((A == -1 + -(d / 4) + r + B * ((p / 2 + 1) / 2 + 1 + q) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || -1 + -(d / 4) + r + B * (q + (p / 2 + 1) / 2) == A)) || d / 2 % 2 == 0) || !(r >= d / 4 + 1)) || !(d / 2 < 0)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r >= d / 4)) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || -(d / 4) + r + B * (q + (p / 2 + 1) / 2) == A) && (((p / 2 + 1) % 2 == 0 || A == -(d / 4) + r + B * ((p / 2 + 1) / 2 + 1 + q)) || !(p / 2 + 1 < 0))))))) || p % 2 == 0) || !(p < 0))) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (((((((((((((A == B * q + r && d == 2 * B) && d == 2 * 1) && 2 <= p) && 2 <= d) && q == 0) && B * p == d) && A == r) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r)))) && p == 2 * 1) || ((((((((((((((4 <= p && ((((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r)))) || (((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && d * q + r == A) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r)))))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((d / 2 == B || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || B == d / 2 + 1) || d % 2 == 0)))) && A == B * q + r) && r >= d / 2) && 2 * (2 * B) == d) && 2 <= d / 2) && p == 2 * (2 * 1)) && q == 0) && d == 2 * (2 * 1)) && B * p == d) && A == r) && B == 1) && (!(p == 1) || B == d)) && d % 2 == 0)) || ((((A == B * q + r && (((((((((((((((((((((((((((((((((!(d / 2 % 2 == 0) && d / 2 < 0) || ((((d / 4 % 2 == 0 || !(r + -(d / 2) >= d / 8 + 1)) || ((-1 + -(d / 8) + (r + -(d / 2)) + B * (q + p / 2 + p / 8) == A || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((-1 + -(d / 8) + (r + -(d / 2)) + B * (p / 8 + 1 + (q + p / 2)) == A || p / 4 % 2 == 0) || !(p / 4 < 0)))) || !(d / 4 < 0)) && ((!(r + -(d / 2) >= d / 8) || (((p / 4 % 2 == 0 || !(p / 4 < 0)) || A == r + -(d / 2) + -(d / 8) + B * (p / 8 + 1 + (q + p / 2))) && (r + -(d / 2) + -(d / 8) + B * (q + p / 2 + p / 8) == A || (!(p / 4 % 2 == 0) && p / 4 < 0)))) || (!(d / 4 % 2 == 0) && d / 4 < 0)))) || r + -(d / 2) >= d / 4) && (((((((((p / 4 % 2 == 0 || !(p / 4 < 0)) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + B * (p / 8 + 1 + (q + p / 2))) && ((!(p / 4 % 2 == 0) && p / 4 < 0) || r + -(d / 2) + -((d / 4 + 1) / 2) + B * (q + p / 2 + p / 8) == A)) || (d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0))) || !(r + -(d / 2) >= (d / 4 + 1) / 2)) && (((!(r + -(d / 2) >= (d / 4 + 1) / 2 + 1) || !(d / 4 + 1 < 0)) || (d / 4 + 1) % 2 == 0) || ((A == -1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + B * (q + p / 2 + p / 8) || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((A == -1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + B * (p / 8 + 1 + (q + p / 2)) || p / 4 % 2 == 0) || !(p / 4 < 0))))) || d / 2 % 2 == 0) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1)) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 2 < 0) || p / 2 % 2 == 0) || ((((((((!(r + -(d / 2) >= (d / 4 + 1) / 2 + 1) || !(d / 4 + 1 < 0)) || (d / 4 + 1) % 2 == 0) || (((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || (q + p / 2 + (p / 4 + 1) / 2) * B + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2))) == A) && (((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2)))))) && (((d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0)) || ((A == r + -(d / 2) + -((d / 4 + 1) / 2) + (q + p / 2 + (p / 4 + 1) / 2) * B || (!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0)) && (((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2))))) || !(r + -(d / 2) >= (d / 4 + 1) / 2))) || d / 2 % 2 == 0) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || (((((((p / 4 + 1) % 2 == 0 || r + -(d / 2) + -(d / 8) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) == A) || !(p / 4 + 1 < 0)) && ((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || r + -(d / 2) + -(d / 8) + (q + p / 2 + (p / 4 + 1) / 2) * B == A)) || !(r + -(d / 2) >= d / 8)) || (!(d / 4 % 2 == 0) && d / 4 < 0)) && (((d / 4 % 2 == 0 || ((((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) + (-1 + -(d / 8) + (r + -(d / 2)))) && ((q + p / 2 + (p / 4 + 1) / 2) * B + (-1 + -(d / 8) + (r + -(d / 2))) == A || (!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0)))) || !(r + -(d / 2) >= d / 8 + 1)) || !(d / 4 < 0)))) || r + -(d / 2) >= d / 4)))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || ((((((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (((((A == B * (q + p / 2 + p / 8) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((p / 4 % 2 == 0 || B * (p / 8 + 1 + (q + p / 2)) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A) || !(p / 4 < 0))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 4)) && (((!((d / 2 + 1) / 2 < 0) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 4 + 1)) || ((r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (q + p / 2 + p / 8) == A || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((p / 4 % 2 == 0 || A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (p / 8 + 1 + (q + p / 2))) || !(p / 4 < 0)))) || (d / 2 + 1) / 2 % 2 == 0))) && (((((((!((d / 2 + 1) / 2 + 1 < 0) || (((p / 4 % 2 == 0 || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (p / 8 + 1 + (q + p / 2))) || !(p / 4 < 0)) && (A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (q + p / 2 + p / 8) || (!(p / 4 % 2 == 0) && p / 4 < 0)))) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || !(r + (-1 + -(d / 2)) >= ((d / 2 + 1) / 2 + 1) / 2 + 1)) && (((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || !(r + (-1 + -(d / 2)) >= ((d / 2 + 1) / 2 + 1) / 2)) || (((!(p / 4 % 2 == 0) && p / 4 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (q + p / 2 + p / 8) == A) && ((p / 4 % 2 == 0 || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (p / 8 + 1 + (q + p / 2)) == A) || !(p / 4 < 0))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1)) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && (((((((((((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || (q + p / 2 + (p / 4 + 1) / 2) * B + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A) && ((B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A || (p / 4 + 1) % 2 == 0) || !(p / 4 + 1 < 0))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 4)) && (((!((d / 2 + 1) / 2 < 0) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) || (p / 4 + 1) % 2 == 0) || !(p / 4 + 1 < 0)) && (A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + (q + p / 2 + (p / 4 + 1) / 2) * B || (!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0)))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 4 + 1)) || (d / 2 + 1) / 2 % 2 == 0)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) && (((((((!((d / 2 + 1) / 2 + 1 < 0) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || !(r + (-1 + -(d / 2)) >= ((d / 2 + 1) / 2 + 1) / 2 + 1)) || ((((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2))) && ((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + (q + p / 2 + (p / 4 + 1) / 2) * B))) && (((((r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) == A || (p / 4 + 1) % 2 == 0) || !(p / 4 + 1 < 0)) && ((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + (q + p / 2 + (p / 4 + 1) / 2) * B == A)) || (!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0)) || !(r + (-1 + -(d / 2)) >= ((d / 2 + 1) / 2 + 1) / 2))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1)) || !(p / 2 < 0)) || p / 2 % 2 == 0))) || d % 2 == 0)) || (p < 0 && !(p % 2 == 0))) && A == B * q + r) && (!(r >= d) || A == r + -d + B * (p + q))) && (!(p == 1) || d * q + r == A)) && (((((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p / 2 + 1 == 1) || p % 2 == 0) || !(p < 0)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || r + B * 1 * q == A) || ((((!(d < 0) || (((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || !(B * 1 == (d / 2 + 1) / 2)) && ((!(B * 1 == (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (((d / 2 % 2 == 0 || !(B * 1 == d / 4 + 1)) || !(d / 2 < 0)) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || !(B * 1 == d / 4)))) || (!(d % 2 == 0) && d < 0))))) && (((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || !(r >= d / 2 + 1)) || d % 2 == 0)) && 8 <= p) && (((((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || !(B * 1 == d / 2 + 1)) || d % 2 == 0) && (!(d / 2 == B * 1) || (!(d % 2 == 0) && d < 0)))) || p == 1) || r + B * 1 * q == A)) && (((((((!(d < 0) || r + -d >= 2 * d / 4 + 1) || ((((2 * d / 4 + 1) % 2 == 0 || !((2 * d / 4 + 1) / 2 + 1 == B * 1)) || !(2 * d / 4 + 1 < 0)) && ((2 * d / 4 + 1 < 0 && !((2 * d / 4 + 1) % 2 == 0)) || !(B * 1 == (2 * d / 4 + 1) / 2)))) || d % 2 == 0) && (((((2 * d / 4 % 2 == 0 || !(2 * d / 8 + 1 == B * 1)) || !(2 * d / 4 < 0)) && ((!(2 * d / 4 % 2 == 0) && 2 * d / 4 < 0) || !(B * 1 == 2 * d / 8))) || (!(d % 2 == 0) && d < 0)) || r + -d >= 2 * d / 4)) || !(r >= d)) || ((((((2 * p / 4 % 2 == 0 || !(2 * p / 4 < 0)) || !(2 * p / 8 + 1 == 1)) && (!(2 * p / 8 == 1) || (!(2 * p / 4 % 2 == 0) && 2 * p / 4 < 0))) || 2 * p / 4 == 1) || (p < 0 && !(p % 2 == 0))) && (((p % 2 == 0 || !(p < 0)) || (((!((2 * p / 4 + 1) % 2 == 0) && 2 * p / 4 + 1 < 0) || !((2 * p / 4 + 1) / 2 == 1)) && (((2 * p / 4 + 1) % 2 == 0 || !(2 * p / 4 + 1 < 0)) || !((2 * p / 4 + 1) / 2 + 1 == 1)))) || 1 == 2 * p / 4 + 1))) || A == B * 1 * (p + q) + (r + -d))) && ((p % 2 == 0 || ((((!(d < 0) || (((!(r + -d >= (d / 2 + 1) / 2) || (((A == ((p / 2 + 1) / 2 + 1 + (p + q)) * B + (r + -d + -((d / 2 + 1) / 2)) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (p + q + (p / 2 + 1) / 2) * B + (r + -d + -((d / 2 + 1) / 2)) == A))) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((!(r + -d >= (d / 2 + 1) / 2 + 1) || ((((p / 2 + 1) % 2 == 0 || A == -1 + -((d / 2 + 1) / 2) + (r + -d) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == -1 + -((d / 2 + 1) / 2) + (r + -d) + (p + q + (p / 2 + 1) / 2) * B))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || r + -d >= d / 2 + 1) || d % 2 == 0) && ((((((!(r + -d >= d / 4 + 1) || d / 2 % 2 == 0) || ((((p / 2 + 1) % 2 == 0 || !(p / 2 + 1 < 0)) || A == r + -d + (-1 + -(d / 4)) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) && (A == r + -d + (-1 + -(d / 4)) + (p + q + (p / 2 + 1) / 2) * B || (p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0))))) || !(d / 2 < 0)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -d >= d / 4)) || ((((p / 2 + 1) % 2 == 0 || A == -(d / 4) + (r + -d) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) || !(p / 2 + 1 < 0)) && ((p + q + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -d)) == A || (p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)))))) || (!(d % 2 == 0) && d < 0)) || r + -d >= d / 2))) || !(p < 0))) && (((((!(d % 2 == 0) && d < 0) || ((((p / 2 + 1) % 2 == 0 || ((((((((d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0)) || (((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2)) && ((((p / 2 + 1) / 2 + 1) % 2 == 0 || B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (r + -(d / 2) + -((d / 4 + 1) / 2)) == A) || !((p / 2 + 1) / 2 + 1 < 0)))) || !(r + -(d / 2) >= (d / 4 + 1) / 2)) && (((!(r + -(d / 2) >= (d / 4 + 1) / 2 + 1) || !(d / 4 + 1 < 0)) || (d / 4 + 1) % 2 == 0) || ((-1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) == A || (!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0)) && ((((p / 2 + 1) / 2 + 1) % 2 == 0 || A == B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2)))) || !((p / 2 + 1) / 2 + 1 < 0))))) || d / 2 % 2 == 0) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || r + -(d / 2) >= d / 4) || (((!(r + -(d / 2) >= d / 8) || ((A == r + -(d / 2) + -(d / 8) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) || (!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0)) && ((((p / 2 + 1) / 2 + 1) % 2 == 0 || !((p / 2 + 1) / 2 + 1 < 0)) || r + -(d / 2) + -(d / 8) + B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) == A))) || (!(d / 4 % 2 == 0) && d / 4 < 0)) && (((d / 4 % 2 == 0 || !(r + -(d / 2) >= d / 8 + 1)) || (((((p / 2 + 1) / 2 + 1) % 2 == 0 || !((p / 2 + 1) / 2 + 1 < 0)) || A == B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (-1 + -(d / 8) + (r + -(d / 2)))) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) + (-1 + -(d / 8) + (r + -(d / 2))) == A))) || !(d / 4 < 0)))))) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || ((((((((((((p / 2 + 1) / 2 % 2 == 0 || -1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2))) == A)) || !(r + -(d / 2) >= (d / 4 + 1) / 2 + 1)) || !(d / 4 + 1 < 0)) || (d / 4 + 1) % 2 == 0) && ((((A == r + -(d / 2) + -((d / 4 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B || (!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0)) && (((p / 2 + 1) / 2 % 2 == 0 || !((p / 2 + 1) / 2 < 0)) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B)) || (d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0))) || !(r + -(d / 2) >= (d / 4 + 1) / 2))) || d / 2 % 2 == 0) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || ((((d / 4 % 2 == 0 || !(r + -(d / 2) >= d / 8 + 1)) || !(d / 4 < 0)) || (((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B + (-1 + -(d / 8) + (r + -(d / 2))) == A) && (((p / 2 + 1) / 2 % 2 == 0 || !((p / 2 + 1) / 2 < 0)) || ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B + (-1 + -(d / 8) + (r + -(d / 2))) == A))) && ((!(r + -(d / 2) >= d / 8) || (!(d / 4 % 2 == 0) && d / 4 < 0)) || ((((p / 2 + 1) / 2 % 2 == 0 || !((p / 2 + 1) / 2 < 0)) || r + -(d / 2) + -(d / 8) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A) && (r + -(d / 2) + -(d / 8) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B == A || (!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0)))))) || r + -(d / 2) >= d / 4))))) && ((!(d < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || ((((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || ((((!((d / 2 + 1) / 2 < 0) || (((r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A || (p / 2 + 1) / 2 % 2 == 0) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 4 + 1)) || (d / 2 + 1) / 2 % 2 == 0) && ((((((p / 2 + 1) / 2 % 2 == 0 || ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 4)))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) && (((((((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || !(r + (-1 + -(d / 2)) >= ((d / 2 + 1) / 2 + 1) / 2)) || ((((p / 2 + 1) / 2 % 2 == 0 || A == r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B == A))) && (((((((p / 2 + 1) / 2 % 2 == 0 || r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B)) || !((d / 2 + 1) / 2 + 1 < 0)) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || !(r + (-1 + -(d / 2)) >= ((d / 2 + 1) / 2 + 1) / 2 + 1))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1))) && (((p / 2 + 1) % 2 == 0 || (((((d / 2 + 1) % 2 == 0 || ((((!((d / 2 + 1) / 2 + 1 < 0) || (((((p / 2 + 1) / 2 + 1) % 2 == 0 || !((p / 2 + 1) / 2 + 1 < 0)) || r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) == A) && (A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) || (!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0)))) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || !(r + (-1 + -(d / 2)) >= ((d / 2 + 1) / 2 + 1) / 2 + 1)) && (((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || (((((p / 2 + 1) / 2 + 1) % 2 == 0 || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) == A) || !((p / 2 + 1) / 2 + 1 < 0)) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) == A))) || !(r + (-1 + -(d / 2)) >= ((d / 2 + 1) / 2 + 1) / 2)))) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) && ((((((!((d / 2 + 1) / 2 < 0) || (((A == B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))) || ((p / 2 + 1) / 2 + 1) % 2 == 0) || !((p / 2 + 1) / 2 + 1 < 0)) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2)))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 4 + 1)) || (d / 2 + 1) / 2 % 2 == 0) && (((((B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A || ((p / 2 + 1) / 2 + 1) % 2 == 0) || !((p / 2 + 1) / 2 + 1 < 0)) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || A == B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 4))) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2))) || !(p / 2 + 1 < 0)))) || d % 2 == 0)) || p % 2 == 0) || !(p < 0))) && (((((!(d % 2 == 0) && d < 0) || r + -d >= d / 2) || ((((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -d >= d / 4)) || (((p / 2 < 0 && !(p / 2 % 2 == 0)) || -(d / 4) + (r + -d) + (p / 4 + (p + q)) * B == A) && (((p + q + (p / 4 + 1)) * B + (-(d / 4) + (r + -d)) == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && ((((((!(p / 2 < 0) || p / 2 % 2 == 0) || (p + q + (p / 4 + 1)) * B + (r + -d + (-1 + -(d / 4))) == A) && (A == r + -d + (-1 + -(d / 4)) + (p / 4 + (p + q)) * B || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || !(r + -d >= d / 4 + 1)) || d / 2 % 2 == 0) || !(d / 2 < 0)))) && (((!(d < 0) || r + -d >= d / 2 + 1) || (((((((-1 + -((d / 2 + 1) / 2) + (r + -d) + (p + q + (p / 4 + 1)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0) && (-1 + -((d / 2 + 1) / 2) + (r + -d) + (p / 4 + (p + q)) * B == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || !(r + -d >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((!(r + -d >= (d / 2 + 1) / 2) || (((p / 4 + (p + q)) * B + (r + -d + -((d / 2 + 1) / 2)) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((A == (p + q + (p / 4 + 1)) * B + (r + -d + -((d / 2 + 1) / 2)) || !(p / 2 < 0)) || p / 2 % 2 == 0))) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))))) || d % 2 == 0)) || (p < 0 && !(p % 2 == 0)))) && (((((A == B * 1 * (q + 2 * p) + (-(2 * d) + r) || -(2 * d) + r >= d) || p == 1) || !(r >= 2 * d)) || ((!(p * 4 / 8 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p * 4 / 8 + 1 == 1)))) || ((!(B * 1 == d * 4 / 8) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || !(d * 4 / 8 + 1 == B * 1)) || d % 2 == 0)))) && B * p == d) && A == r) && ((!(-(2 * d * 2) + r >= d) || -(2 * d * 2) + r >= 2 * d) || -(2 * d * 2) + r + -d + (p + (q + 2 * (2 * p))) * B == A)) && (((((((((((((((((((r >= d || (((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p % 2 == 0) || (((!(d % 2 == 0) && d < 0) || ((((A == -1 + -(d / 4) + (r + -(d / 2)) + (q + (p / 2 + 1) + 1) * (d / 4 + 1) || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || (q + (p / 2 + 1) + 1) * (d / 4) + (-(d / 4) + (r + -(d / 2))) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || A == (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))))) || d % 2 == 0))) || !(p < 0)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (((!(d % 2 == 0) && d < 0) || ((((-1 + -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4 + 1) == A || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + p / 2 + 1) * ((d / 2 + 1) / 2)) && (((A == (q + p / 2 + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || d % 2 == 0))) || (p < 0 && !(p % 2 == 0))))) && ((((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r)))) || (((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && d * q + r == A) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r)))))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((d / 2 == B || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || B == d / 2 + 1) || d % 2 == 0)))) && A == B * q + r) && (p == 1 || (((((p + q + p / 2) * B + (r + -d + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || A == r + -d + -(d / 2) + (p + q + (p / 2 + 1)) * B)) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p % 2 == 0 || A == r + -d + (-1 + -(d / 2)) + (p + q + (p / 2 + 1)) * B) || !(p < 0)) && (A == r + -d + (-1 + -(d / 2)) + (p + q + p / 2) * B || (p < 0 && !(p % 2 == 0))))) || d % 2 == 0)))) && r >= d / 2) && (!(p == 1) || d * q + r == A)) && (((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || ((((p / 2 + 1) % 2 == 0 || -1 + -(d / 4) + (r + -(d / 2)) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B == A) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-1 + -(d / 4) + (r + -(d / 2)))))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -(d / 2))) == A) && ((A == ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (-(d / 4) + (r + -(d / 2))) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)))))) && (((((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 4 + (q + p / 2)) * B + (-(d / 4) + (r + -(d / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((-(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((p / 2 < 0 && !(p / 2 % 2 == 0)) || (p / 4 + (q + p / 2)) * B + (-1 + -(d / 4) + (r + -(d / 2))) == A) && ((!(p / 2 < 0) || p / 2 % 2 == 0) || A == -1 + -(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B)) || d / 2 % 2 == 0) || !(d / 2 < 0))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || (!(d % 2 == 0) && d < 0))) && 2 <= d / 2) && (p == 1 || ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((((!(d < 0) || !(r >= d / 2 + 1)) || d % 2 == 0) || A == r + (-1 + -(d / 2)) + (q + 1) * (d / 2 + 1)) && ((!(r >= d / 2) || (!(d % 2 == 0) && d < 0)) || d / 2 * (q + 1) + (r + -(d / 2)) == A)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(r + -d >= d / 2) || (!(d % 2 == 0) && d < 0)) || r + -d + -(d / 2) + d / 2 * (p + q + 1) == A) && (((!(d < 0) || !(r + -d >= d / 2 + 1)) || A == (p + q + 1) * (d / 2 + 1) + (r + -d + (-1 + -(d / 2)))) || d % 2 == 0)))) && A == r + -d + B * (p + q)) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && (!(p == 1) || B == d)) && ((!(d < 0) || d % 2 == 0) || ((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || ((((((((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B == A))))) && (((((((!(p / 2 < 0) || p / 2 % 2 == 0) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + 1 + (q + p / 2)) * B == A) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + (q + p / 2)) * B)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((d / 2 + 1) % 2 == 0 || !(d / 2 + 1 < 0)) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)) + (p / 4 + 1 + (q + p / 2)) * B || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 + (q + p / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)))) && d % 2 == 0) || (((((((((((((((((((((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r)))) || (((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && d * q + r == A) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r))))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((d / 2 == B || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || B == d / 2 + 1) || d % 2 == 0)))) && A == B * q + r) && (p == 1 || (((((p + q + p / 2) * B + (r + -d + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || A == r + -d + -(d / 2) + (p + q + (p / 2 + 1)) * B)) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p % 2 == 0 || A == r + -d + (-1 + -(d / 2)) + (p + q + (p / 2 + 1)) * B) || !(p < 0)) && (A == r + -d + (-1 + -(d / 2)) + (p + q + p / 2) * B || (p < 0 && !(p % 2 == 0))))) || d % 2 == 0)))) && r >= d / 2) && (!(p == 1) || d * q + r == A)) && (((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || ((((p / 2 + 1) % 2 == 0 || -1 + -(d / 4) + (r + -(d / 2)) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B == A) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-1 + -(d / 4) + (r + -(d / 2)))))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -(d / 2))) == A) && ((A == ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (-(d / 4) + (r + -(d / 2))) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)))))) && (((((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 4 + (q + p / 2)) * B + (-(d / 4) + (r + -(d / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((-(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((p / 2 < 0 && !(p / 2 % 2 == 0)) || (p / 4 + (q + p / 2)) * B + (-1 + -(d / 4) + (r + -(d / 2))) == A) && ((!(p / 2 < 0) || p / 2 % 2 == 0) || A == -1 + -(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B)) || d / 2 % 2 == 0) || !(d / 2 < 0))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || (!(d % 2 == 0) && d < 0))) && 2 <= d / 2) && (p == 1 || ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)))) && ((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p % 2 == 0) || (((!(d % 2 == 0) && d < 0) || ((((A == -1 + -(d / 4) + (r + -(d / 2)) + (q + (p / 2 + 1) + 1) * (d / 4 + 1) || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || (q + (p / 2 + 1) + 1) * (d / 4) + (-(d / 4) + (r + -(d / 2))) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || A == (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))))) || d % 2 == 0))) || !(p < 0))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((((!(d < 0) || !(r >= d / 2 + 1)) || d % 2 == 0) || A == r + (-1 + -(d / 2)) + (q + 1) * (d / 2 + 1)) && ((!(r >= d / 2) || (!(d % 2 == 0) && d < 0)) || d / 2 * (q + 1) + (r + -(d / 2)) == A)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(r + -d >= d / 2) || (!(d % 2 == 0) && d < 0)) || r + -d + -(d / 2) + d / 2 * (p + q + 1) == A) && (((!(d < 0) || !(r + -d >= d / 2 + 1)) || A == (p + q + 1) * (d / 2 + 1) + (r + -d + (-1 + -(d / 2)))) || d % 2 == 0)))) && A == r + -d + B * (p + q)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (((!(d % 2 == 0) && d < 0) || ((((-1 + -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4 + 1) == A || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + p / 2 + 1) * ((d / 2 + 1) / 2)) && (((A == (q + p / 2 + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || d % 2 == 0))) || (p < 0 && !(p % 2 == 0)))) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && (!(p == 1) || B == d)) && ((!(d < 0) || d % 2 == 0) || ((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || ((((((((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B == A))))) && (((((((!(p / 2 < 0) || p / 2 % 2 == 0) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + 1 + (q + p / 2)) * B == A) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + (q + p / 2)) * B)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((d / 2 + 1) % 2 == 0 || !(d / 2 + 1 < 0)) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)) + (p / 4 + 1 + (q + p / 2)) * B || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 + (q + p / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)))) && d % 2 == 0)) || (((((((((((((((((((((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r)))) || (((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && d * q + r == A) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r))))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((d / 2 == B || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || B == d / 2 + 1) || d % 2 == 0)))) && A == B * q + r) && (p == 1 || (((((p + q + p / 2) * B + (r + -d + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || A == r + -d + -(d / 2) + (p + q + (p / 2 + 1)) * B)) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p % 2 == 0 || A == r + -d + (-1 + -(d / 2)) + (p + q + (p / 2 + 1)) * B) || !(p < 0)) && (A == r + -d + (-1 + -(d / 2)) + (p + q + p / 2) * B || (p < 0 && !(p % 2 == 0))))) || d % 2 == 0)))) && r >= d / 2) && (((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || ((((p / 2 + 1) % 2 == 0 || -1 + -(d / 4) + (r + -(d / 2)) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B == A) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-1 + -(d / 4) + (r + -(d / 2)))))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -(d / 2))) == A) && ((A == ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (-(d / 4) + (r + -(d / 2))) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)))))) && (((((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 4 + (q + p / 2)) * B + (-(d / 4) + (r + -(d / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((-(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((p / 2 < 0 && !(p / 2 % 2 == 0)) || (p / 4 + (q + p / 2)) * B + (-1 + -(d / 4) + (r + -(d / 2))) == A) && ((!(p / 2 < 0) || p / 2 % 2 == 0) || A == -1 + -(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B)) || d / 2 % 2 == 0) || !(d / 2 < 0))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || (!(d % 2 == 0) && d < 0))) && 2 <= d / 2) && (p == 1 || ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)))) && ((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p % 2 == 0) || (((!(d % 2 == 0) && d < 0) || ((((A == -1 + -(d / 4) + (r + -(d / 2)) + (q + (p / 2 + 1) + 1) * (d / 4 + 1) || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || (q + (p / 2 + 1) + 1) * (d / 4) + (-(d / 4) + (r + -(d / 2))) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || A == (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))))) || d % 2 == 0))) || !(p < 0))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((((!(d < 0) || !(r >= d / 2 + 1)) || d % 2 == 0) || A == r + (-1 + -(d / 2)) + (q + 1) * (d / 2 + 1)) && ((!(r >= d / 2) || (!(d % 2 == 0) && d < 0)) || d / 2 * (q + 1) + (r + -(d / 2)) == A)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(r + -d >= d / 2) || (!(d % 2 == 0) && d < 0)) || r + -d + -(d / 2) + d / 2 * (p + q + 1) == A) && (((!(d < 0) || !(r + -d >= d / 2 + 1)) || A == (p + q + 1) * (d / 2 + 1) + (r + -d + (-1 + -(d / 2)))) || d % 2 == 0)))) && A == r + -d + B * (p + q)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (((!(d % 2 == 0) && d < 0) || ((((-1 + -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4 + 1) == A || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + p / 2 + 1) * ((d / 2 + 1) / 2)) && (((A == (q + p / 2 + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || d % 2 == 0))) || (p < 0 && !(p % 2 == 0)))) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && d * q + r == A) && (!(p == 1) || B == d)) && ((!(d < 0) || d % 2 == 0) || ((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || ((((((((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B == A))))) && (((((((!(p / 2 < 0) || p / 2 % 2 == 0) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + 1 + (q + p / 2)) * B == A) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + (q + p / 2)) * B)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((d / 2 + 1) % 2 == 0 || !(d / 2 + 1 < 0)) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)) + (p / 4 + 1 + (q + p / 2)) * B || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 + (q + p / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)))) && d % 2 == 0))) && ((((((p / 4 + 1 == 1 || ((((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || !(1 + (p / 4 + 1) / 2 == 1)) && (!(1 == (p / 4 + 1) / 2) || (!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0)))) || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 == 1 || (((p / 4 % 2 == 0 || !(p / 8 + 1 == 1)) || !(p / 4 < 0)) && (!(p / 8 == 1) || (!(p / 4 % 2 == 0) && p / 4 < 0)))) || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || (((B * 1 * (q + p / 2) + (r + -(d / 2)) == A || (!(d % 2 == 0) && d < 0)) || ((((!(d / 2 % 2 == 0) && d / 2 < 0) || ((!(B * 1 == d / 8) || (!(d / 4 % 2 == 0) && d / 4 < 0)) && ((d / 4 % 2 == 0 || !(d / 4 < 0)) || !(B * 1 == d / 8 + 1)))) || r + -(d / 2) >= d / 4) && (((d / 2 % 2 == 0 || ((!(B * 1 == (d / 4 + 1) / 2) || (d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0))) && ((!(d / 4 + 1 < 0) || (d / 4 + 1) % 2 == 0) || !(B * 1 == (d / 4 + 1) / 2 + 1)))) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1))) && (((!(d < 0) || (((((!(B * 1 == (d / 2 + 1) / 4) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) && ((!((d / 2 + 1) / 2 < 0) || !(B * 1 == (d / 2 + 1) / 4 + 1)) || (d / 2 + 1) / 2 % 2 == 0)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) && ((((((!((d / 2 + 1) / 2 + 1 < 0) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2 + 1)) && ((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1))) || r + (-1 + -(d / 2)) + B * 1 * (q + p / 2) == A) || d % 2 == 0))) || (p < 0 && !(p % 2 == 0)))) && (((((!(d < 0) || ((((!(r >= (d / 2 + 1) / 2 + 1) || (((A == -1 + -((d / 2 + 1) / 2) + r + B * (q + (p / 4 + 1)) || !(p / 2 < 0)) || p / 2 % 2 == 0) && (A == B * (p / 4 + q) + (-1 + -((d / 2 + 1) / 2) + r) || (p / 2 < 0 && !(p / 2 % 2 == 0))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && (((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || !(r >= (d / 2 + 1) / 2)) || ((B * (p / 4 + q) + (r + -((d / 2 + 1) / 2)) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((A == r + -((d / 2 + 1) / 2) + B * (q + (p / 4 + 1)) || !(p / 2 < 0)) || p / 2 % 2 == 0))))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (!(d % 2 == 0) && d < 0)) || ((((d / 2 % 2 == 0 || !(r >= d / 4 + 1)) || !(d / 2 < 0)) || (((!(p / 2 < 0) || A == -1 + -(d / 4) + r + B * (q + (p / 4 + 1))) || p / 2 % 2 == 0) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == -1 + -(d / 4) + r + B * (p / 4 + q)))) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || (((-(d / 4) + r + B * (q + (p / 4 + 1)) == A || !(p / 2 < 0)) || p / 2 % 2 == 0) && (-(d / 4) + r + B * (p / 4 + q) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))))) || !(r >= d / 4))))) || (p < 0 && !(p % 2 == 0)))) && B == 1) && (-(2 * d) + r >= d || ((((!(d < 0) || ((B * (2 * p / 4 + (q + 2 * p)) + (-1 + -(2 * d / 4) + (-(2 * d) + r)) == A || (p < 0 && !(p % 2 == 0))) && (((q + 2 * p + (2 * p / 4 + 1)) * B + (-1 + -(2 * d / 4) + (-(2 * d) + r)) == A || p % 2 == 0) || !(p < 0)))) || !(-(2 * d) + r >= 2 * d / 4 + 1)) || d % 2 == 0) && (((((p % 2 == 0 || A == (q + 2 * p + (2 * p / 4 + 1)) * B + (-(2 * d / 4) + (-(2 * d) + r))) || !(p < 0)) && (A == -(2 * d / 4) + (-(2 * d) + r) + B * (2 * p / 4 + (q + 2 * p)) || (p < 0 && !(p % 2 == 0)))) || (!(d % 2 == 0) && d < 0)) || !(-(2 * d) + r >= 2 * d / 4))))) && ((((((((p / 2 + 1) % 2 == 0 || (p / 2 + 1) / 2 + 1 == 1) || !(p / 2 + 1 < 0)) || (((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || !(((p / 2 + 1) / 2 + 1) / 2 == 1)) && ((!(((p / 2 + 1) / 2 + 1) / 2 + 1 == 1) || ((p / 2 + 1) / 2 + 1) % 2 == 0) || !((p / 2 + 1) / 2 + 1 < 0)))) && (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (p / 2 + 1) / 2 == 1) || (((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || !((p / 2 + 1) / 4 == 1)) && (((p / 2 + 1) / 2 % 2 == 0 || !((p / 2 + 1) / 2 < 0)) || !((p / 2 + 1) / 4 + 1 == 1))))) || p % 2 == 0) || ((((!(d < 0) || (((((!(B * 1 == (d / 2 + 1) / 4) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) && ((!((d / 2 + 1) / 2 < 0) || !(B * 1 == (d / 2 + 1) / 4 + 1)) || (d / 2 + 1) / 2 % 2 == 0)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) && ((((((!((d / 2 + 1) / 2 + 1 < 0) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2 + 1)) && ((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1))) || A == r + (-1 + -(d / 2)) + (q + (p / 2 + 1)) * (B * 1)) || d % 2 == 0) && (((!(d % 2 == 0) && d < 0) || r + -(d / 2) + (q + (p / 2 + 1)) * (B * 1) == A) || ((((!(d / 2 % 2 == 0) && d / 2 < 0) || ((!(B * 1 == d / 8) || (!(d / 4 % 2 == 0) && d / 4 < 0)) && ((d / 4 % 2 == 0 || !(d / 4 < 0)) || !(B * 1 == d / 8 + 1)))) || r + -(d / 2) >= d / 4) && (((d / 2 % 2 == 0 || ((!(B * 1 == (d / 4 + 1) / 2) || (d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0))) && ((!(d / 4 + 1 < 0) || (d / 4 + 1) % 2 == 0) || !(B * 1 == (d / 4 + 1) / 2 + 1)))) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1))))) || !(p < 0))) && ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || !(r >= d / 2)) || (!(d % 2 == 0) && d < 0))) && ((((((!(d < 0) || ((((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || !(r >= (d / 2 + 1) / 2)) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + -((d / 2 + 1) / 2) + B * (q + (p / 2 + 1) / 2) == A) && (((p / 2 + 1) % 2 == 0 || A == B * ((p / 2 + 1) / 2 + 1 + q) + (r + -((d / 2 + 1) / 2))) || !(p / 2 + 1 < 0)))) && ((((((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == -1 + -((d / 2 + 1) / 2) + r + B * (q + (p / 2 + 1) / 2)) && (((p / 2 + 1) % 2 == 0 || B * ((p / 2 + 1) / 2 + 1 + q) + (-1 + -((d / 2 + 1) / 2) + r) == A) || !(p / 2 + 1 < 0))) || !(r >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (!(d % 2 == 0) && d < 0)) || (((((((A == -1 + -(d / 4) + r + B * ((p / 2 + 1) / 2 + 1 + q) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || -1 + -(d / 4) + r + B * (q + (p / 2 + 1) / 2) == A)) || d / 2 % 2 == 0) || !(r >= d / 4 + 1)) || !(d / 2 < 0)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r >= d / 4)) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || -(d / 4) + r + B * (q + (p / 2 + 1) / 2) == A) && (((p / 2 + 1) % 2 == 0 || A == -(d / 4) + r + B * ((p / 2 + 1) / 2 + 1 + q)) || !(p / 2 + 1 < 0))))))) || p % 2 == 0) || !(p < 0))) || ((((((((((((((((((((((((((((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p / 2 + 1 == 1) || p % 2 == 0) || !(p < 0)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || ((((!(d < 0) || r + -d >= d / 2 + 1) || (((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || !(B * 1 == (d / 2 + 1) / 2)) && ((!(B * 1 == (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || d % 2 == 0) && (((((d / 2 % 2 == 0 || !(B * 1 == d / 4 + 1)) || !(d / 2 < 0)) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || !(B * 1 == d / 4))) || (!(d % 2 == 0) && d < 0)) || r + -d >= d / 2))) || A == B * 1 * (p + q) + (r + -d)) && (((((((((!(d / 2 % 2 == 0) && d / 2 < 0) || ((((d / 4 % 2 == 0 || !(r + -(d / 2) >= d / 8 + 1)) || ((-1 + -(d / 8) + (r + -(d / 2)) + B * (q + p / 2 + p / 8) == A || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((-1 + -(d / 8) + (r + -(d / 2)) + B * (p / 8 + 1 + (q + p / 2)) == A || p / 4 % 2 == 0) || !(p / 4 < 0)))) || !(d / 4 < 0)) && ((!(r + -(d / 2) >= d / 8) || (((p / 4 % 2 == 0 || !(p / 4 < 0)) || A == r + -(d / 2) + -(d / 8) + B * (p / 8 + 1 + (q + p / 2))) && (r + -(d / 2) + -(d / 8) + B * (q + p / 2 + p / 8) == A || (!(p / 4 % 2 == 0) && p / 4 < 0)))) || (!(d / 4 % 2 == 0) && d / 4 < 0)))) || r + -(d / 2) >= d / 4) && (((((((((p / 4 % 2 == 0 || !(p / 4 < 0)) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + B * (p / 8 + 1 + (q + p / 2))) && ((!(p / 4 % 2 == 0) && p / 4 < 0) || r + -(d / 2) + -((d / 4 + 1) / 2) + B * (q + p / 2 + p / 8) == A)) || (d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0))) || !(r + -(d / 2) >= (d / 4 + 1) / 2)) && (((!(r + -(d / 2) >= (d / 4 + 1) / 2 + 1) || !(d / 4 + 1 < 0)) || (d / 4 + 1) % 2 == 0) || ((A == -1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + B * (q + p / 2 + p / 8) || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((A == -1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + B * (p / 8 + 1 + (q + p / 2)) || p / 4 % 2 == 0) || !(p / 4 < 0))))) || d / 2 % 2 == 0) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1)) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 2 < 0) || p / 2 % 2 == 0) || ((((((((!(r + -(d / 2) >= (d / 4 + 1) / 2 + 1) || !(d / 4 + 1 < 0)) || (d / 4 + 1) % 2 == 0) || (((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || (q + p / 2 + (p / 4 + 1) / 2) * B + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2))) == A) && (((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2)))))) && (((d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0)) || ((A == r + -(d / 2) + -((d / 4 + 1) / 2) + (q + p / 2 + (p / 4 + 1) / 2) * B || (!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0)) && (((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2))))) || !(r + -(d / 2) >= (d / 4 + 1) / 2))) || d / 2 % 2 == 0) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || (((((((p / 4 + 1) % 2 == 0 || r + -(d / 2) + -(d / 8) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) == A) || !(p / 4 + 1 < 0)) && ((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || r + -(d / 2) + -(d / 8) + (q + p / 2 + (p / 4 + 1) / 2) * B == A)) || !(r + -(d / 2) >= d / 8)) || (!(d / 4 % 2 == 0) && d / 4 < 0)) && (((d / 4 % 2 == 0 || ((((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) + (-1 + -(d / 8) + (r + -(d / 2)))) && ((q + p / 2 + (p / 4 + 1) / 2) * B + (-1 + -(d / 8) + (r + -(d / 2))) == A || (!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0)))) || !(r + -(d / 2) >= d / 8 + 1)) || !(d / 4 < 0)))) || r + -(d / 2) >= d / 4)))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || ((((((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (((((A == B * (q + p / 2 + p / 8) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((p / 4 % 2 == 0 || B * (p / 8 + 1 + (q + p / 2)) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A) || !(p / 4 < 0))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 4)) && (((!((d / 2 + 1) / 2 < 0) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 4 + 1)) || ((r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (q + p / 2 + p / 8) == A || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((p / 4 % 2 == 0 || A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (p / 8 + 1 + (q + p / 2))) || !(p / 4 < 0)))) || (d / 2 + 1) / 2 % 2 == 0))) && (((((((!((d / 2 + 1) / 2 + 1 < 0) || (((p / 4 % 2 == 0 || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (p / 8 + 1 + (q + p / 2))) || !(p / 4 < 0)) && (A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (q + p / 2 + p / 8) || (!(p / 4 % 2 == 0) && p / 4 < 0)))) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || !(r + (-1 + -(d / 2)) >= ((d / 2 + 1) / 2 + 1) / 2 + 1)) && (((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || !(r + (-1 + -(d / 2)) >= ((d / 2 + 1) / 2 + 1) / 2)) || (((!(p / 4 % 2 == 0) && p / 4 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (q + p / 2 + p / 8) == A) && ((p / 4 % 2 == 0 || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (p / 8 + 1 + (q + p / 2)) == A) || !(p / 4 < 0))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1)) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && (((((((((((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || (q + p / 2 + (p / 4 + 1) / 2) * B + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A) && ((B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A || (p / 4 + 1) % 2 == 0) || !(p / 4 + 1 < 0))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 4)) && (((!((d / 2 + 1) / 2 < 0) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) || (p / 4 + 1) % 2 == 0) || !(p / 4 + 1 < 0)) && (A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + (q + p / 2 + (p / 4 + 1) / 2) * B || (!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0)))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 4 + 1)) || (d / 2 + 1) / 2 % 2 == 0)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) && (((((((!((d / 2 + 1) / 2 + 1 < 0) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || !(r + (-1 + -(d / 2)) >= ((d / 2 + 1) / 2 + 1) / 2 + 1)) || ((((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2))) && ((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + (q + p / 2 + (p / 4 + 1) / 2) * B))) && (((((r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) == A || (p / 4 + 1) % 2 == 0) || !(p / 4 + 1 < 0)) && ((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + (q + p / 2 + (p / 4 + 1) / 2) * B == A)) || (!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0)) || !(r + (-1 + -(d / 2)) >= ((d / 2 + 1) / 2 + 1) / 2))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1)) || !(p / 2 < 0)) || p / 2 % 2 == 0))) || d % 2 == 0)) || (p < 0 && !(p % 2 == 0)))) && A == B * q + r) && (!(r >= d) || A == r + -d + B * (p + q))) && (((((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p / 2 + 1 == 1) || p % 2 == 0) || !(p < 0)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || r + B * 1 * q == A) || ((((!(d < 0) || (((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || !(B * 1 == (d / 2 + 1) / 2)) && ((!(B * 1 == (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (((d / 2 % 2 == 0 || !(B * 1 == d / 4 + 1)) || !(d / 2 < 0)) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || !(B * 1 == d / 4)))) || (!(d % 2 == 0) && d < 0))))) && (((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || !(r >= d / 2 + 1)) || d % 2 == 0)) && 8 <= p) && (((((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || !(B * 1 == d / 2 + 1)) || d % 2 == 0) && (!(d / 2 == B * 1) || (!(d % 2 == 0) && d < 0)))) || p == 1) || r + B * 1 * q == A)) && ((p % 2 == 0 || ((((!(d < 0) || (((!(r + -d >= (d / 2 + 1) / 2) || (((A == ((p / 2 + 1) / 2 + 1 + (p + q)) * B + (r + -d + -((d / 2 + 1) / 2)) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (p + q + (p / 2 + 1) / 2) * B + (r + -d + -((d / 2 + 1) / 2)) == A))) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((!(r + -d >= (d / 2 + 1) / 2 + 1) || ((((p / 2 + 1) % 2 == 0 || A == -1 + -((d / 2 + 1) / 2) + (r + -d) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == -1 + -((d / 2 + 1) / 2) + (r + -d) + (p + q + (p / 2 + 1) / 2) * B))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || r + -d >= d / 2 + 1) || d % 2 == 0) && ((((((!(r + -d >= d / 4 + 1) || d / 2 % 2 == 0) || ((((p / 2 + 1) % 2 == 0 || !(p / 2 + 1 < 0)) || A == r + -d + (-1 + -(d / 4)) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) && (A == r + -d + (-1 + -(d / 4)) + (p + q + (p / 2 + 1) / 2) * B || (p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0))))) || !(d / 2 < 0)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -d >= d / 4)) || ((((p / 2 + 1) % 2 == 0 || A == -(d / 4) + (r + -d) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) || !(p / 2 + 1 < 0)) && ((p + q + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -d)) == A || (p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)))))) || (!(d % 2 == 0) && d < 0)) || r + -d >= d / 2))) || !(p < 0))) && (((((!(d % 2 == 0) && d < 0) || ((((p / 2 + 1) % 2 == 0 || ((((((((d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0)) || (((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2)) && ((((p / 2 + 1) / 2 + 1) % 2 == 0 || B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (r + -(d / 2) + -((d / 4 + 1) / 2)) == A) || !((p / 2 + 1) / 2 + 1 < 0)))) || !(r + -(d / 2) >= (d / 4 + 1) / 2)) && (((!(r + -(d / 2) >= (d / 4 + 1) / 2 + 1) || !(d / 4 + 1 < 0)) || (d / 4 + 1) % 2 == 0) || ((-1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) == A || (!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0)) && ((((p / 2 + 1) / 2 + 1) % 2 == 0 || A == B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2)))) || !((p / 2 + 1) / 2 + 1 < 0))))) || d / 2 % 2 == 0) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || r + -(d / 2) >= d / 4) || (((!(r + -(d / 2) >= d / 8) || ((A == r + -(d / 2) + -(d / 8) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) || (!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0)) && ((((p / 2 + 1) / 2 + 1) % 2 == 0 || !((p / 2 + 1) / 2 + 1 < 0)) || r + -(d / 2) + -(d / 8) + B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) == A))) || (!(d / 4 % 2 == 0) && d / 4 < 0)) && (((d / 4 % 2 == 0 || !(r + -(d / 2) >= d / 8 + 1)) || (((((p / 2 + 1) / 2 + 1) % 2 == 0 || !((p / 2 + 1) / 2 + 1 < 0)) || A == B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (-1 + -(d / 8) + (r + -(d / 2)))) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) + (-1 + -(d / 8) + (r + -(d / 2))) == A))) || !(d / 4 < 0)))))) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || ((((((((((((p / 2 + 1) / 2 % 2 == 0 || -1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2))) == A)) || !(r + -(d / 2) >= (d / 4 + 1) / 2 + 1)) || !(d / 4 + 1 < 0)) || (d / 4 + 1) % 2 == 0) && ((((A == r + -(d / 2) + -((d / 4 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B || (!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0)) && (((p / 2 + 1) / 2 % 2 == 0 || !((p / 2 + 1) / 2 < 0)) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B)) || (d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0))) || !(r + -(d / 2) >= (d / 4 + 1) / 2))) || d / 2 % 2 == 0) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || ((((d / 4 % 2 == 0 || !(r + -(d / 2) >= d / 8 + 1)) || !(d / 4 < 0)) || (((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B + (-1 + -(d / 8) + (r + -(d / 2))) == A) && (((p / 2 + 1) / 2 % 2 == 0 || !((p / 2 + 1) / 2 < 0)) || ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B + (-1 + -(d / 8) + (r + -(d / 2))) == A))) && ((!(r + -(d / 2) >= d / 8) || (!(d / 4 % 2 == 0) && d / 4 < 0)) || ((((p / 2 + 1) / 2 % 2 == 0 || !((p / 2 + 1) / 2 < 0)) || r + -(d / 2) + -(d / 8) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A) && (r + -(d / 2) + -(d / 8) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B == A || (!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0)))))) || r + -(d / 2) >= d / 4))))) && ((!(d < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || ((((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || ((((!((d / 2 + 1) / 2 < 0) || (((r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A || (p / 2 + 1) / 2 % 2 == 0) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 4 + 1)) || (d / 2 + 1) / 2 % 2 == 0) && ((((((p / 2 + 1) / 2 % 2 == 0 || ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 4)))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) && (((((((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || !(r + (-1 + -(d / 2)) >= ((d / 2 + 1) / 2 + 1) / 2)) || ((((p / 2 + 1) / 2 % 2 == 0 || A == r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B == A))) && (((((((p / 2 + 1) / 2 % 2 == 0 || r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B)) || !((d / 2 + 1) / 2 + 1 < 0)) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || !(r + (-1 + -(d / 2)) >= ((d / 2 + 1) / 2 + 1) / 2 + 1))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1))) && (((p / 2 + 1) % 2 == 0 || (((((d / 2 + 1) % 2 == 0 || ((((!((d / 2 + 1) / 2 + 1 < 0) || (((((p / 2 + 1) / 2 + 1) % 2 == 0 || !((p / 2 + 1) / 2 + 1 < 0)) || r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) == A) && (A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) || (!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0)))) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || !(r + (-1 + -(d / 2)) >= ((d / 2 + 1) / 2 + 1) / 2 + 1)) && (((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || (((((p / 2 + 1) / 2 + 1) % 2 == 0 || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) == A) || !((p / 2 + 1) / 2 + 1 < 0)) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) == A))) || !(r + (-1 + -(d / 2)) >= ((d / 2 + 1) / 2 + 1) / 2)))) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) && ((((((!((d / 2 + 1) / 2 < 0) || (((A == B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))) || ((p / 2 + 1) / 2 + 1) % 2 == 0) || !((p / 2 + 1) / 2 + 1 < 0)) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2)))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 4 + 1)) || (d / 2 + 1) / 2 % 2 == 0) && (((((B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A || ((p / 2 + 1) / 2 + 1) % 2 == 0) || !((p / 2 + 1) / 2 + 1 < 0)) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || A == B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 4))) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2))) || !(p / 2 + 1 < 0)))) || d % 2 == 0)) || p % 2 == 0) || !(p < 0))) && (((((!(d % 2 == 0) && d < 0) || r + -d >= d / 2) || ((((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -d >= d / 4)) || (((p / 2 < 0 && !(p / 2 % 2 == 0)) || -(d / 4) + (r + -d) + (p / 4 + (p + q)) * B == A) && (((p + q + (p / 4 + 1)) * B + (-(d / 4) + (r + -d)) == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && ((((((!(p / 2 < 0) || p / 2 % 2 == 0) || (p + q + (p / 4 + 1)) * B + (r + -d + (-1 + -(d / 4))) == A) && (A == r + -d + (-1 + -(d / 4)) + (p / 4 + (p + q)) * B || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || !(r + -d >= d / 4 + 1)) || d / 2 % 2 == 0) || !(d / 2 < 0)))) && (((!(d < 0) || r + -d >= d / 2 + 1) || (((((((-1 + -((d / 2 + 1) / 2) + (r + -d) + (p + q + (p / 4 + 1)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0) && (-1 + -((d / 2 + 1) / 2) + (r + -d) + (p / 4 + (p + q)) * B == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || !(r + -d >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((!(r + -d >= (d / 2 + 1) / 2) || (((p / 4 + (p + q)) * B + (r + -d + -((d / 2 + 1) / 2)) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((A == (p + q + (p / 4 + 1)) * B + (r + -d + -((d / 2 + 1) / 2)) || !(p / 2 < 0)) || p / 2 % 2 == 0))) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))))) || d % 2 == 0)) || (p < 0 && !(p % 2 == 0)))) && (((((A == B * 1 * (q + 2 * p) + (-(2 * d) + r) || -(2 * d) + r >= d) || p == 1) || !(r >= 2 * d)) || ((!(p * 4 / 8 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p * 4 / 8 + 1 == 1)))) || ((!(B * 1 == d * 4 / 8) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || !(d * 4 / 8 + 1 == B * 1)) || d % 2 == 0)))) && B * p == d) && A == r) && ((!(-(2 * d * 2) + r >= d) || -(2 * d * 2) + r >= 2 * d) || -(2 * d * 2) + r + -d + (p + (q + 2 * (2 * p))) * B == A)) && (((((((((((((((((((r >= d || (((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p % 2 == 0) || (((!(d % 2 == 0) && d < 0) || ((((A == -1 + -(d / 4) + (r + -(d / 2)) + (q + (p / 2 + 1) + 1) * (d / 4 + 1) || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || (q + (p / 2 + 1) + 1) * (d / 4) + (-(d / 4) + (r + -(d / 2))) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || A == (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))))) || d % 2 == 0))) || !(p < 0)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (((!(d % 2 == 0) && d < 0) || ((((-1 + -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4 + 1) == A || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + p / 2 + 1) * ((d / 2 + 1) / 2)) && (((A == (q + p / 2 + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || d % 2 == 0))) || (p < 0 && !(p % 2 == 0))))) && ((((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r)))) || (((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && d * q + r == A) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r)))))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((d / 2 == B || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || B == d / 2 + 1) || d % 2 == 0)))) && A == B * q + r) && (p == 1 || (((((p + q + p / 2) * B + (r + -d + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || A == r + -d + -(d / 2) + (p + q + (p / 2 + 1)) * B)) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p % 2 == 0 || A == r + -d + (-1 + -(d / 2)) + (p + q + (p / 2 + 1)) * B) || !(p < 0)) && (A == r + -d + (-1 + -(d / 2)) + (p + q + p / 2) * B || (p < 0 && !(p % 2 == 0))))) || d % 2 == 0)))) && r >= d / 2) && (!(p == 1) || d * q + r == A)) && (((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || ((((p / 2 + 1) % 2 == 0 || -1 + -(d / 4) + (r + -(d / 2)) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B == A) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-1 + -(d / 4) + (r + -(d / 2)))))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -(d / 2))) == A) && ((A == ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (-(d / 4) + (r + -(d / 2))) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)))))) && (((((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 4 + (q + p / 2)) * B + (-(d / 4) + (r + -(d / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((-(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((p / 2 < 0 && !(p / 2 % 2 == 0)) || (p / 4 + (q + p / 2)) * B + (-1 + -(d / 4) + (r + -(d / 2))) == A) && ((!(p / 2 < 0) || p / 2 % 2 == 0) || A == -1 + -(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B)) || d / 2 % 2 == 0) || !(d / 2 < 0))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || (!(d % 2 == 0) && d < 0))) && 2 <= d / 2) && (p == 1 || ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((((!(d < 0) || !(r >= d / 2 + 1)) || d % 2 == 0) || A == r + (-1 + -(d / 2)) + (q + 1) * (d / 2 + 1)) && ((!(r >= d / 2) || (!(d % 2 == 0) && d < 0)) || d / 2 * (q + 1) + (r + -(d / 2)) == A)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(r + -d >= d / 2) || (!(d % 2 == 0) && d < 0)) || r + -d + -(d / 2) + d / 2 * (p + q + 1) == A) && (((!(d < 0) || !(r + -d >= d / 2 + 1)) || A == (p + q + 1) * (d / 2 + 1) + (r + -d + (-1 + -(d / 2)))) || d % 2 == 0)))) && A == r + -d + B * (p + q)) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && (!(p == 1) || B == d)) && ((!(d < 0) || d % 2 == 0) || ((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || ((((((((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B == A))))) && (((((((!(p / 2 < 0) || p / 2 % 2 == 0) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + 1 + (q + p / 2)) * B == A) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + (q + p / 2)) * B)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((d / 2 + 1) % 2 == 0 || !(d / 2 + 1 < 0)) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)) + (p / 4 + 1 + (q + p / 2)) * B || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 + (q + p / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)))) && d % 2 == 0) || (((((((((((((((((((((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r)))) || (((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && d * q + r == A) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r))))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((d / 2 == B || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || B == d / 2 + 1) || d % 2 == 0)))) && A == B * q + r) && (p == 1 || (((((p + q + p / 2) * B + (r + -d + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || A == r + -d + -(d / 2) + (p + q + (p / 2 + 1)) * B)) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p % 2 == 0 || A == r + -d + (-1 + -(d / 2)) + (p + q + (p / 2 + 1)) * B) || !(p < 0)) && (A == r + -d + (-1 + -(d / 2)) + (p + q + p / 2) * B || (p < 0 && !(p % 2 == 0))))) || d % 2 == 0)))) && r >= d / 2) && (!(p == 1) || d * q + r == A)) && (((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || ((((p / 2 + 1) % 2 == 0 || -1 + -(d / 4) + (r + -(d / 2)) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B == A) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-1 + -(d / 4) + (r + -(d / 2)))))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -(d / 2))) == A) && ((A == ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (-(d / 4) + (r + -(d / 2))) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)))))) && (((((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 4 + (q + p / 2)) * B + (-(d / 4) + (r + -(d / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((-(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((p / 2 < 0 && !(p / 2 % 2 == 0)) || (p / 4 + (q + p / 2)) * B + (-1 + -(d / 4) + (r + -(d / 2))) == A) && ((!(p / 2 < 0) || p / 2 % 2 == 0) || A == -1 + -(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B)) || d / 2 % 2 == 0) || !(d / 2 < 0))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || (!(d % 2 == 0) && d < 0))) && 2 <= d / 2) && (p == 1 || ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)))) && ((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p % 2 == 0) || (((!(d % 2 == 0) && d < 0) || ((((A == -1 + -(d / 4) + (r + -(d / 2)) + (q + (p / 2 + 1) + 1) * (d / 4 + 1) || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || (q + (p / 2 + 1) + 1) * (d / 4) + (-(d / 4) + (r + -(d / 2))) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || A == (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))))) || d % 2 == 0))) || !(p < 0))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((((!(d < 0) || !(r >= d / 2 + 1)) || d % 2 == 0) || A == r + (-1 + -(d / 2)) + (q + 1) * (d / 2 + 1)) && ((!(r >= d / 2) || (!(d % 2 == 0) && d < 0)) || d / 2 * (q + 1) + (r + -(d / 2)) == A)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(r + -d >= d / 2) || (!(d % 2 == 0) && d < 0)) || r + -d + -(d / 2) + d / 2 * (p + q + 1) == A) && (((!(d < 0) || !(r + -d >= d / 2 + 1)) || A == (p + q + 1) * (d / 2 + 1) + (r + -d + (-1 + -(d / 2)))) || d % 2 == 0)))) && A == r + -d + B * (p + q)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (((!(d % 2 == 0) && d < 0) || ((((-1 + -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4 + 1) == A || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + p / 2 + 1) * ((d / 2 + 1) / 2)) && (((A == (q + p / 2 + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || d % 2 == 0))) || (p < 0 && !(p % 2 == 0)))) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && (!(p == 1) || B == d)) && ((!(d < 0) || d % 2 == 0) || ((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || ((((((((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B == A))))) && (((((((!(p / 2 < 0) || p / 2 % 2 == 0) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + 1 + (q + p / 2)) * B == A) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + (q + p / 2)) * B)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((d / 2 + 1) % 2 == 0 || !(d / 2 + 1 < 0)) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)) + (p / 4 + 1 + (q + p / 2)) * B || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 + (q + p / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)))) && d % 2 == 0)) || (((((((((((((((((((((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r)))) || (((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && d * q + r == A) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r))))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((d / 2 == B || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || B == d / 2 + 1) || d % 2 == 0)))) && A == B * q + r) && (p == 1 || (((((p + q + p / 2) * B + (r + -d + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || A == r + -d + -(d / 2) + (p + q + (p / 2 + 1)) * B)) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p % 2 == 0 || A == r + -d + (-1 + -(d / 2)) + (p + q + (p / 2 + 1)) * B) || !(p < 0)) && (A == r + -d + (-1 + -(d / 2)) + (p + q + p / 2) * B || (p < 0 && !(p % 2 == 0))))) || d % 2 == 0)))) && r >= d / 2) && (((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || ((((p / 2 + 1) % 2 == 0 || -1 + -(d / 4) + (r + -(d / 2)) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B == A) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-1 + -(d / 4) + (r + -(d / 2)))))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -(d / 2))) == A) && ((A == ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (-(d / 4) + (r + -(d / 2))) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)))))) && (((((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 4 + (q + p / 2)) * B + (-(d / 4) + (r + -(d / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((-(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((p / 2 < 0 && !(p / 2 % 2 == 0)) || (p / 4 + (q + p / 2)) * B + (-1 + -(d / 4) + (r + -(d / 2))) == A) && ((!(p / 2 < 0) || p / 2 % 2 == 0) || A == -1 + -(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B)) || d / 2 % 2 == 0) || !(d / 2 < 0))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || (!(d % 2 == 0) && d < 0))) && 2 <= d / 2) && (p == 1 || ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)))) && ((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p % 2 == 0) || (((!(d % 2 == 0) && d < 0) || ((((A == -1 + -(d / 4) + (r + -(d / 2)) + (q + (p / 2 + 1) + 1) * (d / 4 + 1) || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || (q + (p / 2 + 1) + 1) * (d / 4) + (-(d / 4) + (r + -(d / 2))) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || A == (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))))) || d % 2 == 0))) || !(p < 0))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((((!(d < 0) || !(r >= d / 2 + 1)) || d % 2 == 0) || A == r + (-1 + -(d / 2)) + (q + 1) * (d / 2 + 1)) && ((!(r >= d / 2) || (!(d % 2 == 0) && d < 0)) || d / 2 * (q + 1) + (r + -(d / 2)) == A)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(r + -d >= d / 2) || (!(d % 2 == 0) && d < 0)) || r + -d + -(d / 2) + d / 2 * (p + q + 1) == A) && (((!(d < 0) || !(r + -d >= d / 2 + 1)) || A == (p + q + 1) * (d / 2 + 1) + (r + -d + (-1 + -(d / 2)))) || d % 2 == 0)))) && A == r + -d + B * (p + q)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (((!(d % 2 == 0) && d < 0) || ((((-1 + -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4 + 1) == A || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + p / 2 + 1) * ((d / 2 + 1) / 2)) && (((A == (q + p / 2 + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || d % 2 == 0))) || (p < 0 && !(p % 2 == 0)))) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && d * q + r == A) && (!(p == 1) || B == d)) && ((!(d < 0) || d % 2 == 0) || ((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || ((((((((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B == A))))) && (((((((!(p / 2 < 0) || p / 2 % 2 == 0) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + 1 + (q + p / 2)) * B == A) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + (q + p / 2)) * B)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((d / 2 + 1) % 2 == 0 || !(d / 2 + 1 < 0)) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)) + (p / 4 + 1 + (q + p / 2)) * B || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 + (q + p / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)))) && d % 2 == 0))) && ((((((p / 4 + 1 == 1 || ((((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || !(1 + (p / 4 + 1) / 2 == 1)) && (!(1 == (p / 4 + 1) / 2) || (!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0)))) || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 == 1 || (((p / 4 % 2 == 0 || !(p / 8 + 1 == 1)) || !(p / 4 < 0)) && (!(p / 8 == 1) || (!(p / 4 % 2 == 0) && p / 4 < 0)))) || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || (((B * 1 * (q + p / 2) + (r + -(d / 2)) == A || (!(d % 2 == 0) && d < 0)) || ((((!(d / 2 % 2 == 0) && d / 2 < 0) || ((!(B * 1 == d / 8) || (!(d / 4 % 2 == 0) && d / 4 < 0)) && ((d / 4 % 2 == 0 || !(d / 4 < 0)) || !(B * 1 == d / 8 + 1)))) || r + -(d / 2) >= d / 4) && (((d / 2 % 2 == 0 || ((!(B * 1 == (d / 4 + 1) / 2) || (d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0))) && ((!(d / 4 + 1 < 0) || (d / 4 + 1) % 2 == 0) || !(B * 1 == (d / 4 + 1) / 2 + 1)))) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1))) && (((!(d < 0) || (((((!(B * 1 == (d / 2 + 1) / 4) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) && ((!((d / 2 + 1) / 2 < 0) || !(B * 1 == (d / 2 + 1) / 4 + 1)) || (d / 2 + 1) / 2 % 2 == 0)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) && ((((((!((d / 2 + 1) / 2 + 1 < 0) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2 + 1)) && ((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1))) || r + (-1 + -(d / 2)) + B * 1 * (q + p / 2) == A) || d % 2 == 0))) || (p < 0 && !(p % 2 == 0)))) && (((((!(d < 0) || ((((!(r >= (d / 2 + 1) / 2 + 1) || (((A == -1 + -((d / 2 + 1) / 2) + r + B * (q + (p / 4 + 1)) || !(p / 2 < 0)) || p / 2 % 2 == 0) && (A == B * (p / 4 + q) + (-1 + -((d / 2 + 1) / 2) + r) || (p / 2 < 0 && !(p / 2 % 2 == 0))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && (((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || !(r >= (d / 2 + 1) / 2)) || ((B * (p / 4 + q) + (r + -((d / 2 + 1) / 2)) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((A == r + -((d / 2 + 1) / 2) + B * (q + (p / 4 + 1)) || !(p / 2 < 0)) || p / 2 % 2 == 0))))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (!(d % 2 == 0) && d < 0)) || ((((d / 2 % 2 == 0 || !(r >= d / 4 + 1)) || !(d / 2 < 0)) || (((!(p / 2 < 0) || A == -1 + -(d / 4) + r + B * (q + (p / 4 + 1))) || p / 2 % 2 == 0) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == -1 + -(d / 4) + r + B * (p / 4 + q)))) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || (((-(d / 4) + r + B * (q + (p / 4 + 1)) == A || !(p / 2 < 0)) || p / 2 % 2 == 0) && (-(d / 4) + r + B * (p / 4 + q) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))))) || !(r >= d / 4))))) || (p < 0 && !(p % 2 == 0)))) && d * q + r == A) && B == 1) && (-(2 * d) + r >= d || ((((!(d < 0) || ((B * (2 * p / 4 + (q + 2 * p)) + (-1 + -(2 * d / 4) + (-(2 * d) + r)) == A || (p < 0 && !(p % 2 == 0))) && (((q + 2 * p + (2 * p / 4 + 1)) * B + (-1 + -(2 * d / 4) + (-(2 * d) + r)) == A || p % 2 == 0) || !(p < 0)))) || !(-(2 * d) + r >= 2 * d / 4 + 1)) || d % 2 == 0) && (((((p % 2 == 0 || A == (q + 2 * p + (2 * p / 4 + 1)) * B + (-(2 * d / 4) + (-(2 * d) + r))) || !(p < 0)) && (A == -(2 * d / 4) + (-(2 * d) + r) + B * (2 * p / 4 + (q + 2 * p)) || (p < 0 && !(p % 2 == 0)))) || (!(d % 2 == 0) && d < 0)) || !(-(2 * d) + r >= 2 * d / 4))))) && ((((((((p / 2 + 1) % 2 == 0 || (p / 2 + 1) / 2 + 1 == 1) || !(p / 2 + 1 < 0)) || (((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || !(((p / 2 + 1) / 2 + 1) / 2 == 1)) && ((!(((p / 2 + 1) / 2 + 1) / 2 + 1 == 1) || ((p / 2 + 1) / 2 + 1) % 2 == 0) || !((p / 2 + 1) / 2 + 1 < 0)))) && (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (p / 2 + 1) / 2 == 1) || (((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || !((p / 2 + 1) / 4 == 1)) && (((p / 2 + 1) / 2 % 2 == 0 || !((p / 2 + 1) / 2 < 0)) || !((p / 2 + 1) / 4 + 1 == 1))))) || p % 2 == 0) || ((((!(d < 0) || (((((!(B * 1 == (d / 2 + 1) / 4) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) && ((!((d / 2 + 1) / 2 < 0) || !(B * 1 == (d / 2 + 1) / 4 + 1)) || (d / 2 + 1) / 2 % 2 == 0)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) && ((((((!((d / 2 + 1) / 2 + 1 < 0) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2 + 1)) && ((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1))) || A == r + (-1 + -(d / 2)) + (q + (p / 2 + 1)) * (B * 1)) || d % 2 == 0) && (((!(d % 2 == 0) && d < 0) || r + -(d / 2) + (q + (p / 2 + 1)) * (B * 1) == A) || ((((!(d / 2 % 2 == 0) && d / 2 < 0) || ((!(B * 1 == d / 8) || (!(d / 4 % 2 == 0) && d / 4 < 0)) && ((d / 4 % 2 == 0 || !(d / 4 < 0)) || !(B * 1 == d / 8 + 1)))) || r + -(d / 2) >= d / 4) && (((d / 2 % 2 == 0 || ((!(B * 1 == (d / 4 + 1) / 2) || (d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0))) && ((!(d / 4 + 1 < 0) || (d / 4 + 1) % 2 == 0) || !(B * 1 == (d / 4 + 1) / 2 + 1)))) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1))))) || !(p < 0))) && ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || !(r >= d / 2)) || (!(d % 2 == 0) && d < 0))) && ((((((!(d < 0) || ((((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || !(r >= (d / 2 + 1) / 2)) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + -((d / 2 + 1) / 2) + B * (q + (p / 2 + 1) / 2) == A) && (((p / 2 + 1) % 2 == 0 || A == B * ((p / 2 + 1) / 2 + 1 + q) + (r + -((d / 2 + 1) / 2))) || !(p / 2 + 1 < 0)))) && ((((((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == -1 + -((d / 2 + 1) / 2) + r + B * (q + (p / 2 + 1) / 2)) && (((p / 2 + 1) % 2 == 0 || B * ((p / 2 + 1) / 2 + 1 + q) + (-1 + -((d / 2 + 1) / 2) + r) == A) || !(p / 2 + 1 < 0))) || !(r >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (!(d % 2 == 0) && d < 0)) || (((((((A == -1 + -(d / 4) + r + B * ((p / 2 + 1) / 2 + 1 + q) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || -1 + -(d / 4) + r + B * (q + (p / 2 + 1) / 2) == A)) || d / 2 % 2 == 0) || !(r >= d / 4 + 1)) || !(d / 2 < 0)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r >= d / 4)) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || -(d / 4) + r + B * (q + (p / 2 + 1) / 2) == A) && (((p / 2 + 1) % 2 == 0 || A == -(d / 4) + r + B * ((p / 2 + 1) / 2 + 1 + q)) || !(p / 2 + 1 < 0))))))) || p % 2 == 0) || !(p < 0))))) && B * p == d) && A == r) && B == 1)) || ((((((((((d == 1 && A == B * q + r) && p == 1) && p >= 1) && B == d) && q == 0) && 1 <= d) && B * p == d) && A == r) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r))))) || (((((((((A == B * q + r && 8 <= p) && 2 * (2 * (2 * 1)) == p) && q == 0) && r >= 2 * (2 * B)) && B * p == d) && A == r) && (((((((((((((((((((r >= d || (((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p % 2 == 0) || (((!(d % 2 == 0) && d < 0) || ((((A == -1 + -(d / 4) + (r + -(d / 2)) + (q + (p / 2 + 1) + 1) * (d / 4 + 1) || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || (q + (p / 2 + 1) + 1) * (d / 4) + (-(d / 4) + (r + -(d / 2))) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || A == (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))))) || d % 2 == 0))) || !(p < 0)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (((!(d % 2 == 0) && d < 0) || ((((-1 + -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4 + 1) == A || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + p / 2 + 1) * ((d / 2 + 1) / 2)) && (((A == (q + p / 2 + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || d % 2 == 0))) || (p < 0 && !(p % 2 == 0))))) && ((((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r)))) || (((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && d * q + r == A) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r)))))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((d / 2 == B || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || B == d / 2 + 1) || d % 2 == 0)))) && A == B * q + r) && (p == 1 || (((((p + q + p / 2) * B + (r + -d + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || A == r + -d + -(d / 2) + (p + q + (p / 2 + 1)) * B)) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p % 2 == 0 || A == r + -d + (-1 + -(d / 2)) + (p + q + (p / 2 + 1)) * B) || !(p < 0)) && (A == r + -d + (-1 + -(d / 2)) + (p + q + p / 2) * B || (p < 0 && !(p % 2 == 0))))) || d % 2 == 0)))) && r >= d / 2) && (!(p == 1) || d * q + r == A)) && (((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || ((((p / 2 + 1) % 2 == 0 || -1 + -(d / 4) + (r + -(d / 2)) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B == A) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-1 + -(d / 4) + (r + -(d / 2)))))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -(d / 2))) == A) && ((A == ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (-(d / 4) + (r + -(d / 2))) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)))))) && (((((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 4 + (q + p / 2)) * B + (-(d / 4) + (r + -(d / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((-(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((p / 2 < 0 && !(p / 2 % 2 == 0)) || (p / 4 + (q + p / 2)) * B + (-1 + -(d / 4) + (r + -(d / 2))) == A) && ((!(p / 2 < 0) || p / 2 % 2 == 0) || A == -1 + -(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B)) || d / 2 % 2 == 0) || !(d / 2 < 0))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || (!(d % 2 == 0) && d < 0))) && 2 <= d / 2) && (p == 1 || ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((((!(d < 0) || !(r >= d / 2 + 1)) || d % 2 == 0) || A == r + (-1 + -(d / 2)) + (q + 1) * (d / 2 + 1)) && ((!(r >= d / 2) || (!(d % 2 == 0) && d < 0)) || d / 2 * (q + 1) + (r + -(d / 2)) == A)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(r + -d >= d / 2) || (!(d % 2 == 0) && d < 0)) || r + -d + -(d / 2) + d / 2 * (p + q + 1) == A) && (((!(d < 0) || !(r + -d >= d / 2 + 1)) || A == (p + q + 1) * (d / 2 + 1) + (r + -d + (-1 + -(d / 2)))) || d % 2 == 0)))) && A == r + -d + B * (p + q)) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && (!(p == 1) || B == d)) && ((!(d < 0) || d % 2 == 0) || ((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || ((((((((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B == A))))) && (((((((!(p / 2 < 0) || p / 2 % 2 == 0) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + 1 + (q + p / 2)) * B == A) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + (q + p / 2)) * B)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((d / 2 + 1) % 2 == 0 || !(d / 2 + 1 < 0)) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)) + (p / 4 + 1 + (q + p / 2)) * B || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 + (q + p / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)))) && d % 2 == 0) || (((((((((((((((((((((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r)))) || (((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && d * q + r == A) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r))))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((d / 2 == B || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || B == d / 2 + 1) || d % 2 == 0)))) && A == B * q + r) && (p == 1 || (((((p + q + p / 2) * B + (r + -d + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || A == r + -d + -(d / 2) + (p + q + (p / 2 + 1)) * B)) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p % 2 == 0 || A == r + -d + (-1 + -(d / 2)) + (p + q + (p / 2 + 1)) * B) || !(p < 0)) && (A == r + -d + (-1 + -(d / 2)) + (p + q + p / 2) * B || (p < 0 && !(p % 2 == 0))))) || d % 2 == 0)))) && r >= d / 2) && (!(p == 1) || d * q + r == A)) && (((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || ((((p / 2 + 1) % 2 == 0 || -1 + -(d / 4) + (r + -(d / 2)) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B == A) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-1 + -(d / 4) + (r + -(d / 2)))))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -(d / 2))) == A) && ((A == ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (-(d / 4) + (r + -(d / 2))) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)))))) && (((((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 4 + (q + p / 2)) * B + (-(d / 4) + (r + -(d / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((-(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((p / 2 < 0 && !(p / 2 % 2 == 0)) || (p / 4 + (q + p / 2)) * B + (-1 + -(d / 4) + (r + -(d / 2))) == A) && ((!(p / 2 < 0) || p / 2 % 2 == 0) || A == -1 + -(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B)) || d / 2 % 2 == 0) || !(d / 2 < 0))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || (!(d % 2 == 0) && d < 0))) && 2 <= d / 2) && (p == 1 || ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)))) && ((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p % 2 == 0) || (((!(d % 2 == 0) && d < 0) || ((((A == -1 + -(d / 4) + (r + -(d / 2)) + (q + (p / 2 + 1) + 1) * (d / 4 + 1) || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || (q + (p / 2 + 1) + 1) * (d / 4) + (-(d / 4) + (r + -(d / 2))) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || A == (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))))) || d % 2 == 0))) || !(p < 0))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((((!(d < 0) || !(r >= d / 2 + 1)) || d % 2 == 0) || A == r + (-1 + -(d / 2)) + (q + 1) * (d / 2 + 1)) && ((!(r >= d / 2) || (!(d % 2 == 0) && d < 0)) || d / 2 * (q + 1) + (r + -(d / 2)) == A)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(r + -d >= d / 2) || (!(d % 2 == 0) && d < 0)) || r + -d + -(d / 2) + d / 2 * (p + q + 1) == A) && (((!(d < 0) || !(r + -d >= d / 2 + 1)) || A == (p + q + 1) * (d / 2 + 1) + (r + -d + (-1 + -(d / 2)))) || d % 2 == 0)))) && A == r + -d + B * (p + q)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (((!(d % 2 == 0) && d < 0) || ((((-1 + -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4 + 1) == A || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + p / 2 + 1) * ((d / 2 + 1) / 2)) && (((A == (q + p / 2 + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || d % 2 == 0))) || (p < 0 && !(p % 2 == 0)))) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && (!(p == 1) || B == d)) && ((!(d < 0) || d % 2 == 0) || ((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || ((((((((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B == A))))) && (((((((!(p / 2 < 0) || p / 2 % 2 == 0) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + 1 + (q + p / 2)) * B == A) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + (q + p / 2)) * B)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((d / 2 + 1) % 2 == 0 || !(d / 2 + 1 < 0)) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)) + (p / 4 + 1 + (q + p / 2)) * B || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 + (q + p / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)))) && d % 2 == 0)) || (((((((((((((((((((((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r)))) || (((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && d * q + r == A) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r))))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((d / 2 == B || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || B == d / 2 + 1) || d % 2 == 0)))) && A == B * q + r) && (p == 1 || (((((p + q + p / 2) * B + (r + -d + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || A == r + -d + -(d / 2) + (p + q + (p / 2 + 1)) * B)) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p % 2 == 0 || A == r + -d + (-1 + -(d / 2)) + (p + q + (p / 2 + 1)) * B) || !(p < 0)) && (A == r + -d + (-1 + -(d / 2)) + (p + q + p / 2) * B || (p < 0 && !(p % 2 == 0))))) || d % 2 == 0)))) && r >= d / 2) && (((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || ((((p / 2 + 1) % 2 == 0 || -1 + -(d / 4) + (r + -(d / 2)) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B == A) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-1 + -(d / 4) + (r + -(d / 2)))))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -(d / 2))) == A) && ((A == ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (-(d / 4) + (r + -(d / 2))) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)))))) && (((((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 4 + (q + p / 2)) * B + (-(d / 4) + (r + -(d / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((-(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((p / 2 < 0 && !(p / 2 % 2 == 0)) || (p / 4 + (q + p / 2)) * B + (-1 + -(d / 4) + (r + -(d / 2))) == A) && ((!(p / 2 < 0) || p / 2 % 2 == 0) || A == -1 + -(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B)) || d / 2 % 2 == 0) || !(d / 2 < 0))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || (!(d % 2 == 0) && d < 0))) && 2 <= d / 2) && (p == 1 || ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)))) && ((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p % 2 == 0) || (((!(d % 2 == 0) && d < 0) || ((((A == -1 + -(d / 4) + (r + -(d / 2)) + (q + (p / 2 + 1) + 1) * (d / 4 + 1) || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || (q + (p / 2 + 1) + 1) * (d / 4) + (-(d / 4) + (r + -(d / 2))) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || A == (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))))) || d % 2 == 0))) || !(p < 0))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((((!(d < 0) || !(r >= d / 2 + 1)) || d % 2 == 0) || A == r + (-1 + -(d / 2)) + (q + 1) * (d / 2 + 1)) && ((!(r >= d / 2) || (!(d % 2 == 0) && d < 0)) || d / 2 * (q + 1) + (r + -(d / 2)) == A)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(r + -d >= d / 2) || (!(d % 2 == 0) && d < 0)) || r + -d + -(d / 2) + d / 2 * (p + q + 1) == A) && (((!(d < 0) || !(r + -d >= d / 2 + 1)) || A == (p + q + 1) * (d / 2 + 1) + (r + -d + (-1 + -(d / 2)))) || d % 2 == 0)))) && A == r + -d + B * (p + q)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (((!(d % 2 == 0) && d < 0) || ((((-1 + -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4 + 1) == A || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + p / 2 + 1) * ((d / 2 + 1) / 2)) && (((A == (q + p / 2 + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || d % 2 == 0))) || (p < 0 && !(p % 2 == 0)))) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && d * q + r == A) && (!(p == 1) || B == d)) && ((!(d < 0) || d % 2 == 0) || ((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || ((((((((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B == A))))) && (((((((!(p / 2 < 0) || p / 2 % 2 == 0) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + 1 + (q + p / 2)) * B == A) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + (q + p / 2)) * B)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((d / 2 + 1) % 2 == 0 || !(d / 2 + 1 < 0)) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)) + (p / 4 + 1 + (q + p / 2)) * B || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 + (q + p / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)))) && d % 2 == 0))) && 2 * (2 * B) * 2 == d) && B == 1) RESULT: Ultimate proved your program to be correct! [2023-02-17 02:08:32,913 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