./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 574ddb4e Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound50.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 0bcbcb4a55258889434b8bf703da9ec6fb29d07a2fbacad968a5ab15e005b314 --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-18 16:37:17,708 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 16:37:17,710 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 16:37:17,736 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 16:37:17,738 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 16:37:17,740 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 16:37:17,742 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 16:37:17,744 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 16:37:17,745 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 16:37:17,749 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 16:37:17,750 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 16:37:17,751 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 16:37:17,751 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 16:37:17,754 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 16:37:17,755 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 16:37:17,757 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 16:37:17,757 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 16:37:17,759 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 16:37:17,759 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 16:37:17,763 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 16:37:17,764 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 16:37:17,764 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 16:37:17,765 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 16:37:17,766 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 16:37:17,772 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 16:37:17,772 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 16:37:17,772 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 16:37:17,774 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 16:37:17,774 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 16:37:17,774 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 16:37:17,775 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 16:37:17,775 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 16:37:17,776 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 16:37:17,777 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 16:37:17,778 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 16:37:17,779 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 16:37:17,779 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 16:37:17,779 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 16:37:17,779 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 16:37:17,780 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 16:37:17,781 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 16:37:17,782 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-18 16:37:17,807 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 16:37:17,807 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 16:37:17,807 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 16:37:17,808 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 16:37:17,808 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 16:37:17,808 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 16:37:17,809 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 16:37:17,809 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 16:37:17,809 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 16:37:17,809 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 16:37:17,810 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 16:37:17,810 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 16:37:17,810 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 16:37:17,810 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 16:37:17,811 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 16:37:17,811 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 16:37:17,811 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 16:37:17,811 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 16:37:17,811 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 16:37:17,811 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 16:37:17,811 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 16:37:17,812 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 16:37:17,812 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 16:37:17,812 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 16:37:17,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 16:37:17,812 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 16:37:17,812 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 16:37:17,812 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 16:37:17,813 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 16:37:17,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 16:37:17,813 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 16:37:17,813 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 16:37:17,813 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 16:37:17,813 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 16:37:17,814 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 16:37:17,814 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 -> 0bcbcb4a55258889434b8bf703da9ec6fb29d07a2fbacad968a5ab15e005b314 [2023-02-18 16:37:17,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 16:37:17,988 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 16:37:17,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 16:37:17,991 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 16:37:17,991 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 16:37:17,992 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound50.c [2023-02-18 16:37:19,017 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 16:37:19,174 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 16:37:19,175 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound50.c [2023-02-18 16:37:19,179 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1039f9fb2/b4fae2eb27df405398cf228f94b103d8/FLAGedb04ce57 [2023-02-18 16:37:19,188 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1039f9fb2/b4fae2eb27df405398cf228f94b103d8 [2023-02-18 16:37:19,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 16:37:19,192 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 16:37:19,193 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 16:37:19,193 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 16:37:19,198 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 16:37:19,199 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 04:37:19" (1/1) ... [2023-02-18 16:37:19,200 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@793e9fc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:37:19, skipping insertion in model container [2023-02-18 16:37:19,200 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 04:37:19" (1/1) ... [2023-02-18 16:37:19,204 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 16:37:19,214 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 16:37:19,298 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/cohencu-ll_valuebound50.c[588,601] [2023-02-18 16:37:19,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 16:37:19,316 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 16:37:19,323 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/cohencu-ll_valuebound50.c[588,601] [2023-02-18 16:37:19,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 16:37:19,348 INFO L208 MainTranslator]: Completed translation [2023-02-18 16:37:19,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:37:19 WrapperNode [2023-02-18 16:37:19,349 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 16:37:19,350 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 16:37:19,350 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 16:37:19,350 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 16:37:19,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:37:19" (1/1) ... [2023-02-18 16:37:19,358 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:37:19" (1/1) ... [2023-02-18 16:37:19,369 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2023-02-18 16:37:19,369 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 16:37:19,370 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 16:37:19,370 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 16:37:19,370 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 16:37:19,376 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:37:19" (1/1) ... [2023-02-18 16:37:19,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:37:19" (1/1) ... [2023-02-18 16:37:19,377 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:37:19" (1/1) ... [2023-02-18 16:37:19,377 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:37:19" (1/1) ... [2023-02-18 16:37:19,379 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:37:19" (1/1) ... [2023-02-18 16:37:19,381 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:37:19" (1/1) ... [2023-02-18 16:37:19,381 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:37:19" (1/1) ... [2023-02-18 16:37:19,382 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:37:19" (1/1) ... [2023-02-18 16:37:19,383 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 16:37:19,384 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 16:37:19,384 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 16:37:19,384 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 16:37:19,384 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:37:19" (1/1) ... [2023-02-18 16:37:19,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 16:37:19,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 16:37:19,404 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-18 16:37:19,421 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-18 16:37:19,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 16:37:19,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 16:37:19,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 16:37:19,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 16:37:19,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 16:37:19,436 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 16:37:19,478 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 16:37:19,480 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 16:37:19,605 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 16:37:19,610 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 16:37:19,610 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-18 16:37:19,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 04:37:19 BoogieIcfgContainer [2023-02-18 16:37:19,611 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 16:37:19,613 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 16:37:19,613 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 16:37:19,615 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 16:37:19,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 04:37:19" (1/3) ... [2023-02-18 16:37:19,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76c71689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 04:37:19, skipping insertion in model container [2023-02-18 16:37:19,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:37:19" (2/3) ... [2023-02-18 16:37:19,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76c71689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 04:37:19, skipping insertion in model container [2023-02-18 16:37:19,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 04:37:19" (3/3) ... [2023-02-18 16:37:19,617 INFO L112 eAbstractionObserver]: Analyzing ICFG cohencu-ll_valuebound50.c [2023-02-18 16:37:19,629 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 16:37:19,629 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 16:37:19,659 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 16:37:19,663 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;@25301c99, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 16:37:19,664 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 16:37:19,666 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-18 16:37:19,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 16:37:19,671 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:37:19,671 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 16:37:19,672 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:37:19,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:37:19,675 INFO L85 PathProgramCache]: Analyzing trace with hash -588951690, now seen corresponding path program 1 times [2023-02-18 16:37:19,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:37:19,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946285159] [2023-02-18 16:37:19,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:37:19,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:37:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 16:37:19,771 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-18 16:37:19,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:37:19,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946285159] [2023-02-18 16:37:19,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946285159] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 16:37:19,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 16:37:19,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 16:37:19,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454196340] [2023-02-18 16:37:19,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 16:37:19,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 16:37:19,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:37:19,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 16:37:19,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 16:37:19,796 INFO L87 Difference]: Start difference. First operand has 27 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) 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-18 16:37:19,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:37:19,812 INFO L93 Difference]: Finished difference Result 51 states and 89 transitions. [2023-02-18 16:37:19,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 16:37:19,815 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-18 16:37:19,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:37:19,820 INFO L225 Difference]: With dead ends: 51 [2023-02-18 16:37:19,820 INFO L226 Difference]: Without dead ends: 23 [2023-02-18 16:37:19,822 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-18 16:37:19,831 INFO L413 NwaCegarLoop]: 37 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, 37 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-18 16:37:19,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 16:37:19,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-02-18 16:37:19,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-02-18 16:37:19,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-18 16:37:19,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2023-02-18 16:37:19,856 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 33 transitions. Word has length 9 [2023-02-18 16:37:19,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:37:19,857 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 33 transitions. [2023-02-18 16:37:19,857 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-18 16:37:19,857 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 33 transitions. [2023-02-18 16:37:19,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 16:37:19,858 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:37:19,858 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 16:37:19,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-18 16:37:19,859 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:37:19,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:37:19,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1187604804, now seen corresponding path program 1 times [2023-02-18 16:37:19,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:37:19,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32018385] [2023-02-18 16:37:19,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:37:19,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:37:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 16:37:19,976 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-18 16:37:19,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:37:19,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32018385] [2023-02-18 16:37:19,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32018385] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 16:37:19,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 16:37:19,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 16:37:19,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096782684] [2023-02-18 16:37:19,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 16:37:19,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 16:37:19,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:37:19,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 16:37:19,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 16:37:19,980 INFO L87 Difference]: Start difference. First operand 23 states and 33 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-18 16:37:20,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:37:20,050 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2023-02-18 16:37:20,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 16:37:20,051 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-18 16:37:20,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:37:20,052 INFO L225 Difference]: With dead ends: 29 [2023-02-18 16:37:20,052 INFO L226 Difference]: Without dead ends: 27 [2023-02-18 16:37:20,052 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-18 16:37:20,053 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 16:37:20,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 63 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 16:37:20,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-18 16:37:20,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-02-18 16:37:20,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-18 16:37:20,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2023-02-18 16:37:20,065 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 9 [2023-02-18 16:37:20,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:37:20,066 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2023-02-18 16:37:20,066 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-18 16:37:20,066 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2023-02-18 16:37:20,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-18 16:37:20,066 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:37:20,067 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 16:37:20,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-18 16:37:20,067 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:37:20,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:37:20,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1137950087, now seen corresponding path program 1 times [2023-02-18 16:37:20,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:37:20,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458734134] [2023-02-18 16:37:20,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:37:20,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:37:20,078 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 16:37:20,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1122111536] [2023-02-18 16:37:20,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:37:20,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:37:20,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 16:37:20,081 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-18 16:37:20,082 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-18 16:37:20,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 16:37:20,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 16:37:20,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 16:37:20,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 16:37:20,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 16:37:20,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 16:37:20,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:37:20,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458734134] [2023-02-18 16:37:20,276 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 16:37:20,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122111536] [2023-02-18 16:37:20,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122111536] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 16:37:20,276 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 16:37:20,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-18 16:37:20,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982981856] [2023-02-18 16:37:20,277 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 16:37:20,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 16:37:20,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:37:20,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 16:37:20,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-18 16:37:20,279 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 16:37:20,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:37:20,579 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2023-02-18 16:37:20,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 16:37:20,580 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2023-02-18 16:37:20,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:37:20,582 INFO L225 Difference]: With dead ends: 52 [2023-02-18 16:37:20,582 INFO L226 Difference]: Without dead ends: 50 [2023-02-18 16:37:20,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-18 16:37:20,585 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 16 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 16:37:20,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 60 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 16:37:20,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-02-18 16:37:20,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2023-02-18 16:37:20,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-18 16:37:20,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 65 transitions. [2023-02-18 16:37:20,608 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 65 transitions. Word has length 14 [2023-02-18 16:37:20,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:37:20,609 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 65 transitions. [2023-02-18 16:37:20,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 16:37:20,609 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 65 transitions. [2023-02-18 16:37:20,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-18 16:37:20,610 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:37:20,610 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 16:37:20,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-18 16:37:20,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:37:20,817 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:37:20,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:37:20,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1500531996, now seen corresponding path program 1 times [2023-02-18 16:37:20,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:37:20,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656700601] [2023-02-18 16:37:20,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:37:20,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:37:20,826 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 16:37:20,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1533060092] [2023-02-18 16:37:20,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:37:20,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:37:20,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 16:37:20,834 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-18 16:37:20,838 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-18 16:37:20,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 16:37:20,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 16:37:20,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 16:37:20,910 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 16:37:20,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 16:37:20,951 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 16:37:20,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:37:20,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656700601] [2023-02-18 16:37:20,951 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 16:37:20,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533060092] [2023-02-18 16:37:20,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533060092] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 16:37:20,952 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 16:37:20,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-18 16:37:20,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295562750] [2023-02-18 16:37:20,952 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 16:37:20,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 16:37:20,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:37:20,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 16:37:20,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-18 16:37:20,954 INFO L87 Difference]: Start difference. First operand 47 states and 65 transitions. Second operand has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 16:37:21,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:37:21,140 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2023-02-18 16:37:21,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 16:37:21,141 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 19 [2023-02-18 16:37:21,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:37:21,142 INFO L225 Difference]: With dead ends: 54 [2023-02-18 16:37:21,142 INFO L226 Difference]: Without dead ends: 52 [2023-02-18 16:37:21,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-18 16:37:21,143 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 21 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 16:37:21,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 47 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 16:37:21,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-02-18 16:37:21,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2023-02-18 16:37:21,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-18 16:37:21,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 68 transitions. [2023-02-18 16:37:21,159 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 68 transitions. Word has length 19 [2023-02-18 16:37:21,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:37:21,159 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 68 transitions. [2023-02-18 16:37:21,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 16:37:21,159 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2023-02-18 16:37:21,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-18 16:37:21,160 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:37:21,160 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 16:37:21,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-18 16:37:21,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-02-18 16:37:21,366 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:37:21,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:37:21,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1926539111, now seen corresponding path program 1 times [2023-02-18 16:37:21,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:37:21,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370974158] [2023-02-18 16:37:21,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:37:21,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:37:21,384 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 16:37:21,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1134754056] [2023-02-18 16:37:21,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:37:21,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:37:21,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 16:37:21,394 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-18 16:37:21,395 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-18 16:37:21,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 16:37:21,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 16:37:21,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 16:37:21,480 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-18 16:37:21,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 16:37:21,596 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-18 16:37:21,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:37:21,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370974158] [2023-02-18 16:37:21,596 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 16:37:21,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134754056] [2023-02-18 16:37:21,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134754056] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 16:37:21,597 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 16:37:21,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-18 16:37:21,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426375420] [2023-02-18 16:37:21,598 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 16:37:21,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 16:37:21,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:37:21,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 16:37:21,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-18 16:37:21,602 INFO L87 Difference]: Start difference. First operand 51 states and 68 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, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-18 16:37:22,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:37:22,286 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2023-02-18 16:37:22,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 16:37:22,287 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, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) Word has length 24 [2023-02-18 16:37:22,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:37:22,287 INFO L225 Difference]: With dead ends: 67 [2023-02-18 16:37:22,287 INFO L226 Difference]: Without dead ends: 58 [2023-02-18 16:37:22,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-18 16:37:22,288 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-18 16:37:22,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 60 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-18 16:37:22,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-02-18 16:37:22,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2023-02-18 16:37:22,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 31 states have (on average 1.064516129032258) internal successors, (33), 33 states have internal predecessors, (33), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2023-02-18 16:37:22,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2023-02-18 16:37:22,300 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 24 [2023-02-18 16:37:22,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:37:22,300 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2023-02-18 16:37:22,300 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, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-18 16:37:22,301 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2023-02-18 16:37:22,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-18 16:37:22,301 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:37:22,301 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 16:37:22,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-18 16:37:22,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:37:22,513 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:37:22,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:37:22,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1495173479, now seen corresponding path program 1 times [2023-02-18 16:37:22,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:37:22,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396374644] [2023-02-18 16:37:22,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:37:22,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:37:22,522 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 16:37:22,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1109065872] [2023-02-18 16:37:22,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:37:22,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:37:22,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 16:37:22,524 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-18 16:37:22,527 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-18 16:37:22,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 16:37:22,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-18 16:37:22,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 16:37:22,596 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-02-18 16:37:22,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 16:37:22,652 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-02-18 16:37:22,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:37:22,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396374644] [2023-02-18 16:37:22,653 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 16:37:22,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109065872] [2023-02-18 16:37:22,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109065872] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 16:37:22,654 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 16:37:22,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2023-02-18 16:37:22,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560714578] [2023-02-18 16:37:22,654 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 16:37:22,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 16:37:22,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:37:22,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 16:37:22,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-02-18 16:37:22,656 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 11 states have internal predecessors, (24), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2023-02-18 16:37:25,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:37:25,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:37:25,921 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2023-02-18 16:37:25,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 16:37:25,922 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 11 states have internal predecessors, (24), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) Word has length 46 [2023-02-18 16:37:25,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:37:25,923 INFO L225 Difference]: With dead ends: 82 [2023-02-18 16:37:25,923 INFO L226 Difference]: Without dead ends: 80 [2023-02-18 16:37:25,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2023-02-18 16:37:25,924 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 22 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 73 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-02-18 16:37:25,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 62 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 281 Invalid, 1 Unknown, 0 Unchecked, 3.2s Time] [2023-02-18 16:37:25,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-18 16:37:25,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2023-02-18 16:37:25,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 45 states have internal predecessors, (45), 26 states have call successors, (26), 10 states have call predecessors, (26), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2023-02-18 16:37:25,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2023-02-18 16:37:25,939 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 46 [2023-02-18 16:37:25,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:37:25,939 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2023-02-18 16:37:25,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 11 states have internal predecessors, (24), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2023-02-18 16:37:25,939 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2023-02-18 16:37:25,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-18 16:37:25,940 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:37:25,941 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 16:37:25,948 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-18 16:37:26,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:37:26,146 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:37:26,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:37:26,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1498221753, now seen corresponding path program 2 times [2023-02-18 16:37:26,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:37:26,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058106017] [2023-02-18 16:37:26,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:37:26,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:37:26,154 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 16:37:26,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2142224648] [2023-02-18 16:37:26,154 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 16:37:26,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:37:26,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 16:37:26,156 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-18 16:37:26,158 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-18 16:37:26,203 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 16:37:26,204 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 16:37:26,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-18 16:37:26,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 16:37:26,238 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 17 proven. 31 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-02-18 16:37:26,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 16:37:26,311 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 19 proven. 25 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-02-18 16:37:26,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:37:26,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058106017] [2023-02-18 16:37:26,312 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 16:37:26,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142224648] [2023-02-18 16:37:26,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142224648] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 16:37:26,312 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 16:37:26,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2023-02-18 16:37:26,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132215650] [2023-02-18 16:37:26,314 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 16:37:26,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-18 16:37:26,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:37:26,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-18 16:37:26,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-02-18 16:37:26,316 INFO L87 Difference]: Start difference. First operand 79 states and 96 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 5 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 5 states have call successors, (15) [2023-02-18 16:37:26,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:37:26,845 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2023-02-18 16:37:26,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 16:37:26,845 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 5 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 5 states have call successors, (15) Word has length 56 [2023-02-18 16:37:26,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:37:26,846 INFO L225 Difference]: With dead ends: 86 [2023-02-18 16:37:26,846 INFO L226 Difference]: Without dead ends: 81 [2023-02-18 16:37:26,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2023-02-18 16:37:26,847 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-18 16:37:26,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 74 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-18 16:37:26,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-18 16:37:26,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-02-18 16:37:26,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 48 states have internal predecessors, (48), 24 states have call successors, (24), 11 states have call predecessors, (24), 11 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-02-18 16:37:26,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2023-02-18 16:37:26,861 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 56 [2023-02-18 16:37:26,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:37:26,861 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2023-02-18 16:37:26,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 5 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 5 states have call successors, (15) [2023-02-18 16:37:26,862 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2023-02-18 16:37:26,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-02-18 16:37:26,862 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:37:26,863 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 16:37:26,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-18 16:37:27,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:37:27,068 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:37:27,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:37:27,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1061977627, now seen corresponding path program 1 times [2023-02-18 16:37:27,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:37:27,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440157673] [2023-02-18 16:37:27,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:37:27,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:37:27,076 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 16:37:27,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1694535352] [2023-02-18 16:37:27,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:37:27,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:37:27,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 16:37:27,077 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-18 16:37:27,079 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-18 16:37:27,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 16:37:27,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-18 16:37:27,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 16:37:27,167 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-02-18 16:37:27,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 16:37:27,280 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-02-18 16:37:27,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:37:27,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440157673] [2023-02-18 16:37:27,281 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 16:37:27,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694535352] [2023-02-18 16:37:27,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694535352] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 16:37:27,281 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 16:37:27,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2023-02-18 16:37:27,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138006569] [2023-02-18 16:37:27,281 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 16:37:27,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 16:37:27,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:37:27,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 16:37:27,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-02-18 16:37:27,283 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2023-02-18 16:37:27,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:37:27,711 INFO L93 Difference]: Finished difference Result 95 states and 114 transitions. [2023-02-18 16:37:27,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 16:37:27,712 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 67 [2023-02-18 16:37:27,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:37:27,713 INFO L225 Difference]: With dead ends: 95 [2023-02-18 16:37:27,713 INFO L226 Difference]: Without dead ends: 93 [2023-02-18 16:37:27,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2023-02-18 16:37:27,714 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 30 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 16:37:27,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 157 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 16:37:27,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-18 16:37:27,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2023-02-18 16:37:27,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 52 states have internal predecessors, (53), 29 states have call successors, (29), 12 states have call predecessors, (29), 12 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-02-18 16:37:27,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 109 transitions. [2023-02-18 16:37:27,734 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 109 transitions. Word has length 67 [2023-02-18 16:37:27,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:37:27,734 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 109 transitions. [2023-02-18 16:37:27,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2023-02-18 16:37:27,734 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 109 transitions. [2023-02-18 16:37:27,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-02-18 16:37:27,735 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:37:27,735 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 16:37:27,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-18 16:37:27,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:37:27,941 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:37:27,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:37:27,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1246911088, now seen corresponding path program 1 times [2023-02-18 16:37:27,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:37:27,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169996689] [2023-02-18 16:37:27,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:37:27,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:37:27,948 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 16:37:27,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [210472840] [2023-02-18 16:37:27,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:37:27,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:37:27,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 16:37:27,950 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-18 16:37:27,952 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-18 16:37:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 16:37:27,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-18 16:37:27,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 16:37:28,046 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-02-18 16:37:28,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 16:37:28,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:37:28,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169996689] [2023-02-18 16:37:28,130 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 16:37:28,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210472840] [2023-02-18 16:37:28,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210472840] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 16:37:28,131 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 16:37:28,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2023-02-18 16:37:28,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856643525] [2023-02-18 16:37:28,131 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 16:37:28,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-18 16:37:28,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:37:28,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-18 16:37:28,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-02-18 16:37:28,132 INFO L87 Difference]: Start difference. First operand 91 states and 109 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-02-18 16:37:28,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:37:28,312 INFO L93 Difference]: Finished difference Result 97 states and 114 transitions. [2023-02-18 16:37:28,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 16:37:28,313 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 72 [2023-02-18 16:37:28,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:37:28,314 INFO L225 Difference]: With dead ends: 97 [2023-02-18 16:37:28,314 INFO L226 Difference]: Without dead ends: 88 [2023-02-18 16:37:28,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2023-02-18 16:37:28,315 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 20 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 16:37:28,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 107 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 16:37:28,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-18 16:37:28,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-02-18 16:37:28,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 51 states have internal predecessors, (52), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2023-02-18 16:37:28,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 103 transitions. [2023-02-18 16:37:28,332 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 103 transitions. Word has length 72 [2023-02-18 16:37:28,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:37:28,333 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 103 transitions. [2023-02-18 16:37:28,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-02-18 16:37:28,333 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 103 transitions. [2023-02-18 16:37:28,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-02-18 16:37:28,334 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:37:28,334 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-18 16:37:28,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-02-18 16:37:28,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:37:28,539 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:37:28,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:37:28,540 INFO L85 PathProgramCache]: Analyzing trace with hash -322800313, now seen corresponding path program 3 times [2023-02-18 16:37:28,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:37:28,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284826858] [2023-02-18 16:37:28,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:37:28,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:37:28,546 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 16:37:28,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1346987593] [2023-02-18 16:37:28,547 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 16:37:28,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:37:28,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 16:37:28,548 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-18 16:37:28,553 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-18 16:37:28,591 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-18 16:37:28,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 16:37:28,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-18 16:37:28,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 16:37:28,644 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 55 proven. 24 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-02-18 16:37:28,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 16:37:28,831 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 55 proven. 24 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-02-18 16:37:28,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:37:28,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284826858] [2023-02-18 16:37:28,832 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 16:37:28,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346987593] [2023-02-18 16:37:28,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346987593] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 16:37:28,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 16:37:28,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2023-02-18 16:37:28,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044358977] [2023-02-18 16:37:28,832 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 16:37:28,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-18 16:37:28,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:37:28,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-18 16:37:28,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2023-02-18 16:37:28,833 INFO L87 Difference]: Start difference. First operand 88 states and 103 transitions. Second operand has 16 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 8 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 6 states have call predecessors, (26), 8 states have call successors, (26) [2023-02-18 16:37:31,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:37:31,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:37:31,922 INFO L93 Difference]: Finished difference Result 110 states and 123 transitions. [2023-02-18 16:37:31,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 16:37:31,922 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 8 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 6 states have call predecessors, (26), 8 states have call successors, (26) Word has length 78 [2023-02-18 16:37:31,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:37:31,925 INFO L225 Difference]: With dead ends: 110 [2023-02-18 16:37:31,925 INFO L226 Difference]: Without dead ends: 107 [2023-02-18 16:37:31,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 139 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2023-02-18 16:37:31,926 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 19 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 54 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-02-18 16:37:31,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 99 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 484 Invalid, 1 Unknown, 0 Unchecked, 2.9s Time] [2023-02-18 16:37:31,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-02-18 16:37:31,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2023-02-18 16:37:31,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 63 states have internal predecessors, (64), 27 states have call successors, (27), 16 states have call predecessors, (27), 16 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-02-18 16:37:31,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2023-02-18 16:37:31,956 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 78 [2023-02-18 16:37:31,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:37:31,956 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2023-02-18 16:37:31,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 8 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 6 states have call predecessors, (26), 8 states have call successors, (26) [2023-02-18 16:37:31,957 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2023-02-18 16:37:31,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-02-18 16:37:31,962 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:37:31,962 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 16:37:31,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-02-18 16:37:32,167 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,SelfDestructingSolverStorable9 [2023-02-18 16:37:32,167 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:37:32,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:37:32,168 INFO L85 PathProgramCache]: Analyzing trace with hash -674604307, now seen corresponding path program 2 times [2023-02-18 16:37:32,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:37:32,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627186039] [2023-02-18 16:37:32,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:37:32,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:37:32,183 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 16:37:32,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1920857712] [2023-02-18 16:37:32,183 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 16:37:32,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:37:32,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 16:37:32,190 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-18 16:37:32,205 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-18 16:37:32,258 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 16:37:32,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 16:37:32,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-18 16:37:32,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 16:37:32,344 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 78 proven. 25 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-02-18 16:37:32,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 16:37:32,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:37:32,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627186039] [2023-02-18 16:37:32,704 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 16:37:32,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920857712] [2023-02-18 16:37:32,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920857712] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 16:37:32,704 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 16:37:32,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2023-02-18 16:37:32,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58210073] [2023-02-18 16:37:32,704 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 16:37:32,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 16:37:32,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:37:32,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 16:37:32,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2023-02-18 16:37:32,705 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2023-02-18 16:37:33,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:37:33,021 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2023-02-18 16:37:33,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 16:37:33,021 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) Word has length 99 [2023-02-18 16:37:33,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:37:33,022 INFO L225 Difference]: With dead ends: 111 [2023-02-18 16:37:33,022 INFO L226 Difference]: Without dead ends: 98 [2023-02-18 16:37:33,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 125 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2023-02-18 16:37:33,023 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 12 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 16:37:33,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 86 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 16:37:33,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-18 16:37:33,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-02-18 16:37:33,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 58 states have (on average 1.0344827586206897) internal successors, (60), 59 states have internal predecessors, (60), 24 states have call successors, (24), 15 states have call predecessors, (24), 15 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-02-18 16:37:33,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2023-02-18 16:37:33,039 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 99 [2023-02-18 16:37:33,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:37:33,039 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2023-02-18 16:37:33,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2023-02-18 16:37:33,040 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2023-02-18 16:37:33,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-02-18 16:37:33,040 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:37:33,040 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 21, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 16:37:33,048 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-18 16:37:33,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:37:33,246 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:37:33,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:37:33,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1837317061, now seen corresponding path program 2 times [2023-02-18 16:37:33,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:37:33,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833315637] [2023-02-18 16:37:33,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:37:33,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:37:33,253 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 16:37:33,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [902339087] [2023-02-18 16:37:33,253 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 16:37:33,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:37:33,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 16:37:33,254 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-18 16:37:33,259 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-18 16:37:33,311 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 16:37:33,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 16:37:33,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-18 16:37:33,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 16:37:33,397 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 101 proven. 43 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2023-02-18 16:37:33,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 16:37:33,979 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 122 proven. 1 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2023-02-18 16:37:33,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:37:33,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833315637] [2023-02-18 16:37:33,979 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 16:37:33,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902339087] [2023-02-18 16:37:33,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902339087] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 16:37:33,979 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 16:37:33,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 17 [2023-02-18 16:37:33,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287907965] [2023-02-18 16:37:33,980 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 16:37:33,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-18 16:37:33,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:37:33,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-18 16:37:33,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2023-02-18 16:37:33,981 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 10 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2023-02-18 16:37:36,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:37:36,229 INFO L93 Difference]: Finished difference Result 123 states and 138 transitions. [2023-02-18 16:37:36,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-18 16:37:36,230 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 10 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) Word has length 121 [2023-02-18 16:37:36,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:37:36,230 INFO L225 Difference]: With dead ends: 123 [2023-02-18 16:37:36,230 INFO L226 Difference]: Without dead ends: 121 [2023-02-18 16:37:36,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 223 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2023-02-18 16:37:36,231 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 12 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-02-18 16:37:36,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 108 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-02-18 16:37:36,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-02-18 16:37:36,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2023-02-18 16:37:36,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 71 states have internal predecessors, (72), 30 states have call successors, (30), 18 states have call predecessors, (30), 18 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2023-02-18 16:37:36,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 131 transitions. [2023-02-18 16:37:36,253 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 131 transitions. Word has length 121 [2023-02-18 16:37:36,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:37:36,254 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 131 transitions. [2023-02-18 16:37:36,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 10 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2023-02-18 16:37:36,254 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 131 transitions. [2023-02-18 16:37:36,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-02-18 16:37:36,256 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:37:36,256 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 22, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 16:37:36,263 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-18 16:37:36,461 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,SelfDestructingSolverStorable11 [2023-02-18 16:37:36,461 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:37:36,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:37:36,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1974193296, now seen corresponding path program 3 times [2023-02-18 16:37:36,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:37:36,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808709452] [2023-02-18 16:37:36,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:37:36,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:37:36,468 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 16:37:36,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1493164344] [2023-02-18 16:37:36,469 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 16:37:36,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:37:36,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 16:37:36,470 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-18 16:37:36,472 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-18 16:37:37,288 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-18 16:37:37,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 16:37:37,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-18 16:37:37,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 16:37:37,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 181 proven. 69 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-02-18 16:37:37,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 16:37:40,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 148 proven. 39 refuted. 0 times theorem prover too weak. 823 trivial. 0 not checked. [2023-02-18 16:37:40,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:37:40,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808709452] [2023-02-18 16:37:40,253 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 16:37:40,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493164344] [2023-02-18 16:37:40,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493164344] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 16:37:40,254 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 16:37:40,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2023-02-18 16:37:40,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258968811] [2023-02-18 16:37:40,254 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 16:37:40,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-18 16:37:40,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:37:40,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-18 16:37:40,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2023-02-18 16:37:40,256 INFO L87 Difference]: Start difference. First operand 118 states and 131 transitions. Second operand has 18 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 9 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (31), 8 states have call predecessors, (31), 9 states have call successors, (31) [2023-02-18 16:37:44,896 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-18 16:37:46,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:37:48,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:37:50,513 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-18 16:37:51,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:37:51,877 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2023-02-18 16:37:51,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 16:37:51,877 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 9 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (31), 8 states have call predecessors, (31), 9 states have call successors, (31) Word has length 126 [2023-02-18 16:37:51,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:37:51,878 INFO L225 Difference]: With dead ends: 124 [2023-02-18 16:37:51,878 INFO L226 Difference]: Without dead ends: 120 [2023-02-18 16:37:51,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 228 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2023-02-18 16:37:51,879 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 26 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 61 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2023-02-18 16:37:51,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 57 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 223 Invalid, 2 Unknown, 0 Unchecked, 10.2s Time] [2023-02-18 16:37:51,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-02-18 16:37:51,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2023-02-18 16:37:51,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 71 states have (on average 1.028169014084507) internal successors, (73), 72 states have internal predecessors, (73), 30 states have call successors, (30), 19 states have call predecessors, (30), 18 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2023-02-18 16:37:51,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2023-02-18 16:37:51,907 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 126 [2023-02-18 16:37:51,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:37:51,907 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2023-02-18 16:37:51,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 9 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (31), 8 states have call predecessors, (31), 9 states have call successors, (31) [2023-02-18 16:37:51,908 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2023-02-18 16:37:51,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-02-18 16:37:51,908 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:37:51,909 INFO L195 NwaCegarLoop]: trace histogram [24, 23, 23, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 16:37:51,931 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-18 16:37:52,115 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,SelfDestructingSolverStorable12 [2023-02-18 16:37:52,116 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:37:52,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:37:52,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1520954085, now seen corresponding path program 1 times [2023-02-18 16:37:52,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:37:52,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441516445] [2023-02-18 16:37:52,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:37:52,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:37:52,122 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 16:37:52,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1805945715] [2023-02-18 16:37:52,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:37:52,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:37:52,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 16:37:52,131 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-18 16:37:52,141 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-18 16:37:52,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 16:37:52,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 54 conjunts are in the unsatisfiable core [2023-02-18 16:37:52,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 16:37:52,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1100 backedges. 103 proven. 165 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2023-02-18 16:37:52,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 16:38:00,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1100 backedges. 103 proven. 165 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2023-02-18 16:38:00,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:38:00,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441516445] [2023-02-18 16:38:00,417 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 16:38:00,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805945715] [2023-02-18 16:38:00,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805945715] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 16:38:00,418 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 16:38:00,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2023-02-18 16:38:00,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137500552] [2023-02-18 16:38:00,418 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 16:38:00,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-18 16:38:00,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:38:00,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-18 16:38:00,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=329, Unknown=3, NotChecked=0, Total=420 [2023-02-18 16:38:00,419 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand has 21 states, 18 states have (on average 2.0) internal successors, (36), 16 states have internal predecessors, (36), 12 states have call successors, (48), 3 states have call predecessors, (48), 2 states have return successors, (46), 11 states have call predecessors, (46), 12 states have call successors, (46) [2023-02-18 16:38:03,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:38:06,709 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-18 16:38:09,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:38:11,349 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-18 16:38:13,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:38:15,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:38:18,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:38:22,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:38:24,739 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-18 16:38:27,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:38:29,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:38:39,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:38:41,426 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-18 16:38:44,103 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 [0] [2023-02-18 16:38:46,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:38:48,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:38:50,671 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-18 16:38:53,882 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-18 16:38:55,923 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-18 16:38:57,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:38:59,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:39:01,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:39:04,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:39:06,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:39:08,704 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-18 16:39:10,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:39:14,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:39:16,086 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-18 16:39:18,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:39:20,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:39:22,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:39:24,252 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-18 16:39:26,254 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-18 16:39:28,256 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-18 16:39:31,539 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-18 16:39:31,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:39:31,679 INFO L93 Difference]: Finished difference Result 167 states and 205 transitions. [2023-02-18 16:39:31,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-18 16:39:31,679 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 2.0) internal successors, (36), 16 states have internal predecessors, (36), 12 states have call successors, (48), 3 states have call predecessors, (48), 2 states have return successors, (46), 11 states have call predecessors, (46), 12 states have call successors, (46) Word has length 131 [2023-02-18 16:39:31,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:39:31,682 INFO L225 Difference]: With dead ends: 167 [2023-02-18 16:39:31,682 INFO L226 Difference]: Without dead ends: 151 [2023-02-18 16:39:31,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 237 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=192, Invalid=674, Unknown=4, NotChecked=0, Total=870 [2023-02-18 16:39:31,683 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 38 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1014 mSolverCounterSat, 85 mSolverCounterUnsat, 31 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 83.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1014 IncrementalHoareTripleChecker+Invalid, 31 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 83.5s IncrementalHoareTripleChecker+Time [2023-02-18 16:39:31,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 136 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1014 Invalid, 31 Unknown, 0 Unchecked, 83.5s Time] [2023-02-18 16:39:31,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-02-18 16:39:31,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2023-02-18 16:39:31,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 49 states have call successors, (49), 20 states have call predecessors, (49), 19 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-02-18 16:39:31,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 180 transitions. [2023-02-18 16:39:31,739 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 180 transitions. Word has length 131 [2023-02-18 16:39:31,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:39:31,739 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 180 transitions. [2023-02-18 16:39:31,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 2.0) internal successors, (36), 16 states have internal predecessors, (36), 12 states have call successors, (48), 3 states have call predecessors, (48), 2 states have return successors, (46), 11 states have call predecessors, (46), 12 states have call successors, (46) [2023-02-18 16:39:31,740 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 180 transitions. [2023-02-18 16:39:31,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2023-02-18 16:39:31,741 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:39:31,741 INFO L195 NwaCegarLoop]: trace histogram [49, 48, 48, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 16:39:31,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-02-18 16:39:31,946 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,SelfDestructingSolverStorable13 [2023-02-18 16:39:31,947 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:39:31,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:39:31,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1512061602, now seen corresponding path program 2 times [2023-02-18 16:39:31,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:39:31,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259982631] [2023-02-18 16:39:31,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:39:31,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:39:31,960 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 16:39:31,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1495581904] [2023-02-18 16:39:31,960 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 16:39:31,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:39:31,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 16:39:31,962 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-18 16:39:31,963 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-18 16:39:32,080 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 16:39:32,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 16:39:32,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 95 conjunts are in the unsatisfiable core [2023-02-18 16:39:32,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 16:39:32,526 INFO L134 CoverageAnalysis]: Checked inductivity of 4860 backedges. 364 proven. 260 refuted. 0 times theorem prover too weak. 4236 trivial. 0 not checked. [2023-02-18 16:39:32,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 16:39:54,987 INFO L134 CoverageAnalysis]: Checked inductivity of 4860 backedges. 364 proven. 260 refuted. 0 times theorem prover too weak. 4236 trivial. 0 not checked. [2023-02-18 16:39:54,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:39:54,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259982631] [2023-02-18 16:39:54,988 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 16:39:54,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495581904] [2023-02-18 16:39:54,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495581904] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 16:39:54,988 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 16:39:54,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 33 [2023-02-18 16:39:54,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769464412] [2023-02-18 16:39:54,989 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 16:39:54,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-18 16:39:54,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:39:54,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-18 16:39:54,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=815, Unknown=7, NotChecked=0, Total=1056 [2023-02-18 16:39:54,990 INFO L87 Difference]: Start difference. First operand 151 states and 180 transitions. Second operand has 33 states, 27 states have (on average 2.074074074074074) internal successors, (56), 28 states have internal predecessors, (56), 24 states have call successors, (98), 3 states have call predecessors, (98), 2 states have return successors, (96), 22 states have call predecessors, (96), 24 states have call successors, (96) [2023-02-18 16:40:02,473 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-18 16:40:04,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 16:40:05,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:40:09,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:40:11,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:40:14,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.79s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:40:17,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:40:20,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:40:22,920 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-18 16:40:25,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:40:27,942 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-18 16:40:31,557 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-18 16:40:34,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:40:38,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.46s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:40:43,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:40:45,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:40:48,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:40:49,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:40:57,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:41:00,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:41:05,674 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-18 16:41:12,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:41:12,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:41:12,696 INFO L93 Difference]: Finished difference Result 261 states and 348 transitions. [2023-02-18 16:41:12,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-02-18 16:41:12,696 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 27 states have (on average 2.074074074074074) internal successors, (56), 28 states have internal predecessors, (56), 24 states have call successors, (98), 3 states have call predecessors, (98), 2 states have return successors, (96), 22 states have call predecessors, (96), 24 states have call successors, (96) Word has length 266 [2023-02-18 16:41:12,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:41:12,698 INFO L225 Difference]: With dead ends: 261 [2023-02-18 16:41:12,698 INFO L226 Difference]: Without dead ends: 241 [2023-02-18 16:41:12,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 495 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 27.5s TimeCoverageRelationStatistics Valid=599, Invalid=1649, Unknown=8, NotChecked=0, Total=2256 [2023-02-18 16:41:12,699 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 52 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 2687 mSolverCounterSat, 193 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 70.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 2895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 2687 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 71.1s IncrementalHoareTripleChecker+Time [2023-02-18 16:41:12,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 287 Invalid, 2895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 2687 Invalid, 15 Unknown, 0 Unchecked, 71.1s Time] [2023-02-18 16:41:12,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2023-02-18 16:41:12,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2023-02-18 16:41:12,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 117 states have (on average 1.0085470085470085) internal successors, (118), 117 states have internal predecessors, (118), 99 states have call successors, (99), 25 states have call predecessors, (99), 24 states have return successors, (98), 98 states have call predecessors, (98), 98 states have call successors, (98) [2023-02-18 16:41:12,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 315 transitions. [2023-02-18 16:41:12,872 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 315 transitions. Word has length 266 [2023-02-18 16:41:12,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:41:12,873 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 315 transitions. [2023-02-18 16:41:12,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 27 states have (on average 2.074074074074074) internal successors, (56), 28 states have internal predecessors, (56), 24 states have call successors, (98), 3 states have call predecessors, (98), 2 states have return successors, (96), 22 states have call predecessors, (96), 24 states have call successors, (96) [2023-02-18 16:41:12,873 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 315 transitions. [2023-02-18 16:41:12,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2023-02-18 16:41:12,878 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:41:12,878 INFO L195 NwaCegarLoop]: trace histogram [99, 98, 98, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 16:41:12,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-02-18 16:41:13,083 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,SelfDestructingSolverStorable14 [2023-02-18 16:41:13,084 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:41:13,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:41:13,084 INFO L85 PathProgramCache]: Analyzing trace with hash -48749890, now seen corresponding path program 3 times [2023-02-18 16:41:13,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:41:13,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868503399] [2023-02-18 16:41:13,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:41:13,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:41:13,098 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 16:41:13,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1383184370] [2023-02-18 16:41:13,099 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 16:41:13,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:41:13,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 16:41:13,115 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 16:41:13,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-18 16:41:13,214 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-18 16:41:13,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 16:41:13,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 49 conjunts are in the unsatisfiable core [2023-02-18 16:41:13,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 16:41:20,140 INFO L134 CoverageAnalysis]: Checked inductivity of 20405 backedges. 1423 proven. 61 refuted. 0 times theorem prover too weak. 18921 trivial. 0 not checked. [2023-02-18 16:41:20,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 16:41:42,079 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (let ((.cse1 (div (+ .cse5 (* (- 6) |c_ULTIMATE.start_main_~z~0#1|)) 12))) (let ((.cse0 (* .cse1 |c_ULTIMATE.start_main_~z~0#1|)) (.cse2 (* 3 |c_ULTIMATE.start_main_~z~0#1|)) (.cse7 (+ .cse1 1))) (let ((.cse3 (+ (+ (div (+ .cse0 (* (- 12) .cse1) .cse2) 18) (- 1)) .cse7)) (.cse4 (+ 6 (* 6 (+ 1 |c_ULTIMATE.start_main_~n~0#1|))))) (or (not (= (mod (+ .cse0 (* 6 .cse1) .cse2) 18) 0)) (not (= 0 (+ (+ (* (* 6 |c_ULTIMATE.start_main_~a~0#1|) .cse3) (- (* .cse3 .cse4))) (* 12 .cse3)))) (not (= (mod (+ .cse5 (* 6 |c_ULTIMATE.start_main_~z~0#1|)) 12) 0)) (= 0 (+ (+ (let ((.cse6 (+ .cse7 |c_ULTIMATE.start_main_~z~0#1|))) (+ (+ (+ (* (* 2 .cse6) .cse6) (- (* (* 3 .cse3) .cse4))) (- (* 18 .cse3))) (- (* 10 .cse6)))) (* 3 .cse4)) (- 10))) (not (= .cse4 (+ 6 |c_ULTIMATE.start_main_~z~0#1|)))))))) is different from true [2023-02-18 16:41:42,125 INFO L134 CoverageAnalysis]: Checked inductivity of 20405 backedges. 1501 proven. 63 refuted. 0 times theorem prover too weak. 18836 trivial. 5 not checked. [2023-02-18 16:41:42,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:41:42,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868503399] [2023-02-18 16:41:42,125 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 16:41:42,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383184370] [2023-02-18 16:41:42,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383184370] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 16:41:42,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 16:41:42,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2023-02-18 16:41:42,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733278660] [2023-02-18 16:41:42,126 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 16:41:42,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-18 16:41:42,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:41:42,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-18 16:41:42,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=274, Unknown=9, NotChecked=34, Total=380 [2023-02-18 16:41:42,128 INFO L87 Difference]: Start difference. First operand 241 states and 315 transitions. Second operand has 20 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 11 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (33), 11 states have call predecessors, (33), 11 states have call successors, (33) [2023-02-18 16:41:44,558 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-18 16:41:53,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.69s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 16:42:04,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 16:42:07,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.78s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:42:12,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 16:42:16,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:42:18,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:42:20,293 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-18 16:42:31,614 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (+ 6 (* 6 (+ 1 |c_ULTIMATE.start_main_~n~0#1|))))) (let ((.cse16 (<= |c_ULTIMATE.start_main_~a~0#1| 50)) (.cse6 (* 6 |c_ULTIMATE.start_main_~a~0#1|)) (.cse13 (* 3 .cse8)) (.cse14 (not (= .cse8 (+ 6 |c_ULTIMATE.start_main_~z~0#1|)))) (.cse9 (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (.cse15 (- (* 12 |c_ULTIMATE.start_main_~y~0#1|))) (.cse10 (* 6 |c_ULTIMATE.start_main_~z~0#1|)) (.cse17 (>= |c_ULTIMATE.start_main_~a~0#1| 0))) (and (or (let ((.cse0 (+ (* (div (+ (- |c_ULTIMATE.start_main_~a~0#1|) (- 1)) 65536) 65536) 65536)) (.cse1 (* |c_ULTIMATE.start_main_~a~0#1| (- 1)))) (and (<= 0 |c_ULTIMATE.start_main_~a~0#1|) (<= .cse0 (+ .cse1 65535)) (<= .cse0 (+ .cse1 32767)) (< |c_ULTIMATE.start_main_~a~0#1| 65536))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1| 65536))) (and (not (<= (mod |c_ULTIMATE.start_main_~a~0#1| 65536) 32767)) (<= 0 .cse2) (< .cse2 65536)))) (let ((.cse4 (div (+ .cse9 (* (- 6) |c_ULTIMATE.start_main_~z~0#1|)) 12))) (let ((.cse3 (* .cse4 |c_ULTIMATE.start_main_~z~0#1|)) (.cse5 (* 3 |c_ULTIMATE.start_main_~z~0#1|)) (.cse12 (+ .cse4 1))) (let ((.cse7 (+ (+ (div (+ .cse3 (* (- 12) .cse4) .cse5) 18) (- 1)) .cse12))) (or (not (= (mod (+ .cse3 (* 6 .cse4) .cse5) 18) 0)) (not (= 0 (+ (+ (* .cse6 .cse7) (- (* .cse7 .cse8))) (* 12 .cse7)))) (not (= (mod (+ .cse9 .cse10) 12) 0)) (= 0 (+ (+ (let ((.cse11 (+ .cse12 |c_ULTIMATE.start_main_~z~0#1|))) (+ (+ (+ (* (* 2 .cse11) .cse11) (- (* (* 3 .cse7) .cse8))) (- (* 18 .cse7))) (- (* 10 .cse11)))) .cse13) (- 10))) .cse14)))) (= 0 (+ (+ (+ (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~z~0#1|) (- (* 18 |c_ULTIMATE.start_main_~x~0#1|))) .cse15) (* 2 |c_ULTIMATE.start_main_~z~0#1|)) (- 6))) .cse16 (or (and .cse16 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse17) (and (or (not .cse16) (not .cse17)) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0))) (let ((.cse18 (+ |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (not (= 0 (+ (+ (* .cse6 .cse18) (- (* .cse18 .cse8))) (* 12 .cse18)))) (= 0 (+ (+ (let ((.cse19 (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (+ (+ (+ (* (* 2 .cse19) .cse19) (- (* (* 3 .cse18) .cse8))) (- (* 18 .cse18))) (- (* 10 .cse19)))) .cse13) (- 10))) .cse14)) (= 0 (+ 12 (+ (+ .cse9 .cse15) (- .cse10)))) (= (mod (* |c_ULTIMATE.start_main_~z~0#1| 5) 6) 0) .cse17))) is different from false [2023-02-18 16:42:39,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:42:41,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:42:53,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:42:55,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:43:02,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.85s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:43:11,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:43:13,212 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (+ 6 (* 6 (+ 1 |c_ULTIMATE.start_main_~n~0#1|))))) (let ((.cse6 (* 6 |c_ULTIMATE.start_main_~a~0#1|)) (.cse13 (* 3 .cse8)) (.cse14 (not (= .cse8 (+ 6 |c_ULTIMATE.start_main_~z~0#1|)))) (.cse9 (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (.cse15 (- (* 12 |c_ULTIMATE.start_main_~y~0#1|))) (.cse10 (* 6 |c_ULTIMATE.start_main_~z~0#1|))) (and (or (let ((.cse0 (+ (* (div (+ (- |c_ULTIMATE.start_main_~a~0#1|) (- 1)) 65536) 65536) 65536)) (.cse1 (* |c_ULTIMATE.start_main_~a~0#1| (- 1)))) (and (<= 0 |c_ULTIMATE.start_main_~a~0#1|) (<= .cse0 (+ .cse1 65535)) (<= .cse0 (+ .cse1 32767)) (< |c_ULTIMATE.start_main_~a~0#1| 65536))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1| 65536))) (and (not (<= (mod |c_ULTIMATE.start_main_~a~0#1| 65536) 32767)) (<= 0 .cse2) (< .cse2 65536)))) (let ((.cse4 (div (+ .cse9 (* (- 6) |c_ULTIMATE.start_main_~z~0#1|)) 12))) (let ((.cse3 (* .cse4 |c_ULTIMATE.start_main_~z~0#1|)) (.cse5 (* 3 |c_ULTIMATE.start_main_~z~0#1|)) (.cse12 (+ .cse4 1))) (let ((.cse7 (+ (+ (div (+ .cse3 (* (- 12) .cse4) .cse5) 18) (- 1)) .cse12))) (or (not (= (mod (+ .cse3 (* 6 .cse4) .cse5) 18) 0)) (not (= 0 (+ (+ (* .cse6 .cse7) (- (* .cse7 .cse8))) (* 12 .cse7)))) (not (= (mod (+ .cse9 .cse10) 12) 0)) (= 0 (+ (+ (let ((.cse11 (+ .cse12 |c_ULTIMATE.start_main_~z~0#1|))) (+ (+ (+ (* (* 2 .cse11) .cse11) (- (* (* 3 .cse7) .cse8))) (- (* 18 .cse7))) (- (* 10 .cse11)))) .cse13) (- 10))) .cse14)))) (= 0 (+ (+ (+ (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~z~0#1|) (- (* 18 |c_ULTIMATE.start_main_~x~0#1|))) .cse15) (* 2 |c_ULTIMATE.start_main_~z~0#1|)) (- 6))) (<= |c_ULTIMATE.start_main_~a~0#1| 50) (let ((.cse16 (+ |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (not (= 0 (+ (+ (* .cse6 .cse16) (- (* .cse16 .cse8))) (* 12 .cse16)))) (= 0 (+ (+ (let ((.cse17 (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (+ (+ (+ (* (* 2 .cse17) .cse17) (- (* (* 3 .cse16) .cse8))) (- (* 18 .cse16))) (- (* 10 .cse17)))) .cse13) (- 10))) .cse14)) (= 0 (+ 12 (+ (+ .cse9 .cse15) (- .cse10)))) (= (mod (* |c_ULTIMATE.start_main_~z~0#1| 5) 6) 0) (>= |c_ULTIMATE.start_main_~a~0#1| 0)))) is different from false [2023-02-18 16:43:15,607 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 [0] [2023-02-18 16:43:18,686 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-18 16:43:23,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 16:43:23,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:43:23,111 INFO L93 Difference]: Finished difference Result 245 states and 318 transitions. [2023-02-18 16:43:23,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-18 16:43:23,112 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 11 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (33), 11 states have call predecessors, (33), 11 states have call successors, (33) Word has length 536 [2023-02-18 16:43:23,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:43:23,113 INFO L225 Difference]: With dead ends: 245 [2023-02-18 16:43:23,113 INFO L226 Difference]: Without dead ends: 0 [2023-02-18 16:43:23,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1085 GetRequests, 1048 SyntacticMatches, 10 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 80.3s TimeCoverageRelationStatistics Valid=141, Invalid=505, Unknown=16, NotChecked=150, Total=812 [2023-02-18 16:43:23,114 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 20 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 45 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 48.6s IncrementalHoareTripleChecker+Time [2023-02-18 16:43:23,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 57 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 208 Invalid, 16 Unknown, 35 Unchecked, 48.6s Time] [2023-02-18 16:43:23,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-18 16:43:23,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-18 16:43:23,115 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-18 16:43:23,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-18 16:43:23,115 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 536 [2023-02-18 16:43:23,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:43:23,115 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-18 16:43:23,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 11 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (33), 11 states have call predecessors, (33), 11 states have call successors, (33) [2023-02-18 16:43:23,115 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-18 16:43:23,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-18 16:43:23,117 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-18 16:43:23,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-18 16:43:23,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:43:23,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-18 16:43:23,383 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-18 16:43:23,385 INFO L895 garLoopResultBuilder]: At program point L33-2(lines 33 46) the Hoare annotation is: (let ((.cse110 (+ 1 |ULTIMATE.start_main_~n~0#1|)) (.cse23 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse126 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse154 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse131 (div (- |ULTIMATE.start_main_~z~0#1|) (- 6)))) (let ((.cse128 (+ .cse131 1)) (.cse123 (+ 6 .cse154)) (.cse152 (+ .cse23 .cse126)) (.cse120 (+ .cse126 .cse154)) (.cse124 (+ 1 .cse110))) (let ((.cse146 (+ 1 .cse124)) (.cse156 (+ .cse152 .cse120)) (.cse155 (+ .cse120 .cse123)) (.cse157 (+ 6 .cse123)) (.cse151 (+ .cse128 1))) (let ((.cse145 (+ .cse151 1)) (.cse149 (+ 6 .cse157)) (.cse148 (+ .cse156 .cse155)) (.cse147 (+ .cse155 .cse157)) (.cse143 (+ 1 .cse146)) (.cse51 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse166 (* 6 |ULTIMATE.start_main_~n~0#1|))) (let ((.cse162 (+ |ULTIMATE.start_main_~a~0#1| 65536)) (.cse116 (* (div (+ (- |ULTIMATE.start_main_~a~0#1|) (- 1)) 65536) 65536)) (.cse36 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse166))) (.cse1 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse68 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse22 (* .cse51 .cse23)) (.cse25 (* 12 .cse23)) (.cse62 (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|))) (.cse63 (* 12 |ULTIMATE.start_main_~x~0#1|)) (.cse88 (+ 30 (- 6))) (.cse135 (+ 1 .cse143)) (.cse141 (+ .cse148 .cse147)) (.cse144 (+ .cse147 .cse149)) (.cse142 (+ 6 .cse149)) (.cse140 (+ .cse145 1))) (let ((.cse134 (+ .cse140 1)) (.cse138 (+ 6 .cse142)) (.cse137 (+ .cse141 .cse144)) (.cse136 (+ .cse144 .cse142)) (.cse5 (= (mod (* |ULTIMATE.start_main_~z~0#1| 5) 6) 0)) (.cse139 (+ 1 .cse135)) (.cse87 (+ .cse88 27 (- 14))) (.cse122 (- (* 18 .cse152))) (.cse102 (= 0 (+ (+ (* .cse51 |ULTIMATE.start_main_~x~0#1|) .cse62) .cse63))) (.cse59 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse101 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse26 (* (* 2 .cse126) .cse126)) (.cse27 (* 3 .cse23)) (.cse28 (- (* 18 .cse23))) (.cse29 (- (* 10 .cse126))) (.cse18 (= 0 (+ (+ .cse22 (- (* .cse23 .cse154))) .cse25))) (.cse24 (+ 6 (* 6 .cse110))) (.cse69 (let ((.cse165 (= |ULTIMATE.start_main_~z~0#1| (+ .cse166 6)))) (or (let ((.cse164 (* (- 6) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse163 (<= (+ |ULTIMATE.start_main_~z~0#1| .cse164 (- 6)) 0))) (and (or (not .cse163) (<= 0 .cse1) (not (<= (+ |ULTIMATE.start_main_~z~0#1| .cse164 (- 5)) 0))) (not .cse165) .cse68 (or .cse163 (<= |ULTIMATE.start_main_~z~0#1| 6))))) .cse165))) (.cse107 (not .cse36)) (.cse8 (<= |ULTIMATE.start_main_~a~0#1| 50)) (.cse33 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse153 (- (* 18 |ULTIMATE.start_main_~x~0#1|))) (.cse160 (- (* 12 |ULTIMATE.start_main_~y~0#1|))) (.cse60 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse161 (+ .cse116 65536)) (.cse115 (* |ULTIMATE.start_main_~a~0#1| (- 1))) (.cse114 (< .cse162 65536)) (.cse112 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767)) (.cse117 (<= 0 .cse162))) (let ((.cse17 (+ 6 6)) (.cse11 (+ 1 6)) (.cse111 (and .cse114 (not .cse112) .cse117)) (.cse118 (<= .cse161 (+ .cse115 32767))) (.cse15 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse113 (< |ULTIMATE.start_main_~a~0#1| 65536)) (.cse119 (<= .cse161 (+ .cse115 65535))) (.cse14 (+ |ULTIMATE.start_main_~n~0#1| (- 1))) (.cse85 (+ |ULTIMATE.start_main_~y~0#1| (* .cse1 (- 1)))) (.cse7 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) .cse153) .cse160) .cse60) (- 6)))) (.cse21 (= 0 (+ 12 (+ (+ (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) .cse160) (- (* 6 |ULTIMATE.start_main_~z~0#1|)))))) (.cse103 (= |ULTIMATE.start_main_~x~0#1| (* (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~n~0#1|))) (.cse35 (or (and .cse33 .cse8 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not .cse8) (not .cse33))))) (.cse16 (let ((.cse158 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (let ((.cse159 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ (* .cse159 |ULTIMATE.start_main_~n~0#1|) .cse159)))))) (or (and .cse69 .cse158) (and .cse69 (or .cse107 .cse158))))) (.cse30 (not (= .cse24 .cse154))) (.cse82 (not (= 0 (+ (+ (* .cse51 .cse156) (- (* .cse156 .cse157))) (* 12 .cse156))))) (.cse83 (not (<= .cse124 |ULTIMATE.start_main_~a~0#1|))) (.cse84 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse155) .cse155) (- (* (* 3 .cse156) .cse157))) (- (* 18 .cse156))) (- (* 10 .cse155))) (* 3 .cse157)) (- 10)))) (.cse132 (not .cse18)) (.cse133 (= 0 (+ (+ (+ (+ (+ .cse26 (- (* .cse27 .cse154))) .cse28) .cse29) (* 3 .cse154)) (- 10)))) (.cse19 (not .cse101)) (.cse39 (= 0 (+ (+ (+ (+ (+ (* .cse59 |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))) .cse153) (- (* 10 |ULTIMATE.start_main_~y~0#1|))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)))) (.cse150 (not .cse102)) (.cse127 (not (= 0 (+ (+ (* .cse51 .cse152) (- (* .cse152 .cse123))) (* 12 .cse152))))) (.cse129 (not (<= .cse110 |ULTIMATE.start_main_~a~0#1|))) (.cse130 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse120) .cse120) (- (* (* 3 .cse152) .cse123))) .cse122) (- (* 10 .cse120))) (* 3 .cse123)) (- 10)))) (.cse90 (+ 27 .cse87)) (.cse91 (* 30 (- 1))) (.cse76 (+ 1 5)) (.cse50 (+ 1 .cse139)) (.cse48 (not .cse5)) (.cse58 (+ .cse137 .cse136)) (.cse55 (+ .cse136 .cse138)) (.cse56 (+ 6 .cse138)) (.cse57 (+ .cse134 1)) (.cse9 (+ 1 0))) (let ((.cse13 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (+ |ULTIMATE.start_main_~y~0#1| (- 1))))) (.cse34 (<= |ULTIMATE.start_main_~n~0#1| .cse9)) (.cse43 (or (not (= 0 (+ (+ (* .cse51 .cse58) (- (* .cse58 .cse56))) (* 12 .cse58)))) (not (<= .cse57 .cse50)) .cse48 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse55) .cse55) (- (* (* 3 .cse58) .cse56))) (- (* 18 .cse58))) (- (* 10 .cse55))) (* 3 .cse56)) (- 10))) (not (<= .cse139 |ULTIMATE.start_main_~a~0#1|)) (<= .cse57 |ULTIMATE.start_main_~a~0#1|))) (.cse71 (+ 1 .cse76)) (.cse78 (+ .cse1 (- 6))) (.cse72 (+ (+ .cse90 (+ 91 .cse91)) 91)) (.cse80 (or .cse127 .cse129 .cse130)) (.cse73 (or .cse39 .cse150)) (.cse74 (or .cse132 .cse133 .cse19)) (.cse75 (+ 6 30)) (.cse40 (or (<= .cse151 |ULTIMATE.start_main_~a~0#1|) .cse48 .cse82 .cse83 (not (<= .cse151 .cse146)) .cse84)) (.cse77 (or .cse107 .cse101 .cse39 .cse150)) (.cse41 (or .cse48 (not (<= .cse145 .cse143)) (not (<= .cse146 |ULTIMATE.start_main_~a~0#1|)) (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse147) .cse147) (- (* (* 3 .cse148) .cse149))) (- (* 18 .cse148))) (- (* 10 .cse147))) (* 3 .cse149)) (- 10))) (<= .cse145 |ULTIMATE.start_main_~a~0#1|) (not (= 0 (+ (+ (* .cse51 .cse148) (- (* .cse148 .cse149))) (* 12 .cse148)))))) (.cse42 (or .cse48 (not (<= .cse140 .cse135)) (not (= 0 (+ (+ (* .cse51 .cse141) (- (* .cse141 .cse142))) (* 12 .cse141)))) (not (<= .cse143 |ULTIMATE.start_main_~a~0#1|)) (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse144) .cse144) (- (* (* 3 .cse141) .cse142))) (- (* 18 .cse141))) (- (* 10 .cse144))) (* 3 .cse142)) (- 10))) (<= .cse140 |ULTIMATE.start_main_~a~0#1|))) (.cse45 (or (<= .cse134 |ULTIMATE.start_main_~a~0#1|) (not (<= .cse135 |ULTIMATE.start_main_~a~0#1|)) .cse48 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse136) .cse136) (- (* (* 3 .cse137) .cse138))) (- (* 18 .cse137))) (- (* 10 .cse136))) (* 3 .cse138)) (- 10))) (not (<= .cse134 .cse139)) (not (= 0 (+ (+ (* .cse51 .cse137) (- (* .cse137 .cse138))) (* 12 .cse137)))))) (.cse46 (or .cse48 (<= .cse131 |ULTIMATE.start_main_~a~0#1|) .cse132 (not (<= .cse131 .cse110)) .cse133 .cse19)) (.cse47 (or .cse48 .cse127 (<= .cse128 |ULTIMATE.start_main_~a~0#1|) (not (<= .cse128 .cse124)) .cse129 .cse130)) (.cse81 (+ 1 2)) (.cse44 (let ((.cse125 (or (= 0 (+ (+ (+ (+ (* .cse126 .cse24) .cse28) (- (* 12 .cse126))) (* 2 .cse24)) (- 6))) .cse30))) (or (and (let ((.cse121 (+ 6 (* 6 .cse124)))) (or (= 0 (+ (+ (+ (+ (* .cse120 .cse121) .cse122) (- (* 12 .cse120))) (* 2 .cse121)) (- 6))) (not (= .cse121 .cse123)))) .cse21 .cse125 .cse7 .cse33 .cse8 .cse103 .cse35 .cse16) (and (or .cse107 .cse7) .cse21 .cse125 .cse33 .cse8 .cse103 .cse35 .cse16)))) (.cse2 (= 0 (+ 12 (+ (+ (* .cse1 .cse1) (- (* 12 .cse85))) (- (* 6 .cse1)))))) (.cse89 (+ .cse14 (- 1))) (.cse4 (or .cse107 .cse101 .cse102)) (.cse6 (or .cse111 (and .cse118 .cse15 .cse113 .cse119))) (.cse10 (or (and .cse114 (<= (+ .cse115 (- 65536)) .cse116) .cse117 (<= (+ .cse115 (- 32768)) .cse116)) (and .cse118 .cse15 .cse119 .cse113))) (.cse93 (+ 1 .cse11)) (.cse12 (<= .cse14 |ULTIMATE.start_main_~a~0#1|)) (.cse97 (+ 6 .cse17)) (.cse20 (or .cse111 (and .cse112 .cse15 .cse113))) (.cse98 (* 7 (- 1))) (.cse3 (= .cse23 (* (* .cse110 .cse110) .cse110))) (.cse92 (+ 1 .cse9)) (.cse94 (* .cse17 (- 1))) (.cse37 (* |ULTIMATE.start_main_~x~0#1| (- 1))) (.cse38 (* |ULTIMATE.start_main_~y~0#1| (- 1)))) (or (let ((.cse31 (+ .cse38 |ULTIMATE.start_main_~x~0#1| 6))) (let ((.cse0 (* 1 (- 1))) (.cse32 (+ |ULTIMATE.start_main_~y~0#1| .cse31 .cse37))) (and (= (+ |ULTIMATE.start_main_~x~0#1| .cse0) 0) (= .cse1 (+ 6 (* 6 0))) .cse2 (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse1)) (= (+ |ULTIMATE.start_main_~y~0#1| (* 6 (- 1))) 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_main_~n~0#1| .cse9) .cse10 (= |ULTIMATE.start_main_~y~0#1| .cse11) .cse12 (= .cse1 6) (= (+ .cse0 |ULTIMATE.start_main_~x~0#1|) 0) .cse13 (= .cse14 0) .cse15 .cse16 (= |ULTIMATE.start_main_~z~0#1| .cse17) (or (< (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1)) .cse18 .cse19) .cse20 (or (not .cse21) (not (= 0 (+ (+ .cse22 (- (* .cse23 .cse24))) .cse25))) (= 0 (+ (+ (+ (+ (+ .cse26 (- (* .cse27 .cse24))) .cse28) .cse29) (* 3 .cse24)) (- 10))) .cse30) .cse21 (= .cse31 0) (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse32)) .cse33 .cse34 .cse35 (= |ULTIMATE.start_main_~x~0#1| 1) (= (+ |ULTIMATE.start_main_~y~0#1| (* .cse32 (- 1))) 1) .cse36))) (and .cse12 .cse39 .cse2 .cse40 .cse41 .cse42 .cse43 .cse20 .cse4 .cse5 .cse6 .cse44 .cse45 .cse21 .cse7 .cse33 .cse8 .cse10 .cse46 .cse35 .cse47 .cse36 (let ((.cse52 (+ .cse58 .cse55)) (.cse53 (+ 6 .cse56)) (.cse49 (+ .cse57 1))) (or .cse48 (not (<= .cse49 (+ 1 .cse50))) (not (= 0 (+ (+ (* .cse51 .cse52) (- (* .cse52 .cse53))) (* 12 .cse52)))) (not (<= .cse50 |ULTIMATE.start_main_~a~0#1|)) (= 0 (+ (+ (let ((.cse54 (+ .cse55 .cse56))) (+ (+ (+ (* (* 2 .cse54) .cse54) (- (* (* 3 .cse52) .cse53))) (- (* 18 .cse52))) (- (* 10 .cse54)))) (* 3 .cse53)) (- 10))) (<= .cse49 |ULTIMATE.start_main_~a~0#1|)))) (and .cse12 .cse2 (= |ULTIMATE.start_main_~x~0#1| 0) .cse13 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) (- .cse51)) (- .cse59)) .cse60) (- 10))) .cse15 (= |ULTIMATE.start_main_~z~0#1| 6) (or (exists ((|aux_div_ULTIMATE.start_main_~a~0#1_40| Int) (|aux_mod_ULTIMATE.start_main_~a~0#1_40| Int)) (let ((.cse61 (+ (* |aux_div_ULTIMATE.start_main_~a~0#1_40| 65536) |aux_mod_ULTIMATE.start_main_~a~0#1_40|))) (let ((.cse64 (+ .cse61 65536))) (and (<= .cse61 50) (not (<= |aux_mod_ULTIMATE.start_main_~a~0#1_40| 32767)) (= 0 (+ (+ (* (* 6 .cse61) |ULTIMATE.start_main_~x~0#1|) .cse62) .cse63)) (>= .cse61 0) (<= 0 |aux_mod_ULTIMATE.start_main_~a~0#1_40|) (<= 0 .cse64) (< |aux_mod_ULTIMATE.start_main_~a~0#1_40| 65536) (< .cse64 65536))))) (exists ((|aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51| Int) (|aux_div_ULTIMATE.start_main_~a~0#1_54| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51| Int)) (let ((.cse65 (+ |aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51| (* |aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51| 65536)))) (let ((.cse66 (+ (* |aux_div_ULTIMATE.start_main_~a~0#1_54| (- 65536)) (* .cse65 (- 1)) (- 1)))) (let ((.cse67 (* .cse66 (- 1)))) (and (<= 0 .cse65) (<= 0 |aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51|) (<= 0 .cse66) (< .cse66 65536) (>= .cse66 0) (= 0 (+ (+ (* (* 6 .cse66) |ULTIMATE.start_main_~x~0#1|) .cse62) .cse63)) (< |aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51| 65536) (<= .cse66 50) (< .cse65 65536) (<= (+ (* |aux_div_ULTIMATE.start_main_~a~0#1_54| 65536) 65536) (+ .cse67 32767)) (<= (+ (* (+ |aux_div_ULTIMATE.start_main_~a~0#1_54| |aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51|) 65536) 65536) (+ .cse67 65535)))))))) .cse20 .cse5 .cse6 .cse21 (= |ULTIMATE.start_main_~y~0#1| 1) .cse68 .cse7 .cse33 .cse34 .cse69 .cse8 .cse10 .cse35 .cse36) (let ((.cse70 (+ (* 48 2) 73))) (and .cse12 (= |ULTIMATE.start_main_~z~0#1| (+ 6 48)) .cse2 (= |ULTIMATE.start_main_~x~0#1| (+ (+ 48 295) .cse70)) (<= .cse71 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| (+ 1 .cse71)) .cse20 .cse4 .cse5 .cse6 .cse44 .cse21 .cse7 .cse33 .cse8 .cse10 .cse35 (= |ULTIMATE.start_main_~y~0#1| (+ .cse70 48)) .cse36)) (and .cse12 (= |ULTIMATE.start_main_~x~0#1| .cse72) .cse2 .cse73 .cse74 (= .cse1 .cse75) .cse20 .cse4 .cse5 .cse6 .cse44 (= |ULTIMATE.start_main_~y~0#1| (+ 91 .cse1)) .cse21 .cse7 .cse33 .cse8 .cse10 .cse35 (= |ULTIMATE.start_main_~n~0#1| .cse76) .cse36) (and .cse12 .cse2 .cse40 .cse77 .cse4 .cse5 .cse6 .cse44 .cse21 .cse7 .cse33 .cse8 .cse10 .cse46 .cse35 .cse47 .cse36) (and .cse12 .cse2 .cse77 .cse4 .cse5 .cse6 .cse44 .cse21 .cse7 .cse33 .cse8 .cse10 .cse46 .cse35 .cse36) (and .cse12 .cse2 .cse40 .cse77 .cse41 .cse42 .cse43 .cse4 .cse5 .cse6 .cse44 .cse45 .cse21 .cse7 .cse33 .cse8 .cse10 .cse46 .cse35 .cse47 .cse36) (and .cse12 .cse2 .cse4 .cse5 .cse6 .cse44 .cse21 .cse7 .cse33 .cse8 .cse10 .cse35 .cse36) (let ((.cse79 (+ .cse1 27 (- 14)))) (and (= .cse78 (+ 6 (+ (+ .cse79 (* .cse78 (- 1))) (- 7)))) .cse12 .cse39 .cse80 .cse2 .cse74 (= |ULTIMATE.start_main_~x~0#1| (+ 27 .cse79)) .cse20 .cse4 .cse5 .cse6 .cse44 (= .cse14 .cse81) .cse21 .cse7 .cse33 .cse8 .cse10 .cse35 (= |ULTIMATE.start_main_~y~0#1| (+ .cse79 .cse1)) (or .cse82 .cse83 .cse84) .cse36)) (and .cse12 .cse2 .cse77 .cse4 .cse5 .cse6 .cse44 .cse21 .cse7 .cse33 .cse8 .cse10 .cse35 .cse36) (and .cse12 .cse2 .cse77 .cse4 .cse5 .cse6 .cse44 .cse21 .cse7 .cse33 .cse8 .cse10 .cse46 .cse35 .cse47 .cse36) (and .cse12 .cse2 (= .cse78 .cse75) .cse73 (= |ULTIMATE.start_main_~n~0#1| .cse71) (= .cse85 (+ 91 .cse78)) .cse20 .cse4 .cse5 .cse6 .cse44 .cse21 .cse7 .cse33 .cse8 .cse10 .cse35 (= (+ |ULTIMATE.start_main_~x~0#1| (* .cse85 (- 1))) .cse72) .cse36) (let ((.cse86 (+ |ULTIMATE.start_main_~y~0#1| .cse91))) (and .cse12 .cse80 .cse2 .cse73 .cse74 (= .cse86 (+ .cse87 .cse88)) (= |ULTIMATE.start_main_~z~0#1| .cse75) .cse20 .cse4 .cse5 .cse6 .cse44 .cse21 .cse7 .cse33 .cse8 .cse10 (= .cse89 .cse81) .cse35 (= |ULTIMATE.start_main_~x~0#1| (+ .cse90 .cse86)) .cse36)) (and .cse12 .cse2 .cse40 .cse77 .cse41 .cse4 .cse5 .cse6 .cse44 .cse21 .cse7 .cse33 .cse8 .cse10 .cse46 .cse35 .cse47 .cse36) (and .cse12 .cse2 .cse40 .cse77 .cse41 .cse42 .cse4 .cse5 .cse6 .cse44 .cse21 .cse7 .cse33 .cse8 .cse10 .cse46 .cse35 .cse47 .cse36) (and .cse12 .cse2 .cse40 .cse77 .cse41 .cse42 .cse4 .cse5 .cse6 .cse44 .cse45 .cse21 .cse7 .cse33 .cse8 .cse10 .cse46 .cse35 .cse47 .cse36) (let ((.cse95 (+ .cse85 (- 7))) (.cse96 (+ 7 (+ 18 (- 6))))) (and (<= .cse92 |ULTIMATE.start_main_~a~0#1|) .cse2 (= |ULTIMATE.start_main_~z~0#1| (+ 6 18)) (= |ULTIMATE.start_main_~x~0#1| (+ .cse93 .cse85)) (= |ULTIMATE.start_main_~n~0#1| .cse81) (= (+ |ULTIMATE.start_main_~x~0#1| (* 19 (- 1))) (+ 1 (+ 19 .cse94))) .cse5 .cse6 .cse7 .cse8 .cse10 (<= |ULTIMATE.start_main_~n~0#1| .cse81) .cse12 (= .cse95 .cse17) (<= 2 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ .cse96 18)) (= .cse1 (+ 6 .cse95)) .cse20 .cse44 .cse21 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse97)) .cse33 (= (+ .cse98 (+ (+ |ULTIMATE.start_main_~x~0#1| (* .cse96 (- 1))) .cse98) 6) 0) .cse35 .cse36)) (let ((.cse109 (+ .cse38 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (- 6)))) (let ((.cse108 (+ |ULTIMATE.start_main_~y~0#1| .cse37 .cse109))) (let ((.cse105 (+ |ULTIMATE.start_main_~y~0#1| (* .cse108 (- 1))))) (let ((.cse99 (+ (* .cse105 (- 1)) .cse109 6))) (let ((.cse100 (+ |ULTIMATE.start_main_~y~0#1| (- 7))) (.cse104 (+ |ULTIMATE.start_main_~y~0#1| .cse94)) (.cse106 (+ .cse105 .cse99 (* .cse109 (- 1))))) (and (= .cse99 0) (= |ULTIMATE.start_main_~y~0#1| (+ 7 .cse1)) (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse100)) (= |ULTIMATE.start_main_~y~0#1| (+ (+ 1 (+ 12 (- 6))) 12)) .cse2 (= |ULTIMATE.start_main_~n~0#1| (+ 1 1)) (<= 1 |ULTIMATE.start_main_~a~0#1|) (= .cse89 0) .cse4 .cse5 .cse6 (or .cse101 .cse102) .cse7 .cse8 .cse10 .cse103 (= |ULTIMATE.start_main_~z~0#1| (+ 6 12)) (= |ULTIMATE.start_main_~x~0#1| .cse93) .cse12 (= |ULTIMATE.start_main_~z~0#1| .cse97) (= .cse1 .cse17) (= .cse14 .cse9) .cse16 .cse20 (= .cse104 .cse11) .cse21 .cse33 (= (+ .cse105 (* .cse106 (- 1))) 1) (= (+ .cse98 (+ |ULTIMATE.start_main_~x~0#1| .cse98) 6) 0) (= .cse100 .cse17) (or .cse107 .cse3) .cse35 (= |ULTIMATE.start_main_~x~0#1| (+ 1 .cse104)) (= |ULTIMATE.start_main_~n~0#1| .cse92) (= .cse108 (+ 6 .cse106)) .cse36))))))))))))))) [2023-02-18 16:43:23,387 INFO L895 garLoopResultBuilder]: At program point L33-3(lines 33 46) the Hoare annotation is: (let ((.cse92 (+ 1 |ULTIMATE.start_main_~n~0#1|)) (.cse54 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse71 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse128 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse118 (div (- |ULTIMATE.start_main_~z~0#1|) (- 6)))) (let ((.cse117 (+ .cse118 1)) (.cse78 (+ 6 .cse128)) (.cse129 (+ .cse54 .cse71)) (.cse75 (+ .cse71 .cse128)) (.cse79 (+ 1 .cse92))) (let ((.cse120 (+ 1 .cse79)) (.cse126 (+ .cse129 .cse75)) (.cse125 (+ .cse75 .cse78)) (.cse127 (+ 6 .cse78)) (.cse124 (+ .cse117 1))) (let ((.cse98 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse119 (+ .cse124 1)) (.cse123 (+ 6 .cse127)) (.cse122 (+ .cse126 .cse125)) (.cse121 (+ .cse125 .cse127)) (.cse115 (+ 1 .cse120))) (let ((.cse90 (* 6 |ULTIMATE.start_main_~n~0#1|)) (.cse131 (+ |ULTIMATE.start_main_~a~0#1| 65536)) (.cse83 (* (div (+ (- |ULTIMATE.start_main_~a~0#1|) (- 1)) 65536) 65536)) (.cse107 (+ 1 .cse115)) (.cse113 (+ .cse122 .cse121)) (.cse116 (+ .cse121 .cse123)) (.cse114 (+ 6 .cse123)) (.cse112 (+ .cse119 1)) (.cse53 (* .cse98 .cse54)) (.cse56 (* 12 .cse54))) (let ((.cse23 (= (mod (* |ULTIMATE.start_main_~z~0#1| 5) 6) 0)) (.cse57 (* (* 2 .cse71) .cse71)) (.cse58 (* 3 .cse54)) (.cse59 (- (* 18 .cse54))) (.cse60 (- (* 10 .cse71))) (.cse69 (= 0 (+ (+ .cse53 (- (* .cse54 .cse128))) .cse56))) (.cse77 (- (* 18 .cse129))) (.cse106 (+ .cse112 1)) (.cse110 (+ 6 .cse114)) (.cse109 (+ .cse113 .cse116)) (.cse108 (+ .cse116 .cse114)) (.cse111 (+ 1 .cse107)) (.cse130 (+ .cse83 65536)) (.cse82 (* |ULTIMATE.start_main_~a~0#1| (- 1))) (.cse81 (< .cse131 65536)) (.cse47 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767)) (.cse84 (<= 0 .cse131)) (.cse55 (+ 6 (* 6 .cse92))) (.cse41 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse90)))) (let ((.cse11 (<= |ULTIMATE.start_main_~a~0#1| 50)) (.cse7 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse51 (+ |ULTIMATE.start_main_~a~0#1| 1)) (.cse28 (not .cse41)) (.cse61 (not (= .cse55 .cse128))) (.cse43 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse68 (- (* 12 |ULTIMATE.start_main_~y~0#1|))) (.cse46 (and .cse81 (not .cse47) .cse84)) (.cse85 (<= .cse130 (+ .cse82 32767))) (.cse48 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse49 (< |ULTIMATE.start_main_~a~0#1| 65536)) (.cse86 (<= .cse130 (+ .cse82 65535))) (.cse80 (+ .cse118 (- 1))) (.cse2 (= 0 (+ (+ (* .cse98 |ULTIMATE.start_main_~x~0#1|) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 12 |ULTIMATE.start_main_~x~0#1|)))) (.cse91 (- (* 18 |ULTIMATE.start_main_~x~0#1|))) (.cse50 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse52 (+ 1 0)) (.cse97 (+ 1 .cse111)) (.cse105 (+ .cse109 .cse108)) (.cse102 (+ .cse108 .cse110)) (.cse103 (+ 6 .cse110)) (.cse104 (+ .cse106 1)) (.cse72 (not (= 0 (+ (+ (* .cse98 .cse129) (- (* .cse129 .cse78))) (* 12 .cse129))))) (.cse73 (not (<= .cse92 |ULTIMATE.start_main_~a~0#1|))) (.cse74 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse75) .cse75) (- (* (* 3 .cse129) .cse78))) .cse77) (- (* 10 .cse75))) (* 3 .cse78)) (- 10)))) (.cse93 (not .cse69)) (.cse94 (= 0 (+ (+ (+ (+ (+ .cse57 (- (* .cse58 .cse128))) .cse59) .cse60) (* 3 .cse128)) (- 10)))) (.cse15 (not (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))) (.cse95 (not .cse23)) (.cse65 (not (= 0 (+ (+ (* .cse98 .cse126) (- (* .cse126 .cse127))) (* 12 .cse126))))) (.cse66 (not (<= .cse79 |ULTIMATE.start_main_~a~0#1|))) (.cse67 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse125) .cse125) (- (* (* 3 .cse126) .cse127))) (- (* 18 .cse126))) (- (* 10 .cse125))) (* 3 .cse127)) (- 10))))) (let ((.cse19 (or (<= .cse124 |ULTIMATE.start_main_~a~0#1|) .cse95 .cse65 .cse66 (not (<= .cse124 .cse120)) .cse67)) (.cse21 (or .cse95 (not (<= .cse119 .cse115)) (not (<= .cse120 |ULTIMATE.start_main_~a~0#1|)) (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse121) .cse121) (- (* (* 3 .cse122) .cse123))) (- (* 18 .cse122))) (- (* 10 .cse121))) (* 3 .cse123)) (- 10))) (<= .cse119 |ULTIMATE.start_main_~a~0#1|) (not (= 0 (+ (+ (* .cse98 .cse122) (- (* .cse122 .cse123))) (* 12 .cse122)))))) (.cse26 (or .cse95 (<= .cse118 |ULTIMATE.start_main_~a~0#1|) .cse93 (not (<= .cse118 .cse92)) .cse94 .cse15)) (.cse27 (or .cse95 .cse72 (<= .cse117 |ULTIMATE.start_main_~a~0#1|) (not (<= .cse117 .cse79)) .cse73 .cse74)) (.cse37 (or .cse95 (not (<= .cse112 .cse107)) (not (= 0 (+ (+ (* .cse98 .cse113) (- (* .cse113 .cse114))) (* 12 .cse113)))) (not (<= .cse115 |ULTIMATE.start_main_~a~0#1|)) (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse116) .cse116) (- (* (* 3 .cse113) .cse114))) (- (* 18 .cse113))) (- (* 10 .cse116))) (* 3 .cse114)) (- 10))) (<= .cse112 |ULTIMATE.start_main_~a~0#1|))) (.cse38 (or (not (= 0 (+ (+ (* .cse98 .cse105) (- (* .cse105 .cse103))) (* 12 .cse105)))) (not (<= .cse104 .cse97)) .cse95 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse102) .cse102) (- (* (* 3 .cse105) .cse103))) (- (* 18 .cse105))) (- (* 10 .cse102))) (* 3 .cse103)) (- 10))) (not (<= .cse111 |ULTIMATE.start_main_~a~0#1|)) (<= .cse104 |ULTIMATE.start_main_~a~0#1|))) (.cse39 (or (<= .cse106 |ULTIMATE.start_main_~a~0#1|) (not (<= .cse107 |ULTIMATE.start_main_~a~0#1|)) .cse95 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse108) .cse108) (- (* (* 3 .cse109) .cse110))) (- (* 18 .cse109))) (- (* 10 .cse108))) (* 3 .cse110)) (- 10))) (not (<= .cse106 .cse111)) (not (= 0 (+ (+ (* .cse98 .cse109) (- (* .cse109 .cse110))) (* 12 .cse109)))))) (.cse42 (let ((.cse99 (+ .cse105 .cse102)) (.cse100 (+ 6 .cse103)) (.cse96 (+ .cse104 1))) (or .cse95 (not (<= .cse96 (+ 1 .cse97))) (not (= 0 (+ (+ (* .cse98 .cse99) (- (* .cse99 .cse100))) (* 12 .cse99)))) (not (<= .cse97 |ULTIMATE.start_main_~a~0#1|)) (= 0 (+ (+ (let ((.cse101 (+ .cse102 .cse103))) (+ (+ (+ (* (* 2 .cse101) .cse101) (- (* (* 3 .cse99) .cse100))) (- (* 18 .cse99))) (- (* 10 .cse101)))) (* 3 .cse100)) (- 10))) (<= .cse96 |ULTIMATE.start_main_~a~0#1|)))) (.cse14 (+ 1 .cse52)) (.cse18 (= 0 (+ 12 (+ (+ (* .cse50 .cse50) (- (* 12 (+ |ULTIMATE.start_main_~y~0#1| (* .cse50 (- 1)))))) (- (* 6 .cse50)))))) (.cse29 (= 0 (+ (+ (+ (+ (+ (* (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))) .cse91) (- (* 10 |ULTIMATE.start_main_~y~0#1|))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)))) (.cse30 (not .cse2)) (.cse20 (or .cse93 .cse94 .cse15)) (.cse4 (= .cse54 (* (* .cse92 .cse92) .cse92))) (.cse22 (<= (+ .cse80 (- 1)) |ULTIMATE.start_main_~a~0#1|)) (.cse24 (or .cse46 (and .cse85 .cse48 .cse49 .cse86))) (.cse6 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) .cse91) .cse68) (* 2 |ULTIMATE.start_main_~z~0#1|)) (- 6)))) (.cse10 (let ((.cse89 (= |ULTIMATE.start_main_~z~0#1| (+ .cse90 6)))) (or (let ((.cse88 (* (- 6) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse87 (<= (+ |ULTIMATE.start_main_~z~0#1| .cse88 (- 6)) 0))) (and (or (not .cse87) (<= 0 .cse50) (not (<= (+ |ULTIMATE.start_main_~z~0#1| .cse88 (- 5)) 0))) (not .cse89) .cse43 (or .cse87 (<= |ULTIMATE.start_main_~z~0#1| 6))))) .cse89))) (.cse25 (or (and .cse81 (<= (+ .cse82 (- 65536)) .cse83) .cse84 (<= (+ .cse82 (- 32768)) .cse83)) (and .cse85 .cse48 .cse86 .cse49))) (.cse12 (= |ULTIMATE.start_main_~x~0#1| (* (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~n~0#1|))) (.cse31 (not (<= .cse80 |ULTIMATE.start_main_~a~0#1|))) (.cse32 (let ((.cse76 (+ 6 (* 6 .cse79)))) (or (= 0 (+ (+ (+ (+ (* .cse75 .cse76) .cse77) (- (* 12 .cse75))) (* 2 .cse76)) (- 6))) (not (= .cse76 .cse78))))) (.cse33 (<= (+ |ULTIMATE.start_main_~n~0#1| (- 1)) |ULTIMATE.start_main_~a~0#1|)) (.cse34 (or .cse72 .cse73 .cse74)) (.cse35 (or (= 0 (+ (+ (+ (+ (* .cse71 .cse55) .cse59) (- (* 12 .cse71))) (* 2 .cse55)) (- 6))) .cse61)) (.cse36 (or .cse28 .cse2)) (.cse1 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (let ((.cse70 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ (* .cse70 |ULTIMATE.start_main_~n~0#1|) .cse70))))) (.cse3 (or (< (+ |ULTIMATE.start_main_~n~0#1| 1) .cse51) .cse69 .cse15)) (.cse5 (= 0 (+ 12 (+ (+ (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) .cse68) (- (* 6 |ULTIMATE.start_main_~z~0#1|)))))) (.cse13 (or (and .cse7 .cse11 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not .cse11) (not .cse7))))) (.cse40 (or .cse65 .cse66 .cse67))) (or (let ((.cse17 (+ (* |ULTIMATE.start_main_~y~0#1| (- 1)) |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (- 6)))) (let ((.cse16 (+ |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~x~0#1| (- 1)) .cse17))) (let ((.cse8 (+ |ULTIMATE.start_main_~y~0#1| (* .cse16 (- 1))))) (let ((.cse0 (+ (* .cse8 (- 1)) .cse17 6))) (let ((.cse9 (+ .cse8 .cse0 (* .cse17 (- 1))))) (and (= .cse0 0) (= |ULTIMATE.start_main_~z~0#1| (+ 6 12)) (= |ULTIMATE.start_main_~y~0#1| (+ (+ 1 (+ 12 (- 6))) 12)) .cse1 (= |ULTIMATE.start_main_~n~0#1| (+ 1 1)) (<= 1 |ULTIMATE.start_main_~a~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= (+ .cse8 (* .cse9 (- 1))) 1) .cse10 .cse11 .cse12 .cse13 (= |ULTIMATE.start_main_~n~0#1| .cse14) .cse15 (= .cse16 (+ 6 .cse9)))))))) (and .cse18 .cse19 .cse20 .cse21 .cse4 .cse22 .cse23 .cse24 .cse6 .cse10 .cse11 .cse25 .cse26 .cse12 .cse27 (or .cse28 .cse29 .cse30) .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse1 .cse3 .cse37 .cse38 .cse39 .cse5 .cse7 .cse13 .cse40 .cse41 .cse42) (and (= |ULTIMATE.start_main_~y~0#1| 1) .cse43 (= |ULTIMATE.start_main_~x~0#1| 0) .cse10 (= |ULTIMATE.start_main_~z~0#1| 6)) (let ((.cse44 (+ (* 48 2) 73)) (.cse45 (+ 1 (+ 1 5)))) (and (= |ULTIMATE.start_main_~z~0#1| (+ 6 48)) .cse18 (= |ULTIMATE.start_main_~x~0#1| (+ (+ 48 295) .cse44)) .cse20 .cse4 .cse22 .cse23 .cse24 .cse6 .cse10 .cse11 .cse25 .cse12 (= |ULTIMATE.start_main_~y~0#1| (+ .cse44 48)) .cse31 .cse32 .cse33 .cse34 .cse35 (<= .cse45 |ULTIMATE.start_main_~a~0#1|) .cse36 .cse1 (<= |ULTIMATE.start_main_~n~0#1| (+ 1 .cse45)) .cse3 (or .cse46 (and .cse47 .cse48 .cse49)) .cse5 .cse7 .cse13 .cse40 .cse15 .cse41)) (and (= .cse50 (+ 6 (* 6 0))) (= .cse50 6) (= (+ (* 1 (- 1)) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (+ |ULTIMATE.start_main_~y~0#1| (- 1)))) .cse1 .cse48 (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse50)) .cse3 .cse4 (<= .cse51 1) .cse6 .cse7 (<= |ULTIMATE.start_main_~n~0#1| .cse52) .cse10 .cse11 (= |ULTIMATE.start_main_~n~0#1| .cse52) .cse12 .cse13 (= |ULTIMATE.start_main_~x~0#1| 1)) (and .cse18 .cse19 .cse20 .cse21 .cse4 .cse22 .cse23 .cse24 (or (not (= 0 (+ (+ .cse53 (- (* .cse54 .cse55))) .cse56))) (= 0 (+ (+ (+ (+ (+ .cse57 (- (* .cse58 .cse55))) .cse59) .cse60) (* 3 .cse55)) (- 10))) .cse61) .cse6 .cse10 .cse11 .cse25 .cse26 .cse12 .cse27 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse1 .cse3 .cse37 .cse38 .cse39 .cse5 .cse7 .cse13 .cse40 .cse41 .cse42) (let ((.cse62 (+ 6 6)) (.cse63 (+ 7 (+ 18 (- 6))))) (and (<= .cse14 |ULTIMATE.start_main_~a~0#1|) .cse18 (= |ULTIMATE.start_main_~z~0#1| (+ 6 18)) (= (+ |ULTIMATE.start_main_~x~0#1| (* 19 (- 1))) (+ 1 (+ 19 (* .cse62 (- 1))))) .cse4 .cse22 .cse23 .cse24 .cse6 .cse10 .cse11 .cse25 .cse12 (<= |ULTIMATE.start_main_~n~0#1| (+ 1 2)) .cse31 .cse32 .cse33 (<= 2 |ULTIMATE.start_main_~a~0#1|) .cse35 .cse1 (= |ULTIMATE.start_main_~y~0#1| (+ .cse63 18)) .cse3 .cse5 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (+ 6 .cse62))) .cse7 (= (let ((.cse64 (* 7 (- 1)))) (+ .cse64 (+ (+ |ULTIMATE.start_main_~x~0#1| (* .cse63 (- 1))) .cse64) 6)) 0) .cse13 .cse15 .cse41)) (and .cse18 (or .cse29 .cse30) .cse20 .cse4 .cse22 .cse23 .cse24 .cse6 .cse10 .cse11 .cse25 .cse12 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse1 .cse3 .cse5 .cse7 .cse13 .cse40 .cse41)))))))))) [2023-02-18 16:43:23,387 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_main_~x~0#1| 0)) (.cse1 (= |ULTIMATE.start_main_~y~0#1| 1)) (.cse4 (= |ULTIMATE.start_main_~z~0#1| 6)) (.cse2 (= |ULTIMATE.start_main_~n~0#1| 0))) (let ((.cse0 (let ((.cse5 (let ((.cse6 (let ((.cse10 (= |ULTIMATE.start_main_~z~0#1| (+ (* 6 |ULTIMATE.start_main_~n~0#1|) 6)))) (or (let ((.cse9 (* (- 6) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse8 (<= (+ |ULTIMATE.start_main_~z~0#1| .cse9 (- 6)) 0))) (and (or (not .cse8) (<= 0 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (not (<= (+ |ULTIMATE.start_main_~z~0#1| .cse9 (- 5)) 0))) (not .cse10) .cse2 (or .cse8 (<= |ULTIMATE.start_main_~z~0#1| 6))))) .cse10)))) (or (and .cse6 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (let ((.cse7 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ (* .cse7 |ULTIMATE.start_main_~n~0#1|) .cse7))))) (and .cse1 .cse2 .cse6 .cse4))))) (or (and .cse2 .cse3 .cse5 .cse4) (and .cse5 (= |ULTIMATE.start_main_~x~0#1| (* (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~n~0#1|))))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (- (* 18 |ULTIMATE.start_main_~x~0#1|))) (- (* 12 |ULTIMATE.start_main_~y~0#1|))) (* 2 |ULTIMATE.start_main_~z~0#1|)) (- 6))))))) [2023-02-18 16:43:23,388 INFO L895 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (let ((.cse113 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse96 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse99 (+ 6 |ULTIMATE.start_main_~z~0#1|))) (let ((.cse11 (<= |ULTIMATE.start_main_~a~0#1| 50)) (.cse10 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse87 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse0 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse91 (* 6 |ULTIMATE.start_main_~n~0#1|)) (.cse111 (- (* 18 |ULTIMATE.start_main_~x~0#1|))) (.cse121 (- (* 12 |ULTIMATE.start_main_~y~0#1|))) (.cse38 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse40 (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|))) (.cse41 (* 12 |ULTIMATE.start_main_~x~0#1|)) (.cse122 (+ |ULTIMATE.start_main_~a~0#1| 65536)) (.cse106 (* (div (+ (- |ULTIMATE.start_main_~a~0#1|) (- 1)) 65536) 65536)) (.cse49 (+ 1 |ULTIMATE.start_main_~n~0#1|)) (.cse100 (+ .cse96 .cse99)) (.cse103 (+ 6 .cse99)) (.cse112 (+ .cse113 .cse96))) (let ((.cse102 (- (* 18 .cse112))) (.cse98 (- (* 18 .cse113))) (.cse77 (+ .cse100 .cse103)) (.cse53 (+ 1 .cse49)) (.cse76 (+ 6 .cse103)) (.cse78 (+ .cse112 .cse100)) (.cse47 (div (- |ULTIMATE.start_main_~z~0#1|) (- 6))) (.cse115 (+ .cse106 65536)) (.cse105 (* |ULTIMATE.start_main_~a~0#1| (- 1))) (.cse104 (< .cse122 65536)) (.cse22 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767)) (.cse107 (<= 0 .cse122)) (.cse94 (= 0 (+ (+ (* .cse38 |ULTIMATE.start_main_~x~0#1|) .cse40) .cse41))) (.cse86 (= .cse113 (* (* .cse49 .cse49) .cse49))) (.cse71 (= 0 (+ 12 (+ (+ (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) .cse121) (- (* 6 |ULTIMATE.start_main_~z~0#1|)))))) (.cse46 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) .cse111) .cse121) (* 2 |ULTIMATE.start_main_~z~0#1|)) (- 6)))) (.cse1 (let ((.cse120 (= |ULTIMATE.start_main_~z~0#1| (+ .cse91 6)))) (or (let ((.cse119 (* (- 6) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse118 (<= (+ |ULTIMATE.start_main_~z~0#1| .cse119 (- 6)) 0))) (and (or (not .cse118) (<= 0 .cse87) (not (<= (+ |ULTIMATE.start_main_~z~0#1| .cse119 (- 5)) 0))) (not .cse120) .cse0 (or .cse118 (<= |ULTIMATE.start_main_~z~0#1| 6))))) .cse120))) (.cse88 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (let ((.cse117 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ (* .cse117 |ULTIMATE.start_main_~n~0#1|) .cse117))))) (.cse90 (= |ULTIMATE.start_main_~x~0#1| (* (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~n~0#1|))) (.cse14 (or (and .cse10 .cse11 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not .cse11) (not .cse10))))) (.cse114 (= 0 (+ (+ (* .cse38 .cse113) (- (* .cse113 .cse99))) (* 12 .cse113)))) (.cse26 (not (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)))) (let ((.cse89 (+ 1 0)) (.cse81 (let ((.cse116 (or (< (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1)) .cse114 .cse26))) (or (and .cse86 .cse71 .cse46 .cse10 .cse1 .cse11 .cse88 .cse90 .cse14 .cse94 .cse116) (and .cse86 .cse71 .cse46 .cse10 .cse1 .cse11 .cse88 .cse90 .cse14 .cse116)))) (.cse21 (and .cse104 (not .cse22) .cse107)) (.cse108 (<= .cse115 (+ .cse105 32767))) (.cse23 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse24 (< |ULTIMATE.start_main_~a~0#1| 65536)) (.cse109 (<= .cse115 (+ .cse105 65535))) (.cse110 (+ .cse47 (- 1))) (.cse29 (not (= 0 (+ (+ (* .cse38 .cse78) (- (* .cse78 .cse76))) (* 12 .cse78))))) (.cse30 (not (<= .cse53 |ULTIMATE.start_main_~a~0#1|))) (.cse32 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse77) .cse77) (- (* (* 3 .cse78) .cse76))) (- (* 18 .cse78))) (- (* 10 .cse77))) (* 3 .cse76)) (- 10)))) (.cse48 (not .cse114)) (.cse50 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse96) .cse96) (- (* (* 3 .cse113) .cse99))) .cse98) (- (* 10 .cse96))) (* 3 .cse99)) (- 10)))) (.cse51 (not (= 0 (+ (+ (* .cse38 .cse112) (- (* .cse112 .cse103))) (* 12 .cse112))))) (.cse54 (not (<= .cse49 |ULTIMATE.start_main_~a~0#1|))) (.cse55 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse100) .cse100) (- (* (* 3 .cse112) .cse103))) .cse102) (- (* 10 .cse100))) (* 3 .cse103)) (- 10))))) (let ((.cse17 (or .cse51 .cse54 .cse55)) (.cse20 (or .cse48 .cse50 .cse26)) (.cse25 (or .cse29 .cse30 .cse32)) (.cse2 (not (<= .cse110 |ULTIMATE.start_main_~a~0#1|))) (.cse3 (<= (+ |ULTIMATE.start_main_~n~0#1| (- 1)) |ULTIMATE.start_main_~a~0#1|)) (.cse79 (= 0 (+ (+ (+ (+ (+ (* (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))) .cse111) (- (* 10 |ULTIMATE.start_main_~y~0#1|))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)))) (.cse5 (= 0 (+ 12 (+ (+ (* .cse87 .cse87) (- (* 12 (+ |ULTIMATE.start_main_~y~0#1| (* .cse87 (- 1)))))) (- (* 6 .cse87)))))) (.cse7 (<= (+ .cse110 (- 1)) |ULTIMATE.start_main_~a~0#1|)) (.cse8 (= (mod (* |ULTIMATE.start_main_~z~0#1| 5) 6) 0)) (.cse9 (or .cse21 (and .cse108 .cse23 .cse24 .cse109))) (.cse13 (or (and .cse104 (<= (+ .cse105 (- 65536)) .cse106) .cse107 (<= (+ .cse105 (- 32768)) .cse106)) (and .cse108 .cse23 .cse109 .cse24))) (.cse15 (let ((.cse92 (let ((.cse101 (+ 6 (* 6 .cse53)))) (or (= 0 (+ (+ (+ (+ (* .cse100 .cse101) .cse102) (- (* 12 .cse100))) (* 2 .cse101)) (- 6))) (not (= .cse101 .cse103))))) (.cse93 (let ((.cse97 (+ 6 (* 6 .cse49)))) (or (= 0 (+ (+ (+ (+ (* .cse96 .cse97) .cse98) (- (* 12 .cse96))) (* 2 .cse97)) (- 6))) (not (= .cse97 .cse99)))))) (or (and .cse92 .cse93 .cse46 .cse81 .cse10 .cse11 .cse14 .cse94) (let ((.cse95 (+ 6 6))) (and .cse92 (<= 2 |ULTIMATE.start_main_~a~0#1|) .cse93 .cse46 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (+ 6 .cse95))) .cse81 .cse10 .cse11 .cse14 (= (+ |ULTIMATE.start_main_~x~0#1| (* 19 (- 1))) (+ 1 (+ 19 (* .cse95 (- 1))))) .cse26 (<= |ULTIMATE.start_main_~n~0#1| (+ 1 2))))))) (.cse16 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse91))) (.cse4 (+ 1 .cse89))) (or (and (= |ULTIMATE.start_main_~y~0#1| 1) .cse0 (= |ULTIMATE.start_main_~x~0#1| 0) .cse1 (= |ULTIMATE.start_main_~z~0#1| 6)) (let ((.cse6 (+ 7 (+ 18 (- 6))))) (and .cse2 .cse3 (<= .cse4 |ULTIMATE.start_main_~a~0#1|) .cse5 (= |ULTIMATE.start_main_~z~0#1| (+ 6 18)) (= |ULTIMATE.start_main_~y~0#1| (+ .cse6 18)) .cse7 .cse8 .cse9 .cse10 .cse11 (= (let ((.cse12 (* 7 (- 1)))) (+ .cse12 (+ (+ |ULTIMATE.start_main_~x~0#1| (* .cse6 (- 1))) .cse12) 6)) 0) .cse13 .cse14 .cse15 .cse16)) (let ((.cse19 (+ 1 (+ 1 5))) (.cse18 (+ (* 48 2) 73))) (and .cse2 .cse3 (= |ULTIMATE.start_main_~z~0#1| (+ 6 48)) .cse17 .cse5 (= |ULTIMATE.start_main_~x~0#1| (+ (+ 48 295) .cse18)) (<= .cse19 |ULTIMATE.start_main_~a~0#1|) .cse20 (<= |ULTIMATE.start_main_~n~0#1| (+ 1 .cse19)) .cse7 (or .cse21 (and .cse22 .cse23 .cse24)) .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 (= |ULTIMATE.start_main_~y~0#1| (+ .cse18 48)) .cse15 .cse25 .cse26 .cse16)) (let ((.cse52 (+ .cse47 1))) (let ((.cse31 (+ 1 .cse53)) (.cse27 (+ .cse52 1))) (let ((.cse36 (+ .cse78 .cse77)) (.cse35 (+ .cse77 .cse76)) (.cse37 (+ 6 .cse76)) (.cse33 (+ .cse27 1)) (.cse34 (+ 1 .cse31))) (let ((.cse57 (+ 1 .cse34)) (.cse56 (+ .cse33 1)) (.cse59 (+ 6 .cse37)) (.cse58 (+ .cse36 .cse35)) (.cse60 (+ .cse35 .cse37))) (let ((.cse69 (+ .cse58 .cse60)) (.cse68 (+ .cse60 .cse59)) (.cse70 (+ 6 .cse59)) (.cse67 (+ .cse56 1)) (.cse66 (+ 1 .cse57))) (let ((.cse28 (not .cse8)) (.cse64 (+ 1 .cse66)) (.cse63 (+ .cse67 1)) (.cse62 (+ 6 .cse70)) (.cse61 (+ .cse69 .cse68)) (.cse65 (+ .cse68 .cse70))) (and .cse5 (or (<= .cse27 |ULTIMATE.start_main_~a~0#1|) .cse28 .cse29 .cse30 (not (<= .cse27 .cse31)) .cse32) .cse20 (or .cse28 (not (<= .cse33 .cse34)) (not (<= .cse31 |ULTIMATE.start_main_~a~0#1|)) (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse35) .cse35) (- (* (* 3 .cse36) .cse37))) (- (* 18 .cse36))) (- (* 10 .cse35))) (* 3 .cse37)) (- 10))) (<= .cse33 |ULTIMATE.start_main_~a~0#1|) (not (= 0 (+ (+ (* .cse38 .cse36) (- (* .cse36 .cse37))) (* 12 .cse36))))) (or (exists ((|aux_div_ULTIMATE.start_main_~a~0#1_40| Int) (|aux_mod_ULTIMATE.start_main_~a~0#1_40| Int)) (let ((.cse39 (+ (* |aux_div_ULTIMATE.start_main_~a~0#1_40| 65536) |aux_mod_ULTIMATE.start_main_~a~0#1_40|))) (let ((.cse42 (+ .cse39 65536))) (and (<= .cse39 50) (not (<= |aux_mod_ULTIMATE.start_main_~a~0#1_40| 32767)) (= 0 (+ (+ (* (* 6 .cse39) |ULTIMATE.start_main_~x~0#1|) .cse40) .cse41)) (>= .cse39 0) (<= 0 |aux_mod_ULTIMATE.start_main_~a~0#1_40|) (<= 0 .cse42) (< |aux_mod_ULTIMATE.start_main_~a~0#1_40| 65536) (< .cse42 65536))))) (exists ((|aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51| Int) (|aux_div_ULTIMATE.start_main_~a~0#1_54| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51| Int)) (let ((.cse43 (+ |aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51| (* |aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51| 65536)))) (let ((.cse44 (+ (* |aux_div_ULTIMATE.start_main_~a~0#1_54| (- 65536)) (* .cse43 (- 1)) (- 1)))) (let ((.cse45 (* .cse44 (- 1)))) (and (<= 0 .cse43) (<= 0 |aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51|) (<= 0 .cse44) (< .cse44 65536) (>= .cse44 0) (= 0 (+ (+ (* (* 6 .cse44) |ULTIMATE.start_main_~x~0#1|) .cse40) .cse41)) (< |aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51| 65536) (<= .cse44 50) (< .cse43 65536) (<= (+ (* |aux_div_ULTIMATE.start_main_~a~0#1_54| 65536) 65536) (+ .cse45 32767)) (<= (+ (* (+ |aux_div_ULTIMATE.start_main_~a~0#1_54| |aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51|) 65536) 65536) (+ .cse45 65535)))))))) .cse7 .cse8 .cse9 .cse46 .cse11 .cse13 (or .cse28 (<= .cse47 |ULTIMATE.start_main_~a~0#1|) .cse48 (not (<= .cse47 .cse49)) .cse50 .cse26) (or .cse28 .cse51 (<= .cse52 |ULTIMATE.start_main_~a~0#1|) (not (<= .cse52 .cse53)) .cse54 .cse55) .cse15 .cse2 .cse3 .cse17 (or .cse28 (not (<= .cse56 .cse57)) (not (= 0 (+ (+ (* .cse38 .cse58) (- (* .cse58 .cse59))) (* 12 .cse58)))) (not (<= .cse34 |ULTIMATE.start_main_~a~0#1|)) (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse60) .cse60) (- (* (* 3 .cse58) .cse59))) (- (* 18 .cse58))) (- (* 10 .cse60))) (* 3 .cse59)) (- 10))) (<= .cse56 |ULTIMATE.start_main_~a~0#1|)) (or (not (= 0 (+ (+ (* .cse38 .cse61) (- (* .cse61 .cse62))) (* 12 .cse61)))) (not (<= .cse63 .cse64)) .cse28 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse65) .cse65) (- (* (* 3 .cse61) .cse62))) (- (* 18 .cse61))) (- (* 10 .cse65))) (* 3 .cse62)) (- 10))) (not (<= .cse66 |ULTIMATE.start_main_~a~0#1|)) (<= .cse63 |ULTIMATE.start_main_~a~0#1|)) (or (<= .cse67 |ULTIMATE.start_main_~a~0#1|) (not (<= .cse57 |ULTIMATE.start_main_~a~0#1|)) .cse28 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse68) .cse68) (- (* (* 3 .cse69) .cse70))) (- (* 18 .cse69))) (- (* 10 .cse68))) (* 3 .cse70)) (- 10))) (not (<= .cse67 .cse66)) (not (= 0 (+ (+ (* .cse38 .cse69) (- (* .cse69 .cse70))) (* 12 .cse69))))) .cse71 .cse10 .cse14 .cse25 .cse16 (let ((.cse73 (+ .cse61 .cse65)) (.cse74 (+ 6 .cse62)) (.cse72 (+ .cse63 1))) (or .cse28 (not (<= .cse72 (+ 1 .cse64))) (not (= 0 (+ (+ (* .cse38 .cse73) (- (* .cse73 .cse74))) (* 12 .cse73)))) (not (<= .cse64 |ULTIMATE.start_main_~a~0#1|)) (= 0 (+ (+ (let ((.cse75 (+ .cse65 .cse62))) (+ (+ (+ (* (* 2 .cse75) .cse75) (- (* (* 3 .cse73) .cse74))) (- (* 18 .cse73))) (- (* 10 .cse75)))) (* 3 .cse74)) (- 10))) (<= .cse72 |ULTIMATE.start_main_~a~0#1|)))))))))) (and .cse2 .cse3 .cse79 .cse17 .cse5 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse25 .cse16) (and .cse2 .cse3 .cse79 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16) (let ((.cse85 (+ (* |ULTIMATE.start_main_~y~0#1| (- 1)) |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (- 6)))) (let ((.cse84 (+ |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~x~0#1| (- 1)) .cse85))) (let ((.cse82 (+ |ULTIMATE.start_main_~y~0#1| (* .cse84 (- 1))))) (let ((.cse80 (+ (* .cse82 (- 1)) .cse85 6))) (let ((.cse83 (+ .cse82 .cse80 (* .cse85 (- 1))))) (and (= .cse80 0) .cse81 .cse10 (= (+ .cse82 (* .cse83 (- 1))) 1) .cse11 .cse14 (= |ULTIMATE.start_main_~n~0#1| .cse4) (= .cse84 (+ 6 .cse83)))))))) (and .cse86 (= .cse87 (+ 6 (* 6 0))) .cse46 (= .cse87 6) .cse1 .cse88 (= |ULTIMATE.start_main_~n~0#1| .cse89) .cse90 (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse87))))))))) [2023-02-18 16:43:23,390 INFO L895 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (let ((.cse82 (+ 1 |ULTIMATE.start_main_~n~0#1|)) (.cse40 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse100 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse121 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse80 (div (- |ULTIMATE.start_main_~z~0#1|) (- 6)))) (let ((.cse76 (+ .cse80 1)) (.cse104 (+ 6 .cse121)) (.cse117 (+ .cse40 .cse100)) (.cse101 (+ .cse100 .cse121)) (.cse77 (+ 1 .cse82))) (let ((.cse111 (+ 1 .cse77)) (.cse119 (+ .cse117 .cse101)) (.cse118 (+ .cse101 .cse104)) (.cse120 (+ 6 .cse104)) (.cse116 (+ .cse76 1))) (let ((.cse63 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse110 (+ .cse116 1)) (.cse114 (+ 6 .cse120)) (.cse113 (+ .cse119 .cse118)) (.cse112 (+ .cse118 .cse120)) (.cse108 (+ 1 .cse111))) (let ((.cse129 (+ |ULTIMATE.start_main_~a~0#1| 65536)) (.cse86 (* (div (+ (- |ULTIMATE.start_main_~a~0#1|) (- 1)) 65536) 65536)) (.cse91 (+ 1 .cse108)) (.cse106 (+ .cse113 .cse112)) (.cse109 (+ .cse112 .cse114)) (.cse107 (+ 6 .cse114)) (.cse105 (+ .cse110 1)) (.cse39 (* .cse63 .cse40)) (.cse42 (* 12 .cse40))) (let ((.cse103 (- (* 18 .cse117))) (.cse31 (= (mod (* |ULTIMATE.start_main_~z~0#1| 5) 6) 0)) (.cse43 (* (* 2 .cse100) .cse100)) (.cse44 (* 3 .cse40)) (.cse45 (- (* 18 .cse40))) (.cse46 (- (* 10 .cse100))) (.cse41 (+ 6 (* 6 .cse82))) (.cse11 (<= |ULTIMATE.start_main_~a~0#1| 50)) (.cse7 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse55 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse36 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse71 (* 6 |ULTIMATE.start_main_~n~0#1|)) (.cse115 (- (* 18 |ULTIMATE.start_main_~x~0#1|))) (.cse126 (- (* 12 |ULTIMATE.start_main_~y~0#1|))) (.cse56 (+ |ULTIMATE.start_main_~a~0#1| 1)) (.cse122 (= 0 (+ (+ .cse39 (- (* .cse40 .cse121))) .cse42))) (.cse15 (not (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))) (.cse90 (+ .cse105 1)) (.cse94 (+ 6 .cse107)) (.cse93 (+ .cse106 .cse109)) (.cse92 (+ .cse109 .cse107)) (.cse95 (+ 1 .cse91)) (.cse128 (+ .cse86 65536)) (.cse85 (* |ULTIMATE.start_main_~a~0#1| (- 1))) (.cse84 (< .cse129 65536)) (.cse28 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767)) (.cse87 (<= 0 .cse129))) (let ((.cse27 (and .cse84 (not .cse28) .cse87)) (.cse88 (<= .cse128 (+ .cse85 32767))) (.cse29 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse30 (< |ULTIMATE.start_main_~a~0#1| 65536)) (.cse89 (<= .cse128 (+ .cse85 65535))) (.cse62 (+ 1 .cse95)) (.cse70 (+ .cse93 .cse92)) (.cse67 (+ .cse92 .cse94)) (.cse68 (+ 6 .cse94)) (.cse69 (+ .cse90 1)) (.cse1 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (let ((.cse127 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ (* .cse127 |ULTIMATE.start_main_~n~0#1|) .cse127))))) (.cse3 (or (< (+ |ULTIMATE.start_main_~n~0#1| 1) .cse56) .cse122 .cse15)) (.cse4 (= .cse40 (* (* .cse82 .cse82) .cse82))) (.cse5 (= 0 (+ 12 (+ (+ (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) .cse126) (- (* 6 |ULTIMATE.start_main_~z~0#1|)))))) (.cse6 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) .cse115) .cse126) (* 2 |ULTIMATE.start_main_~z~0#1|)) (- 6)))) (.cse10 (let ((.cse125 (= |ULTIMATE.start_main_~z~0#1| (+ .cse71 6)))) (or (let ((.cse124 (* (- 6) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse123 (<= (+ |ULTIMATE.start_main_~z~0#1| .cse124 (- 6)) 0))) (and (or (not .cse123) (<= 0 .cse55) (not (<= (+ |ULTIMATE.start_main_~z~0#1| .cse124 (- 5)) 0))) (not .cse125) .cse36 (or .cse123 (<= |ULTIMATE.start_main_~z~0#1| 6))))) .cse125))) (.cse12 (= |ULTIMATE.start_main_~x~0#1| (* (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~n~0#1|))) (.cse13 (or (and .cse7 .cse11 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not .cse11) (not .cse7))))) (.cse47 (not (= .cse41 .cse121))) (.cse2 (= 0 (+ (+ (* .cse63 |ULTIMATE.start_main_~x~0#1|) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 12 |ULTIMATE.start_main_~x~0#1|)))) (.cse81 (not .cse122)) (.cse83 (= 0 (+ (+ (+ (+ (+ .cse43 (- (* .cse44 .cse121))) .cse45) .cse46) (* 3 .cse121)) (- 10)))) (.cse60 (not .cse31)) (.cse72 (not (= 0 (+ (+ (* .cse63 .cse119) (- (* .cse119 .cse120))) (* 12 .cse119))))) (.cse73 (not (<= .cse77 |ULTIMATE.start_main_~a~0#1|))) (.cse74 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse118) .cse118) (- (* (* 3 .cse119) .cse120))) (- (* 18 .cse119))) (- (* 10 .cse118))) (* 3 .cse120)) (- 10)))) (.cse75 (not (= 0 (+ (+ (* .cse63 .cse117) (- (* .cse117 .cse104))) (* 12 .cse117))))) (.cse78 (not (<= .cse82 |ULTIMATE.start_main_~a~0#1|))) (.cse79 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse101) .cse101) (- (* (* 3 .cse117) .cse104))) .cse103) (- (* 10 .cse101))) (* 3 .cse104)) (- 10)))) (.cse96 (+ .cse80 (- 1))) (.cse57 (+ 1 0))) (let ((.cse14 (+ 1 .cse57)) (.cse18 (not (<= .cse96 |ULTIMATE.start_main_~a~0#1|))) (.cse19 (<= (+ |ULTIMATE.start_main_~n~0#1| (- 1)) |ULTIMATE.start_main_~a~0#1|)) (.cse20 (or .cse75 .cse78 .cse79)) (.cse21 (= 0 (+ 12 (+ (+ (* .cse55 .cse55) (- (* 12 (+ |ULTIMATE.start_main_~y~0#1| (* .cse55 (- 1)))))) (- (* 6 .cse55)))))) (.cse37 (or (<= .cse116 |ULTIMATE.start_main_~a~0#1|) .cse60 .cse72 .cse73 (not (<= .cse116 .cse111)) .cse74)) (.cse24 (or .cse81 .cse83 .cse15)) (.cse54 (or (= 0 (+ (+ (+ (+ (+ (* (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))) .cse115) (- (* 10 |ULTIMATE.start_main_~y~0#1|))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10))) (not .cse2))) (.cse38 (or .cse60 (not (<= .cse110 .cse108)) (not (<= .cse111 |ULTIMATE.start_main_~a~0#1|)) (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse112) .cse112) (- (* (* 3 .cse113) .cse114))) (- (* 18 .cse113))) (- (* 10 .cse112))) (* 3 .cse114)) (- 10))) (<= .cse110 |ULTIMATE.start_main_~a~0#1|) (not (= 0 (+ (+ (* .cse63 .cse113) (- (* .cse113 .cse114))) (* 12 .cse113)))))) (.cse50 (or .cse60 (not (<= .cse105 .cse91)) (not (= 0 (+ (+ (* .cse63 .cse106) (- (* .cse106 .cse107))) (* 12 .cse106)))) (not (<= .cse108 |ULTIMATE.start_main_~a~0#1|)) (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse109) .cse109) (- (* (* 3 .cse106) .cse107))) (- (* 18 .cse106))) (- (* 10 .cse109))) (* 3 .cse107)) (- 10))) (<= .cse105 |ULTIMATE.start_main_~a~0#1|))) (.cse25 (let ((.cse97 (let ((.cse102 (+ 6 (* 6 .cse77)))) (or (= 0 (+ (+ (+ (+ (* .cse101 .cse102) .cse103) (- (* 12 .cse101))) (* 2 .cse102)) (- 6))) (not (= .cse102 .cse104))))) (.cse98 (or (= 0 (+ (+ (+ (+ (* .cse100 .cse41) .cse45) (- (* 12 .cse100))) (* 2 .cse41)) (- 6))) .cse47))) (or (let ((.cse99 (+ 6 6))) (and .cse97 (<= 2 |ULTIMATE.start_main_~a~0#1|) .cse98 .cse1 (= (+ |ULTIMATE.start_main_~x~0#1| (* 19 (- 1))) (+ 1 (+ 19 (* .cse99 (- 1))))) .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (+ 6 .cse99))) .cse7 .cse10 .cse11 .cse12 .cse13 .cse15 (<= |ULTIMATE.start_main_~n~0#1| (+ 1 2)))) (and .cse97 .cse98 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13)))) (.cse26 (<= (+ .cse96 (- 1)) |ULTIMATE.start_main_~a~0#1|)) (.cse51 (or (not (= 0 (+ (+ (* .cse63 .cse70) (- (* .cse70 .cse68))) (* 12 .cse70)))) (not (<= .cse69 .cse62)) .cse60 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse67) .cse67) (- (* (* 3 .cse70) .cse68))) (- (* 18 .cse70))) (- (* 10 .cse67))) (* 3 .cse68)) (- 10))) (not (<= .cse95 |ULTIMATE.start_main_~a~0#1|)) (<= .cse69 |ULTIMATE.start_main_~a~0#1|))) (.cse32 (or .cse27 (and .cse88 .cse29 .cse30 .cse89))) (.cse52 (or (<= .cse90 |ULTIMATE.start_main_~a~0#1|) (not (<= .cse91 |ULTIMATE.start_main_~a~0#1|)) .cse60 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse92) .cse92) (- (* (* 3 .cse93) .cse94))) (- (* 18 .cse93))) (- (* 10 .cse92))) (* 3 .cse94)) (- 10))) (not (<= .cse90 .cse95)) (not (= 0 (+ (+ (* .cse63 .cse93) (- (* .cse93 .cse94))) (* 12 .cse93)))))) (.cse33 (or (and .cse84 (<= (+ .cse85 (- 65536)) .cse86) .cse87 (<= (+ .cse85 (- 32768)) .cse86)) (and .cse88 .cse29 .cse89 .cse30))) (.cse48 (or .cse60 (<= .cse80 |ULTIMATE.start_main_~a~0#1|) .cse81 (not (<= .cse80 .cse82)) .cse83 .cse15)) (.cse49 (or .cse60 .cse75 (<= .cse76 |ULTIMATE.start_main_~a~0#1|) (not (<= .cse76 .cse77)) .cse78 .cse79)) (.cse34 (or .cse72 .cse73 .cse74)) (.cse35 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse71))) (.cse53 (let ((.cse64 (+ .cse70 .cse67)) (.cse65 (+ 6 .cse68)) (.cse61 (+ .cse69 1))) (or .cse60 (not (<= .cse61 (+ 1 .cse62))) (not (= 0 (+ (+ (* .cse63 .cse64) (- (* .cse64 .cse65))) (* 12 .cse64)))) (not (<= .cse62 |ULTIMATE.start_main_~a~0#1|)) (= 0 (+ (+ (let ((.cse66 (+ .cse67 .cse68))) (+ (+ (+ (* (* 2 .cse66) .cse66) (- (* (* 3 .cse64) .cse65))) (- (* 18 .cse64))) (- (* 10 .cse66)))) (* 3 .cse65)) (- 10))) (<= .cse61 |ULTIMATE.start_main_~a~0#1|))))) (or (let ((.cse17 (+ (* |ULTIMATE.start_main_~y~0#1| (- 1)) |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (- 6)))) (let ((.cse16 (+ |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~x~0#1| (- 1)) .cse17))) (let ((.cse8 (+ |ULTIMATE.start_main_~y~0#1| (* .cse16 (- 1))))) (let ((.cse0 (+ (* .cse8 (- 1)) .cse17 6))) (let ((.cse9 (+ .cse8 .cse0 (* .cse17 (- 1))))) (and (= .cse0 0) (= |ULTIMATE.start_main_~z~0#1| (+ 6 12)) (= |ULTIMATE.start_main_~y~0#1| (+ (+ 1 (+ 12 (- 6))) 12)) .cse1 (= |ULTIMATE.start_main_~n~0#1| (+ 1 1)) (<= 1 |ULTIMATE.start_main_~a~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= (+ .cse8 (* .cse9 (- 1))) 1) .cse10 .cse11 .cse12 .cse13 (= |ULTIMATE.start_main_~n~0#1| .cse14) .cse15 (= .cse16 (+ 6 .cse9)))))))) (let ((.cse23 (+ 1 (+ 1 5))) (.cse22 (+ (* 48 2) 73))) (and .cse18 .cse19 (= |ULTIMATE.start_main_~z~0#1| (+ 6 48)) .cse20 .cse21 (= |ULTIMATE.start_main_~x~0#1| (+ (+ 48 295) .cse22)) (<= .cse23 |ULTIMATE.start_main_~a~0#1|) .cse24 (<= |ULTIMATE.start_main_~n~0#1| (+ 1 .cse23)) .cse25 .cse26 (or .cse27 (and .cse28 .cse29 .cse30)) .cse31 .cse32 .cse7 .cse11 .cse33 .cse13 (= |ULTIMATE.start_main_~y~0#1| (+ .cse22 48)) .cse34 .cse15 .cse35)) (and (= |ULTIMATE.start_main_~y~0#1| 1) .cse36 (= |ULTIMATE.start_main_~x~0#1| 0) .cse10 (= |ULTIMATE.start_main_~z~0#1| 6)) (and .cse21 .cse37 .cse24 .cse38 .cse26 .cse31 .cse32 (or (not (= 0 (+ (+ .cse39 (- (* .cse40 .cse41))) .cse42))) (= 0 (+ (+ (+ (+ (+ .cse43 (- (* .cse44 .cse41))) .cse45) .cse46) (* 3 .cse41)) (- 10))) .cse47) .cse6 .cse11 .cse33 .cse48 .cse49 .cse18 .cse19 .cse20 .cse50 .cse25 .cse51 .cse52 .cse5 .cse7 .cse13 .cse34 .cse35 .cse53) (and .cse18 .cse19 .cse20 .cse21 .cse54 .cse24 .cse25 .cse26 .cse31 .cse32 .cse7 .cse11 .cse33 .cse13 .cse34 .cse35) (and (= .cse55 (+ 6 (* 6 0))) (= .cse55 6) (= (+ (* 1 (- 1)) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (+ |ULTIMATE.start_main_~y~0#1| (- 1)))) .cse1 .cse29 (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse55)) .cse3 .cse4 (<= .cse56 1) .cse6 .cse7 (<= |ULTIMATE.start_main_~n~0#1| .cse57) .cse10 .cse11 (= |ULTIMATE.start_main_~n~0#1| .cse57) .cse12 .cse13 (= |ULTIMATE.start_main_~x~0#1| 1)) (let ((.cse58 (+ 7 (+ 18 (- 6))))) (and .cse18 .cse19 (<= .cse14 |ULTIMATE.start_main_~a~0#1|) .cse21 (= |ULTIMATE.start_main_~z~0#1| (+ 6 18)) (= |ULTIMATE.start_main_~y~0#1| (+ .cse58 18)) .cse25 .cse26 .cse31 .cse32 .cse7 .cse11 (= (let ((.cse59 (* 7 (- 1)))) (+ .cse59 (+ (+ |ULTIMATE.start_main_~x~0#1| (* .cse58 (- 1))) .cse59) 6)) 0) .cse33 .cse13 .cse35)) (and .cse18 .cse19 .cse20 .cse21 .cse37 .cse24 .cse54 .cse38 .cse50 .cse25 .cse26 .cse51 .cse31 .cse32 .cse52 .cse7 .cse11 .cse33 .cse48 .cse13 .cse49 .cse34 .cse35 .cse53)))))))))) [2023-02-18 16:43:23,390 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 13) no Hoare annotation was computed. [2023-02-18 16:43:23,390 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-18 16:43:23,390 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 22 56) the Hoare annotation is: true [2023-02-18 16:43:23,390 INFO L899 garLoopResultBuilder]: For program point L38(lines 33 46) no Hoare annotation was computed. [2023-02-18 16:43:23,392 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (let ((.cse129 (+ 1 |ULTIMATE.start_main_~n~0#1|)) (.cse88 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse108 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse155 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse145 (div (- |ULTIMATE.start_main_~z~0#1|) (- 6)))) (let ((.cse144 (+ .cse145 1)) (.cse115 (+ 6 .cse155)) (.cse156 (+ .cse88 .cse108)) (.cse112 (+ .cse108 .cse155)) (.cse116 (+ 1 .cse129))) (let ((.cse147 (+ 1 .cse116)) (.cse153 (+ .cse156 .cse112)) (.cse152 (+ .cse112 .cse115)) (.cse154 (+ 6 .cse115)) (.cse151 (+ .cse144 1))) (let ((.cse146 (+ .cse151 1)) (.cse150 (+ 6 .cse154)) (.cse149 (+ .cse153 .cse152)) (.cse148 (+ .cse152 .cse154)) (.cse142 (+ 1 .cse147)) (.cse30 (* 6 |ULTIMATE.start_main_~a~0#1|))) (let ((.cse158 (+ |ULTIMATE.start_main_~a~0#1| 65536)) (.cse119 (* (div (+ (- |ULTIMATE.start_main_~a~0#1|) (- 1)) 65536) 65536)) (.cse126 (* 6 |ULTIMATE.start_main_~n~0#1|)) (.cse87 (* .cse30 .cse88)) (.cse90 (* 12 .cse88)) (.cse101 (+ 30 (- 6))) (.cse134 (+ 1 .cse142)) (.cse140 (+ .cse149 .cse148)) (.cse143 (+ .cse148 .cse150)) (.cse141 (+ 6 .cse150)) (.cse139 (+ .cse146 1))) (let ((.cse133 (+ .cse139 1)) (.cse137 (+ 6 .cse141)) (.cse136 (+ .cse140 .cse143)) (.cse135 (+ .cse143 .cse141)) (.cse6 (= (mod (* |ULTIMATE.start_main_~z~0#1| 5) 6) 0)) (.cse138 (+ 1 .cse134)) (.cse100 (+ .cse101 27 (- 14))) (.cse66 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse91 (* (* 2 .cse108) .cse108)) (.cse92 (* 3 .cse88)) (.cse93 (- (* 18 .cse88))) (.cse94 (- (* 10 .cse108))) (.cse80 (= 0 (+ (+ .cse87 (- (* .cse88 .cse155))) .cse90))) (.cse114 (- (* 18 .cse156))) (.cse67 (= 0 (+ (+ (* .cse30 |ULTIMATE.start_main_~x~0#1|) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 12 |ULTIMATE.start_main_~x~0#1|)))) (.cse85 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse127 (- (* 18 |ULTIMATE.start_main_~x~0#1|))) (.cse26 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse126))) (.cse44 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse157 (+ .cse119 65536)) (.cse118 (* |ULTIMATE.start_main_~a~0#1| (- 1))) (.cse117 (< .cse158 65536)) (.cse105 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767)) (.cse120 (<= 0 .cse158)) (.cse89 (+ 6 (* 6 .cse129)))) (let ((.cse10 (<= |ULTIMATE.start_main_~a~0#1| 50)) (.cse24 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse95 (not (= .cse89 .cse155))) (.cse41 (+ |ULTIMATE.start_main_~n~0#1| (- 1))) (.cse96 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse103 (- (* 12 |ULTIMATE.start_main_~y~0#1|))) (.cse86 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse104 (and .cse117 (not .cse105) .cse120)) (.cse121 (<= .cse157 (+ .cse118 32767))) (.cse79 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse106 (< |ULTIMATE.start_main_~a~0#1| 65536)) (.cse122 (<= .cse157 (+ .cse118 65535))) (.cse52 (+ |ULTIMATE.start_main_~y~0#1| (* .cse44 (- 1)))) (.cse128 (not .cse26)) (.cse0 (= 0 (+ (+ (+ (+ (+ (* .cse85 |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))) .cse127) (- (* 10 |ULTIMATE.start_main_~y~0#1|))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)))) (.cse132 (not .cse67)) (.cse109 (not (= 0 (+ (+ (* .cse30 .cse156) (- (* .cse156 .cse115))) (* 12 .cse156))))) (.cse110 (not (<= .cse129 |ULTIMATE.start_main_~a~0#1|))) (.cse111 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse112) .cse112) (- (* (* 3 .cse156) .cse115))) .cse114) (- (* 10 .cse112))) (* 3 .cse115)) (- 10)))) (.cse130 (not .cse80)) (.cse131 (= 0 (+ (+ (+ (+ (+ .cse91 (- (* .cse92 .cse155))) .cse93) .cse94) (* 3 .cse155)) (- 10)))) (.cse81 (not .cse66)) (.cse45 (not (= 0 (+ (+ (* .cse30 .cse153) (- (* .cse153 .cse154))) (* 12 .cse153))))) (.cse46 (not (<= .cse116 |ULTIMATE.start_main_~a~0#1|))) (.cse47 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse152) .cse152) (- (* (* 3 .cse153) .cse154))) (- (* 18 .cse153))) (- (* 10 .cse152))) (* 3 .cse154)) (- 10)))) (.cse98 (+ 27 .cse100)) (.cse102 (* 30 (- 1))) (.cse29 (+ 1 .cse138)) (.cse27 (not .cse6)) (.cse37 (+ .cse136 .cse135)) (.cse34 (+ .cse135 .cse137)) (.cse35 (+ 6 .cse137)) (.cse36 (+ .cse133 1)) (.cse68 (+ 1 0)) (.cse58 (+ 6 6)) (.cse70 (+ 1 6)) (.cse97 (+ 1 5))) (let ((.cse38 (+ .cse44 (- 6))) (.cse51 (+ 1 .cse97)) (.cse55 (+ 1 .cse70)) (.cse60 (+ 6 .cse58)) (.cse61 (* 7 (- 1))) (.cse54 (+ 1 .cse68)) (.cse56 (* .cse58 (- 1))) (.cse20 (or (not (= 0 (+ (+ (* .cse30 .cse37) (- (* .cse37 .cse35))) (* 12 .cse37)))) (not (<= .cse36 .cse29)) .cse27 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse34) .cse34) (- (* (* 3 .cse37) .cse35))) (- (* 18 .cse37))) (- (* 10 .cse34))) (* 3 .cse35)) (- 10))) (not (<= .cse138 |ULTIMATE.start_main_~a~0#1|)) (<= .cse36 |ULTIMATE.start_main_~a~0#1|))) (.cse75 (* |ULTIMATE.start_main_~x~0#1| (- 1))) (.cse76 (* |ULTIMATE.start_main_~y~0#1| (- 1))) (.cse78 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (+ |ULTIMATE.start_main_~y~0#1| (- 1))))) (.cse84 (<= |ULTIMATE.start_main_~n~0#1| .cse68)) (.cse53 (+ (+ .cse98 (+ 91 .cse102)) 91)) (.cse2 (or (<= .cse151 |ULTIMATE.start_main_~a~0#1|) .cse27 .cse45 .cse46 (not (<= .cse151 .cse147)) .cse47)) (.cse3 (or .cse27 (not (<= .cse146 .cse142)) (not (<= .cse147 |ULTIMATE.start_main_~a~0#1|)) (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse148) .cse148) (- (* (* 3 .cse149) .cse150))) (- (* 18 .cse149))) (- (* 10 .cse148))) (* 3 .cse150)) (- 10))) (<= .cse146 |ULTIMATE.start_main_~a~0#1|) (not (= 0 (+ (+ (* .cse30 .cse149) (- (* .cse149 .cse150))) (* 12 .cse149)))))) (.cse12 (or .cse27 (<= .cse145 |ULTIMATE.start_main_~a~0#1|) .cse130 (not (<= .cse145 .cse129)) .cse131 .cse81)) (.cse14 (or .cse27 .cse109 (<= .cse144 |ULTIMATE.start_main_~a~0#1|) (not (<= .cse144 .cse116)) .cse110 .cse111)) (.cse48 (or .cse128 .cse66 .cse0 .cse132)) (.cse19 (or .cse27 (not (<= .cse139 .cse134)) (not (= 0 (+ (+ (* .cse30 .cse140) (- (* .cse140 .cse141))) (* 12 .cse140)))) (not (<= .cse142 |ULTIMATE.start_main_~a~0#1|)) (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse143) .cse143) (- (* (* 3 .cse140) .cse141))) (- (* 18 .cse140))) (- (* 10 .cse143))) (* 3 .cse141)) (- 10))) (<= .cse139 |ULTIMATE.start_main_~a~0#1|))) (.cse22 (or (<= .cse133 |ULTIMATE.start_main_~a~0#1|) (not (<= .cse134 |ULTIMATE.start_main_~a~0#1|)) .cse27 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse135) .cse135) (- (* (* 3 .cse136) .cse137))) (- (* 18 .cse136))) (- (* 10 .cse135))) (* 3 .cse137)) (- 10))) (not (<= .cse133 .cse138)) (not (= 0 (+ (+ (* .cse30 .cse136) (- (* .cse136 .cse137))) (* 12 .cse136)))))) (.cse1 (= 0 (+ 12 (+ (+ (* .cse44 .cse44) (- (* 12 .cse52))) (- (* 6 .cse44)))))) (.cse50 (or .cse0 .cse132)) (.cse40 (or .cse130 .cse131 .cse81)) (.cse49 (+ 6 30)) (.cse4 (= .cse88 (* (* .cse129 .cse129) .cse129))) (.cse5 (or .cse128 .cse66 .cse67)) (.cse7 (or .cse104 (and .cse121 .cse79 .cse106 .cse122))) (.cse8 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) .cse127) .cse103) .cse86) (- 6)))) (.cse9 (let ((.cse125 (= |ULTIMATE.start_main_~z~0#1| (+ .cse126 6)))) (or (let ((.cse124 (* (- 6) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse123 (<= (+ |ULTIMATE.start_main_~z~0#1| .cse124 (- 6)) 0))) (and (or (not .cse123) (<= 0 .cse44) (not (<= (+ |ULTIMATE.start_main_~z~0#1| .cse124 (- 5)) 0))) (not .cse125) .cse96 (or .cse123 (<= |ULTIMATE.start_main_~z~0#1| 6))))) .cse125))) (.cse11 (or (and .cse117 (<= (+ .cse118 (- 65536)) .cse119) .cse120 (<= (+ .cse118 (- 32768)) .cse119)) (and .cse121 .cse79 .cse122 .cse106))) (.cse65 (+ .cse41 (- 1))) (.cse42 (+ 1 2)) (.cse13 (= |ULTIMATE.start_main_~x~0#1| (* (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~n~0#1|))) (.cse15 (let ((.cse113 (+ 6 (* 6 .cse116)))) (or (= 0 (+ (+ (+ (+ (* .cse112 .cse113) .cse114) (- (* 12 .cse112))) (* 2 .cse113)) (- 6))) (not (= .cse113 .cse115))))) (.cse16 (<= .cse41 |ULTIMATE.start_main_~a~0#1|)) (.cse43 (or .cse109 .cse110 .cse111)) (.cse17 (or (= 0 (+ (+ (+ (+ (* .cse108 .cse89) .cse93) (- (* 12 .cse108))) (* 2 .cse89)) (- 6))) .cse95)) (.cse18 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (let ((.cse107 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ (* .cse107 |ULTIMATE.start_main_~n~0#1|) .cse107))))) (.cse21 (or .cse104 (and .cse105 .cse79 .cse106))) (.cse23 (= 0 (+ 12 (+ (+ (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) .cse103) (- (* 6 |ULTIMATE.start_main_~z~0#1|)))))) (.cse25 (or (and .cse24 .cse10 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not .cse10) (not .cse24)))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 (let ((.cse31 (+ .cse37 .cse34)) (.cse32 (+ 6 .cse35)) (.cse28 (+ .cse36 1))) (or .cse27 (not (<= .cse28 (+ 1 .cse29))) (not (= 0 (+ (+ (* .cse30 .cse31) (- (* .cse31 .cse32))) (* 12 .cse31)))) (not (<= .cse29 |ULTIMATE.start_main_~a~0#1|)) (= 0 (+ (+ (let ((.cse33 (+ .cse34 .cse35))) (+ (+ (+ (* (* 2 .cse33) .cse33) (- (* (* 3 .cse31) .cse32))) (- (* 18 .cse31))) (- (* 10 .cse33)))) (* 3 .cse32)) (- 10))) (<= .cse28 |ULTIMATE.start_main_~a~0#1|)))) (let ((.cse39 (+ .cse44 27 (- 14)))) (and (= .cse38 (+ 6 (+ (+ .cse39 (* .cse38 (- 1))) (- 7)))) .cse0 .cse1 .cse40 (= |ULTIMATE.start_main_~x~0#1| (+ 27 .cse39)) .cse4 .cse5 .cse6 .cse7 (= .cse41 .cse42) .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse16 .cse43 .cse17 .cse18 .cse21 .cse23 .cse24 .cse25 (= |ULTIMATE.start_main_~y~0#1| (+ .cse39 .cse44)) (or .cse45 .cse46 .cse47) .cse26)) (and .cse15 .cse16 .cse1 .cse17 .cse2 .cse18 .cse48 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse24 .cse9 .cse10 .cse11 .cse12 .cse13 .cse25 .cse14 .cse26) (and .cse15 .cse16 .cse1 (= .cse38 .cse49) .cse17 .cse18 .cse50 (= |ULTIMATE.start_main_~n~0#1| .cse51) (= .cse52 (+ 91 .cse38)) .cse4 .cse21 .cse5 .cse6 .cse7 .cse23 .cse8 .cse24 .cse9 .cse10 .cse11 .cse13 .cse25 (= (+ |ULTIMATE.start_main_~x~0#1| (* .cse52 (- 1))) .cse53) .cse26) (let ((.cse57 (+ .cse52 (- 7))) (.cse59 (+ 7 (+ 18 (- 6))))) (and (<= .cse54 |ULTIMATE.start_main_~a~0#1|) .cse1 (= |ULTIMATE.start_main_~z~0#1| (+ 6 18)) (= |ULTIMATE.start_main_~x~0#1| (+ .cse55 .cse52)) (= |ULTIMATE.start_main_~n~0#1| .cse42) (= (+ |ULTIMATE.start_main_~x~0#1| (* 19 (- 1))) (+ 1 (+ 19 .cse56))) .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 (<= |ULTIMATE.start_main_~n~0#1| .cse42) .cse15 .cse16 (= .cse57 .cse58) (<= 2 |ULTIMATE.start_main_~a~0#1|) .cse17 .cse18 (= |ULTIMATE.start_main_~y~0#1| (+ .cse59 18)) (= .cse44 (+ 6 .cse57)) .cse21 .cse23 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse60)) .cse24 (= (+ .cse61 (+ (+ |ULTIMATE.start_main_~x~0#1| (* .cse59 (- 1))) .cse61) 6) 0) .cse25 .cse26)) (let ((.cse62 (+ (* 48 2) 73))) (and .cse15 .cse16 (= |ULTIMATE.start_main_~z~0#1| (+ 6 48)) .cse1 (= |ULTIMATE.start_main_~x~0#1| (+ (+ 48 295) .cse62)) .cse17 (<= .cse51 |ULTIMATE.start_main_~a~0#1|) .cse18 (<= |ULTIMATE.start_main_~n~0#1| (+ 1 .cse51)) .cse4 .cse21 .cse5 .cse6 .cse7 .cse23 .cse8 .cse24 .cse9 .cse10 .cse11 .cse13 .cse25 (= |ULTIMATE.start_main_~y~0#1| (+ .cse62 48)) .cse26)) (and .cse15 .cse16 .cse1 .cse17 .cse18 .cse48 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse24 .cse9 .cse10 .cse11 .cse12 .cse13 .cse25 .cse26) (let ((.cse74 (+ .cse76 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (- 6)))) (let ((.cse73 (+ |ULTIMATE.start_main_~y~0#1| .cse75 .cse74))) (let ((.cse71 (+ |ULTIMATE.start_main_~y~0#1| (* .cse73 (- 1))))) (let ((.cse63 (+ (* .cse71 (- 1)) .cse74 6))) (let ((.cse64 (+ |ULTIMATE.start_main_~y~0#1| (- 7))) (.cse69 (+ |ULTIMATE.start_main_~y~0#1| .cse56)) (.cse72 (+ .cse71 .cse63 (* .cse74 (- 1))))) (and (= .cse63 0) (= |ULTIMATE.start_main_~y~0#1| (+ 7 .cse44)) (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse64)) (= |ULTIMATE.start_main_~y~0#1| (+ (+ 1 (+ 12 (- 6))) 12)) .cse1 (= |ULTIMATE.start_main_~n~0#1| (+ 1 1)) (<= 1 |ULTIMATE.start_main_~a~0#1|) (= .cse65 0) .cse4 .cse5 .cse6 .cse7 (or .cse66 .cse67) .cse8 .cse9 .cse10 .cse11 .cse13 (= |ULTIMATE.start_main_~z~0#1| (+ 6 12)) (= |ULTIMATE.start_main_~x~0#1| .cse55) .cse16 (= |ULTIMATE.start_main_~z~0#1| .cse60) (= .cse44 .cse58) (= .cse41 .cse68) .cse18 .cse21 (= .cse69 .cse70) .cse23 .cse24 (= (+ .cse71 (* .cse72 (- 1))) 1) (= (+ .cse61 (+ |ULTIMATE.start_main_~x~0#1| .cse61) 6) 0) (= .cse64 .cse58) .cse25 (= |ULTIMATE.start_main_~x~0#1| (+ 1 .cse69)) (= |ULTIMATE.start_main_~n~0#1| .cse54) (= .cse73 (+ 6 .cse72)) .cse26)))))) (and .cse15 .cse16 .cse1 .cse17 .cse2 .cse18 .cse48 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse24 .cse9 .cse10 .cse11 .cse12 .cse13 .cse25 .cse14 .cse26) (and .cse15 .cse16 .cse1 .cse17 .cse18 .cse48 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse24 .cse9 .cse10 .cse11 .cse12 .cse13 .cse25 .cse14 .cse26) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse48 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26) (let ((.cse82 (+ .cse76 |ULTIMATE.start_main_~x~0#1| 6))) (let ((.cse77 (* 1 (- 1))) (.cse83 (+ |ULTIMATE.start_main_~y~0#1| .cse82 .cse75))) (and (= (+ |ULTIMATE.start_main_~x~0#1| .cse77) 0) (= .cse44 (+ 6 (* 6 0))) .cse1 (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse44)) (= (+ |ULTIMATE.start_main_~y~0#1| (* 6 (- 1))) 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= |ULTIMATE.start_main_~n~0#1| .cse68) .cse11 .cse13 (= |ULTIMATE.start_main_~y~0#1| .cse70) .cse16 (= .cse44 6) (= (+ .cse77 |ULTIMATE.start_main_~x~0#1|) 0) .cse78 (= .cse41 0) .cse18 .cse79 (= |ULTIMATE.start_main_~z~0#1| .cse58) (or (< (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1)) .cse80 .cse81) .cse21 .cse23 (= .cse82 0) (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse83)) .cse24 .cse84 .cse25 (= |ULTIMATE.start_main_~x~0#1| 1) (= (+ |ULTIMATE.start_main_~y~0#1| (* .cse83 (- 1))) 1) .cse26))) (and .cse15 .cse16 .cse1 .cse17 .cse18 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse24 .cse9 .cse10 .cse11 .cse13 .cse25 .cse26) (and .cse15 .cse16 .cse1 .cse17 .cse18 .cse48 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse24 .cse9 .cse10 .cse11 .cse13 .cse25 .cse26) (and .cse15 .cse16 .cse1 .cse17 .cse2 .cse18 .cse48 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse24 .cse9 .cse10 .cse11 .cse12 .cse13 .cse25 .cse14 .cse26) (and .cse16 .cse1 (= |ULTIMATE.start_main_~x~0#1| 0) .cse78 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) (- .cse30)) (- .cse85)) .cse86) (- 10))) .cse79 (= |ULTIMATE.start_main_~z~0#1| 6) .cse21 (or (not .cse23) (not (= 0 (+ (+ .cse87 (- (* .cse88 .cse89))) .cse90))) (= 0 (+ (+ (+ (+ (+ .cse91 (- (* .cse92 .cse89))) .cse93) .cse94) (* 3 .cse89)) (- 10))) .cse95) .cse6 .cse7 .cse23 (= |ULTIMATE.start_main_~y~0#1| 1) .cse96 .cse8 .cse24 .cse84 .cse9 .cse10 .cse11 .cse25 .cse26) (and .cse1 .cse50 .cse40 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_main_~y~0#1| (+ 91 .cse44)) .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse16 (= |ULTIMATE.start_main_~x~0#1| .cse53) .cse17 .cse18 (= .cse44 .cse49) .cse21 .cse23 .cse24 .cse25 (= |ULTIMATE.start_main_~n~0#1| .cse97) .cse26) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse48 .cse19 .cse22 .cse23 .cse24 .cse25 .cse26) (let ((.cse99 (+ |ULTIMATE.start_main_~y~0#1| .cse102))) (and .cse1 .cse50 .cse40 (= |ULTIMATE.start_main_~z~0#1| .cse49) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= .cse65 .cse42) .cse13 (= |ULTIMATE.start_main_~x~0#1| (+ .cse98 .cse99)) .cse15 .cse16 .cse43 .cse17 .cse18 (= .cse99 (+ .cse100 .cse101)) .cse21 .cse23 .cse24 .cse25 .cse26))))))))))) [2023-02-18 16:43:23,394 INFO L895 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (let ((.cse144 (+ 1 |ULTIMATE.start_main_~n~0#1|)) (.cse129 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse126 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse167 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse143 (div (- |ULTIMATE.start_main_~z~0#1|) (- 6)))) (let ((.cse140 (+ .cse143 1)) (.cse123 (+ 6 .cse167)) (.cse162 (+ .cse129 .cse126)) (.cse120 (+ .cse126 .cse167)) (.cse124 (+ 1 .cse144))) (let ((.cse157 (+ 1 .cse124)) (.cse164 (+ .cse162 .cse120)) (.cse163 (+ .cse120 .cse123)) (.cse165 (+ 6 .cse123)) (.cse161 (+ .cse140 1))) (let ((.cse156 (+ .cse161 1)) (.cse160 (+ 6 .cse165)) (.cse159 (+ .cse164 .cse163)) (.cse158 (+ .cse163 .cse165)) (.cse154 (+ 1 .cse157)) (.cse56 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse175 (* 6 |ULTIMATE.start_main_~n~0#1|))) (let ((.cse18 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse175))) (.cse30 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse67 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse115 (* (div (+ (- |ULTIMATE.start_main_~a~0#1|) (- 1)) 65536) 65536)) (.cse176 (+ |ULTIMATE.start_main_~a~0#1| 65536)) (.cse91 (+ 30 (- 6))) (.cse128 (* .cse56 .cse129)) (.cse130 (* 12 .cse129)) (.cse61 (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|))) (.cse62 (* 12 |ULTIMATE.start_main_~x~0#1|)) (.cse146 (+ 1 .cse154)) (.cse152 (+ .cse159 .cse158)) (.cse155 (+ .cse158 .cse160)) (.cse153 (+ 6 .cse160)) (.cse151 (+ .cse156 1))) (let ((.cse145 (+ .cse151 1)) (.cse149 (+ 6 .cse153)) (.cse148 (+ .cse152 .cse155)) (.cse147 (+ .cse155 .cse153)) (.cse6 (= (mod (* |ULTIMATE.start_main_~z~0#1| 5) 6) 0)) (.cse150 (+ 1 .cse146)) (.cse122 (- (* 18 .cse162))) (.cse34 (= 0 (+ (+ (* .cse56 |ULTIMATE.start_main_~x~0#1|) .cse61) .cse62))) (.cse57 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse97 (* 3 |ULTIMATE.start_main_~z~0#1|)) (.cse33 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse131 (* (* 2 .cse126) .cse126)) (.cse132 (* 3 .cse129)) (.cse127 (- (* 18 .cse129))) (.cse133 (- (* 10 .cse126))) (.cse106 (= 0 (+ (+ .cse128 (- (* .cse129 .cse167))) .cse130))) (.cse90 (+ .cse91 27 (- 14))) (.cse113 (< .cse176 65536)) (.cse135 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767)) (.cse116 (<= 0 .cse176)) (.cse168 (+ .cse115 65536)) (.cse114 (* |ULTIMATE.start_main_~a~0#1| (- 1))) (.cse101 (+ 6 (* 6 .cse144))) (.cse69 (let ((.cse174 (= |ULTIMATE.start_main_~z~0#1| (+ .cse175 6)))) (or (let ((.cse173 (* (- 6) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse172 (<= (+ |ULTIMATE.start_main_~z~0#1| .cse173 (- 6)) 0))) (and (or (not .cse172) (<= 0 .cse30) (not (<= (+ |ULTIMATE.start_main_~z~0#1| .cse173 (- 5)) 0))) (not .cse174) .cse67 (or .cse172 (<= |ULTIMATE.start_main_~z~0#1| 6))))) .cse174))) (.cse47 (not .cse18)) (.cse13 (<= |ULTIMATE.start_main_~a~0#1| 50)) (.cse12 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse96 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse95 (* 6 |ULTIMATE.start_main_~z~0#1|)) (.cse166 (- (* 18 |ULTIMATE.start_main_~x~0#1|))) (.cse171 (- (* 12 |ULTIMATE.start_main_~y~0#1|))) (.cse58 (* 2 |ULTIMATE.start_main_~z~0#1|))) (let ((.cse11 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) .cse166) .cse171) .cse58) (- 6)))) (.cse10 (= 0 (+ 12 (+ (+ .cse96 .cse171) (- .cse95))))) (.cse35 (= |ULTIMATE.start_main_~x~0#1| (* (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~n~0#1|))) (.cse16 (or (and .cse12 .cse13 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not .cse13) (not .cse12))))) (.cse41 (let ((.cse169 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (let ((.cse170 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ (* .cse170 |ULTIMATE.start_main_~n~0#1|) .cse170)))))) (or (and .cse69 .cse169) (and .cse69 (or .cse47 .cse169))))) (.cse104 (* 3 .cse101)) (.cse105 (not (= .cse101 .cse167))) (.cse117 (<= .cse168 (+ .cse114 32767))) (.cse118 (<= .cse168 (+ .cse114 65535))) (.cse134 (and .cse113 (not .cse135) .cse116)) (.cse59 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse119 (< |ULTIMATE.start_main_~a~0#1| 65536)) (.cse24 (+ |ULTIMATE.start_main_~y~0#1| (* .cse30 (- 1)))) (.cse92 (+ 27 .cse90)) (.cse93 (* 30 (- 1))) (.cse38 (+ 6 6)) (.cse43 (+ 1 6)) (.cse136 (not .cse106)) (.cse137 (= 0 (+ (+ (+ (+ (+ .cse131 (- (* .cse132 .cse167))) .cse127) .cse133) (* 3 .cse167)) (- 10)))) (.cse107 (not .cse33)) (.cse72 (= 0 (+ (+ (+ (+ (+ (* .cse57 |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))) .cse166) (- (* 10 |ULTIMATE.start_main_~y~0#1|))) .cse97) (- 10)))) (.cse138 (not .cse34)) (.cse76 (not (= 0 (+ (+ (* .cse56 .cse164) (- (* .cse164 .cse165))) (* 12 .cse164))))) (.cse77 (not (<= .cse124 |ULTIMATE.start_main_~a~0#1|))) (.cse78 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse163) .cse163) (- (* (* 3 .cse164) .cse165))) (- (* 18 .cse164))) (- (* 10 .cse163))) (* 3 .cse165)) (- 10)))) (.cse40 (+ 1 0)) (.cse39 (+ |ULTIMATE.start_main_~n~0#1| (- 1))) (.cse139 (not (= 0 (+ (+ (* .cse56 .cse162) (- (* .cse162 .cse123))) (* 12 .cse162))))) (.cse141 (not (<= .cse144 |ULTIMATE.start_main_~a~0#1|))) (.cse142 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse120) .cse120) (- (* (* 3 .cse162) .cse123))) .cse122) (- (* 10 .cse120))) (* 3 .cse123)) (- 10)))) (.cse81 (+ 1 .cse150)) (.cse79 (not .cse6)) (.cse88 (+ .cse148 .cse147)) (.cse85 (+ .cse147 .cse149)) (.cse86 (+ 6 .cse149)) (.cse87 (+ .cse145 1)) (.cse112 (+ 1 5))) (let ((.cse23 (+ 1 .cse112)) (.cse20 (+ .cse30 (- 6))) (.cse27 (or (not (= 0 (+ (+ (* .cse56 .cse88) (- (* .cse88 .cse86))) (* 12 .cse88)))) (not (<= .cse87 .cse81)) .cse79 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse85) .cse85) (- (* (* 3 .cse88) .cse86))) (- (* 18 .cse88))) (- (* 10 .cse85))) (* 3 .cse86)) (- 10))) (not (<= .cse150 |ULTIMATE.start_main_~a~0#1|)) (<= .cse87 |ULTIMATE.start_main_~a~0#1|))) (.cse73 (or .cse139 .cse141 .cse142)) (.cse32 (+ .cse39 (- 1))) (.cse48 (= .cse129 (* (* .cse144 .cse144) .cse144))) (.cse55 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (+ |ULTIMATE.start_main_~y~0#1| (- 1))))) (.cse68 (<= |ULTIMATE.start_main_~n~0#1| .cse40)) (.cse53 (* |ULTIMATE.start_main_~x~0#1| (- 1))) (.cse54 (* |ULTIMATE.start_main_~y~0#1| (- 1))) (.cse2 (or (<= .cse161 |ULTIMATE.start_main_~a~0#1|) .cse79 .cse76 .cse77 (not (<= .cse161 .cse157)) .cse78)) (.cse3 (or .cse47 .cse33 .cse72 .cse138)) (.cse4 (or .cse79 (not (<= .cse156 .cse154)) (not (<= .cse157 |ULTIMATE.start_main_~a~0#1|)) (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse158) .cse158) (- (* (* 3 .cse159) .cse160))) (- (* 18 .cse159))) (- (* 10 .cse158))) (* 3 .cse160)) (- 10))) (<= .cse156 |ULTIMATE.start_main_~a~0#1|) (not (= 0 (+ (+ (* .cse56 .cse159) (- (* .cse159 .cse160))) (* 12 .cse159)))))) (.cse19 (or .cse79 (not (<= .cse151 .cse146)) (not (= 0 (+ (+ (* .cse56 .cse152) (- (* .cse152 .cse153))) (* 12 .cse152)))) (not (<= .cse154 |ULTIMATE.start_main_~a~0#1|)) (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse155) .cse155) (- (* (* 3 .cse152) .cse153))) (- (* 18 .cse152))) (- (* 10 .cse155))) (* 3 .cse153)) (- 10))) (<= .cse151 |ULTIMATE.start_main_~a~0#1|))) (.cse28 (or (<= .cse145 |ULTIMATE.start_main_~a~0#1|) (not (<= .cse146 |ULTIMATE.start_main_~a~0#1|)) .cse79 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse147) .cse147) (- (* (* 3 .cse148) .cse149))) (- (* 18 .cse148))) (- (* 10 .cse147))) (* 3 .cse149)) (- 10))) (not (<= .cse145 .cse150)) (not (= 0 (+ (+ (* .cse56 .cse148) (- (* .cse148 .cse149))) (* 12 .cse148)))))) (.cse15 (or .cse79 (<= .cse143 |ULTIMATE.start_main_~a~0#1|) .cse136 (not (<= .cse143 .cse144)) .cse137 .cse107)) (.cse17 (or .cse79 .cse139 (<= .cse140 |ULTIMATE.start_main_~a~0#1|) (not (<= .cse140 .cse124)) .cse141 .cse142)) (.cse49 (+ 1 .cse40)) (.cse36 (+ 1 .cse43)) (.cse52 (* .cse38 (- 1))) (.cse75 (+ 1 2)) (.cse37 (+ 6 .cse38)) (.cse46 (* 7 (- 1))) (.cse0 (<= .cse39 |ULTIMATE.start_main_~a~0#1|)) (.cse26 (+ (+ .cse92 (+ 91 .cse93)) 91)) (.cse1 (= 0 (+ 12 (+ (+ (* .cse30 .cse30) (- (* 12 .cse24))) (- (* 6 .cse30)))))) (.cse22 (or .cse72 .cse138)) (.cse74 (or .cse136 .cse137 .cse107)) (.cse21 (+ 6 30)) (.cse25 (or .cse134 (and .cse135 .cse59 .cse119))) (.cse5 (or .cse47 .cse33 .cse34)) (.cse7 (or .cse134 (and .cse117 .cse59 .cse119 .cse118))) (.cse8 (or (not (= 0 (+ (+ .cse128 (- (* .cse129 .cse101))) .cse130))) (= 0 (+ (+ (+ (+ (+ .cse131 (- (* .cse132 .cse101))) .cse127) .cse133) .cse104) (- 10))) .cse105)) (.cse9 (let ((.cse125 (or (= 0 (+ (+ (+ (+ (* .cse126 .cse101) .cse127) (- (* 12 .cse126))) (* 2 .cse101)) (- 6))) .cse105))) (or (and (let ((.cse121 (+ 6 (* 6 .cse124)))) (or (= 0 (+ (+ (+ (+ (* .cse120 .cse121) .cse122) (- (* 12 .cse120))) (* 2 .cse121)) (- 6))) (not (= .cse121 .cse123)))) .cse10 .cse125 .cse11 .cse12 .cse13 .cse35 .cse16 .cse41) (and (or .cse47 .cse11) .cse10 .cse125 .cse12 .cse13 .cse35 .cse16 .cse41)))) (.cse14 (or (and .cse113 (<= (+ .cse114 (- 65536)) .cse115) .cse116 (<= (+ .cse114 (- 32768)) .cse115)) (and .cse117 .cse59 .cse118 .cse119)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 (= .cse20 .cse21) .cse22 (= |ULTIMATE.start_main_~n~0#1| .cse23) (= .cse24 (+ 91 .cse20)) .cse25 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 (= (+ |ULTIMATE.start_main_~x~0#1| (* .cse24 (- 1))) .cse26) .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse27 .cse5 .cse6 .cse7 .cse8 .cse9 .cse28 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (let ((.cse51 (+ .cse54 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (- 6)))) (let ((.cse50 (+ |ULTIMATE.start_main_~y~0#1| .cse53 .cse51))) (let ((.cse44 (+ |ULTIMATE.start_main_~y~0#1| (* .cse50 (- 1))))) (let ((.cse29 (+ (* .cse44 (- 1)) .cse51 6))) (let ((.cse31 (+ |ULTIMATE.start_main_~y~0#1| (- 7))) (.cse42 (+ |ULTIMATE.start_main_~y~0#1| .cse52)) (.cse45 (+ .cse44 .cse29 (* .cse51 (- 1))))) (and (= .cse29 0) (= |ULTIMATE.start_main_~y~0#1| (+ 7 .cse30)) (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse31)) (= |ULTIMATE.start_main_~y~0#1| (+ (+ 1 (+ 12 (- 6))) 12)) .cse1 (= |ULTIMATE.start_main_~n~0#1| (+ 1 1)) (<= 1 |ULTIMATE.start_main_~a~0#1|) (= .cse32 0) .cse5 .cse6 .cse7 .cse8 (or .cse33 .cse34) .cse11 .cse13 .cse14 .cse35 (= |ULTIMATE.start_main_~z~0#1| (+ 6 12)) (= |ULTIMATE.start_main_~x~0#1| .cse36) .cse0 (= |ULTIMATE.start_main_~z~0#1| .cse37) (= .cse30 .cse38) (= .cse39 .cse40) .cse41 .cse25 (= .cse42 .cse43) .cse10 .cse12 (= (+ .cse44 (* .cse45 (- 1))) 1) (= (+ .cse46 (+ |ULTIMATE.start_main_~x~0#1| .cse46) 6) 0) (= .cse31 .cse38) (or .cse47 .cse48) .cse16 (= |ULTIMATE.start_main_~x~0#1| (+ 1 .cse42)) (= |ULTIMATE.start_main_~n~0#1| .cse49) (= .cse50 (+ 6 .cse45)) .cse18)))))) (and .cse0 .cse1 (= |ULTIMATE.start_main_~x~0#1| 0) .cse55 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) (- .cse56)) (- .cse57)) .cse58) (- 10))) .cse59 (= |ULTIMATE.start_main_~z~0#1| 6) (or (exists ((|aux_div_ULTIMATE.start_main_~a~0#1_40| Int) (|aux_mod_ULTIMATE.start_main_~a~0#1_40| Int)) (let ((.cse60 (+ (* |aux_div_ULTIMATE.start_main_~a~0#1_40| 65536) |aux_mod_ULTIMATE.start_main_~a~0#1_40|))) (let ((.cse63 (+ .cse60 65536))) (and (<= .cse60 50) (not (<= |aux_mod_ULTIMATE.start_main_~a~0#1_40| 32767)) (= 0 (+ (+ (* (* 6 .cse60) |ULTIMATE.start_main_~x~0#1|) .cse61) .cse62)) (>= .cse60 0) (<= 0 |aux_mod_ULTIMATE.start_main_~a~0#1_40|) (<= 0 .cse63) (< |aux_mod_ULTIMATE.start_main_~a~0#1_40| 65536) (< .cse63 65536))))) (exists ((|aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51| Int) (|aux_div_ULTIMATE.start_main_~a~0#1_54| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51| Int)) (let ((.cse64 (+ |aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51| (* |aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51| 65536)))) (let ((.cse65 (+ (* |aux_div_ULTIMATE.start_main_~a~0#1_54| (- 65536)) (* .cse64 (- 1)) (- 1)))) (let ((.cse66 (* .cse65 (- 1)))) (and (<= 0 .cse64) (<= 0 |aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51|) (<= 0 .cse65) (< .cse65 65536) (>= .cse65 0) (= 0 (+ (+ (* (* 6 .cse65) |ULTIMATE.start_main_~x~0#1|) .cse61) .cse62)) (< |aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51| 65536) (<= .cse65 50) (< .cse64 65536) (<= (+ (* |aux_div_ULTIMATE.start_main_~a~0#1_54| 65536) 65536) (+ .cse66 32767)) (<= (+ (* (+ |aux_div_ULTIMATE.start_main_~a~0#1_54| |aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51|) 65536) 65536) (+ .cse66 65535)))))))) .cse25 .cse6 .cse7 .cse10 (= |ULTIMATE.start_main_~y~0#1| 1) .cse67 .cse11 .cse12 .cse68 .cse69 .cse13 .cse14 .cse16 .cse18) (let ((.cse70 (+ (* 48 2) 73))) (and .cse0 (= |ULTIMATE.start_main_~z~0#1| (+ 6 48)) .cse1 (= |ULTIMATE.start_main_~x~0#1| (+ (+ 48 295) .cse70)) (<= .cse23 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| (+ 1 .cse23)) .cse25 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 (= |ULTIMATE.start_main_~y~0#1| (+ .cse70 48)) .cse18)) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse18) (let ((.cse71 (+ .cse30 27 (- 14)))) (and (= .cse20 (+ 6 (+ (+ .cse71 (* .cse20 (- 1))) (- 7)))) .cse0 .cse72 .cse73 .cse1 .cse74 (= |ULTIMATE.start_main_~x~0#1| (+ 27 .cse71)) .cse25 .cse5 .cse6 .cse7 .cse8 .cse9 (= .cse39 .cse75) .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 (= |ULTIMATE.start_main_~y~0#1| (+ .cse71 .cse30)) (or .cse76 .cse77 .cse78) .cse18)) (and .cse0 .cse72 .cse1 .cse2 .cse4 .cse19 .cse27 .cse25 .cse5 .cse6 .cse7 .cse8 .cse9 .cse28 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (let ((.cse82 (+ .cse88 .cse85)) (.cse83 (+ 6 .cse86)) (.cse80 (+ .cse87 1))) (or .cse79 (not (<= .cse80 (+ 1 .cse81))) (not (= 0 (+ (+ (* .cse56 .cse82) (- (* .cse82 .cse83))) (* 12 .cse82)))) (not (<= .cse81 |ULTIMATE.start_main_~a~0#1|)) (= 0 (+ (+ (let ((.cse84 (+ .cse85 .cse86))) (+ (+ (+ (* (* 2 .cse84) .cse84) (- (* (* 3 .cse82) .cse83))) (- (* 18 .cse82))) (- (* 10 .cse84)))) (* 3 .cse83)) (- 10))) (<= .cse80 |ULTIMATE.start_main_~a~0#1|)))) (and .cse0 .cse1 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse18) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (let ((.cse89 (+ |ULTIMATE.start_main_~y~0#1| .cse93))) (and .cse0 .cse73 .cse1 .cse22 .cse74 (= .cse89 (+ .cse90 .cse91)) (= |ULTIMATE.start_main_~z~0#1| .cse21) .cse25 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= .cse32 .cse75) .cse16 (= |ULTIMATE.start_main_~x~0#1| (+ .cse92 .cse89)) .cse18)) (let ((.cse108 (+ .cse54 |ULTIMATE.start_main_~x~0#1| 6))) (let ((.cse94 (* 1 (- 1))) (.cse109 (+ |ULTIMATE.start_main_~y~0#1| .cse108 .cse53))) (and (= (+ |ULTIMATE.start_main_~x~0#1| .cse94) 0) (= .cse30 (+ 6 (* 6 0))) .cse1 (let ((.cse98 (div (+ (* (- 6) |ULTIMATE.start_main_~z~0#1|) .cse96) 12))) (let ((.cse99 (* .cse98 |ULTIMATE.start_main_~z~0#1|)) (.cse103 (+ .cse98 1))) (let ((.cse100 (+ (+ (div (+ .cse97 .cse99 (* (- 12) .cse98)) 18) (- 1)) .cse103))) (or (not (= (mod (+ .cse95 .cse96) 12) 0)) (not (= (mod (+ .cse97 (* 6 .cse98) .cse99) 18) 0)) (not (= 0 (+ (+ (* .cse56 .cse100) (- (* .cse100 .cse101))) (* 12 .cse100)))) (= 0 (+ (+ (let ((.cse102 (+ .cse103 |ULTIMATE.start_main_~z~0#1|))) (+ (+ (+ (* (* 2 .cse102) .cse102) (- (* (* 3 .cse100) .cse101))) (- (* 18 .cse100))) (- (* 10 .cse102)))) .cse104) (- 10))) .cse105)))) (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse30)) (= (+ |ULTIMATE.start_main_~y~0#1| (* 6 (- 1))) 1) .cse48 .cse5 .cse6 .cse7 .cse8 .cse11 .cse13 (= |ULTIMATE.start_main_~n~0#1| .cse40) .cse14 (= |ULTIMATE.start_main_~y~0#1| .cse43) .cse0 (= .cse30 6) (= (+ .cse94 |ULTIMATE.start_main_~x~0#1|) 0) .cse55 (= .cse39 0) .cse59 .cse41 (= |ULTIMATE.start_main_~z~0#1| .cse38) (or (< (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1)) .cse106 .cse107) .cse25 .cse10 (= .cse108 0) (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse109)) .cse12 .cse68 .cse16 (= |ULTIMATE.start_main_~x~0#1| 1) (= (+ |ULTIMATE.start_main_~y~0#1| (* .cse109 (- 1))) 1) .cse18))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse28 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (let ((.cse110 (+ .cse24 (- 7))) (.cse111 (+ 7 (+ 18 (- 6))))) (and (<= .cse49 |ULTIMATE.start_main_~a~0#1|) .cse1 (= |ULTIMATE.start_main_~z~0#1| (+ 6 18)) (= |ULTIMATE.start_main_~x~0#1| (+ .cse36 .cse24)) (= |ULTIMATE.start_main_~n~0#1| .cse75) (= (+ |ULTIMATE.start_main_~x~0#1| (* 19 (- 1))) (+ 1 (+ 19 .cse52))) .cse6 .cse7 .cse8 .cse11 .cse13 .cse14 (<= |ULTIMATE.start_main_~n~0#1| .cse75) .cse0 (= .cse110 .cse38) (<= 2 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ .cse111 18)) (= .cse30 (+ 6 .cse110)) .cse25 .cse9 .cse10 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse37)) .cse12 (= (+ .cse46 (+ (+ |ULTIMATE.start_main_~x~0#1| (* .cse111 (- 1))) .cse46) 6) 0) .cse16 .cse18)) (and .cse0 (= |ULTIMATE.start_main_~x~0#1| .cse26) .cse1 .cse22 .cse74 (= .cse30 .cse21) .cse25 .cse5 .cse6 .cse7 .cse8 .cse9 (= |ULTIMATE.start_main_~y~0#1| (+ 91 .cse30)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 (= |ULTIMATE.start_main_~n~0#1| .cse112) .cse18)))))))))) [2023-02-18 16:43:23,395 INFO L895 garLoopResultBuilder]: At program point L34-1(line 34) the Hoare annotation is: (let ((.cse106 (+ 1 |ULTIMATE.start_main_~n~0#1|)) (.cse144 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse137 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse163 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse104 (div (- |ULTIMATE.start_main_~z~0#1|) (- 6)))) (let ((.cse100 (+ .cse104 1)) (.cse142 (+ 6 .cse163)) (.cse160 (+ .cse144 .cse137)) (.cse139 (+ .cse137 .cse163)) (.cse101 (+ 1 .cse106))) (let ((.cse136 (+ 1 .cse101)) (.cse166 (+ .cse160 .cse139)) (.cse165 (+ .cse139 .cse142)) (.cse167 (+ 6 .cse142)) (.cse135 (+ .cse100 1))) (let ((.cse156 (+ .cse135 1)) (.cse159 (+ 6 .cse167)) (.cse158 (+ .cse166 .cse165)) (.cse157 (+ .cse165 .cse167)) (.cse154 (+ 1 .cse136)) (.cse61 (* 6 |ULTIMATE.start_main_~a~0#1|))) (let ((.cse131 (+ 6 (* 6 .cse106))) (.cse110 (* (div (+ (- |ULTIMATE.start_main_~a~0#1|) (- 1)) 65536) 65536)) (.cse118 (* 6 |ULTIMATE.start_main_~n~0#1|)) (.cse171 (+ |ULTIMATE.start_main_~a~0#1| 65536)) (.cse24 (+ 30 (- 6))) (.cse169 (* .cse61 .cse144)) (.cse170 (* 12 .cse144)) (.cse146 (+ 1 .cse154)) (.cse152 (+ .cse158 .cse157)) (.cse155 (+ .cse157 .cse159)) (.cse153 (+ 6 .cse159)) (.cse151 (+ .cse156 1))) (let ((.cse141 (- (* 18 .cse160))) (.cse145 (+ .cse151 1)) (.cse149 (+ 6 .cse153)) (.cse148 (+ .cse152 .cse155)) (.cse147 (+ .cse155 .cse153)) (.cse6 (= (mod (* |ULTIMATE.start_main_~z~0#1| 5) 6) 0)) (.cse150 (+ 1 .cse146)) (.cse73 (= 0 (+ (+ (* .cse61 |ULTIMATE.start_main_~x~0#1|) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 12 |ULTIMATE.start_main_~x~0#1|)))) (.cse84 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse119 (- (* 18 |ULTIMATE.start_main_~x~0#1|))) (.cse127 (* 3 |ULTIMATE.start_main_~z~0#1|)) (.cse72 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse95 (= 0 (+ (+ .cse169 (- (* .cse144 .cse163))) .cse170))) (.cse23 (+ .cse24 27 (- 14))) (.cse108 (< .cse171 65536)) (.cse143 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767)) (.cse111 (<= 0 .cse171)) (.cse41 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse29 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse118))) (.cse168 (+ .cse110 65536)) (.cse109 (* |ULTIMATE.start_main_~a~0#1| (- 1))) (.cse161 (* (* 2 .cse137) .cse137)) (.cse162 (* 3 .cse144)) (.cse138 (- (* 18 .cse144))) (.cse164 (- (* 10 .cse137))) (.cse134 (* 3 .cse131))) (let ((.cse11 (<= |ULTIMATE.start_main_~a~0#1| 50)) (.cse27 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse90 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse85 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse120 (- (* 12 |ULTIMATE.start_main_~y~0#1|))) (.cse87 (not (= 0 (+ (+ .cse169 (- (* .cse144 .cse131))) .cse170)))) (.cse88 (= 0 (+ (+ (+ (+ (+ .cse161 (- (* .cse162 .cse131))) .cse138) .cse164) .cse134) (- 10)))) (.cse112 (<= .cse168 (+ .cse109 32767))) (.cse113 (<= .cse168 (+ .cse109 65535))) (.cse124 (not .cse29)) (.cse122 (* 6 |ULTIMATE.start_main_~z~0#1|)) (.cse121 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse47 (not (= 0 (+ (+ (* .cse61 .cse166) (- (* .cse166 .cse167))) (* 12 .cse166))))) (.cse48 (not (<= .cse101 |ULTIMATE.start_main_~a~0#1|))) (.cse49 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse165) .cse165) (- (* (* 3 .cse166) .cse167))) (- (* 18 .cse166))) (- (* 10 .cse165))) (* 3 .cse167)) (- 10)))) (.cse89 (not (= .cse131 .cse163))) (.cse32 (+ |ULTIMATE.start_main_~y~0#1| (* .cse41 (- 1)))) (.cse123 (and .cse108 (not .cse143) .cse111)) (.cse86 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse114 (< |ULTIMATE.start_main_~a~0#1| 65536)) (.cse92 (+ 1 5)) (.cse16 (+ 27 .cse23)) (.cse30 (* 30 (- 1))) (.cse105 (not .cse95)) (.cse107 (= 0 (+ (+ (+ (+ (+ .cse161 (- (* .cse162 .cse163))) .cse138) .cse164) (* 3 .cse163)) (- 10)))) (.cse96 (not .cse72)) (.cse45 (= 0 (+ (+ (+ (+ (+ (* .cse84 |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))) .cse119) (- (* 10 |ULTIMATE.start_main_~y~0#1|))) .cse127) (- 10)))) (.cse125 (not .cse73)) (.cse74 (+ 1 0)) (.cse39 (+ 6 6)) (.cse76 (+ 1 6)) (.cse46 (+ |ULTIMATE.start_main_~n~0#1| (- 1))) (.cse60 (+ 1 .cse150)) (.cse58 (not .cse6)) (.cse68 (+ .cse148 .cse147)) (.cse65 (+ .cse147 .cse149)) (.cse66 (+ 6 .cse149)) (.cse67 (+ .cse145 1)) (.cse99 (not (= 0 (+ (+ (* .cse61 .cse160) (- (* .cse160 .cse142))) (* 12 .cse160))))) (.cse102 (not (<= .cse106 |ULTIMATE.start_main_~a~0#1|))) (.cse103 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse139) .cse139) (- (* (* 3 .cse160) .cse142))) .cse141) (- (* 10 .cse139))) (* 3 .cse142)) (- 10))))) (let ((.cse33 (+ .cse41 (- 6))) (.cse14 (+ 1 2)) (.cse20 (or .cse99 .cse102 .cse103)) (.cse56 (or (not (= 0 (+ (+ (* .cse61 .cse68) (- (* .cse68 .cse66))) (* 12 .cse68)))) (not (<= .cse67 .cse60)) .cse58 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse65) .cse65) (- (* (* 3 .cse68) .cse66))) (- (* 18 .cse68))) (- (* 10 .cse65))) (* 3 .cse66)) (- 10))) (not (<= .cse150 |ULTIMATE.start_main_~a~0#1|)) (<= .cse67 |ULTIMATE.start_main_~a~0#1|))) (.cse13 (+ .cse46 (- 1))) (.cse36 (+ 1 .cse76)) (.cse42 (+ 6 .cse39)) (.cse43 (* 7 (- 1))) (.cse35 (+ 1 .cse74)) (.cse37 (* .cse39 (- 1))) (.cse51 (or .cse58 (not (<= .cse156 .cse154)) (not (<= .cse136 |ULTIMATE.start_main_~a~0#1|)) (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse157) .cse157) (- (* (* 3 .cse158) .cse159))) (- (* 18 .cse158))) (- (* 10 .cse157))) (* 3 .cse159)) (- 10))) (<= .cse156 |ULTIMATE.start_main_~a~0#1|) (not (= 0 (+ (+ (* .cse61 .cse158) (- (* .cse158 .cse159))) (* 12 .cse158)))))) (.cse55 (or .cse58 (not (<= .cse151 .cse146)) (not (= 0 (+ (+ (* .cse61 .cse152) (- (* .cse152 .cse153))) (* 12 .cse152)))) (not (<= .cse154 |ULTIMATE.start_main_~a~0#1|)) (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse155) .cse155) (- (* (* 3 .cse152) .cse153))) (- (* 18 .cse152))) (- (* 10 .cse155))) (* 3 .cse153)) (- 10))) (<= .cse151 |ULTIMATE.start_main_~a~0#1|))) (.cse57 (or (<= .cse145 |ULTIMATE.start_main_~a~0#1|) (not (<= .cse146 |ULTIMATE.start_main_~a~0#1|)) .cse58 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse147) .cse147) (- (* (* 3 .cse148) .cse149))) (- (* 18 .cse148))) (- (* 10 .cse147))) (* 3 .cse149)) (- 10))) (not (<= .cse145 .cse150)) (not (= 0 (+ (+ (* .cse61 .cse148) (- (* .cse148 .cse149))) (* 12 .cse148)))))) (.cse2 (or .cse45 .cse125)) (.cse3 (or .cse105 .cse107 .cse96)) (.cse34 (+ (+ .cse16 (+ 91 .cse30)) 91)) (.cse4 (+ 6 30)) (.cse31 (+ 1 .cse92)) (.cse71 (= .cse144 (* (* .cse106 .cse106) .cse106))) (.cse83 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (+ |ULTIMATE.start_main_~y~0#1| (- 1))))) (.cse25 (or .cse123 (and .cse143 .cse86 .cse114))) (.cse91 (<= |ULTIMATE.start_main_~n~0#1| .cse74)) (.cse81 (* |ULTIMATE.start_main_~x~0#1| (- 1))) (.cse82 (* |ULTIMATE.start_main_~y~0#1| (- 1))) (.cse18 (let ((.cse140 (+ 6 (* 6 .cse101)))) (or (= 0 (+ (+ (+ (+ (* .cse139 .cse140) .cse141) (- (* 12 .cse139))) (* 2 .cse140)) (- 6))) (not (= .cse140 .cse142))))) (.cse19 (<= .cse46 |ULTIMATE.start_main_~a~0#1|)) (.cse0 (= 0 (+ 12 (+ (+ (* .cse41 .cse41) (- (* 12 .cse32))) (- (* 6 .cse41)))))) (.cse21 (or (= 0 (+ (+ (+ (+ (* .cse137 .cse131) .cse138) (- (* 12 .cse137))) (* 2 .cse131)) (- 6))) .cse89)) (.cse50 (or (<= .cse135 |ULTIMATE.start_main_~a~0#1|) .cse58 .cse47 .cse48 (not (<= .cse135 .cse136)) .cse49)) (.cse1 (let ((.cse128 (div (+ (* (- 6) |ULTIMATE.start_main_~z~0#1|) .cse121) 12))) (let ((.cse129 (* .cse128 |ULTIMATE.start_main_~z~0#1|)) (.cse133 (+ .cse128 1))) (let ((.cse130 (+ (+ (div (+ .cse127 .cse129 (* (- 12) .cse128)) 18) (- 1)) .cse133))) (or (not (= (mod (+ .cse122 .cse121) 12) 0)) (not (= (mod (+ .cse127 (* 6 .cse128) .cse129) 18) 0)) (not (= 0 (+ (+ (* .cse61 .cse130) (- (* .cse130 .cse131))) (* 12 .cse130)))) (= 0 (+ (+ (let ((.cse132 (+ .cse133 |ULTIMATE.start_main_~z~0#1|))) (+ (+ (+ (* (* 2 .cse132) .cse132) (- (* (* 3 .cse130) .cse131))) (- (* 18 .cse130))) (- (* 10 .cse132)))) .cse134) (- 10))) .cse89))))) (.cse22 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (let ((.cse126 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ (* .cse126 |ULTIMATE.start_main_~n~0#1|) .cse126))))) (.cse54 (or .cse124 .cse72 .cse45 .cse125)) (.cse5 (or .cse124 .cse72 .cse73)) (.cse7 (or .cse123 (and .cse112 .cse86 .cse114 .cse113))) (.cse8 (or .cse87 .cse88 .cse89)) (.cse26 (= 0 (+ 12 (+ (+ .cse121 .cse120) (- .cse122))))) (.cse9 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) .cse119) .cse120) .cse85) (- 6)))) (.cse10 (let ((.cse117 (= |ULTIMATE.start_main_~z~0#1| (+ .cse118 6)))) (or (let ((.cse116 (* (- 6) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse115 (<= (+ |ULTIMATE.start_main_~z~0#1| .cse116 (- 6)) 0))) (and (or (not .cse115) (<= 0 .cse41) (not (<= (+ |ULTIMATE.start_main_~z~0#1| .cse116 (- 5)) 0))) (not .cse117) .cse90 (or .cse115 (<= |ULTIMATE.start_main_~z~0#1| 6))))) .cse117))) (.cse12 (or (and .cse108 (<= (+ .cse109 (- 65536)) .cse110) .cse111 (<= (+ .cse109 (- 32768)) .cse110)) (and .cse112 .cse86 .cse113 .cse114))) (.cse52 (or .cse58 (<= .cse104 |ULTIMATE.start_main_~a~0#1|) .cse105 (not (<= .cse104 .cse106)) .cse107 .cse96)) (.cse15 (= |ULTIMATE.start_main_~x~0#1| (* (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~n~0#1|))) (.cse28 (or (and .cse27 .cse11 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not .cse11) (not .cse27))))) (.cse53 (or .cse58 .cse99 (<= .cse100 |ULTIMATE.start_main_~a~0#1|) (not (<= .cse100 .cse101)) .cse102 .cse103))) (or (let ((.cse17 (+ |ULTIMATE.start_main_~y~0#1| .cse30))) (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_main_~z~0#1| .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= .cse13 .cse14) .cse15 (= |ULTIMATE.start_main_~x~0#1| (+ .cse16 .cse17)) .cse18 .cse19 .cse20 .cse21 .cse22 (= .cse17 (+ .cse23 .cse24)) .cse25 .cse26 .cse27 .cse28 .cse29)) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~n~0#1| .cse31) (= .cse32 (+ 91 .cse33)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 .cse18 .cse19 (= .cse33 .cse4) .cse21 .cse22 .cse25 .cse26 .cse27 .cse28 (= (+ |ULTIMATE.start_main_~x~0#1| (* .cse32 (- 1))) .cse34) .cse29) (let ((.cse38 (+ .cse32 (- 7))) (.cse40 (+ 7 (+ 18 (- 6))))) (and (<= .cse35 |ULTIMATE.start_main_~a~0#1|) .cse0 (= |ULTIMATE.start_main_~z~0#1| (+ 6 18)) (= |ULTIMATE.start_main_~x~0#1| (+ .cse36 .cse32)) .cse1 (= |ULTIMATE.start_main_~n~0#1| .cse14) (= (+ |ULTIMATE.start_main_~x~0#1| (* 19 (- 1))) (+ 1 (+ 19 .cse37))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 (<= |ULTIMATE.start_main_~n~0#1| .cse14) .cse18 .cse19 (= .cse38 .cse39) (<= 2 |ULTIMATE.start_main_~a~0#1|) .cse21 .cse22 (= |ULTIMATE.start_main_~y~0#1| (+ .cse40 18)) (= .cse41 (+ 6 .cse38)) .cse25 .cse26 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse42)) .cse27 (= (+ .cse43 (+ (+ |ULTIMATE.start_main_~x~0#1| (* .cse40 (- 1))) .cse43) 6) 0) .cse28 .cse29)) (let ((.cse44 (+ .cse41 27 (- 14)))) (and (= .cse33 (+ 6 (+ (+ .cse44 (* .cse33 (- 1))) (- 7)))) .cse45 .cse0 .cse1 .cse3 (= |ULTIMATE.start_main_~x~0#1| (+ 27 .cse44)) .cse5 .cse6 .cse7 .cse8 (= .cse46 .cse14) .cse9 .cse10 .cse11 .cse12 .cse15 .cse18 .cse19 .cse20 .cse21 .cse22 .cse25 .cse26 .cse27 .cse28 (= |ULTIMATE.start_main_~y~0#1| (+ .cse44 .cse41)) (or .cse47 .cse48 .cse49) .cse29)) (and .cse18 .cse19 .cse0 .cse21 .cse1 .cse22 .cse5 .cse6 .cse7 .cse8 .cse26 .cse9 .cse27 .cse10 .cse11 .cse12 .cse15 .cse28 .cse29) (and .cse0 .cse50 .cse1 .cse51 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse52 .cse15 .cse53 .cse18 .cse19 .cse21 .cse22 .cse54 .cse55 .cse26 .cse27 .cse28 .cse29) (and .cse0 .cse50 .cse1 .cse51 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse52 .cse15 .cse53 .cse18 .cse19 .cse21 .cse22 .cse54 .cse55 .cse56 .cse57 .cse26 .cse27 .cse28 .cse29) (and .cse45 .cse0 .cse50 .cse1 .cse51 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse52 .cse15 .cse53 .cse18 .cse19 .cse21 .cse22 .cse55 .cse56 .cse25 .cse57 .cse26 .cse27 .cse28 .cse29 (let ((.cse62 (+ .cse68 .cse65)) (.cse63 (+ 6 .cse66)) (.cse59 (+ .cse67 1))) (or .cse58 (not (<= .cse59 (+ 1 .cse60))) (not (= 0 (+ (+ (* .cse61 .cse62) (- (* .cse62 .cse63))) (* 12 .cse62)))) (not (<= .cse60 |ULTIMATE.start_main_~a~0#1|)) (= 0 (+ (+ (let ((.cse64 (+ .cse65 .cse66))) (+ (+ (+ (* (* 2 .cse64) .cse64) (- (* (* 3 .cse62) .cse63))) (- (* 18 .cse62))) (- (* 10 .cse64)))) (* 3 .cse63)) (- 10))) (<= .cse59 |ULTIMATE.start_main_~a~0#1|)))) (and .cse18 .cse19 .cse0 .cse21 .cse50 .cse1 .cse22 .cse54 .cse51 .cse5 .cse6 .cse7 .cse8 .cse26 .cse9 .cse27 .cse10 .cse11 .cse12 .cse52 .cse15 .cse28 .cse53 .cse29) (let ((.cse80 (+ .cse82 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (- 6)))) (let ((.cse79 (+ |ULTIMATE.start_main_~y~0#1| .cse81 .cse80))) (let ((.cse77 (+ |ULTIMATE.start_main_~y~0#1| (* .cse79 (- 1))))) (let ((.cse69 (+ (* .cse77 (- 1)) .cse80 6))) (let ((.cse70 (+ |ULTIMATE.start_main_~y~0#1| (- 7))) (.cse75 (+ |ULTIMATE.start_main_~y~0#1| .cse37)) (.cse78 (+ .cse77 .cse69 (* .cse80 (- 1))))) (and (= .cse69 0) (= |ULTIMATE.start_main_~y~0#1| (+ 7 .cse41)) (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse70)) (= |ULTIMATE.start_main_~y~0#1| (+ (+ 1 (+ 12 (- 6))) 12)) .cse0 .cse1 (= |ULTIMATE.start_main_~n~0#1| (+ 1 1)) (<= 1 |ULTIMATE.start_main_~a~0#1|) (= .cse13 0) .cse71 .cse5 .cse6 .cse7 .cse8 (or .cse72 .cse73) .cse9 .cse10 .cse11 .cse12 .cse15 (= |ULTIMATE.start_main_~z~0#1| (+ 6 12)) (= |ULTIMATE.start_main_~x~0#1| .cse36) .cse19 (= |ULTIMATE.start_main_~z~0#1| .cse42) (= .cse41 .cse39) (= .cse46 .cse74) .cse22 .cse25 (= .cse75 .cse76) .cse26 .cse27 (= (+ .cse77 (* .cse78 (- 1))) 1) (= (+ .cse43 (+ |ULTIMATE.start_main_~x~0#1| .cse43) 6) 0) (= .cse70 .cse39) .cse28 (= |ULTIMATE.start_main_~x~0#1| (+ 1 .cse75)) (= |ULTIMATE.start_main_~n~0#1| .cse35) (= .cse79 (+ 6 .cse78)) .cse29)))))) (and .cse19 .cse0 (= |ULTIMATE.start_main_~x~0#1| 0) .cse83 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) (- .cse61)) (- .cse84)) .cse85) (- 10))) .cse86 (= |ULTIMATE.start_main_~z~0#1| 6) .cse25 (or (not .cse26) .cse87 .cse88 .cse89) .cse6 .cse7 .cse26 (= |ULTIMATE.start_main_~y~0#1| 1) .cse90 .cse9 .cse27 .cse91 .cse10 .cse11 .cse12 .cse28 .cse29) (and .cse0 .cse50 .cse1 .cse51 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse52 .cse15 .cse53 .cse18 .cse19 .cse21 .cse22 .cse54 .cse55 .cse57 .cse26 .cse27 .cse28 .cse29) (and .cse18 .cse19 .cse0 .cse21 .cse1 .cse22 .cse54 .cse5 .cse6 .cse7 .cse8 .cse26 .cse9 .cse27 .cse10 .cse11 .cse12 .cse52 .cse15 .cse28 .cse29) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_main_~y~0#1| (+ 91 .cse41)) .cse9 .cse10 .cse11 .cse12 .cse15 .cse18 .cse19 (= |ULTIMATE.start_main_~x~0#1| .cse34) .cse21 .cse22 (= .cse41 .cse4) .cse25 .cse26 .cse27 .cse28 (= |ULTIMATE.start_main_~n~0#1| .cse92) .cse29) (let ((.cse93 (+ (* 48 2) 73))) (and (= |ULTIMATE.start_main_~z~0#1| (+ 6 48)) .cse0 (= |ULTIMATE.start_main_~x~0#1| (+ (+ 48 295) .cse93)) .cse1 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 (= |ULTIMATE.start_main_~y~0#1| (+ .cse93 48)) .cse18 .cse19 .cse21 (<= .cse31 |ULTIMATE.start_main_~a~0#1|) .cse22 (<= |ULTIMATE.start_main_~n~0#1| (+ 1 .cse31)) .cse25 .cse26 .cse27 .cse28 .cse29)) (and .cse18 .cse19 .cse0 .cse21 .cse1 .cse22 .cse54 .cse5 .cse6 .cse7 .cse8 .cse26 .cse9 .cse27 .cse10 .cse11 .cse12 .cse15 .cse28 .cse29) (let ((.cse97 (+ .cse82 |ULTIMATE.start_main_~x~0#1| 6))) (let ((.cse94 (* 1 (- 1))) (.cse98 (+ |ULTIMATE.start_main_~y~0#1| .cse97 .cse81))) (and (= (+ |ULTIMATE.start_main_~x~0#1| .cse94) 0) (= .cse41 (+ 6 (* 6 0))) .cse0 (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse41)) (= (+ |ULTIMATE.start_main_~y~0#1| (* 6 (- 1))) 1) .cse71 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 (= |ULTIMATE.start_main_~n~0#1| .cse74) .cse12 (= |ULTIMATE.start_main_~y~0#1| .cse76) .cse19 (= .cse41 6) (= (+ .cse94 |ULTIMATE.start_main_~x~0#1|) 0) .cse83 (= .cse46 0) .cse22 .cse86 (= |ULTIMATE.start_main_~z~0#1| .cse39) (or (< (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1)) .cse95 .cse96) .cse25 .cse26 (= .cse97 0) (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse98)) .cse27 .cse91 .cse28 (= |ULTIMATE.start_main_~x~0#1| 1) (= (+ |ULTIMATE.start_main_~y~0#1| (* .cse98 (- 1))) 1) .cse29))) (and .cse18 .cse19 .cse0 .cse21 .cse1 .cse22 .cse54 .cse5 .cse6 .cse7 .cse8 .cse26 .cse9 .cse27 .cse10 .cse11 .cse12 .cse52 .cse15 .cse28 .cse53 .cse29) (and .cse18 .cse19 .cse0 .cse21 .cse50 .cse1 .cse22 .cse54 .cse5 .cse6 .cse7 .cse8 .cse26 .cse9 .cse27 .cse10 .cse11 .cse12 .cse52 .cse15 .cse28 .cse53 .cse29)))))))))) [2023-02-18 16:43:23,395 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-18 16:43:23,396 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-18 16:43:23,396 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2023-02-18 16:43:23,396 INFO L895 garLoopResultBuilder]: At program point L51(line 51) the Hoare annotation is: (let ((.cse4 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse2 (= |ULTIMATE.start_main_~n~0#1| 0))) (let ((.cse3 (let ((.cse13 (= |ULTIMATE.start_main_~z~0#1| (+ (* 6 |ULTIMATE.start_main_~n~0#1|) 6)))) (or (let ((.cse12 (* (- 6) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse11 (<= (+ |ULTIMATE.start_main_~z~0#1| .cse12 (- 6)) 0))) (and (or (not .cse11) (<= 0 .cse4) (not (<= (+ |ULTIMATE.start_main_~z~0#1| .cse12 (- 5)) 0))) (not .cse13) .cse2 (or .cse11 (<= |ULTIMATE.start_main_~z~0#1| 6))))) .cse13))) (.cse0 (- (* 12 |ULTIMATE.start_main_~y~0#1|)))) (let ((.cse1 (let ((.cse5 (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (let ((.cse10 (+ 1 |ULTIMATE.start_main_~n~0#1|))) (* (* .cse10 .cse10) .cse10)))) (.cse6 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (- (* 18 |ULTIMATE.start_main_~x~0#1|))) .cse0) (* 2 |ULTIMATE.start_main_~z~0#1|)) (- 6)))) (.cse7 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (let ((.cse9 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ (* .cse9 |ULTIMATE.start_main_~n~0#1|) .cse9))))) (.cse8 (= |ULTIMATE.start_main_~x~0#1| (* (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~n~0#1|)))) (or (and .cse5 .cse6 .cse3 .cse7 (= |ULTIMATE.start_main_~n~0#1| (+ 1 0)) .cse8 (= |ULTIMATE.start_main_~x~0#1| 1)) (and .cse5 .cse6 .cse3 .cse7 .cse8))))) (or (and (= 0 (+ 12 (+ (+ (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) .cse0) (- (* 6 |ULTIMATE.start_main_~z~0#1|))))) .cse1) (and (= |ULTIMATE.start_main_~y~0#1| 1) .cse2 (= |ULTIMATE.start_main_~x~0#1| 0) .cse3 (= |ULTIMATE.start_main_~z~0#1| 6)) (and (= .cse4 (+ 6 (* 6 0))) (= .cse4 6) .cse1 (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse4))))))) [2023-02-18 16:43:23,397 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (let ((.cse96 (+ 1 |ULTIMATE.start_main_~n~0#1|)) (.cse122 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse92 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse95 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse103 (div (- |ULTIMATE.start_main_~z~0#1|) (- 6)))) (let ((.cse102 (+ .cse103 1)) (.cse100 (+ 6 .cse95)) (.cse125 (+ .cse122 .cse92)) (.cse97 (+ .cse92 .cse95)) (.cse101 (+ 1 .cse96))) (let ((.cse113 (+ 1 .cse101)) (.cse120 (+ .cse125 .cse97)) (.cse119 (+ .cse97 .cse100)) (.cse121 (+ 6 .cse100)) (.cse117 (+ .cse102 1))) (let ((.cse61 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse112 (+ .cse117 1)) (.cse116 (+ 6 .cse121)) (.cse115 (+ .cse120 .cse119)) (.cse114 (+ .cse119 .cse121)) (.cse82 (+ 1 .cse113))) (let ((.cse74 (+ 1 .cse82)) (.cse80 (+ .cse115 .cse114)) (.cse83 (+ .cse114 .cse116)) (.cse81 (+ 6 .cse116)) (.cse79 (+ .cse112 1)) (.cse34 (+ |ULTIMATE.start_main_~a~0#1| 1)) (.cse123 (= 0 (+ (+ (* .cse61 .cse122) (- (* .cse122 .cse95))) (* 12 .cse122)))) (.cse43 (not (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))) (.cse17 (<= |ULTIMATE.start_main_~a~0#1| 50)) (.cse16 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse29 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse0 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse69 (* 6 |ULTIMATE.start_main_~n~0#1|)) (.cse118 (- (* 18 |ULTIMATE.start_main_~x~0#1|))) (.cse130 (- (* 12 |ULTIMATE.start_main_~y~0#1|))) (.cse45 (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|))) (.cse46 (* 12 |ULTIMATE.start_main_~x~0#1|)) (.cse131 (+ |ULTIMATE.start_main_~a~0#1| 65536)) (.cse108 (* (div (+ (- |ULTIMATE.start_main_~a~0#1|) (- 1)) 65536) 65536))) (let ((.cse13 (= (mod (* |ULTIMATE.start_main_~z~0#1| 5) 6) 0)) (.cse94 (- (* 18 .cse122))) (.cse124 (+ .cse108 65536)) (.cse107 (* |ULTIMATE.start_main_~a~0#1| (- 1))) (.cse106 (< .cse131 65536)) (.cse41 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767)) (.cse109 (<= 0 .cse131)) (.cse99 (- (* 18 .cse125))) (.cse90 (= 0 (+ (+ (* .cse61 |ULTIMATE.start_main_~x~0#1|) .cse45) .cse46))) (.cse33 (= .cse122 (* (* .cse96 .cse96) .cse96))) (.cse51 (= 0 (+ 12 (+ (+ (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) .cse130) (- (* 6 |ULTIMATE.start_main_~z~0#1|)))))) (.cse35 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) .cse118) .cse130) (* 2 |ULTIMATE.start_main_~z~0#1|)) (- 6)))) (.cse1 (let ((.cse129 (= |ULTIMATE.start_main_~z~0#1| (+ .cse69 6)))) (or (let ((.cse128 (* (- 6) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse127 (<= (+ |ULTIMATE.start_main_~z~0#1| .cse128 (- 6)) 0))) (and (or (not .cse127) (<= 0 .cse29) (not (<= (+ |ULTIMATE.start_main_~z~0#1| .cse128 (- 5)) 0))) (not .cse129) .cse0 (or .cse127 (<= |ULTIMATE.start_main_~z~0#1| 6))))) .cse129))) (.cse30 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (let ((.cse126 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ (* .cse126 |ULTIMATE.start_main_~n~0#1|) .cse126))))) (.cse37 (= |ULTIMATE.start_main_~x~0#1| (* (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~n~0#1|))) (.cse20 (or (and .cse16 .cse17 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not .cse17) (not .cse16))))) (.cse32 (or (< (+ |ULTIMATE.start_main_~n~0#1| 1) .cse34) .cse123 .cse43)) (.cse73 (+ .cse79 1)) (.cse77 (+ 6 .cse81)) (.cse76 (+ .cse80 .cse83)) (.cse75 (+ .cse83 .cse81)) (.cse78 (+ 1 .cse74))) (let ((.cse36 (+ 1 0)) (.cse60 (+ 1 .cse78)) (.cse68 (+ .cse76 .cse75)) (.cse65 (+ .cse75 .cse77)) (.cse66 (+ 6 .cse77)) (.cse67 (+ .cse73 1)) (.cse53 (or (and .cse33 .cse51 .cse35 .cse16 .cse1 .cse17 .cse30 .cse37 .cse20 .cse90 .cse32) (and .cse33 .cse51 .cse35 .cse16 .cse1 .cse17 .cse30 .cse37 .cse20 .cse32))) (.cse84 (not (= 0 (+ (+ (* .cse61 .cse125) (- (* .cse125 .cse100))) (* 12 .cse125))))) (.cse85 (not (<= .cse96 |ULTIMATE.start_main_~a~0#1|))) (.cse86 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse97) .cse97) (- (* (* 3 .cse125) .cse100))) .cse99) (- (* 10 .cse97))) (* 3 .cse100)) (- 10)))) (.cse40 (and .cse106 (not .cse41) .cse109)) (.cse110 (<= .cse124 (+ .cse107 32767))) (.cse31 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse42 (< |ULTIMATE.start_main_~a~0#1| 65536)) (.cse111 (<= .cse124 (+ .cse107 65535))) (.cse87 (+ .cse103 (- 1))) (.cse104 (not .cse123)) (.cse105 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse92) .cse92) (- (* (* 3 .cse122) .cse95))) .cse94) (- (* 10 .cse92))) (* 3 .cse95)) (- 10)))) (.cse58 (not .cse13)) (.cse70 (not (= 0 (+ (+ (* .cse61 .cse120) (- (* .cse120 .cse121))) (* 12 .cse120))))) (.cse71 (not (<= .cse101 |ULTIMATE.start_main_~a~0#1|))) (.cse72 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse119) .cse119) (- (* (* 3 .cse120) .cse121))) (- (* 18 .cse120))) (- (* 10 .cse119))) (* 3 .cse121)) (- 10))))) (let ((.cse4 (= 0 (+ (+ (+ (+ (+ (* (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))) .cse118) (- (* 10 |ULTIMATE.start_main_~y~0#1|))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)))) (.cse6 (= 0 (+ 12 (+ (+ (* .cse29 .cse29) (- (* 12 (+ |ULTIMATE.start_main_~y~0#1| (* .cse29 (- 1)))))) (- (* 6 .cse29)))))) (.cse7 (or (<= .cse117 |ULTIMATE.start_main_~a~0#1|) .cse58 .cse70 .cse71 (not (<= .cse117 .cse113)) .cse72)) (.cse8 (or .cse104 .cse105 .cse43)) (.cse9 (or .cse58 (not (<= .cse112 .cse82)) (not (<= .cse113 |ULTIMATE.start_main_~a~0#1|)) (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse114) .cse114) (- (* (* 3 .cse115) .cse116))) (- (* 18 .cse115))) (- (* 10 .cse114))) (* 3 .cse116)) (- 10))) (<= .cse112 |ULTIMATE.start_main_~a~0#1|) (not (= 0 (+ (+ (* .cse61 .cse115) (- (* .cse115 .cse116))) (* 12 .cse115)))))) (.cse11 (<= (+ .cse87 (- 1)) |ULTIMATE.start_main_~a~0#1|)) (.cse14 (or .cse40 (and .cse110 .cse31 .cse42 .cse111))) (.cse18 (or (and .cse106 (<= (+ .cse107 (- 65536)) .cse108) .cse109 (<= (+ .cse107 (- 32768)) .cse108)) (and .cse110 .cse31 .cse111 .cse42))) (.cse19 (or .cse58 (<= .cse103 |ULTIMATE.start_main_~a~0#1|) .cse104 (not (<= .cse103 .cse96)) .cse105 .cse43)) (.cse21 (or .cse58 .cse84 (<= .cse102 |ULTIMATE.start_main_~a~0#1|) (not (<= .cse102 .cse101)) .cse85 .cse86)) (.cse22 (let ((.cse88 (let ((.cse98 (+ 6 (* 6 .cse101)))) (or (= 0 (+ (+ (+ (+ (* .cse97 .cse98) .cse99) (- (* 12 .cse97))) (* 2 .cse98)) (- 6))) (not (= .cse98 .cse100))))) (.cse89 (let ((.cse93 (+ 6 (* 6 .cse96)))) (or (= 0 (+ (+ (+ (+ (* .cse92 .cse93) .cse94) (- (* 12 .cse92))) (* 2 .cse93)) (- 6))) (not (= .cse93 .cse95)))))) (or (and .cse88 .cse89 .cse35 .cse53 .cse16 .cse17 .cse20 .cse90) (let ((.cse91 (+ 6 6))) (and .cse88 (<= 2 |ULTIMATE.start_main_~a~0#1|) .cse89 .cse35 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (+ 6 .cse91))) .cse53 .cse16 .cse17 .cse20 (= (+ |ULTIMATE.start_main_~x~0#1| (* 19 (- 1))) (+ 1 (+ 19 (* .cse91 (- 1))))) .cse43 (<= |ULTIMATE.start_main_~n~0#1| (+ 1 2))))))) (.cse2 (not (<= .cse87 |ULTIMATE.start_main_~a~0#1|))) (.cse3 (<= (+ |ULTIMATE.start_main_~n~0#1| (- 1)) |ULTIMATE.start_main_~a~0#1|)) (.cse5 (or .cse84 .cse85 .cse86)) (.cse10 (or .cse58 (not (<= .cse79 .cse74)) (not (= 0 (+ (+ (* .cse61 .cse80) (- (* .cse80 .cse81))) (* 12 .cse80)))) (not (<= .cse82 |ULTIMATE.start_main_~a~0#1|)) (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse83) .cse83) (- (* (* 3 .cse80) .cse81))) (- (* 18 .cse80))) (- (* 10 .cse83))) (* 3 .cse81)) (- 10))) (<= .cse79 |ULTIMATE.start_main_~a~0#1|))) (.cse12 (or (not (= 0 (+ (+ (* .cse61 .cse68) (- (* .cse68 .cse66))) (* 12 .cse68)))) (not (<= .cse67 .cse60)) .cse58 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse65) .cse65) (- (* (* 3 .cse68) .cse66))) (- (* 18 .cse68))) (- (* 10 .cse65))) (* 3 .cse66)) (- 10))) (not (<= .cse78 |ULTIMATE.start_main_~a~0#1|)) (<= .cse67 |ULTIMATE.start_main_~a~0#1|))) (.cse15 (or (<= .cse73 |ULTIMATE.start_main_~a~0#1|) (not (<= .cse74 |ULTIMATE.start_main_~a~0#1|)) .cse58 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse75) .cse75) (- (* (* 3 .cse76) .cse77))) (- (* 18 .cse76))) (- (* 10 .cse75))) (* 3 .cse77)) (- 10))) (not (<= .cse73 .cse78)) (not (= 0 (+ (+ (* .cse61 .cse76) (- (* .cse76 .cse77))) (* 12 .cse76)))))) (.cse23 (or .cse70 .cse71 .cse72)) (.cse24 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse69))) (.cse25 (let ((.cse62 (+ .cse68 .cse65)) (.cse63 (+ 6 .cse66)) (.cse59 (+ .cse67 1))) (or .cse58 (not (<= .cse59 (+ 1 .cse60))) (not (= 0 (+ (+ (* .cse61 .cse62) (- (* .cse62 .cse63))) (* 12 .cse62)))) (not (<= .cse60 |ULTIMATE.start_main_~a~0#1|)) (= 0 (+ (+ (let ((.cse64 (+ .cse65 .cse66))) (+ (+ (+ (* (* 2 .cse64) .cse64) (- (* (* 3 .cse62) .cse63))) (- (* 18 .cse62))) (- (* 10 .cse64)))) (* 3 .cse63)) (- 10))) (<= .cse59 |ULTIMATE.start_main_~a~0#1|)))) (.cse26 (+ 1 .cse36))) (or (and (= |ULTIMATE.start_main_~y~0#1| 1) .cse0 (= |ULTIMATE.start_main_~x~0#1| 0) .cse1 (= |ULTIMATE.start_main_~z~0#1| 6)) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (let ((.cse27 (+ 7 (+ 18 (- 6))))) (and .cse2 .cse3 (<= .cse26 |ULTIMATE.start_main_~a~0#1|) .cse6 (= |ULTIMATE.start_main_~z~0#1| (+ 6 18)) (= |ULTIMATE.start_main_~y~0#1| (+ .cse27 18)) .cse11 .cse13 .cse14 .cse16 .cse17 (= (let ((.cse28 (* 7 (- 1)))) (+ .cse28 (+ (+ |ULTIMATE.start_main_~x~0#1| (* .cse27 (- 1))) .cse28) 6)) 0) .cse18 .cse20 .cse22 .cse24)) (and (= .cse29 (+ 6 (* 6 0))) (= .cse29 6) (= (+ (* 1 (- 1)) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (+ |ULTIMATE.start_main_~y~0#1| (- 1)))) .cse30 .cse31 (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse29)) .cse32 .cse33 (<= .cse34 1) .cse35 .cse16 (<= |ULTIMATE.start_main_~n~0#1| .cse36) .cse1 .cse17 (= |ULTIMATE.start_main_~n~0#1| .cse36) .cse37 .cse20 (= |ULTIMATE.start_main_~x~0#1| 1)) (let ((.cse39 (+ 1 (+ 1 5))) (.cse38 (+ (* 48 2) 73))) (and .cse2 .cse3 (= |ULTIMATE.start_main_~z~0#1| (+ 6 48)) .cse5 .cse6 (= |ULTIMATE.start_main_~x~0#1| (+ (+ 48 295) .cse38)) (<= .cse39 |ULTIMATE.start_main_~a~0#1|) .cse8 (<= |ULTIMATE.start_main_~n~0#1| (+ 1 .cse39)) .cse11 (or .cse40 (and .cse41 .cse31 .cse42)) .cse13 .cse14 .cse16 .cse17 .cse18 .cse20 (= |ULTIMATE.start_main_~y~0#1| (+ .cse38 48)) .cse22 .cse23 .cse43 .cse24)) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse11 .cse13 .cse14 .cse16 .cse17 .cse18 .cse20 .cse22 .cse23 .cse24) (and .cse6 .cse7 .cse8 .cse9 (or (exists ((|aux_div_ULTIMATE.start_main_~a~0#1_40| Int) (|aux_mod_ULTIMATE.start_main_~a~0#1_40| Int)) (let ((.cse44 (+ (* |aux_div_ULTIMATE.start_main_~a~0#1_40| 65536) |aux_mod_ULTIMATE.start_main_~a~0#1_40|))) (let ((.cse47 (+ .cse44 65536))) (and (<= .cse44 50) (not (<= |aux_mod_ULTIMATE.start_main_~a~0#1_40| 32767)) (= 0 (+ (+ (* (* 6 .cse44) |ULTIMATE.start_main_~x~0#1|) .cse45) .cse46)) (>= .cse44 0) (<= 0 |aux_mod_ULTIMATE.start_main_~a~0#1_40|) (<= 0 .cse47) (< |aux_mod_ULTIMATE.start_main_~a~0#1_40| 65536) (< .cse47 65536))))) (exists ((|aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51| Int) (|aux_div_ULTIMATE.start_main_~a~0#1_54| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51| Int)) (let ((.cse48 (+ |aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51| (* |aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51| 65536)))) (let ((.cse49 (+ (* |aux_div_ULTIMATE.start_main_~a~0#1_54| (- 65536)) (* .cse48 (- 1)) (- 1)))) (let ((.cse50 (* .cse49 (- 1)))) (and (<= 0 .cse48) (<= 0 |aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51|) (<= 0 .cse49) (< .cse49 65536) (>= .cse49 0) (= 0 (+ (+ (* (* 6 .cse49) |ULTIMATE.start_main_~x~0#1|) .cse45) .cse46)) (< |aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51| 65536) (<= .cse49 50) (< .cse48 65536) (<= (+ (* |aux_div_ULTIMATE.start_main_~a~0#1_54| 65536) 65536) (+ .cse50 32767)) (<= (+ (* (+ |aux_div_ULTIMATE.start_main_~a~0#1_54| |aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51|) 65536) 65536) (+ .cse50 65535)))))))) .cse11 .cse13 .cse14 .cse35 .cse17 .cse18 .cse19 .cse21 .cse22 .cse2 .cse3 .cse5 .cse10 .cse12 .cse15 .cse51 .cse16 .cse20 .cse23 .cse24 .cse25) (let ((.cse57 (+ (* |ULTIMATE.start_main_~y~0#1| (- 1)) |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (- 6)))) (let ((.cse56 (+ |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~x~0#1| (- 1)) .cse57))) (let ((.cse54 (+ |ULTIMATE.start_main_~y~0#1| (* .cse56 (- 1))))) (let ((.cse52 (+ (* .cse54 (- 1)) .cse57 6))) (let ((.cse55 (+ .cse54 .cse52 (* .cse57 (- 1))))) (and (= .cse52 0) (= |ULTIMATE.start_main_~z~0#1| (+ 6 12)) (= |ULTIMATE.start_main_~y~0#1| (+ (+ 1 (+ 12 (- 6))) 12)) .cse53 (= |ULTIMATE.start_main_~n~0#1| (+ 1 1)) (<= 1 |ULTIMATE.start_main_~a~0#1|) .cse16 (= (+ .cse54 (* .cse55 (- 1))) 1) .cse17 .cse20 (= |ULTIMATE.start_main_~n~0#1| .cse26) .cse43 (= .cse56 (+ 6 .cse55))))))))))))))))) [2023-02-18 16:43:23,397 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2023-02-18 16:43:23,399 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (let ((.cse122 (+ 1 |ULTIMATE.start_main_~n~0#1|)) (.cse137 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse108 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse153 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse120 (div (- |ULTIMATE.start_main_~z~0#1|) (- 6)))) (let ((.cse117 (+ .cse120 1)) (.cse114 (+ 6 .cse153)) (.cse150 (+ .cse137 .cse108)) (.cse111 (+ .cse108 .cse153)) (.cse115 (+ 1 .cse122))) (let ((.cse139 (+ 1 .cse115)) (.cse156 (+ .cse150 .cse111)) (.cse155 (+ .cse111 .cse114)) (.cse157 (+ 6 .cse114)) (.cse143 (+ .cse117 1))) (let ((.cse138 (+ .cse143 1)) (.cse142 (+ 6 .cse157)) (.cse141 (+ .cse156 .cse155)) (.cse140 (+ .cse155 .cse157)) (.cse103 (+ 1 .cse139)) (.cse66 (* 6 |ULTIMATE.start_main_~a~0#1|))) (let ((.cse126 (* (div (+ (- |ULTIMATE.start_main_~a~0#1|) (- 1)) 65536) 65536)) (.cse134 (* 6 |ULTIMATE.start_main_~n~0#1|)) (.cse161 (+ |ULTIMATE.start_main_~a~0#1| 65536)) (.cse60 (+ 30 (- 6))) (.cse159 (* .cse66 .cse137)) (.cse160 (* 12 .cse137)) (.cse100 (+ 1 .cse103)) (.cse101 (+ .cse141 .cse140)) (.cse104 (+ .cse140 .cse142)) (.cse102 (+ 6 .cse142)) (.cse99 (+ .cse138 1))) (let ((.cse145 (+ .cse99 1)) (.cse148 (+ 6 .cse102)) (.cse147 (+ .cse101 .cse104)) (.cse146 (+ .cse104 .cse102)) (.cse4 (= (mod (* |ULTIMATE.start_main_~z~0#1| 5) 6) 0)) (.cse149 (+ 1 .cse100)) (.cse113 (- (* 18 .cse150))) (.cse26 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse82 (= 0 (+ (+ .cse159 (- (* .cse137 .cse153))) .cse160))) (.cse27 (= 0 (+ (+ (* .cse66 |ULTIMATE.start_main_~x~0#1|) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 12 |ULTIMATE.start_main_~x~0#1|)))) (.cse92 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse135 (- (* 18 |ULTIMATE.start_main_~x~0#1|))) (.cse59 (+ .cse60 27 (- 14))) (.cse124 (< .cse161 65536)) (.cse144 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767)) (.cse127 (<= 0 .cse161)) (.cse23 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse21 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse134))) (.cse158 (+ .cse126 65536)) (.cse125 (* |ULTIMATE.start_main_~a~0#1| (- 1))) (.cse151 (* (* 2 .cse108) .cse108)) (.cse152 (* 3 .cse137)) (.cse110 (- (* 18 .cse137))) (.cse154 (- (* 10 .cse108))) (.cse109 (+ 6 (* 6 .cse122)))) (let ((.cse9 (<= |ULTIMATE.start_main_~a~0#1| 50)) (.cse19 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse97 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse98 (- (* 12 |ULTIMATE.start_main_~y~0#1|))) (.cse93 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse94 (not (= 0 (+ (+ .cse159 (- (* .cse137 .cse109))) .cse160)))) (.cse95 (= 0 (+ (+ (+ (+ (+ .cse151 (- (* .cse152 .cse109))) .cse110) .cse154) (* 3 .cse109)) (- 10)))) (.cse96 (not (= .cse109 .cse153))) (.cse128 (<= .cse158 (+ .cse125 32767))) (.cse129 (<= .cse158 (+ .cse125 65535))) (.cse105 (not .cse21)) (.cse76 (not (= 0 (+ (+ (* .cse66 .cse156) (- (* .cse156 .cse157))) (* 12 .cse156))))) (.cse77 (not (<= .cse115 |ULTIMATE.start_main_~a~0#1|))) (.cse78 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse155) .cse155) (- (* (* 3 .cse156) .cse157))) (- (* 18 .cse156))) (- (* 10 .cse155))) (* 3 .cse157)) (- 10)))) (.cse89 (+ |ULTIMATE.start_main_~y~0#1| (* .cse23 (- 1)))) (.cse136 (and .cse124 (not .cse144) .cse127)) (.cse81 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse130 (< |ULTIMATE.start_main_~a~0#1| 65536)) (.cse30 (+ 6 6)) (.cse34 (+ 1 6)) (.cse32 (+ 1 0)) (.cse56 (+ 27 .cse59)) (.cse61 (* 30 (- 1))) (.cse88 (+ 1 5)) (.cse62 (= 0 (+ (+ (+ (+ (+ (* .cse92 |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))) .cse135) (- (* 10 |ULTIMATE.start_main_~y~0#1|))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)))) (.cse106 (not .cse27)) (.cse121 (not .cse82)) (.cse123 (= 0 (+ (+ (+ (+ (+ .cse151 (- (* .cse152 .cse153))) .cse110) .cse154) (* 3 .cse153)) (- 10)))) (.cse83 (not .cse26)) (.cse116 (not (= 0 (+ (+ (* .cse66 .cse150) (- (* .cse150 .cse114))) (* 12 .cse150))))) (.cse118 (not (<= .cse122 |ULTIMATE.start_main_~a~0#1|))) (.cse119 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse111) .cse111) (- (* (* 3 .cse150) .cse114))) .cse113) (- (* 10 .cse111))) (* 3 .cse114)) (- 10)))) (.cse65 (+ 1 .cse149)) (.cse63 (not .cse4)) (.cse73 (+ .cse147 .cse146)) (.cse70 (+ .cse146 .cse148)) (.cse71 (+ 6 .cse148)) (.cse72 (+ .cse145 1)) (.cse31 (+ |ULTIMATE.start_main_~n~0#1| (- 1)))) (let ((.cse25 (+ .cse31 (- 1))) (.cse51 (or (not (= 0 (+ (+ (* .cse66 .cse73) (- (* .cse73 .cse71))) (* 12 .cse73)))) (not (<= .cse72 .cse65)) .cse63 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse70) .cse70) (- (* (* 3 .cse73) .cse71))) (- (* 18 .cse73))) (- (* 10 .cse70))) (* 3 .cse71)) (- 10))) (not (<= .cse149 |ULTIMATE.start_main_~a~0#1|)) (<= .cse72 |ULTIMATE.start_main_~a~0#1|))) (.cse50 (or (<= .cse145 |ULTIMATE.start_main_~a~0#1|) (not (<= .cse100 |ULTIMATE.start_main_~a~0#1|)) .cse63 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse146) .cse146) (- (* (* 3 .cse147) .cse148))) (- (* 18 .cse147))) (- (* 10 .cse146))) (* 3 .cse148)) (- 10))) (not (<= .cse145 .cse149)) (not (= 0 (+ (+ (* .cse66 .cse147) (- (* .cse147 .cse148))) (* 12 .cse147)))))) (.cse58 (or .cse116 .cse118 .cse119)) (.cse42 (* |ULTIMATE.start_main_~x~0#1| (- 1))) (.cse43 (* |ULTIMATE.start_main_~y~0#1| (- 1))) (.cse53 (or .cse121 .cse123 .cse83)) (.cse52 (or .cse62 .cse106)) (.cse15 (+ 1 .cse88)) (.cse74 (+ .cse23 (- 6))) (.cse54 (+ 6 30)) (.cse87 (+ (+ .cse56 (+ 91 .cse61)) 91)) (.cse38 (+ 1 .cse32)) (.cse28 (+ 1 .cse34)) (.cse41 (* .cse30 (- 1))) (.cse55 (+ 1 2)) (.cse29 (+ 6 .cse30)) (.cse37 (* 7 (- 1))) (.cse80 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (+ |ULTIMATE.start_main_~y~0#1| (- 1))))) (.cse17 (or .cse136 (and .cse144 .cse81 .cse130))) (.cse86 (<= |ULTIMATE.start_main_~n~0#1| .cse32)) (.cse0 (= 0 (+ 12 (+ (+ (* .cse23 .cse23) (- (* 12 .cse89))) (- (* 6 .cse23)))))) (.cse46 (or (<= .cse143 |ULTIMATE.start_main_~a~0#1|) .cse63 .cse76 .cse77 (not (<= .cse143 .cse139)) .cse78)) (.cse47 (or .cse63 (not (<= .cse138 .cse103)) (not (<= .cse139 |ULTIMATE.start_main_~a~0#1|)) (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse140) .cse140) (- (* (* 3 .cse141) .cse142))) (- (* 18 .cse141))) (- (* 10 .cse140))) (* 3 .cse142)) (- 10))) (<= .cse138 |ULTIMATE.start_main_~a~0#1|) (not (= 0 (+ (+ (* .cse66 .cse141) (- (* .cse141 .cse142))) (* 12 .cse141)))))) (.cse2 (= .cse137 (* (* .cse122 .cse122) .cse122))) (.cse3 (or .cse105 .cse26 .cse27)) (.cse5 (or .cse136 (and .cse128 .cse81 .cse130 .cse129))) (.cse6 (or .cse94 .cse95 .cse96)) (.cse7 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) .cse135) .cse98) .cse93) (- 6)))) (.cse8 (let ((.cse133 (= |ULTIMATE.start_main_~z~0#1| (+ .cse134 6)))) (or (let ((.cse132 (* (- 6) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse131 (<= (+ |ULTIMATE.start_main_~z~0#1| .cse132 (- 6)) 0))) (and (or (not .cse131) (<= 0 .cse23) (not (<= (+ |ULTIMATE.start_main_~z~0#1| .cse132 (- 5)) 0))) (not .cse133) .cse97 (or .cse131 (<= |ULTIMATE.start_main_~z~0#1| 6))))) .cse133))) (.cse10 (or (and .cse124 (<= (+ .cse125 (- 65536)) .cse126) .cse127 (<= (+ .cse125 (- 32768)) .cse126)) (and .cse128 .cse81 .cse129 .cse130))) (.cse45 (or .cse63 (<= .cse120 |ULTIMATE.start_main_~a~0#1|) .cse121 (not (<= .cse120 .cse122)) .cse123 .cse83)) (.cse11 (= |ULTIMATE.start_main_~x~0#1| (* (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~n~0#1|))) (.cse48 (or .cse63 .cse116 (<= .cse117 |ULTIMATE.start_main_~a~0#1|) (not (<= .cse117 .cse115)) .cse118 .cse119)) (.cse12 (let ((.cse112 (+ 6 (* 6 .cse115)))) (or (= 0 (+ (+ (+ (+ (* .cse111 .cse112) .cse113) (- (* 12 .cse111))) (* 2 .cse112)) (- 6))) (not (= .cse112 .cse114))))) (.cse13 (<= .cse31 |ULTIMATE.start_main_~a~0#1|)) (.cse14 (or (= 0 (+ (+ (+ (+ (* .cse108 .cse109) .cse110) (- (* 12 .cse108))) (* 2 .cse109)) (- 6))) .cse96)) (.cse16 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (let ((.cse107 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ (* .cse107 |ULTIMATE.start_main_~n~0#1|) .cse107))))) (.cse44 (or .cse105 .cse26 .cse62 .cse106)) (.cse49 (or .cse63 (not (<= .cse99 .cse100)) (not (= 0 (+ (+ (* .cse66 .cse101) (- (* .cse101 .cse102))) (* 12 .cse101)))) (not (<= .cse103 |ULTIMATE.start_main_~a~0#1|)) (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse104) .cse104) (- (* (* 3 .cse101) .cse102))) (- (* 18 .cse101))) (- (* 10 .cse104))) (* 3 .cse102)) (- 10))) (<= .cse99 |ULTIMATE.start_main_~a~0#1|))) (.cse18 (= 0 (+ 12 (+ (+ (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) .cse98) (- (* 6 |ULTIMATE.start_main_~z~0#1|)))))) (.cse20 (or (and .cse19 .cse9 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not .cse9) (not .cse19)))))) (or (let ((.cse1 (+ (* 48 2) 73))) (and (= |ULTIMATE.start_main_~z~0#1| (+ 6 48)) .cse0 (= |ULTIMATE.start_main_~x~0#1| (+ (+ 48 295) .cse1)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |ULTIMATE.start_main_~y~0#1| (+ .cse1 48)) .cse12 .cse13 .cse14 (<= .cse15 |ULTIMATE.start_main_~a~0#1|) .cse16 (<= |ULTIMATE.start_main_~n~0#1| (+ 1 .cse15)) .cse17 .cse18 .cse19 .cse20 .cse21)) (let ((.cse40 (+ .cse43 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (- 6)))) (let ((.cse39 (+ |ULTIMATE.start_main_~y~0#1| .cse42 .cse40))) (let ((.cse35 (+ |ULTIMATE.start_main_~y~0#1| (* .cse39 (- 1))))) (let ((.cse22 (+ (* .cse35 (- 1)) .cse40 6))) (let ((.cse24 (+ |ULTIMATE.start_main_~y~0#1| (- 7))) (.cse33 (+ |ULTIMATE.start_main_~y~0#1| .cse41)) (.cse36 (+ .cse35 .cse22 (* .cse40 (- 1))))) (and (= .cse22 0) (= |ULTIMATE.start_main_~y~0#1| (+ 7 .cse23)) (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse24)) (= |ULTIMATE.start_main_~y~0#1| (+ (+ 1 (+ 12 (- 6))) 12)) .cse0 (= |ULTIMATE.start_main_~n~0#1| (+ 1 1)) (<= 1 |ULTIMATE.start_main_~a~0#1|) (= .cse25 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (or .cse26 .cse27) .cse8 .cse9 .cse10 .cse11 (= |ULTIMATE.start_main_~z~0#1| (+ 6 12)) (= |ULTIMATE.start_main_~x~0#1| .cse28) .cse13 (= |ULTIMATE.start_main_~z~0#1| .cse29) (= .cse23 .cse30) (= .cse31 .cse32) .cse16 .cse17 (= .cse33 .cse34) .cse18 .cse19 (= (+ .cse35 (* .cse36 (- 1))) 1) (= (+ .cse37 (+ |ULTIMATE.start_main_~x~0#1| .cse37) 6) 0) (= .cse24 .cse30) .cse20 (= |ULTIMATE.start_main_~x~0#1| (+ 1 .cse33)) (= |ULTIMATE.start_main_~n~0#1| .cse38) (= .cse39 (+ 6 .cse36)) .cse21)))))) (and .cse12 .cse13 .cse0 .cse14 .cse16 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse19 .cse8 .cse9 .cse10 .cse11 .cse20 .cse21) (and .cse12 .cse13 .cse0 .cse14 .cse16 .cse44 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse19 .cse8 .cse9 .cse10 .cse45 .cse11 .cse20 .cse21) (and .cse0 .cse46 .cse47 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse45 .cse11 .cse48 .cse12 .cse13 .cse14 .cse16 .cse44 .cse49 .cse50 .cse18 .cse19 .cse20 .cse21) (and .cse12 .cse13 .cse0 .cse14 .cse16 .cse44 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse19 .cse8 .cse9 .cse10 .cse11 .cse20 .cse21) (and .cse0 .cse46 .cse47 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse45 .cse11 .cse48 .cse12 .cse13 .cse14 .cse16 .cse44 .cse49 .cse51 .cse50 .cse18 .cse19 .cse20 .cse21) (let ((.cse57 (+ |ULTIMATE.start_main_~y~0#1| .cse61))) (and .cse0 .cse52 .cse53 (= |ULTIMATE.start_main_~z~0#1| .cse54) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= .cse25 .cse55) .cse11 (= |ULTIMATE.start_main_~x~0#1| (+ .cse56 .cse57)) .cse12 .cse13 .cse58 .cse14 .cse16 (= .cse57 (+ .cse59 .cse60)) .cse17 .cse18 .cse19 .cse20 .cse21)) (and .cse62 .cse0 .cse46 .cse47 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse45 .cse11 .cse48 .cse12 .cse13 .cse14 .cse16 .cse49 .cse51 .cse17 .cse50 .cse18 .cse19 .cse20 .cse21 (let ((.cse67 (+ .cse73 .cse70)) (.cse68 (+ 6 .cse71)) (.cse64 (+ .cse72 1))) (or .cse63 (not (<= .cse64 (+ 1 .cse65))) (not (= 0 (+ (+ (* .cse66 .cse67) (- (* .cse67 .cse68))) (* 12 .cse67)))) (not (<= .cse65 |ULTIMATE.start_main_~a~0#1|)) (= 0 (+ (+ (let ((.cse69 (+ .cse70 .cse71))) (+ (+ (+ (* (* 2 .cse69) .cse69) (- (* (* 3 .cse67) .cse68))) (- (* 18 .cse67))) (- (* 10 .cse69)))) (* 3 .cse68)) (- 10))) (<= .cse64 |ULTIMATE.start_main_~a~0#1|)))) (let ((.cse75 (+ .cse23 27 (- 14)))) (and (= .cse74 (+ 6 (+ (+ .cse75 (* .cse74 (- 1))) (- 7)))) .cse0 .cse52 .cse53 (= |ULTIMATE.start_main_~x~0#1| (+ 27 .cse75)) .cse2 .cse3 .cse4 .cse5 .cse6 (= .cse31 .cse55) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse58 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 (= |ULTIMATE.start_main_~y~0#1| (+ .cse75 .cse23)) (or .cse76 .cse77 .cse78) .cse21)) (and .cse12 .cse13 .cse0 .cse14 .cse46 .cse16 .cse44 .cse47 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse19 .cse8 .cse9 .cse10 .cse45 .cse11 .cse20 .cse48 .cse21) (let ((.cse84 (+ .cse43 |ULTIMATE.start_main_~x~0#1| 6))) (let ((.cse79 (* 1 (- 1))) (.cse85 (+ |ULTIMATE.start_main_~y~0#1| .cse84 .cse42))) (and (= (+ |ULTIMATE.start_main_~x~0#1| .cse79) 0) (= .cse23 (+ 6 (* 6 0))) .cse0 (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse23)) (= (+ |ULTIMATE.start_main_~y~0#1| (* 6 (- 1))) 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |ULTIMATE.start_main_~n~0#1| .cse32) .cse10 .cse11 (= |ULTIMATE.start_main_~y~0#1| .cse34) .cse13 (= .cse23 6) (= (+ .cse79 |ULTIMATE.start_main_~x~0#1|) 0) .cse80 (= .cse31 0) .cse16 .cse81 (= |ULTIMATE.start_main_~z~0#1| .cse30) (or (< (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1)) .cse82 .cse83) .cse17 .cse18 (= .cse84 0) (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse85)) .cse19 .cse86 .cse20 (= |ULTIMATE.start_main_~x~0#1| 1) (= (+ |ULTIMATE.start_main_~y~0#1| (* .cse85 (- 1))) 1) .cse21))) (and .cse0 .cse52 .cse53 .cse2 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_main_~y~0#1| (+ 91 .cse23)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= |ULTIMATE.start_main_~x~0#1| .cse87) .cse14 .cse16 (= .cse23 .cse54) .cse17 .cse18 .cse19 .cse20 (= |ULTIMATE.start_main_~n~0#1| .cse88) .cse21) (and .cse0 .cse52 (= |ULTIMATE.start_main_~n~0#1| .cse15) (= .cse89 (+ 91 .cse74)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= .cse74 .cse54) .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 (= (+ |ULTIMATE.start_main_~x~0#1| (* .cse89 (- 1))) .cse87) .cse21) (let ((.cse90 (+ .cse89 (- 7))) (.cse91 (+ 7 (+ 18 (- 6))))) (and (<= .cse38 |ULTIMATE.start_main_~a~0#1|) .cse0 (= |ULTIMATE.start_main_~z~0#1| (+ 6 18)) (= |ULTIMATE.start_main_~x~0#1| (+ .cse28 .cse89)) (= |ULTIMATE.start_main_~n~0#1| .cse55) (= (+ |ULTIMATE.start_main_~x~0#1| (* 19 (- 1))) (+ 1 (+ 19 .cse41))) .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= |ULTIMATE.start_main_~n~0#1| .cse55) .cse12 .cse13 (= .cse90 .cse30) (<= 2 |ULTIMATE.start_main_~a~0#1|) .cse14 .cse16 (= |ULTIMATE.start_main_~y~0#1| (+ .cse91 18)) (= .cse23 (+ 6 .cse90)) .cse17 .cse18 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse29)) .cse19 (= (+ .cse37 (+ (+ |ULTIMATE.start_main_~x~0#1| (* .cse91 (- 1))) .cse37) 6) 0) .cse20 .cse21)) (and .cse12 .cse13 .cse0 .cse14 .cse16 .cse44 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse19 .cse8 .cse9 .cse10 .cse45 .cse11 .cse20 .cse48 .cse21) (and .cse13 .cse0 (= |ULTIMATE.start_main_~x~0#1| 0) .cse80 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) (- .cse66)) (- .cse92)) .cse93) (- 10))) .cse81 (= |ULTIMATE.start_main_~z~0#1| 6) .cse17 (or (not .cse18) .cse94 .cse95 .cse96) .cse4 .cse5 .cse18 (= |ULTIMATE.start_main_~y~0#1| 1) .cse97 .cse7 .cse19 .cse86 .cse8 .cse9 .cse10 .cse20 .cse21) (and .cse12 .cse13 .cse0 .cse14 .cse46 .cse16 .cse44 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse19 .cse8 .cse9 .cse10 .cse45 .cse11 .cse20 .cse48 .cse21) (and .cse0 .cse46 .cse47 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse45 .cse11 .cse48 .cse12 .cse13 .cse14 .cse16 .cse44 .cse49 .cse18 .cse19 .cse20 .cse21)))))))))) [2023-02-18 16:43:23,400 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse129 (+ 1 |ULTIMATE.start_main_~n~0#1|)) (.cse82 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse108 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse155 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse145 (div (- |ULTIMATE.start_main_~z~0#1|) (- 6)))) (let ((.cse144 (+ .cse145 1)) (.cse115 (+ 6 .cse155)) (.cse156 (+ .cse82 .cse108)) (.cse112 (+ .cse108 .cse155)) (.cse116 (+ 1 .cse129))) (let ((.cse147 (+ 1 .cse116)) (.cse153 (+ .cse156 .cse112)) (.cse152 (+ .cse112 .cse115)) (.cse154 (+ 6 .cse115)) (.cse151 (+ .cse144 1))) (let ((.cse146 (+ .cse151 1)) (.cse150 (+ 6 .cse154)) (.cse149 (+ .cse153 .cse152)) (.cse148 (+ .cse152 .cse154)) (.cse142 (+ 1 .cse147)) (.cse30 (* 6 |ULTIMATE.start_main_~a~0#1|))) (let ((.cse158 (+ |ULTIMATE.start_main_~a~0#1| 65536)) (.cse119 (* (div (+ (- |ULTIMATE.start_main_~a~0#1|) (- 1)) 65536) 65536)) (.cse126 (* 6 |ULTIMATE.start_main_~n~0#1|)) (.cse81 (* .cse30 .cse82)) (.cse84 (* 12 .cse82)) (.cse101 (+ 30 (- 6))) (.cse134 (+ 1 .cse142)) (.cse140 (+ .cse149 .cse148)) (.cse143 (+ .cse148 .cse150)) (.cse141 (+ 6 .cse150)) (.cse139 (+ .cse146 1))) (let ((.cse133 (+ .cse139 1)) (.cse137 (+ 6 .cse141)) (.cse136 (+ .cse140 .cse143)) (.cse135 (+ .cse143 .cse141)) (.cse6 (= (mod (* |ULTIMATE.start_main_~z~0#1| 5) 6) 0)) (.cse138 (+ 1 .cse134)) (.cse100 (+ .cse101 27 (- 14))) (.cse66 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse85 (* (* 2 .cse108) .cse108)) (.cse86 (* 3 .cse82)) (.cse87 (- (* 18 .cse82))) (.cse88 (- (* 10 .cse108))) (.cse94 (= 0 (+ (+ .cse81 (- (* .cse82 .cse155))) .cse84))) (.cse114 (- (* 18 .cse156))) (.cse67 (= 0 (+ (+ (* .cse30 |ULTIMATE.start_main_~x~0#1|) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 12 |ULTIMATE.start_main_~x~0#1|)))) (.cse78 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse127 (- (* 18 |ULTIMATE.start_main_~x~0#1|))) (.cse26 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse126))) (.cse44 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse157 (+ .cse119 65536)) (.cse118 (* |ULTIMATE.start_main_~a~0#1| (- 1))) (.cse117 (< .cse158 65536)) (.cse105 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767)) (.cse120 (<= 0 .cse158)) (.cse83 (+ 6 (* 6 .cse129)))) (let ((.cse10 (<= |ULTIMATE.start_main_~a~0#1| 50)) (.cse24 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse89 (not (= .cse83 .cse155))) (.cse41 (+ |ULTIMATE.start_main_~n~0#1| (- 1))) (.cse90 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse103 (- (* 12 |ULTIMATE.start_main_~y~0#1|))) (.cse79 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse104 (and .cse117 (not .cse105) .cse120)) (.cse121 (<= .cse157 (+ .cse118 32767))) (.cse80 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse106 (< |ULTIMATE.start_main_~a~0#1| 65536)) (.cse122 (<= .cse157 (+ .cse118 65535))) (.cse52 (+ |ULTIMATE.start_main_~y~0#1| (* .cse44 (- 1)))) (.cse128 (not .cse26)) (.cse0 (= 0 (+ (+ (+ (+ (+ (* .cse78 |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))) .cse127) (- (* 10 |ULTIMATE.start_main_~y~0#1|))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)))) (.cse132 (not .cse67)) (.cse109 (not (= 0 (+ (+ (* .cse30 .cse156) (- (* .cse156 .cse115))) (* 12 .cse156))))) (.cse110 (not (<= .cse129 |ULTIMATE.start_main_~a~0#1|))) (.cse111 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse112) .cse112) (- (* (* 3 .cse156) .cse115))) .cse114) (- (* 10 .cse112))) (* 3 .cse115)) (- 10)))) (.cse130 (not .cse94)) (.cse131 (= 0 (+ (+ (+ (+ (+ .cse85 (- (* .cse86 .cse155))) .cse87) .cse88) (* 3 .cse155)) (- 10)))) (.cse95 (not .cse66)) (.cse45 (not (= 0 (+ (+ (* .cse30 .cse153) (- (* .cse153 .cse154))) (* 12 .cse153))))) (.cse46 (not (<= .cse116 |ULTIMATE.start_main_~a~0#1|))) (.cse47 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse152) .cse152) (- (* (* 3 .cse153) .cse154))) (- (* 18 .cse153))) (- (* 10 .cse152))) (* 3 .cse154)) (- 10)))) (.cse98 (+ 27 .cse100)) (.cse102 (* 30 (- 1))) (.cse29 (+ 1 .cse138)) (.cse27 (not .cse6)) (.cse37 (+ .cse136 .cse135)) (.cse34 (+ .cse135 .cse137)) (.cse35 (+ 6 .cse137)) (.cse36 (+ .cse133 1)) (.cse68 (+ 1 0)) (.cse58 (+ 6 6)) (.cse70 (+ 1 6)) (.cse92 (+ 1 5))) (let ((.cse38 (+ .cse44 (- 6))) (.cse51 (+ 1 .cse92)) (.cse55 (+ 1 .cse70)) (.cse60 (+ 6 .cse58)) (.cse61 (* 7 (- 1))) (.cse54 (+ 1 .cse68)) (.cse56 (* .cse58 (- 1))) (.cse20 (or (not (= 0 (+ (+ (* .cse30 .cse37) (- (* .cse37 .cse35))) (* 12 .cse37)))) (not (<= .cse36 .cse29)) .cse27 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse34) .cse34) (- (* (* 3 .cse37) .cse35))) (- (* 18 .cse37))) (- (* 10 .cse34))) (* 3 .cse35)) (- 10))) (not (<= .cse138 |ULTIMATE.start_main_~a~0#1|)) (<= .cse36 |ULTIMATE.start_main_~a~0#1|))) (.cse53 (+ (+ .cse98 (+ 91 .cse102)) 91)) (.cse2 (or (<= .cse151 |ULTIMATE.start_main_~a~0#1|) .cse27 .cse45 .cse46 (not (<= .cse151 .cse147)) .cse47)) (.cse3 (or .cse27 (not (<= .cse146 .cse142)) (not (<= .cse147 |ULTIMATE.start_main_~a~0#1|)) (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse148) .cse148) (- (* (* 3 .cse149) .cse150))) (- (* 18 .cse149))) (- (* 10 .cse148))) (* 3 .cse150)) (- 10))) (<= .cse146 |ULTIMATE.start_main_~a~0#1|) (not (= 0 (+ (+ (* .cse30 .cse149) (- (* .cse149 .cse150))) (* 12 .cse149)))))) (.cse12 (or .cse27 (<= .cse145 |ULTIMATE.start_main_~a~0#1|) .cse130 (not (<= .cse145 .cse129)) .cse131 .cse95)) (.cse14 (or .cse27 .cse109 (<= .cse144 |ULTIMATE.start_main_~a~0#1|) (not (<= .cse144 .cse116)) .cse110 .cse111)) (.cse48 (or .cse128 .cse66 .cse0 .cse132)) (.cse19 (or .cse27 (not (<= .cse139 .cse134)) (not (= 0 (+ (+ (* .cse30 .cse140) (- (* .cse140 .cse141))) (* 12 .cse140)))) (not (<= .cse142 |ULTIMATE.start_main_~a~0#1|)) (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse143) .cse143) (- (* (* 3 .cse140) .cse141))) (- (* 18 .cse140))) (- (* 10 .cse143))) (* 3 .cse141)) (- 10))) (<= .cse139 |ULTIMATE.start_main_~a~0#1|))) (.cse22 (or (<= .cse133 |ULTIMATE.start_main_~a~0#1|) (not (<= .cse134 |ULTIMATE.start_main_~a~0#1|)) .cse27 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse135) .cse135) (- (* (* 3 .cse136) .cse137))) (- (* 18 .cse136))) (- (* 10 .cse135))) (* 3 .cse137)) (- 10))) (not (<= .cse133 .cse138)) (not (= 0 (+ (+ (* .cse30 .cse136) (- (* .cse136 .cse137))) (* 12 .cse136)))))) (.cse77 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (+ |ULTIMATE.start_main_~y~0#1| (- 1))))) (.cse91 (<= |ULTIMATE.start_main_~n~0#1| .cse68)) (.cse75 (* |ULTIMATE.start_main_~x~0#1| (- 1))) (.cse76 (* |ULTIMATE.start_main_~y~0#1| (- 1))) (.cse1 (= 0 (+ 12 (+ (+ (* .cse44 .cse44) (- (* 12 .cse52))) (- (* 6 .cse44)))))) (.cse50 (or .cse0 .cse132)) (.cse40 (or .cse130 .cse131 .cse95)) (.cse49 (+ 6 30)) (.cse4 (= .cse82 (* (* .cse129 .cse129) .cse129))) (.cse5 (or .cse128 .cse66 .cse67)) (.cse7 (or .cse104 (and .cse121 .cse80 .cse106 .cse122))) (.cse8 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) .cse127) .cse103) .cse79) (- 6)))) (.cse9 (let ((.cse125 (= |ULTIMATE.start_main_~z~0#1| (+ .cse126 6)))) (or (let ((.cse124 (* (- 6) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse123 (<= (+ |ULTIMATE.start_main_~z~0#1| .cse124 (- 6)) 0))) (and (or (not .cse123) (<= 0 .cse44) (not (<= (+ |ULTIMATE.start_main_~z~0#1| .cse124 (- 5)) 0))) (not .cse125) .cse90 (or .cse123 (<= |ULTIMATE.start_main_~z~0#1| 6))))) .cse125))) (.cse11 (or (and .cse117 (<= (+ .cse118 (- 65536)) .cse119) .cse120 (<= (+ .cse118 (- 32768)) .cse119)) (and .cse121 .cse80 .cse122 .cse106))) (.cse65 (+ .cse41 (- 1))) (.cse42 (+ 1 2)) (.cse13 (= |ULTIMATE.start_main_~x~0#1| (* (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~n~0#1|))) (.cse15 (let ((.cse113 (+ 6 (* 6 .cse116)))) (or (= 0 (+ (+ (+ (+ (* .cse112 .cse113) .cse114) (- (* 12 .cse112))) (* 2 .cse113)) (- 6))) (not (= .cse113 .cse115))))) (.cse16 (<= .cse41 |ULTIMATE.start_main_~a~0#1|)) (.cse43 (or .cse109 .cse110 .cse111)) (.cse17 (or (= 0 (+ (+ (+ (+ (* .cse108 .cse83) .cse87) (- (* 12 .cse108))) (* 2 .cse83)) (- 6))) .cse89)) (.cse18 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (let ((.cse107 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ (* .cse107 |ULTIMATE.start_main_~n~0#1|) .cse107))))) (.cse21 (or .cse104 (and .cse105 .cse80 .cse106))) (.cse23 (= 0 (+ 12 (+ (+ (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) .cse103) (- (* 6 |ULTIMATE.start_main_~z~0#1|)))))) (.cse25 (or (and .cse24 .cse10 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not .cse10) (not .cse24)))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 (let ((.cse31 (+ .cse37 .cse34)) (.cse32 (+ 6 .cse35)) (.cse28 (+ .cse36 1))) (or .cse27 (not (<= .cse28 (+ 1 .cse29))) (not (= 0 (+ (+ (* .cse30 .cse31) (- (* .cse31 .cse32))) (* 12 .cse31)))) (not (<= .cse29 |ULTIMATE.start_main_~a~0#1|)) (= 0 (+ (+ (let ((.cse33 (+ .cse34 .cse35))) (+ (+ (+ (* (* 2 .cse33) .cse33) (- (* (* 3 .cse31) .cse32))) (- (* 18 .cse31))) (- (* 10 .cse33)))) (* 3 .cse32)) (- 10))) (<= .cse28 |ULTIMATE.start_main_~a~0#1|)))) (let ((.cse39 (+ .cse44 27 (- 14)))) (and (= .cse38 (+ 6 (+ (+ .cse39 (* .cse38 (- 1))) (- 7)))) .cse0 .cse1 .cse40 (= |ULTIMATE.start_main_~x~0#1| (+ 27 .cse39)) .cse4 .cse5 .cse6 .cse7 (= .cse41 .cse42) .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse16 .cse43 .cse17 .cse18 .cse21 .cse23 .cse24 .cse25 (= |ULTIMATE.start_main_~y~0#1| (+ .cse39 .cse44)) (or .cse45 .cse46 .cse47) .cse26)) (and .cse15 .cse16 .cse1 .cse17 .cse2 .cse18 .cse48 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse24 .cse9 .cse10 .cse11 .cse12 .cse13 .cse25 .cse14 .cse26) (and .cse15 .cse16 .cse1 (= .cse38 .cse49) .cse17 .cse18 .cse50 (= |ULTIMATE.start_main_~n~0#1| .cse51) (= .cse52 (+ 91 .cse38)) .cse4 .cse21 .cse5 .cse6 .cse7 .cse23 .cse8 .cse24 .cse9 .cse10 .cse11 .cse13 .cse25 (= (+ |ULTIMATE.start_main_~x~0#1| (* .cse52 (- 1))) .cse53) .cse26) (let ((.cse57 (+ .cse52 (- 7))) (.cse59 (+ 7 (+ 18 (- 6))))) (and (<= .cse54 |ULTIMATE.start_main_~a~0#1|) .cse1 (= |ULTIMATE.start_main_~z~0#1| (+ 6 18)) (= |ULTIMATE.start_main_~x~0#1| (+ .cse55 .cse52)) (= |ULTIMATE.start_main_~n~0#1| .cse42) (= (+ |ULTIMATE.start_main_~x~0#1| (* 19 (- 1))) (+ 1 (+ 19 .cse56))) .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 (<= |ULTIMATE.start_main_~n~0#1| .cse42) .cse15 .cse16 (= .cse57 .cse58) (<= 2 |ULTIMATE.start_main_~a~0#1|) .cse17 .cse18 (= |ULTIMATE.start_main_~y~0#1| (+ .cse59 18)) (= .cse44 (+ 6 .cse57)) .cse21 .cse23 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse60)) .cse24 (= (+ .cse61 (+ (+ |ULTIMATE.start_main_~x~0#1| (* .cse59 (- 1))) .cse61) 6) 0) .cse25 .cse26)) (let ((.cse62 (+ (* 48 2) 73))) (and .cse15 .cse16 (= |ULTIMATE.start_main_~z~0#1| (+ 6 48)) .cse1 (= |ULTIMATE.start_main_~x~0#1| (+ (+ 48 295) .cse62)) .cse17 (<= .cse51 |ULTIMATE.start_main_~a~0#1|) .cse18 (<= |ULTIMATE.start_main_~n~0#1| (+ 1 .cse51)) .cse4 .cse21 .cse5 .cse6 .cse7 .cse23 .cse8 .cse24 .cse9 .cse10 .cse11 .cse13 .cse25 (= |ULTIMATE.start_main_~y~0#1| (+ .cse62 48)) .cse26)) (and .cse15 .cse16 .cse1 .cse17 .cse18 .cse48 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse24 .cse9 .cse10 .cse11 .cse12 .cse13 .cse25 .cse26) (let ((.cse74 (+ .cse76 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (- 6)))) (let ((.cse73 (+ |ULTIMATE.start_main_~y~0#1| .cse75 .cse74))) (let ((.cse71 (+ |ULTIMATE.start_main_~y~0#1| (* .cse73 (- 1))))) (let ((.cse63 (+ (* .cse71 (- 1)) .cse74 6))) (let ((.cse64 (+ |ULTIMATE.start_main_~y~0#1| (- 7))) (.cse69 (+ |ULTIMATE.start_main_~y~0#1| .cse56)) (.cse72 (+ .cse71 .cse63 (* .cse74 (- 1))))) (and (= .cse63 0) (= |ULTIMATE.start_main_~y~0#1| (+ 7 .cse44)) (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse64)) (= |ULTIMATE.start_main_~y~0#1| (+ (+ 1 (+ 12 (- 6))) 12)) .cse1 (= |ULTIMATE.start_main_~n~0#1| (+ 1 1)) (<= 1 |ULTIMATE.start_main_~a~0#1|) (= .cse65 0) .cse4 .cse5 .cse6 .cse7 (or .cse66 .cse67) .cse8 .cse9 .cse10 .cse11 .cse13 (= |ULTIMATE.start_main_~z~0#1| (+ 6 12)) (= |ULTIMATE.start_main_~x~0#1| .cse55) .cse16 (= |ULTIMATE.start_main_~z~0#1| .cse60) (= .cse44 .cse58) (= .cse41 .cse68) .cse18 .cse21 (= .cse69 .cse70) .cse23 .cse24 (= (+ .cse71 (* .cse72 (- 1))) 1) (= (+ .cse61 (+ |ULTIMATE.start_main_~x~0#1| .cse61) 6) 0) (= .cse64 .cse58) .cse25 (= |ULTIMATE.start_main_~x~0#1| (+ 1 .cse69)) (= |ULTIMATE.start_main_~n~0#1| .cse54) (= .cse73 (+ 6 .cse72)) .cse26)))))) (and .cse15 .cse16 .cse1 .cse17 .cse2 .cse18 .cse48 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse24 .cse9 .cse10 .cse11 .cse12 .cse13 .cse25 .cse14 .cse26) (and .cse15 .cse16 .cse1 .cse17 .cse18 .cse48 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse24 .cse9 .cse10 .cse11 .cse12 .cse13 .cse25 .cse14 .cse26) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse48 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse15 .cse16 .cse1 .cse17 .cse18 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse24 .cse9 .cse10 .cse11 .cse13 .cse25 .cse26) (and .cse15 .cse16 .cse1 .cse17 .cse18 .cse48 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse24 .cse9 .cse10 .cse11 .cse13 .cse25 .cse26) (and .cse15 .cse16 .cse1 .cse17 .cse2 .cse18 .cse48 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse24 .cse9 .cse10 .cse11 .cse12 .cse13 .cse25 .cse14 .cse26) (and .cse16 .cse1 (= |ULTIMATE.start_main_~x~0#1| 0) .cse77 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) (- .cse30)) (- .cse78)) .cse79) (- 10))) .cse80 (= |ULTIMATE.start_main_~z~0#1| 6) .cse21 (or (not .cse23) (not (= 0 (+ (+ .cse81 (- (* .cse82 .cse83))) .cse84))) (= 0 (+ (+ (+ (+ (+ .cse85 (- (* .cse86 .cse83))) .cse87) .cse88) (* 3 .cse83)) (- 10))) .cse89) .cse6 .cse7 .cse23 (= |ULTIMATE.start_main_~y~0#1| 1) .cse90 .cse8 .cse24 .cse91 .cse9 .cse10 .cse11 .cse25 .cse26) (and .cse1 .cse50 .cse40 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_main_~y~0#1| (+ 91 .cse44)) .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse16 (= |ULTIMATE.start_main_~x~0#1| .cse53) .cse17 .cse18 (= .cse44 .cse49) .cse21 .cse23 .cse24 .cse25 (= |ULTIMATE.start_main_~n~0#1| .cse92) .cse26) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse48 .cse19 .cse22 .cse23 .cse24 .cse25 .cse26) (let ((.cse96 (+ .cse76 |ULTIMATE.start_main_~x~0#1| 6))) (let ((.cse93 (* 1 (- 1))) (.cse97 (+ |ULTIMATE.start_main_~y~0#1| .cse96 .cse75))) (and (= (+ |ULTIMATE.start_main_~x~0#1| .cse93) 0) (= .cse44 (+ 6 (* 6 0))) .cse1 (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse44)) (= (+ |ULTIMATE.start_main_~y~0#1| (* 6 (- 1))) 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= |ULTIMATE.start_main_~n~0#1| .cse68) .cse11 (= |ULTIMATE.start_main_~y~0#1| .cse70) .cse16 (= .cse44 6) (= (+ .cse93 |ULTIMATE.start_main_~x~0#1|) 0) .cse77 (= .cse41 0) .cse18 .cse80 (= |ULTIMATE.start_main_~z~0#1| .cse58) (or (< (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1)) .cse94 .cse95) .cse21 .cse23 (= .cse96 0) (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse97)) .cse24 .cse91 .cse25 (= |ULTIMATE.start_main_~x~0#1| 1) (= (+ |ULTIMATE.start_main_~y~0#1| (* .cse97 (- 1))) 1) .cse26))) (let ((.cse99 (+ |ULTIMATE.start_main_~y~0#1| .cse102))) (and .cse1 .cse50 .cse40 (= |ULTIMATE.start_main_~z~0#1| .cse49) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= .cse65 .cse42) .cse13 (= |ULTIMATE.start_main_~x~0#1| (+ .cse98 .cse99)) .cse15 .cse16 .cse43 .cse17 .cse18 (= .cse99 (+ .cse100 .cse101)) .cse21 .cse23 .cse24 .cse25 .cse26))))))))))) [2023-02-18 16:43:23,400 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2023-02-18 16:43:23,400 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2023-02-18 16:43:23,401 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2023-02-18 16:43:23,401 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2023-02-18 16:43:23,401 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 14 20) the Hoare annotation is: true [2023-02-18 16:43:23,401 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2023-02-18 16:43:23,403 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 3, 2, 1, 1, 1, 1, 1] [2023-02-18 16:43:23,405 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 16:43:23,418 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,419 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,419 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,419 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,419 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,420 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,420 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,420 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,420 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,420 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,421 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,421 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,421 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,421 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,421 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,422 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,422 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] [2023-02-18 16:43:23,422 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,422 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,422 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] [2023-02-18 16:43:23,423 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,423 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,423 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] [2023-02-18 16:43:23,423 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,424 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,424 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] [2023-02-18 16:43:23,424 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,424 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,424 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,425 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] [2023-02-18 16:43:23,425 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,425 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,425 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,425 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,426 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] [2023-02-18 16:43:23,426 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] [2023-02-18 16:43:23,426 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,426 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,426 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] [2023-02-18 16:43:23,427 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,427 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] [2023-02-18 16:43:23,427 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,427 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,466 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,467 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,467 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,467 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,467 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,467 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,468 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,468 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,468 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,468 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,468 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,469 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,469 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,469 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,469 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,469 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,470 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] [2023-02-18 16:43:23,470 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,470 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,470 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] [2023-02-18 16:43:23,470 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,471 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,471 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] [2023-02-18 16:43:23,471 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,471 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,471 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] [2023-02-18 16:43:23,472 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,472 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,472 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,472 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] [2023-02-18 16:43:23,472 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,473 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,473 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,473 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,473 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] [2023-02-18 16:43:23,473 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] [2023-02-18 16:43:23,474 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,474 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,474 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] [2023-02-18 16:43:23,474 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,474 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] [2023-02-18 16:43:23,474 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,475 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 04:43:23 BoogieIcfgContainer [2023-02-18 16:43:23,492 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 16:43:23,493 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 16:43:23,493 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 16:43:23,493 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 16:43:23,493 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 04:37:19" (3/4) ... [2023-02-18 16:43:23,495 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-18 16:43:23,499 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-18 16:43:23,503 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2023-02-18 16:43:23,504 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-18 16:43:23,504 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-18 16:43:23,504 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-18 16:43:23,521 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((((((((((((x + 1 * -1 == 0 && z + -6 == 6 + 6 * 0) && 0 == 12 + ((z + -6) * (z + -6) + -(12 * (y + (z + -6) * -1)) + -(6 * (z + -6)))) && y == 1 + (z + -6)) && y + 6 * -1 == 1) && x + y == (1 + n) * (1 + n) * (1 + n)) && ((!(z == 6 + 6 * n) || n <= a) || 0 == 6 * a * x + -(x * z) + 12 * x)) && z * 5 % 6 == 0) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && a < 65536) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a <= 50) && n == 1 + 0) && ((((a + 65536 < 65536 && a * -1 + -65536 <= (-a + -1) / 65536 * 65536) && 0 <= a + 65536) && a * -1 + -32768 <= (-a + -1) / 65536 * 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535) && a < 65536))) && y == 1 + 6) && n + -1 <= a) && z + -6 == 6) && 1 * -1 + x == 0) && z == 6 + (y + -1)) && n + -1 == 0) && 0 <= a) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) && z == 6 + 6) && ((n + 1 < a + 1 || 0 == 6 * a * (x + y) + -((x + y) * (6 + z)) + 12 * (x + y)) || !(n <= a))) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((a % 65536 <= 32767 && 0 <= a) && a < 65536))) && (((!(0 == 12 + (z * z + -(12 * y) + -(6 * z))) || !(0 == 6 * a * (x + y) + -((x + y) * (6 + 6 * (1 + n))) + 12 * (x + y))) || 0 == 2 * (y + z) * (y + z) + -(3 * (x + y) * (6 + 6 * (1 + n))) + -(18 * (x + y)) + -(10 * (y + z)) + 3 * (6 + 6 * (1 + n)) + -10) || !(6 + 6 * (1 + n) == 6 + z))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && y * -1 + x + 6 == 0) && z == 6 + (y + (y * -1 + x + 6) + x * -1)) && a >= 0) && n <= 1 + 0) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && x == 1) && y + (y + (y * -1 + x + 6) + x * -1) * -1 == 1) && z == 6 + 6 * n) || ((((((((((((((((((((((n + -1 <= a && 0 == 2 * y * y + -(3 * x * z) + -(18 * x) + -(10 * y) + 3 * z + -10) && 0 == 12 + ((z + -6) * (z + -6) + -(12 * (y + (z + -6) * -1)) + -(6 * (z + -6)))) && (((((-z / -6 + 1 + 1 <= a || !(z * 5 % 6 == 0)) || !(0 == 6 * a * (x + y + (y + z) + (y + z + (6 + z))) + -((x + y + (y + z) + (y + z + (6 + z))) * (6 + (6 + (6 + z)))) + 12 * (x + y + (y + z) + (y + z + (6 + z))))) || !(1 + (1 + n) <= a)) || !(-z / -6 + 1 + 1 <= 1 + (1 + (1 + n)))) || 0 == 2 * (y + z + (6 + z) + (6 + (6 + z))) * (y + z + (6 + z) + (6 + (6 + z))) + -(3 * (x + y + (y + z) + (y + z + (6 + z))) * (6 + (6 + (6 + z)))) + -(18 * (x + y + (y + z) + (y + z + (6 + z)))) + -(10 * (y + z + (6 + z) + (6 + (6 + z)))) + 3 * (6 + (6 + (6 + z))) + -10)) && (((((!(z * 5 % 6 == 0) || !(-z / -6 + 1 + 1 + 1 <= 1 + (1 + (1 + (1 + n))))) || !(1 + (1 + (1 + n)) <= a)) || 0 == 2 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + -(3 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z)))) * (6 + (6 + (6 + (6 + z))))) + -(18 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))))) + -(10 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))))) + 3 * (6 + (6 + (6 + (6 + z)))) + -10) || -z / -6 + 1 + 1 + 1 <= a) || !(0 == 6 * a * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z)))) + -((x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z)))) * (6 + (6 + (6 + (6 + z))))) + 12 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))))))) && (((((!(z * 5 % 6 == 0) || !(-z / -6 + 1 + 1 + 1 + 1 <= 1 + (1 + (1 + (1 + (1 + n)))))) || !(0 == 6 * a * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))))) + -((x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))))) * (6 + (6 + (6 + (6 + (6 + z)))))) + 12 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))))))) || !(1 + (1 + (1 + (1 + n))) <= a)) || 0 == 2 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))) * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))) + -(3 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))))) * (6 + (6 + (6 + (6 + (6 + z)))))) + -(18 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))))) + -(10 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))))) + 3 * (6 + (6 + (6 + (6 + (6 + z))))) + -10) || -z / -6 + 1 + 1 + 1 + 1 <= a)) && (((((!(0 == 6 * a * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z))))))) + -((x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z))))))) * (6 + (6 + (6 + (6 + (6 + (6 + (6 + z)))))))) + 12 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z)))))))) || !(-z / -6 + 1 + 1 + 1 + 1 + 1 + 1 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + n)))))))) || !(z * 5 % 6 == 0)) || 0 == 2 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z))))) + (6 + (6 + (6 + (6 + (6 + (6 + z))))))) * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z))))) + (6 + (6 + (6 + (6 + (6 + (6 + z))))))) + -(3 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z))))))) * (6 + (6 + (6 + (6 + (6 + (6 + (6 + z)))))))) + -(18 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z)))))))) + -(10 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z))))) + (6 + (6 + (6 + (6 + (6 + (6 + z)))))))) + 3 * (6 + (6 + (6 + (6 + (6 + (6 + (6 + z))))))) + -10) || !(1 + (1 + (1 + (1 + (1 + (1 + n))))) <= a)) || -z / -6 + 1 + 1 + 1 + 1 + 1 + 1 <= a)) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((a % 65536 <= 32767 && 0 <= a) && a < 65536))) && ((!(z == 6 + 6 * n) || n <= a) || 0 == 6 * a * x + -(x * z) + 12 * x)) && z * 5 % 6 == 0) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && a < 65536) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535))) && ((((((((((0 == (y + z + (6 + z)) * (6 + 6 * (1 + (1 + n))) + -(18 * (x + y + (y + z))) + -(12 * (y + z + (6 + z))) + 2 * (6 + 6 * (1 + (1 + n))) + -6 || !(6 + 6 * (1 + (1 + n)) == 6 + (6 + z))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) || ((((((((!(z == 6 + 6 * n) || 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))))) && (((((-z / -6 + 1 + 1 + 1 + 1 + 1 <= a || !(1 + (1 + (1 + (1 + (1 + n)))) <= a)) || !(z * 5 % 6 == 0)) || 0 == 2 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z)))))) * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z)))))) + -(3 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))))) * (6 + (6 + (6 + (6 + (6 + (6 + z))))))) + -(18 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))))) + -(10 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z))))))) + 3 * (6 + (6 + (6 + (6 + (6 + (6 + z)))))) + -10) || !(-z / -6 + 1 + 1 + 1 + 1 + 1 <= 1 + (1 + (1 + (1 + (1 + (1 + n))))))) || !(0 == 6 * a * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))))) + -((x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))))) * (6 + (6 + (6 + (6 + (6 + (6 + z))))))) + 12 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))))))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && ((((a + 65536 < 65536 && a * -1 + -65536 <= (-a + -1) / 65536 * 65536) && 0 <= a + 65536) && a * -1 + -32768 <= (-a + -1) / 65536 * 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535) && a < 65536))) && (((((!(z * 5 % 6 == 0) || -z / -6 <= a) || !(0 == 6 * a * (x + y) + -((x + y) * (6 + z)) + 12 * (x + y))) || !(-z / -6 <= 1 + n)) || 0 == 2 * (y + z) * (y + z) + -(3 * (x + y) * (6 + z)) + -(18 * (x + y)) + -(10 * (y + z)) + 3 * (6 + z) + -10) || !(n <= a))) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && (((((!(z * 5 % 6 == 0) || !(0 == 6 * a * (x + y + (y + z)) + -((x + y + (y + z)) * (6 + (6 + z))) + 12 * (x + y + (y + z)))) || -z / -6 + 1 <= a) || !(-z / -6 + 1 <= 1 + (1 + n))) || !(1 + n <= a)) || 0 == 2 * (y + z + (6 + z)) * (y + z + (6 + z)) + -(3 * (x + y + (y + z)) * (6 + (6 + z))) + -(18 * (x + y + (y + z))) + -(10 * (y + z + (6 + z))) + 3 * (6 + (6 + z)) + -10)) && z == 6 + 6 * n) && (((((!(z * 5 % 6 == 0) || !(-z / -6 + 1 + 1 + 1 + 1 + 1 + 1 + 1 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + n))))))))) || !(0 == 6 * a * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z)))))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z))))) + (6 + (6 + (6 + (6 + (6 + (6 + z)))))))) + -((x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z)))))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z))))) + (6 + (6 + (6 + (6 + (6 + (6 + z)))))))) * (6 + (6 + (6 + (6 + (6 + (6 + (6 + (6 + z))))))))) + 12 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z)))))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z))))) + (6 + (6 + (6 + (6 + (6 + (6 + z)))))))))) || !(1 + (1 + (1 + (1 + (1 + (1 + (1 + n)))))) <= a)) || 0 == 2 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z))))) + (6 + (6 + (6 + (6 + (6 + (6 + z)))))) + (6 + (6 + (6 + (6 + (6 + (6 + (6 + z)))))))) * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z))))) + (6 + (6 + (6 + (6 + (6 + (6 + z)))))) + (6 + (6 + (6 + (6 + (6 + (6 + (6 + z)))))))) + -(3 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z)))))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z))))) + (6 + (6 + (6 + (6 + (6 + (6 + z)))))))) * (6 + (6 + (6 + (6 + (6 + (6 + (6 + (6 + z))))))))) + -(18 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z)))))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z))))) + (6 + (6 + (6 + (6 + (6 + (6 + z))))))))) + -(10 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z))))) + (6 + (6 + (6 + (6 + (6 + (6 + z)))))) + (6 + (6 + (6 + (6 + (6 + (6 + (6 + z))))))))) + 3 * (6 + (6 + (6 + (6 + (6 + (6 + (6 + (6 + z)))))))) + -10) || -z / -6 + 1 + 1 + 1 + 1 + 1 + 1 + 1 <= a))) || (((((((((((((((((((((n + -1 <= a && 0 == 12 + ((z + -6) * (z + -6) + -(12 * (y + (z + -6) * -1)) + -(6 * (z + -6)))) && x == 0) && z == 6 + (y + -1)) && 0 == a * z + -(6 * a) + -(2 * y) + 2 * z + -10) && 0 <= a) && z == 6) && ((\exists aux_div_ULTIMATE.start_main_~a~0#1_40 : int, aux_mod_ULTIMATE.start_main_~a~0#1_40 : int :: ((((((aux_div_ULTIMATE.start_main_~a~0#1_40 * 65536 + aux_mod_ULTIMATE.start_main_~a~0#1_40 <= 50 && !(aux_mod_ULTIMATE.start_main_~a~0#1_40 <= 32767)) && 0 == 6 * (aux_div_ULTIMATE.start_main_~a~0#1_40 * 65536 + aux_mod_ULTIMATE.start_main_~a~0#1_40) * x + -(x * z) + 12 * x) && aux_div_ULTIMATE.start_main_~a~0#1_40 * 65536 + aux_mod_ULTIMATE.start_main_~a~0#1_40 >= 0) && 0 <= aux_mod_ULTIMATE.start_main_~a~0#1_40) && 0 <= aux_div_ULTIMATE.start_main_~a~0#1_40 * 65536 + aux_mod_ULTIMATE.start_main_~a~0#1_40 + 65536) && aux_mod_ULTIMATE.start_main_~a~0#1_40 < 65536) && aux_div_ULTIMATE.start_main_~a~0#1_40 * 65536 + aux_mod_ULTIMATE.start_main_~a~0#1_40 + 65536 < 65536) || (\exists aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51 : int, aux_div_ULTIMATE.start_main_~a~0#1_54 : int, aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51 : int :: (((((((((0 <= aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51 + aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51 * 65536 && 0 <= aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51) && 0 <= aux_div_ULTIMATE.start_main_~a~0#1_54 * -65536 + (aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51 + aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51 * 65536) * -1 + -1) && aux_div_ULTIMATE.start_main_~a~0#1_54 * -65536 + (aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51 + aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51 * 65536) * -1 + -1 < 65536) && aux_div_ULTIMATE.start_main_~a~0#1_54 * -65536 + (aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51 + aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51 * 65536) * -1 + -1 >= 0) && 0 == 6 * (aux_div_ULTIMATE.start_main_~a~0#1_54 * -65536 + (aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51 + aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51 * 65536) * -1 + -1) * x + -(x * z) + 12 * x) && aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51 < 65536) && aux_div_ULTIMATE.start_main_~a~0#1_54 * -65536 + (aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51 + aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51 * 65536) * -1 + -1 <= 50) && aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51 + aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51 * 65536 < 65536) && aux_div_ULTIMATE.start_main_~a~0#1_54 * 65536 + 65536 <= (aux_div_ULTIMATE.start_main_~a~0#1_54 * -65536 + (aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51 + aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51 * 65536) * -1 + -1) * -1 + 32767) && (aux_div_ULTIMATE.start_main_~a~0#1_54 + aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51) * 65536 + 65536 <= (aux_div_ULTIMATE.start_main_~a~0#1_54 * -65536 + (aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51 + aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51 * 65536) * -1 + -1) * -1 + 65535))) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((a % 65536 <= 32767 && 0 <= a) && a < 65536))) && z * 5 % 6 == 0) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && a < 65536) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && y == 1) && n == 0) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && n <= 1 + 0) && ((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6)) && a <= 50) && ((((a + 65536 < 65536 && a * -1 + -65536 <= (-a + -1) / 65536 * 65536) && 0 <= a + 65536) && a * -1 + -32768 <= (-a + -1) / 65536 * 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535) && a < 65536))) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && z == 6 + 6 * n)) || ((((((((((((((((((n + -1 <= a && z == 6 + 48) && 0 == 12 + ((z + -6) * (z + -6) + -(12 * (y + (z + -6) * -1)) + -(6 * (z + -6)))) && x == 48 + 295 + (48 * 2 + 73)) && 1 + (1 + 5) <= a) && n <= 1 + (1 + (1 + 5))) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((a % 65536 <= 32767 && 0 <= a) && a < 65536))) && ((!(z == 6 + 6 * n) || n <= a) || 0 == 6 * a * x + -(x * z) + 12 * x)) && z * 5 % 6 == 0) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && a < 65536) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535))) && ((((((((((0 == (y + z + (6 + z)) * (6 + 6 * (1 + (1 + n))) + -(18 * (x + y + (y + z))) + -(12 * (y + z + (6 + z))) + 2 * (6 + 6 * (1 + (1 + n))) + -6 || !(6 + 6 * (1 + (1 + n)) == 6 + (6 + z))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) || ((((((((!(z == 6 + 6 * n) || 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && ((((a + 65536 < 65536 && a * -1 + -65536 <= (-a + -1) / 65536 * 65536) && 0 <= a + 65536) && a * -1 + -32768 <= (-a + -1) / 65536 * 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535) && a < 65536))) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && y == 48 * 2 + 73 + 48) && z == 6 + 6 * n)) || (((((((((((((((((((n + -1 <= a && x == 27 + (30 + -6 + 27 + -14) + (91 + 30 * -1) + 91) && 0 == 12 + ((z + -6) * (z + -6) + -(12 * (y + (z + -6) * -1)) + -(6 * (z + -6)))) && (0 == 2 * y * y + -(3 * x * z) + -(18 * x) + -(10 * y) + 3 * z + -10 || !(0 == 6 * a * x + -(x * z) + 12 * x))) && ((!(0 == 6 * a * (x + y) + -((x + y) * (6 + z)) + 12 * (x + y)) || 0 == 2 * (y + z) * (y + z) + -(3 * (x + y) * (6 + z)) + -(18 * (x + y)) + -(10 * (y + z)) + 3 * (6 + z) + -10) || !(n <= a))) && z + -6 == 6 + 30) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((a % 65536 <= 32767 && 0 <= a) && a < 65536))) && ((!(z == 6 + 6 * n) || n <= a) || 0 == 6 * a * x + -(x * z) + 12 * x)) && z * 5 % 6 == 0) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && a < 65536) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535))) && ((((((((((0 == (y + z + (6 + z)) * (6 + 6 * (1 + (1 + n))) + -(18 * (x + y + (y + z))) + -(12 * (y + z + (6 + z))) + 2 * (6 + 6 * (1 + (1 + n))) + -6 || !(6 + 6 * (1 + (1 + n)) == 6 + (6 + z))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) || ((((((((!(z == 6 + 6 * n) || 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))))) && y == 91 + (z + -6)) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && ((((a + 65536 < 65536 && a * -1 + -65536 <= (-a + -1) / 65536 * 65536) && 0 <= a + 65536) && a * -1 + -32768 <= (-a + -1) / 65536 * 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535) && a < 65536))) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && n == 1 + 5) && z == 6 + 6 * n)) || ((((((((((((((((n + -1 <= a && 0 == 12 + ((z + -6) * (z + -6) + -(12 * (y + (z + -6) * -1)) + -(6 * (z + -6)))) && (((((-z / -6 + 1 + 1 <= a || !(z * 5 % 6 == 0)) || !(0 == 6 * a * (x + y + (y + z) + (y + z + (6 + z))) + -((x + y + (y + z) + (y + z + (6 + z))) * (6 + (6 + (6 + z)))) + 12 * (x + y + (y + z) + (y + z + (6 + z))))) || !(1 + (1 + n) <= a)) || !(-z / -6 + 1 + 1 <= 1 + (1 + (1 + n)))) || 0 == 2 * (y + z + (6 + z) + (6 + (6 + z))) * (y + z + (6 + z) + (6 + (6 + z))) + -(3 * (x + y + (y + z) + (y + z + (6 + z))) * (6 + (6 + (6 + z)))) + -(18 * (x + y + (y + z) + (y + z + (6 + z)))) + -(10 * (y + z + (6 + z) + (6 + (6 + z)))) + 3 * (6 + (6 + (6 + z))) + -10)) && (((!(z == 6 + 6 * n) || n <= a) || 0 == 2 * y * y + -(3 * x * z) + -(18 * x) + -(10 * y) + 3 * z + -10) || !(0 == 6 * a * x + -(x * z) + 12 * x))) && ((!(z == 6 + 6 * n) || n <= a) || 0 == 6 * a * x + -(x * z) + 12 * x)) && z * 5 % 6 == 0) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && a < 65536) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535))) && ((((((((((0 == (y + z + (6 + z)) * (6 + 6 * (1 + (1 + n))) + -(18 * (x + y + (y + z))) + -(12 * (y + z + (6 + z))) + 2 * (6 + 6 * (1 + (1 + n))) + -6 || !(6 + 6 * (1 + (1 + n)) == 6 + (6 + z))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) || ((((((((!(z == 6 + 6 * n) || 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && ((((a + 65536 < 65536 && a * -1 + -65536 <= (-a + -1) / 65536 * 65536) && 0 <= a + 65536) && a * -1 + -32768 <= (-a + -1) / 65536 * 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535) && a < 65536))) && (((((!(z * 5 % 6 == 0) || -z / -6 <= a) || !(0 == 6 * a * (x + y) + -((x + y) * (6 + z)) + 12 * (x + y))) || !(-z / -6 <= 1 + n)) || 0 == 2 * (y + z) * (y + z) + -(3 * (x + y) * (6 + z)) + -(18 * (x + y)) + -(10 * (y + z)) + 3 * (6 + z) + -10) || !(n <= a))) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && (((((!(z * 5 % 6 == 0) || !(0 == 6 * a * (x + y + (y + z)) + -((x + y + (y + z)) * (6 + (6 + z))) + 12 * (x + y + (y + z)))) || -z / -6 + 1 <= a) || !(-z / -6 + 1 <= 1 + (1 + n))) || !(1 + n <= a)) || 0 == 2 * (y + z + (6 + z)) * (y + z + (6 + z)) + -(3 * (x + y + (y + z)) * (6 + (6 + z))) + -(18 * (x + y + (y + z))) + -(10 * (y + z + (6 + z))) + 3 * (6 + (6 + z)) + -10)) && z == 6 + 6 * n)) || ((((((((((((((n + -1 <= a && 0 == 12 + ((z + -6) * (z + -6) + -(12 * (y + (z + -6) * -1)) + -(6 * (z + -6)))) && (((!(z == 6 + 6 * n) || n <= a) || 0 == 2 * y * y + -(3 * x * z) + -(18 * x) + -(10 * y) + 3 * z + -10) || !(0 == 6 * a * x + -(x * z) + 12 * x))) && ((!(z == 6 + 6 * n) || n <= a) || 0 == 6 * a * x + -(x * z) + 12 * x)) && z * 5 % 6 == 0) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && a < 65536) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535))) && ((((((((((0 == (y + z + (6 + z)) * (6 + 6 * (1 + (1 + n))) + -(18 * (x + y + (y + z))) + -(12 * (y + z + (6 + z))) + 2 * (6 + 6 * (1 + (1 + n))) + -6 || !(6 + 6 * (1 + (1 + n)) == 6 + (6 + z))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) || ((((((((!(z == 6 + 6 * n) || 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && ((((a + 65536 < 65536 && a * -1 + -65536 <= (-a + -1) / 65536 * 65536) && 0 <= a + 65536) && a * -1 + -32768 <= (-a + -1) / 65536 * 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535) && a < 65536))) && (((((!(z * 5 % 6 == 0) || -z / -6 <= a) || !(0 == 6 * a * (x + y) + -((x + y) * (6 + z)) + 12 * (x + y))) || !(-z / -6 <= 1 + n)) || 0 == 2 * (y + z) * (y + z) + -(3 * (x + y) * (6 + z)) + -(18 * (x + y)) + -(10 * (y + z)) + 3 * (6 + z) + -10) || !(n <= a))) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && z == 6 + 6 * n)) || ((((((((((((((((((((n + -1 <= a && 0 == 12 + ((z + -6) * (z + -6) + -(12 * (y + (z + -6) * -1)) + -(6 * (z + -6)))) && (((((-z / -6 + 1 + 1 <= a || !(z * 5 % 6 == 0)) || !(0 == 6 * a * (x + y + (y + z) + (y + z + (6 + z))) + -((x + y + (y + z) + (y + z + (6 + z))) * (6 + (6 + (6 + z)))) + 12 * (x + y + (y + z) + (y + z + (6 + z))))) || !(1 + (1 + n) <= a)) || !(-z / -6 + 1 + 1 <= 1 + (1 + (1 + n)))) || 0 == 2 * (y + z + (6 + z) + (6 + (6 + z))) * (y + z + (6 + z) + (6 + (6 + z))) + -(3 * (x + y + (y + z) + (y + z + (6 + z))) * (6 + (6 + (6 + z)))) + -(18 * (x + y + (y + z) + (y + z + (6 + z)))) + -(10 * (y + z + (6 + z) + (6 + (6 + z)))) + 3 * (6 + (6 + (6 + z))) + -10)) && (((!(z == 6 + 6 * n) || n <= a) || 0 == 2 * y * y + -(3 * x * z) + -(18 * x) + -(10 * y) + 3 * z + -10) || !(0 == 6 * a * x + -(x * z) + 12 * x))) && (((((!(z * 5 % 6 == 0) || !(-z / -6 + 1 + 1 + 1 <= 1 + (1 + (1 + (1 + n))))) || !(1 + (1 + (1 + n)) <= a)) || 0 == 2 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + -(3 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z)))) * (6 + (6 + (6 + (6 + z))))) + -(18 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))))) + -(10 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))))) + 3 * (6 + (6 + (6 + (6 + z)))) + -10) || -z / -6 + 1 + 1 + 1 <= a) || !(0 == 6 * a * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z)))) + -((x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z)))) * (6 + (6 + (6 + (6 + z))))) + 12 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))))))) && (((((!(z * 5 % 6 == 0) || !(-z / -6 + 1 + 1 + 1 + 1 <= 1 + (1 + (1 + (1 + (1 + n)))))) || !(0 == 6 * a * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))))) + -((x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))))) * (6 + (6 + (6 + (6 + (6 + z)))))) + 12 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))))))) || !(1 + (1 + (1 + (1 + n))) <= a)) || 0 == 2 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))) * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))) + -(3 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))))) * (6 + (6 + (6 + (6 + (6 + z)))))) + -(18 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))))) + -(10 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))))) + 3 * (6 + (6 + (6 + (6 + (6 + z))))) + -10) || -z / -6 + 1 + 1 + 1 + 1 <= a)) && (((((!(0 == 6 * a * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z))))))) + -((x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z))))))) * (6 + (6 + (6 + (6 + (6 + (6 + (6 + z)))))))) + 12 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z)))))))) || !(-z / -6 + 1 + 1 + 1 + 1 + 1 + 1 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + n)))))))) || !(z * 5 % 6 == 0)) || 0 == 2 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z))))) + (6 + (6 + (6 + (6 + (6 + (6 + z))))))) * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z))))) + (6 + (6 + (6 + (6 + (6 + (6 + z))))))) + -(3 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z))))))) * (6 + (6 + (6 + (6 + (6 + (6 + (6 + z)))))))) + -(18 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z)))))))) + -(10 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z))))) + (6 + (6 + (6 + (6 + (6 + (6 + z)))))))) + 3 * (6 + (6 + (6 + (6 + (6 + (6 + (6 + z))))))) + -10) || !(1 + (1 + (1 + (1 + (1 + (1 + n))))) <= a)) || -z / -6 + 1 + 1 + 1 + 1 + 1 + 1 <= a)) && ((!(z == 6 + 6 * n) || n <= a) || 0 == 6 * a * x + -(x * z) + 12 * x)) && z * 5 % 6 == 0) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && a < 65536) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535))) && ((((((((((0 == (y + z + (6 + z)) * (6 + 6 * (1 + (1 + n))) + -(18 * (x + y + (y + z))) + -(12 * (y + z + (6 + z))) + 2 * (6 + 6 * (1 + (1 + n))) + -6 || !(6 + 6 * (1 + (1 + n)) == 6 + (6 + z))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) || ((((((((!(z == 6 + 6 * n) || 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))))) && (((((-z / -6 + 1 + 1 + 1 + 1 + 1 <= a || !(1 + (1 + (1 + (1 + (1 + n)))) <= a)) || !(z * 5 % 6 == 0)) || 0 == 2 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z)))))) * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z)))))) + -(3 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))))) * (6 + (6 + (6 + (6 + (6 + (6 + z))))))) + -(18 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))))) + -(10 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z))))))) + 3 * (6 + (6 + (6 + (6 + (6 + (6 + z)))))) + -10) || !(-z / -6 + 1 + 1 + 1 + 1 + 1 <= 1 + (1 + (1 + (1 + (1 + (1 + n))))))) || !(0 == 6 * a * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))))) + -((x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))))) * (6 + (6 + (6 + (6 + (6 + (6 + z))))))) + 12 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))))))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && ((((a + 65536 < 65536 && a * -1 + -65536 <= (-a + -1) / 65536 * 65536) && 0 <= a + 65536) && a * -1 + -32768 <= (-a + -1) / 65536 * 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535) && a < 65536))) && (((((!(z * 5 % 6 == 0) || -z / -6 <= a) || !(0 == 6 * a * (x + y) + -((x + y) * (6 + z)) + 12 * (x + y))) || !(-z / -6 <= 1 + n)) || 0 == 2 * (y + z) * (y + z) + -(3 * (x + y) * (6 + z)) + -(18 * (x + y)) + -(10 * (y + z)) + 3 * (6 + z) + -10) || !(n <= a))) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && (((((!(z * 5 % 6 == 0) || !(0 == 6 * a * (x + y + (y + z)) + -((x + y + (y + z)) * (6 + (6 + z))) + 12 * (x + y + (y + z)))) || -z / -6 + 1 <= a) || !(-z / -6 + 1 <= 1 + (1 + n))) || !(1 + n <= a)) || 0 == 2 * (y + z + (6 + z)) * (y + z + (6 + z)) + -(3 * (x + y + (y + z)) * (6 + (6 + z))) + -(18 * (x + y + (y + z))) + -(10 * (y + z + (6 + z))) + 3 * (6 + (6 + z)) + -10)) && z == 6 + 6 * n)) || ((((((((((((n + -1 <= a && 0 == 12 + ((z + -6) * (z + -6) + -(12 * (y + (z + -6) * -1)) + -(6 * (z + -6)))) && ((!(z == 6 + 6 * n) || n <= a) || 0 == 6 * a * x + -(x * z) + 12 * x)) && z * 5 % 6 == 0) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && a < 65536) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535))) && ((((((((((0 == (y + z + (6 + z)) * (6 + 6 * (1 + (1 + n))) + -(18 * (x + y + (y + z))) + -(12 * (y + z + (6 + z))) + 2 * (6 + 6 * (1 + (1 + n))) + -6 || !(6 + 6 * (1 + (1 + n)) == 6 + (6 + z))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) || ((((((((!(z == 6 + 6 * n) || 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && ((((a + 65536 < 65536 && a * -1 + -65536 <= (-a + -1) / 65536 * 65536) && 0 <= a + 65536) && a * -1 + -32768 <= (-a + -1) / 65536 * 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535) && a < 65536))) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && z == 6 + 6 * n)) || (((((((((((((((((((((z + -6 + -6 == 6 + (z + -6 + 27 + -14 + (z + -6 + -6) * -1 + -7) && n + -1 <= a) && 0 == 2 * y * y + -(3 * x * z) + -(18 * x) + -(10 * y) + 3 * z + -10) && ((!(0 == 6 * a * (x + y + (y + z)) + -((x + y + (y + z)) * (6 + (6 + z))) + 12 * (x + y + (y + z))) || !(1 + n <= a)) || 0 == 2 * (y + z + (6 + z)) * (y + z + (6 + z)) + -(3 * (x + y + (y + z)) * (6 + (6 + z))) + -(18 * (x + y + (y + z))) + -(10 * (y + z + (6 + z))) + 3 * (6 + (6 + z)) + -10)) && 0 == 12 + ((z + -6) * (z + -6) + -(12 * (y + (z + -6) * -1)) + -(6 * (z + -6)))) && ((!(0 == 6 * a * (x + y) + -((x + y) * (6 + z)) + 12 * (x + y)) || 0 == 2 * (y + z) * (y + z) + -(3 * (x + y) * (6 + z)) + -(18 * (x + y)) + -(10 * (y + z)) + 3 * (6 + z) + -10) || !(n <= a))) && x == 27 + (z + -6 + 27 + -14)) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((a % 65536 <= 32767 && 0 <= a) && a < 65536))) && ((!(z == 6 + 6 * n) || n <= a) || 0 == 6 * a * x + -(x * z) + 12 * x)) && z * 5 % 6 == 0) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && a < 65536) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535))) && ((((((((((0 == (y + z + (6 + z)) * (6 + 6 * (1 + (1 + n))) + -(18 * (x + y + (y + z))) + -(12 * (y + z + (6 + z))) + 2 * (6 + 6 * (1 + (1 + n))) + -6 || !(6 + 6 * (1 + (1 + n)) == 6 + (6 + z))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) || ((((((((!(z == 6 + 6 * n) || 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))))) && n + -1 == 1 + 2) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && ((((a + 65536 < 65536 && a * -1 + -65536 <= (-a + -1) / 65536 * 65536) && 0 <= a + 65536) && a * -1 + -32768 <= (-a + -1) / 65536 * 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535) && a < 65536))) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && y == z + -6 + 27 + -14 + (z + -6)) && ((!(0 == 6 * a * (x + y + (y + z) + (y + z + (6 + z))) + -((x + y + (y + z) + (y + z + (6 + z))) * (6 + (6 + (6 + z)))) + 12 * (x + y + (y + z) + (y + z + (6 + z)))) || !(1 + (1 + n) <= a)) || 0 == 2 * (y + z + (6 + z) + (6 + (6 + z))) * (y + z + (6 + z) + (6 + (6 + z))) + -(3 * (x + y + (y + z) + (y + z + (6 + z))) * (6 + (6 + (6 + z)))) + -(18 * (x + y + (y + z) + (y + z + (6 + z)))) + -(10 * (y + z + (6 + z) + (6 + (6 + z)))) + 3 * (6 + (6 + (6 + z))) + -10)) && z == 6 + 6 * n)) || (((((((((((((n + -1 <= a && 0 == 12 + ((z + -6) * (z + -6) + -(12 * (y + (z + -6) * -1)) + -(6 * (z + -6)))) && (((!(z == 6 + 6 * n) || n <= a) || 0 == 2 * y * y + -(3 * x * z) + -(18 * x) + -(10 * y) + 3 * z + -10) || !(0 == 6 * a * x + -(x * z) + 12 * x))) && ((!(z == 6 + 6 * n) || n <= a) || 0 == 6 * a * x + -(x * z) + 12 * x)) && z * 5 % 6 == 0) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && a < 65536) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535))) && ((((((((((0 == (y + z + (6 + z)) * (6 + 6 * (1 + (1 + n))) + -(18 * (x + y + (y + z))) + -(12 * (y + z + (6 + z))) + 2 * (6 + 6 * (1 + (1 + n))) + -6 || !(6 + 6 * (1 + (1 + n)) == 6 + (6 + z))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) || ((((((((!(z == 6 + 6 * n) || 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && ((((a + 65536 < 65536 && a * -1 + -65536 <= (-a + -1) / 65536 * 65536) && 0 <= a + 65536) && a * -1 + -32768 <= (-a + -1) / 65536 * 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535) && a < 65536))) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && z == 6 + 6 * n)) || (((((((((((((((n + -1 <= a && 0 == 12 + ((z + -6) * (z + -6) + -(12 * (y + (z + -6) * -1)) + -(6 * (z + -6)))) && (((!(z == 6 + 6 * n) || n <= a) || 0 == 2 * y * y + -(3 * x * z) + -(18 * x) + -(10 * y) + 3 * z + -10) || !(0 == 6 * a * x + -(x * z) + 12 * x))) && ((!(z == 6 + 6 * n) || n <= a) || 0 == 6 * a * x + -(x * z) + 12 * x)) && z * 5 % 6 == 0) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && a < 65536) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535))) && ((((((((((0 == (y + z + (6 + z)) * (6 + 6 * (1 + (1 + n))) + -(18 * (x + y + (y + z))) + -(12 * (y + z + (6 + z))) + 2 * (6 + 6 * (1 + (1 + n))) + -6 || !(6 + 6 * (1 + (1 + n)) == 6 + (6 + z))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) || ((((((((!(z == 6 + 6 * n) || 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && ((((a + 65536 < 65536 && a * -1 + -65536 <= (-a + -1) / 65536 * 65536) && 0 <= a + 65536) && a * -1 + -32768 <= (-a + -1) / 65536 * 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535) && a < 65536))) && (((((!(z * 5 % 6 == 0) || -z / -6 <= a) || !(0 == 6 * a * (x + y) + -((x + y) * (6 + z)) + 12 * (x + y))) || !(-z / -6 <= 1 + n)) || 0 == 2 * (y + z) * (y + z) + -(3 * (x + y) * (6 + z)) + -(18 * (x + y)) + -(10 * (y + z)) + 3 * (6 + z) + -10) || !(n <= a))) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && (((((!(z * 5 % 6 == 0) || !(0 == 6 * a * (x + y + (y + z)) + -((x + y + (y + z)) * (6 + (6 + z))) + 12 * (x + y + (y + z)))) || -z / -6 + 1 <= a) || !(-z / -6 + 1 <= 1 + (1 + n))) || !(1 + n <= a)) || 0 == 2 * (y + z + (6 + z)) * (y + z + (6 + z)) + -(3 * (x + y + (y + z)) * (6 + (6 + z))) + -(18 * (x + y + (y + z))) + -(10 * (y + z + (6 + z))) + 3 * (6 + (6 + z)) + -10)) && z == 6 + 6 * n)) || ((((((((((((((((((n + -1 <= a && 0 == 12 + ((z + -6) * (z + -6) + -(12 * (y + (z + -6) * -1)) + -(6 * (z + -6)))) && z + -6 + -6 == 6 + 30) && (0 == 2 * y * y + -(3 * x * z) + -(18 * x) + -(10 * y) + 3 * z + -10 || !(0 == 6 * a * x + -(x * z) + 12 * x))) && n == 1 + (1 + 5)) && y + (z + -6) * -1 == 91 + (z + -6 + -6)) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((a % 65536 <= 32767 && 0 <= a) && a < 65536))) && ((!(z == 6 + 6 * n) || n <= a) || 0 == 6 * a * x + -(x * z) + 12 * x)) && z * 5 % 6 == 0) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && a < 65536) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535))) && ((((((((((0 == (y + z + (6 + z)) * (6 + 6 * (1 + (1 + n))) + -(18 * (x + y + (y + z))) + -(12 * (y + z + (6 + z))) + 2 * (6 + 6 * (1 + (1 + n))) + -6 || !(6 + 6 * (1 + (1 + n)) == 6 + (6 + z))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) || ((((((((!(z == 6 + 6 * n) || 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && ((((a + 65536 < 65536 && a * -1 + -65536 <= (-a + -1) / 65536 * 65536) && 0 <= a + 65536) && a * -1 + -32768 <= (-a + -1) / 65536 * 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535) && a < 65536))) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && x + (y + (z + -6) * -1) * -1 == 27 + (30 + -6 + 27 + -14) + (91 + 30 * -1) + 91) && z == 6 + 6 * n)) || ((((((((((((((((((((n + -1 <= a && ((!(0 == 6 * a * (x + y + (y + z)) + -((x + y + (y + z)) * (6 + (6 + z))) + 12 * (x + y + (y + z))) || !(1 + n <= a)) || 0 == 2 * (y + z + (6 + z)) * (y + z + (6 + z)) + -(3 * (x + y + (y + z)) * (6 + (6 + z))) + -(18 * (x + y + (y + z))) + -(10 * (y + z + (6 + z))) + 3 * (6 + (6 + z)) + -10)) && 0 == 12 + ((z + -6) * (z + -6) + -(12 * (y + (z + -6) * -1)) + -(6 * (z + -6)))) && (0 == 2 * y * y + -(3 * x * z) + -(18 * x) + -(10 * y) + 3 * z + -10 || !(0 == 6 * a * x + -(x * z) + 12 * x))) && ((!(0 == 6 * a * (x + y) + -((x + y) * (6 + z)) + 12 * (x + y)) || 0 == 2 * (y + z) * (y + z) + -(3 * (x + y) * (6 + z)) + -(18 * (x + y)) + -(10 * (y + z)) + 3 * (6 + z) + -10) || !(n <= a))) && y + 30 * -1 == 30 + -6 + 27 + -14 + (30 + -6)) && z == 6 + 30) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((a % 65536 <= 32767 && 0 <= a) && a < 65536))) && ((!(z == 6 + 6 * n) || n <= a) || 0 == 6 * a * x + -(x * z) + 12 * x)) && z * 5 % 6 == 0) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && a < 65536) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535))) && ((((((((((0 == (y + z + (6 + z)) * (6 + 6 * (1 + (1 + n))) + -(18 * (x + y + (y + z))) + -(12 * (y + z + (6 + z))) + 2 * (6 + 6 * (1 + (1 + n))) + -6 || !(6 + 6 * (1 + (1 + n)) == 6 + (6 + z))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) || ((((((((!(z == 6 + 6 * n) || 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && ((((a + 65536 < 65536 && a * -1 + -65536 <= (-a + -1) / 65536 * 65536) && 0 <= a + 65536) && a * -1 + -32768 <= (-a + -1) / 65536 * 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535) && a < 65536))) && n + -1 + -1 == 1 + 2) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && x == 27 + (30 + -6 + 27 + -14) + (y + 30 * -1)) && z == 6 + 6 * n)) || (((((((((((((((((n + -1 <= a && 0 == 12 + ((z + -6) * (z + -6) + -(12 * (y + (z + -6) * -1)) + -(6 * (z + -6)))) && (((((-z / -6 + 1 + 1 <= a || !(z * 5 % 6 == 0)) || !(0 == 6 * a * (x + y + (y + z) + (y + z + (6 + z))) + -((x + y + (y + z) + (y + z + (6 + z))) * (6 + (6 + (6 + z)))) + 12 * (x + y + (y + z) + (y + z + (6 + z))))) || !(1 + (1 + n) <= a)) || !(-z / -6 + 1 + 1 <= 1 + (1 + (1 + n)))) || 0 == 2 * (y + z + (6 + z) + (6 + (6 + z))) * (y + z + (6 + z) + (6 + (6 + z))) + -(3 * (x + y + (y + z) + (y + z + (6 + z))) * (6 + (6 + (6 + z)))) + -(18 * (x + y + (y + z) + (y + z + (6 + z)))) + -(10 * (y + z + (6 + z) + (6 + (6 + z)))) + 3 * (6 + (6 + (6 + z))) + -10)) && (((!(z == 6 + 6 * n) || n <= a) || 0 == 2 * y * y + -(3 * x * z) + -(18 * x) + -(10 * y) + 3 * z + -10) || !(0 == 6 * a * x + -(x * z) + 12 * x))) && (((((!(z * 5 % 6 == 0) || !(-z / -6 + 1 + 1 + 1 <= 1 + (1 + (1 + (1 + n))))) || !(1 + (1 + (1 + n)) <= a)) || 0 == 2 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + -(3 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z)))) * (6 + (6 + (6 + (6 + z))))) + -(18 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))))) + -(10 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))))) + 3 * (6 + (6 + (6 + (6 + z)))) + -10) || -z / -6 + 1 + 1 + 1 <= a) || !(0 == 6 * a * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z)))) + -((x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z)))) * (6 + (6 + (6 + (6 + z))))) + 12 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))))))) && ((!(z == 6 + 6 * n) || n <= a) || 0 == 6 * a * x + -(x * z) + 12 * x)) && z * 5 % 6 == 0) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && a < 65536) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535))) && ((((((((((0 == (y + z + (6 + z)) * (6 + 6 * (1 + (1 + n))) + -(18 * (x + y + (y + z))) + -(12 * (y + z + (6 + z))) + 2 * (6 + 6 * (1 + (1 + n))) + -6 || !(6 + 6 * (1 + (1 + n)) == 6 + (6 + z))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) || ((((((((!(z == 6 + 6 * n) || 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && ((((a + 65536 < 65536 && a * -1 + -65536 <= (-a + -1) / 65536 * 65536) && 0 <= a + 65536) && a * -1 + -32768 <= (-a + -1) / 65536 * 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535) && a < 65536))) && (((((!(z * 5 % 6 == 0) || -z / -6 <= a) || !(0 == 6 * a * (x + y) + -((x + y) * (6 + z)) + 12 * (x + y))) || !(-z / -6 <= 1 + n)) || 0 == 2 * (y + z) * (y + z) + -(3 * (x + y) * (6 + z)) + -(18 * (x + y)) + -(10 * (y + z)) + 3 * (6 + z) + -10) || !(n <= a))) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && (((((!(z * 5 % 6 == 0) || !(0 == 6 * a * (x + y + (y + z)) + -((x + y + (y + z)) * (6 + (6 + z))) + 12 * (x + y + (y + z)))) || -z / -6 + 1 <= a) || !(-z / -6 + 1 <= 1 + (1 + n))) || !(1 + n <= a)) || 0 == 2 * (y + z + (6 + z)) * (y + z + (6 + z)) + -(3 * (x + y + (y + z)) * (6 + (6 + z))) + -(18 * (x + y + (y + z))) + -(10 * (y + z + (6 + z))) + 3 * (6 + (6 + z)) + -10)) && z == 6 + 6 * n)) || ((((((((((((((((((n + -1 <= a && 0 == 12 + ((z + -6) * (z + -6) + -(12 * (y + (z + -6) * -1)) + -(6 * (z + -6)))) && (((((-z / -6 + 1 + 1 <= a || !(z * 5 % 6 == 0)) || !(0 == 6 * a * (x + y + (y + z) + (y + z + (6 + z))) + -((x + y + (y + z) + (y + z + (6 + z))) * (6 + (6 + (6 + z)))) + 12 * (x + y + (y + z) + (y + z + (6 + z))))) || !(1 + (1 + n) <= a)) || !(-z / -6 + 1 + 1 <= 1 + (1 + (1 + n)))) || 0 == 2 * (y + z + (6 + z) + (6 + (6 + z))) * (y + z + (6 + z) + (6 + (6 + z))) + -(3 * (x + y + (y + z) + (y + z + (6 + z))) * (6 + (6 + (6 + z)))) + -(18 * (x + y + (y + z) + (y + z + (6 + z)))) + -(10 * (y + z + (6 + z) + (6 + (6 + z)))) + 3 * (6 + (6 + (6 + z))) + -10)) && (((!(z == 6 + 6 * n) || n <= a) || 0 == 2 * y * y + -(3 * x * z) + -(18 * x) + -(10 * y) + 3 * z + -10) || !(0 == 6 * a * x + -(x * z) + 12 * x))) && (((((!(z * 5 % 6 == 0) || !(-z / -6 + 1 + 1 + 1 <= 1 + (1 + (1 + (1 + n))))) || !(1 + (1 + (1 + n)) <= a)) || 0 == 2 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + -(3 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z)))) * (6 + (6 + (6 + (6 + z))))) + -(18 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))))) + -(10 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))))) + 3 * (6 + (6 + (6 + (6 + z)))) + -10) || -z / -6 + 1 + 1 + 1 <= a) || !(0 == 6 * a * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z)))) + -((x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z)))) * (6 + (6 + (6 + (6 + z))))) + 12 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))))))) && (((((!(z * 5 % 6 == 0) || !(-z / -6 + 1 + 1 + 1 + 1 <= 1 + (1 + (1 + (1 + (1 + n)))))) || !(0 == 6 * a * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))))) + -((x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))))) * (6 + (6 + (6 + (6 + (6 + z)))))) + 12 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))))))) || !(1 + (1 + (1 + (1 + n))) <= a)) || 0 == 2 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))) * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))) + -(3 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))))) * (6 + (6 + (6 + (6 + (6 + z)))))) + -(18 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))))) + -(10 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))))) + 3 * (6 + (6 + (6 + (6 + (6 + z))))) + -10) || -z / -6 + 1 + 1 + 1 + 1 <= a)) && ((!(z == 6 + 6 * n) || n <= a) || 0 == 6 * a * x + -(x * z) + 12 * x)) && z * 5 % 6 == 0) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && a < 65536) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535))) && ((((((((((0 == (y + z + (6 + z)) * (6 + 6 * (1 + (1 + n))) + -(18 * (x + y + (y + z))) + -(12 * (y + z + (6 + z))) + 2 * (6 + 6 * (1 + (1 + n))) + -6 || !(6 + 6 * (1 + (1 + n)) == 6 + (6 + z))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) || ((((((((!(z == 6 + 6 * n) || 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && ((((a + 65536 < 65536 && a * -1 + -65536 <= (-a + -1) / 65536 * 65536) && 0 <= a + 65536) && a * -1 + -32768 <= (-a + -1) / 65536 * 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535) && a < 65536))) && (((((!(z * 5 % 6 == 0) || -z / -6 <= a) || !(0 == 6 * a * (x + y) + -((x + y) * (6 + z)) + 12 * (x + y))) || !(-z / -6 <= 1 + n)) || 0 == 2 * (y + z) * (y + z) + -(3 * (x + y) * (6 + z)) + -(18 * (x + y)) + -(10 * (y + z)) + 3 * (6 + z) + -10) || !(n <= a))) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && (((((!(z * 5 % 6 == 0) || !(0 == 6 * a * (x + y + (y + z)) + -((x + y + (y + z)) * (6 + (6 + z))) + 12 * (x + y + (y + z)))) || -z / -6 + 1 <= a) || !(-z / -6 + 1 <= 1 + (1 + n))) || !(1 + n <= a)) || 0 == 2 * (y + z + (6 + z)) * (y + z + (6 + z)) + -(3 * (x + y + (y + z)) * (6 + (6 + z))) + -(18 * (x + y + (y + z))) + -(10 * (y + z + (6 + z))) + 3 * (6 + (6 + z)) + -10)) && z == 6 + 6 * n)) || (((((((((((((((((((n + -1 <= a && 0 == 12 + ((z + -6) * (z + -6) + -(12 * (y + (z + -6) * -1)) + -(6 * (z + -6)))) && (((((-z / -6 + 1 + 1 <= a || !(z * 5 % 6 == 0)) || !(0 == 6 * a * (x + y + (y + z) + (y + z + (6 + z))) + -((x + y + (y + z) + (y + z + (6 + z))) * (6 + (6 + (6 + z)))) + 12 * (x + y + (y + z) + (y + z + (6 + z))))) || !(1 + (1 + n) <= a)) || !(-z / -6 + 1 + 1 <= 1 + (1 + (1 + n)))) || 0 == 2 * (y + z + (6 + z) + (6 + (6 + z))) * (y + z + (6 + z) + (6 + (6 + z))) + -(3 * (x + y + (y + z) + (y + z + (6 + z))) * (6 + (6 + (6 + z)))) + -(18 * (x + y + (y + z) + (y + z + (6 + z)))) + -(10 * (y + z + (6 + z) + (6 + (6 + z)))) + 3 * (6 + (6 + (6 + z))) + -10)) && (((!(z == 6 + 6 * n) || n <= a) || 0 == 2 * y * y + -(3 * x * z) + -(18 * x) + -(10 * y) + 3 * z + -10) || !(0 == 6 * a * x + -(x * z) + 12 * x))) && (((((!(z * 5 % 6 == 0) || !(-z / -6 + 1 + 1 + 1 <= 1 + (1 + (1 + (1 + n))))) || !(1 + (1 + (1 + n)) <= a)) || 0 == 2 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + -(3 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z)))) * (6 + (6 + (6 + (6 + z))))) + -(18 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))))) + -(10 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))))) + 3 * (6 + (6 + (6 + (6 + z)))) + -10) || -z / -6 + 1 + 1 + 1 <= a) || !(0 == 6 * a * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z)))) + -((x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z)))) * (6 + (6 + (6 + (6 + z))))) + 12 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))))))) && (((((!(z * 5 % 6 == 0) || !(-z / -6 + 1 + 1 + 1 + 1 <= 1 + (1 + (1 + (1 + (1 + n)))))) || !(0 == 6 * a * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))))) + -((x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))))) * (6 + (6 + (6 + (6 + (6 + z)))))) + 12 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))))))) || !(1 + (1 + (1 + (1 + n))) <= a)) || 0 == 2 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))) * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))) + -(3 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))))) * (6 + (6 + (6 + (6 + (6 + z)))))) + -(18 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))))) + -(10 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))))) + 3 * (6 + (6 + (6 + (6 + (6 + z))))) + -10) || -z / -6 + 1 + 1 + 1 + 1 <= a)) && ((!(z == 6 + 6 * n) || n <= a) || 0 == 6 * a * x + -(x * z) + 12 * x)) && z * 5 % 6 == 0) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && a < 65536) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535))) && ((((((((((0 == (y + z + (6 + z)) * (6 + 6 * (1 + (1 + n))) + -(18 * (x + y + (y + z))) + -(12 * (y + z + (6 + z))) + 2 * (6 + 6 * (1 + (1 + n))) + -6 || !(6 + 6 * (1 + (1 + n)) == 6 + (6 + z))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) || ((((((((!(z == 6 + 6 * n) || 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))))) && (((((-z / -6 + 1 + 1 + 1 + 1 + 1 <= a || !(1 + (1 + (1 + (1 + (1 + n)))) <= a)) || !(z * 5 % 6 == 0)) || 0 == 2 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z)))))) * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z)))))) + -(3 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))))) * (6 + (6 + (6 + (6 + (6 + (6 + z))))))) + -(18 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))))) + -(10 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z))))))) + 3 * (6 + (6 + (6 + (6 + (6 + (6 + z)))))) + -10) || !(-z / -6 + 1 + 1 + 1 + 1 + 1 <= 1 + (1 + (1 + (1 + (1 + (1 + n))))))) || !(0 == 6 * a * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))))) + -((x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))))) * (6 + (6 + (6 + (6 + (6 + (6 + z))))))) + 12 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))))))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && ((((a + 65536 < 65536 && a * -1 + -65536 <= (-a + -1) / 65536 * 65536) && 0 <= a + 65536) && a * -1 + -32768 <= (-a + -1) / 65536 * 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535) && a < 65536))) && (((((!(z * 5 % 6 == 0) || -z / -6 <= a) || !(0 == 6 * a * (x + y) + -((x + y) * (6 + z)) + 12 * (x + y))) || !(-z / -6 <= 1 + n)) || 0 == 2 * (y + z) * (y + z) + -(3 * (x + y) * (6 + z)) + -(18 * (x + y)) + -(10 * (y + z)) + 3 * (6 + z) + -10) || !(n <= a))) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && (((((!(z * 5 % 6 == 0) || !(0 == 6 * a * (x + y + (y + z)) + -((x + y + (y + z)) * (6 + (6 + z))) + 12 * (x + y + (y + z)))) || -z / -6 + 1 <= a) || !(-z / -6 + 1 <= 1 + (1 + n))) || !(1 + n <= a)) || 0 == 2 * (y + z + (6 + z)) * (y + z + (6 + z)) + -(3 * (x + y + (y + z)) * (6 + (6 + z))) + -(18 * (x + y + (y + z))) + -(10 * (y + z + (6 + z))) + 3 * (6 + (6 + z)) + -10)) && z == 6 + 6 * n)) || ((((((((((((((((((((((((1 + (1 + 0) <= a && 0 == 12 + ((z + -6) * (z + -6) + -(12 * (y + (z + -6) * -1)) + -(6 * (z + -6)))) && z == 6 + 18) && x == 1 + (1 + 6) + (y + (z + -6) * -1)) && n == 1 + 2) && x + 19 * -1 == 1 + (19 + (6 + 6) * -1)) && z * 5 % 6 == 0) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && a < 65536) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a <= 50) && ((((a + 65536 < 65536 && a * -1 + -65536 <= (-a + -1) / 65536 * 65536) && 0 <= a + 65536) && a * -1 + -32768 <= (-a + -1) / 65536 * 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535) && a < 65536))) && n <= 1 + 2) && n + -1 <= a) && y + (z + -6) * -1 + -7 == 6 + 6) && 2 <= a) && y == 7 + (18 + -6) + 18) && z + -6 == 6 + (y + (z + -6) * -1 + -7)) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((a % 65536 <= 32767 && 0 <= a) && a < 65536))) && ((((((((((0 == (y + z + (6 + z)) * (6 + 6 * (1 + (1 + n))) + -(18 * (x + y + (y + z))) + -(12 * (y + z + (6 + z))) + 2 * (6 + 6 * (1 + (1 + n))) + -6 || !(6 + 6 * (1 + (1 + n)) == 6 + (6 + z))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) || ((((((((!(z == 6 + 6 * n) || 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && z == 6 + (6 + (6 + 6))) && a >= 0) && 7 * -1 + (x + (7 + (18 + -6)) * -1 + 7 * -1) + 6 == 0) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && z == 6 + 6 * n)) || ((((((((((((((((((((((((((((((((((((y + (y + x * -1 + (y * -1 + x + z + -6)) * -1) * -1 + (y * -1 + x + z + -6) + 6 == 0 && y == 7 + (z + -6)) && z == 6 + (y + -7)) && y == 1 + (12 + -6) + 12) && 0 == 12 + ((z + -6) * (z + -6) + -(12 * (y + (z + -6) * -1)) + -(6 * (z + -6)))) && n == 1 + 1) && 1 <= a) && n + -1 + -1 == 0) && ((!(z == 6 + 6 * n) || n <= a) || 0 == 6 * a * x + -(x * z) + 12 * x)) && z * 5 % 6 == 0) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && a < 65536) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535))) && (n <= a || 0 == 6 * a * x + -(x * z) + 12 * x)) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a <= 50) && ((((a + 65536 < 65536 && a * -1 + -65536 <= (-a + -1) / 65536 * 65536) && 0 <= a + 65536) && a * -1 + -32768 <= (-a + -1) / 65536 * 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535) && a < 65536))) && x == n * n * n) && z == 6 + 12) && x == 1 + (1 + 6)) && n + -1 <= a) && z == 6 + (6 + 6)) && z + -6 == 6 + 6) && n + -1 == 1 + 0) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((a % 65536 <= 32767 && 0 <= a) && a < 65536))) && y + (6 + 6) * -1 == 1 + 6) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && a >= 0) && y + (y + x * -1 + (y * -1 + x + z + -6)) * -1 + (y + (y + x * -1 + (y * -1 + x + z + -6)) * -1 + ((y + (y + x * -1 + (y * -1 + x + z + -6)) * -1) * -1 + (y * -1 + x + z + -6) + 6) + (y * -1 + x + z + -6) * -1) * -1 == 1) && 7 * -1 + (x + 7 * -1) + 6 == 0) && y + -7 == 6 + 6) && (!(z == 6 + 6 * n) || x + y == (1 + n) * (1 + n) * (1 + n))) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && x == 1 + (y + (6 + 6) * -1)) && n == 1 + (1 + 0)) && y + x * -1 + (y * -1 + x + z + -6) == 6 + (y + (y + x * -1 + (y * -1 + x + z + -6)) * -1 + ((y + (y + x * -1 + (y * -1 + x + z + -6)) * -1) * -1 + (y * -1 + x + z + -6) + 6) + (y * -1 + x + z + -6) * -1)) && z == 6 + 6 * n) [2023-02-18 16:43:23,528 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 16:43:23,528 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 16:43:23,529 INFO L158 Benchmark]: Toolchain (without parser) took 364336.28ms. Allocated memory was 241.2MB in the beginning and 293.6MB in the end (delta: 52.4MB). Free memory was 191.8MB in the beginning and 205.5MB in the end (delta: -13.6MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. [2023-02-18 16:43:23,530 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 146.8MB. Free memory was 90.9MB in the beginning and 90.7MB in the end (delta: 168.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 16:43:23,531 INFO L158 Benchmark]: CACSL2BoogieTranslator took 156.06ms. Allocated memory is still 241.2MB. Free memory was 191.8MB in the beginning and 180.2MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 16:43:23,531 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.45ms. Allocated memory is still 241.2MB. Free memory was 179.3MB in the beginning and 178.3MB in the end (delta: 949.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 16:43:23,531 INFO L158 Benchmark]: Boogie Preprocessor took 13.02ms. Allocated memory is still 241.2MB. Free memory was 178.3MB in the beginning and 177.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 16:43:23,531 INFO L158 Benchmark]: RCFGBuilder took 227.86ms. Allocated memory is still 241.2MB. Free memory was 177.2MB in the beginning and 165.7MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 16:43:23,533 INFO L158 Benchmark]: TraceAbstraction took 363879.08ms. Allocated memory was 241.2MB in the beginning and 293.6MB in the end (delta: 52.4MB). Free memory was 164.6MB in the beginning and 209.6MB in the end (delta: -45.1MB). Peak memory consumption was 135.2MB. Max. memory is 16.1GB. [2023-02-18 16:43:23,536 INFO L158 Benchmark]: Witness Printer took 35.70ms. Allocated memory is still 293.6MB. Free memory was 208.6MB in the beginning and 205.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-18 16:43:23,541 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.13ms. Allocated memory is still 146.8MB. Free memory was 90.9MB in the beginning and 90.7MB in the end (delta: 168.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 156.06ms. Allocated memory is still 241.2MB. Free memory was 191.8MB in the beginning and 180.2MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.45ms. Allocated memory is still 241.2MB. Free memory was 179.3MB in the beginning and 178.3MB in the end (delta: 949.2kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 13.02ms. Allocated memory is still 241.2MB. Free memory was 178.3MB in the beginning and 177.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 227.86ms. Allocated memory is still 241.2MB. Free memory was 177.2MB in the beginning and 165.7MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 363879.08ms. Allocated memory was 241.2MB in the beginning and 293.6MB in the end (delta: 52.4MB). Free memory was 164.6MB in the beginning and 209.6MB in the end (delta: -45.1MB). Peak memory consumption was 135.2MB. Max. memory is 16.1GB. * Witness Printer took 35.70ms. Allocated memory is still 293.6MB. Free memory was 208.6MB in the beginning and 205.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] * 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, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 363.8s, OverallIterations: 16, TraceHistogramMax: 99, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 293.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 66 mSolverCounterUnknown, 439 SdHoareTripleChecker+Valid, 223.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 332 mSDsluCounter, 1497 SdHoareTripleChecker+Invalid, 223.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 35 IncrementalHoareTripleChecker+Unchecked, 1038 mSDsCounter, 788 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7373 IncrementalHoareTripleChecker+Invalid, 8262 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 788 mSolverCounterUnsat, 459 mSDtfsCounter, 7373 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3291 GetRequests, 2970 SyntacticMatches, 37 SemanticMatches, 284 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1370 ImplicationChecksByTransitivity, 129.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=241occurred in iteration=15, InterpolantAutomatonStates: 186, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 12 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 156 PreInvPairs, 308 NumberOfFragments, 229063 HoareAnnotationTreeSize, 156 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 65.4s InterpolantComputationTime, 1673 NumberOfCodeBlocks, 1078 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 3129 ConstructedInterpolants, 6 QuantifiedInterpolants, 66970 SizeOfPredicates, 82 NumberOfNonLiveVariables, 2542 ConjunctsInSsa, 505 ConjunctsInUnsatCore, 28 InterpolantComputations, 2 PerfectInterpolantSequences, 57945/59296 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: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 33]: Loop Invariant [2023-02-18 16:43:23,558 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,558 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,558 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,559 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,559 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,559 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,559 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,559 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,560 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,560 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,560 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,560 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,560 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,561 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,561 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,561 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,561 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] [2023-02-18 16:43:23,561 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,561 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,562 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] [2023-02-18 16:43:23,562 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,562 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,562 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] [2023-02-18 16:43:23,562 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,563 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,563 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] [2023-02-18 16:43:23,563 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,563 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,563 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,564 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] [2023-02-18 16:43:23,564 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,564 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,564 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,564 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,564 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] [2023-02-18 16:43:23,565 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] [2023-02-18 16:43:23,565 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,565 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,565 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] [2023-02-18 16:43:23,565 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,566 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] [2023-02-18 16:43:23,566 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,566 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,580 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,581 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,581 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,581 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,581 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,581 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,582 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,582 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,582 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,582 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,582 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,582 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,583 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 16:43:23,583 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,583 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,583 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,583 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] [2023-02-18 16:43:23,584 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,584 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,584 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] [2023-02-18 16:43:23,584 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,584 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,584 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] [2023-02-18 16:43:23,585 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,585 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,585 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] [2023-02-18 16:43:23,585 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,585 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,586 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,586 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] [2023-02-18 16:43:23,586 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,586 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,587 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,588 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,588 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] [2023-02-18 16:43:23,588 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] [2023-02-18 16:43:23,588 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,588 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,588 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] [2023-02-18 16:43:23,589 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,589 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_54,QUANTIFIED] [2023-02-18 16:43:23,589 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] [2023-02-18 16:43:23,589 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((x + 1 * -1 == 0 && z + -6 == 6 + 6 * 0) && 0 == 12 + ((z + -6) * (z + -6) + -(12 * (y + (z + -6) * -1)) + -(6 * (z + -6)))) && y == 1 + (z + -6)) && y + 6 * -1 == 1) && x + y == (1 + n) * (1 + n) * (1 + n)) && ((!(z == 6 + 6 * n) || n <= a) || 0 == 6 * a * x + -(x * z) + 12 * x)) && z * 5 % 6 == 0) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && a < 65536) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a <= 50) && n == 1 + 0) && ((((a + 65536 < 65536 && a * -1 + -65536 <= (-a + -1) / 65536 * 65536) && 0 <= a + 65536) && a * -1 + -32768 <= (-a + -1) / 65536 * 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535) && a < 65536))) && y == 1 + 6) && n + -1 <= a) && z + -6 == 6) && 1 * -1 + x == 0) && z == 6 + (y + -1)) && n + -1 == 0) && 0 <= a) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) && z == 6 + 6) && ((n + 1 < a + 1 || 0 == 6 * a * (x + y) + -((x + y) * (6 + z)) + 12 * (x + y)) || !(n <= a))) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((a % 65536 <= 32767 && 0 <= a) && a < 65536))) && (((!(0 == 12 + (z * z + -(12 * y) + -(6 * z))) || !(0 == 6 * a * (x + y) + -((x + y) * (6 + 6 * (1 + n))) + 12 * (x + y))) || 0 == 2 * (y + z) * (y + z) + -(3 * (x + y) * (6 + 6 * (1 + n))) + -(18 * (x + y)) + -(10 * (y + z)) + 3 * (6 + 6 * (1 + n)) + -10) || !(6 + 6 * (1 + n) == 6 + z))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && y * -1 + x + 6 == 0) && z == 6 + (y + (y * -1 + x + 6) + x * -1)) && a >= 0) && n <= 1 + 0) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && x == 1) && y + (y + (y * -1 + x + 6) + x * -1) * -1 == 1) && z == 6 + 6 * n) || ((((((((((((((((((((((n + -1 <= a && 0 == 2 * y * y + -(3 * x * z) + -(18 * x) + -(10 * y) + 3 * z + -10) && 0 == 12 + ((z + -6) * (z + -6) + -(12 * (y + (z + -6) * -1)) + -(6 * (z + -6)))) && (((((-z / -6 + 1 + 1 <= a || !(z * 5 % 6 == 0)) || !(0 == 6 * a * (x + y + (y + z) + (y + z + (6 + z))) + -((x + y + (y + z) + (y + z + (6 + z))) * (6 + (6 + (6 + z)))) + 12 * (x + y + (y + z) + (y + z + (6 + z))))) || !(1 + (1 + n) <= a)) || !(-z / -6 + 1 + 1 <= 1 + (1 + (1 + n)))) || 0 == 2 * (y + z + (6 + z) + (6 + (6 + z))) * (y + z + (6 + z) + (6 + (6 + z))) + -(3 * (x + y + (y + z) + (y + z + (6 + z))) * (6 + (6 + (6 + z)))) + -(18 * (x + y + (y + z) + (y + z + (6 + z)))) + -(10 * (y + z + (6 + z) + (6 + (6 + z)))) + 3 * (6 + (6 + (6 + z))) + -10)) && (((((!(z * 5 % 6 == 0) || !(-z / -6 + 1 + 1 + 1 <= 1 + (1 + (1 + (1 + n))))) || !(1 + (1 + (1 + n)) <= a)) || 0 == 2 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + -(3 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z)))) * (6 + (6 + (6 + (6 + z))))) + -(18 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))))) + -(10 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))))) + 3 * (6 + (6 + (6 + (6 + z)))) + -10) || -z / -6 + 1 + 1 + 1 <= a) || !(0 == 6 * a * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z)))) + -((x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z)))) * (6 + (6 + (6 + (6 + z))))) + 12 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))))))) && (((((!(z * 5 % 6 == 0) || !(-z / -6 + 1 + 1 + 1 + 1 <= 1 + (1 + (1 + (1 + (1 + n)))))) || !(0 == 6 * a * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))))) + -((x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))))) * (6 + (6 + (6 + (6 + (6 + z)))))) + 12 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))))))) || !(1 + (1 + (1 + (1 + n))) <= a)) || 0 == 2 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))) * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))) + -(3 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))))) * (6 + (6 + (6 + (6 + (6 + z)))))) + -(18 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))))) + -(10 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))))) + 3 * (6 + (6 + (6 + (6 + (6 + z))))) + -10) || -z / -6 + 1 + 1 + 1 + 1 <= a)) && (((((!(0 == 6 * a * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z))))))) + -((x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z))))))) * (6 + (6 + (6 + (6 + (6 + (6 + (6 + z)))))))) + 12 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z)))))))) || !(-z / -6 + 1 + 1 + 1 + 1 + 1 + 1 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + n)))))))) || !(z * 5 % 6 == 0)) || 0 == 2 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z))))) + (6 + (6 + (6 + (6 + (6 + (6 + z))))))) * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z))))) + (6 + (6 + (6 + (6 + (6 + (6 + z))))))) + -(3 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z))))))) * (6 + (6 + (6 + (6 + (6 + (6 + (6 + z)))))))) + -(18 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z)))))))) + -(10 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z))))) + (6 + (6 + (6 + (6 + (6 + (6 + z)))))))) + 3 * (6 + (6 + (6 + (6 + (6 + (6 + (6 + z))))))) + -10) || !(1 + (1 + (1 + (1 + (1 + (1 + n))))) <= a)) || -z / -6 + 1 + 1 + 1 + 1 + 1 + 1 <= a)) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((a % 65536 <= 32767 && 0 <= a) && a < 65536))) && ((!(z == 6 + 6 * n) || n <= a) || 0 == 6 * a * x + -(x * z) + 12 * x)) && z * 5 % 6 == 0) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && a < 65536) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535))) && ((((((((((0 == (y + z + (6 + z)) * (6 + 6 * (1 + (1 + n))) + -(18 * (x + y + (y + z))) + -(12 * (y + z + (6 + z))) + 2 * (6 + 6 * (1 + (1 + n))) + -6 || !(6 + 6 * (1 + (1 + n)) == 6 + (6 + z))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) || ((((((((!(z == 6 + 6 * n) || 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))))) && (((((-z / -6 + 1 + 1 + 1 + 1 + 1 <= a || !(1 + (1 + (1 + (1 + (1 + n)))) <= a)) || !(z * 5 % 6 == 0)) || 0 == 2 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z)))))) * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z)))))) + -(3 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))))) * (6 + (6 + (6 + (6 + (6 + (6 + z))))))) + -(18 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))))) + -(10 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z))))))) + 3 * (6 + (6 + (6 + (6 + (6 + (6 + z)))))) + -10) || !(-z / -6 + 1 + 1 + 1 + 1 + 1 <= 1 + (1 + (1 + (1 + (1 + (1 + n))))))) || !(0 == 6 * a * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))))) + -((x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))))) * (6 + (6 + (6 + (6 + (6 + (6 + z))))))) + 12 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))))))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && ((((a + 65536 < 65536 && a * -1 + -65536 <= (-a + -1) / 65536 * 65536) && 0 <= a + 65536) && a * -1 + -32768 <= (-a + -1) / 65536 * 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535) && a < 65536))) && (((((!(z * 5 % 6 == 0) || -z / -6 <= a) || !(0 == 6 * a * (x + y) + -((x + y) * (6 + z)) + 12 * (x + y))) || !(-z / -6 <= 1 + n)) || 0 == 2 * (y + z) * (y + z) + -(3 * (x + y) * (6 + z)) + -(18 * (x + y)) + -(10 * (y + z)) + 3 * (6 + z) + -10) || !(n <= a))) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && (((((!(z * 5 % 6 == 0) || !(0 == 6 * a * (x + y + (y + z)) + -((x + y + (y + z)) * (6 + (6 + z))) + 12 * (x + y + (y + z)))) || -z / -6 + 1 <= a) || !(-z / -6 + 1 <= 1 + (1 + n))) || !(1 + n <= a)) || 0 == 2 * (y + z + (6 + z)) * (y + z + (6 + z)) + -(3 * (x + y + (y + z)) * (6 + (6 + z))) + -(18 * (x + y + (y + z))) + -(10 * (y + z + (6 + z))) + 3 * (6 + (6 + z)) + -10)) && z == 6 + 6 * n) && (((((!(z * 5 % 6 == 0) || !(-z / -6 + 1 + 1 + 1 + 1 + 1 + 1 + 1 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + n))))))))) || !(0 == 6 * a * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z)))))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z))))) + (6 + (6 + (6 + (6 + (6 + (6 + z)))))))) + -((x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z)))))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z))))) + (6 + (6 + (6 + (6 + (6 + (6 + z)))))))) * (6 + (6 + (6 + (6 + (6 + (6 + (6 + (6 + z))))))))) + 12 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z)))))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z))))) + (6 + (6 + (6 + (6 + (6 + (6 + z)))))))))) || !(1 + (1 + (1 + (1 + (1 + (1 + (1 + n)))))) <= a)) || 0 == 2 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z))))) + (6 + (6 + (6 + (6 + (6 + (6 + z)))))) + (6 + (6 + (6 + (6 + (6 + (6 + (6 + z)))))))) * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z))))) + (6 + (6 + (6 + (6 + (6 + (6 + z)))))) + (6 + (6 + (6 + (6 + (6 + (6 + (6 + z)))))))) + -(3 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z)))))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z))))) + (6 + (6 + (6 + (6 + (6 + (6 + z)))))))) * (6 + (6 + (6 + (6 + (6 + (6 + (6 + (6 + z))))))))) + -(18 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z)))))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z))))) + (6 + (6 + (6 + (6 + (6 + (6 + z))))))))) + -(10 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z))))) + (6 + (6 + (6 + (6 + (6 + (6 + z)))))) + (6 + (6 + (6 + (6 + (6 + (6 + (6 + z))))))))) + 3 * (6 + (6 + (6 + (6 + (6 + (6 + (6 + (6 + z)))))))) + -10) || -z / -6 + 1 + 1 + 1 + 1 + 1 + 1 + 1 <= a))) || (((((((((((((((((((((n + -1 <= a && 0 == 12 + ((z + -6) * (z + -6) + -(12 * (y + (z + -6) * -1)) + -(6 * (z + -6)))) && x == 0) && z == 6 + (y + -1)) && 0 == a * z + -(6 * a) + -(2 * y) + 2 * z + -10) && 0 <= a) && z == 6) && ((\exists aux_div_ULTIMATE.start_main_~a~0#1_40 : int, aux_mod_ULTIMATE.start_main_~a~0#1_40 : int :: ((((((aux_div_ULTIMATE.start_main_~a~0#1_40 * 65536 + aux_mod_ULTIMATE.start_main_~a~0#1_40 <= 50 && !(aux_mod_ULTIMATE.start_main_~a~0#1_40 <= 32767)) && 0 == 6 * (aux_div_ULTIMATE.start_main_~a~0#1_40 * 65536 + aux_mod_ULTIMATE.start_main_~a~0#1_40) * x + -(x * z) + 12 * x) && aux_div_ULTIMATE.start_main_~a~0#1_40 * 65536 + aux_mod_ULTIMATE.start_main_~a~0#1_40 >= 0) && 0 <= aux_mod_ULTIMATE.start_main_~a~0#1_40) && 0 <= aux_div_ULTIMATE.start_main_~a~0#1_40 * 65536 + aux_mod_ULTIMATE.start_main_~a~0#1_40 + 65536) && aux_mod_ULTIMATE.start_main_~a~0#1_40 < 65536) && aux_div_ULTIMATE.start_main_~a~0#1_40 * 65536 + aux_mod_ULTIMATE.start_main_~a~0#1_40 + 65536 < 65536) || (\exists aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51 : int, aux_div_ULTIMATE.start_main_~a~0#1_54 : int, aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51 : int :: (((((((((0 <= aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51 + aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51 * 65536 && 0 <= aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51) && 0 <= aux_div_ULTIMATE.start_main_~a~0#1_54 * -65536 + (aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51 + aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51 * 65536) * -1 + -1) && aux_div_ULTIMATE.start_main_~a~0#1_54 * -65536 + (aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51 + aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51 * 65536) * -1 + -1 < 65536) && aux_div_ULTIMATE.start_main_~a~0#1_54 * -65536 + (aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51 + aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51 * 65536) * -1 + -1 >= 0) && 0 == 6 * (aux_div_ULTIMATE.start_main_~a~0#1_54 * -65536 + (aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51 + aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51 * 65536) * -1 + -1) * x + -(x * z) + 12 * x) && aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51 < 65536) && aux_div_ULTIMATE.start_main_~a~0#1_54 * -65536 + (aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51 + aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51 * 65536) * -1 + -1 <= 50) && aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51 + aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51 * 65536 < 65536) && aux_div_ULTIMATE.start_main_~a~0#1_54 * 65536 + 65536 <= (aux_div_ULTIMATE.start_main_~a~0#1_54 * -65536 + (aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51 + aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51 * 65536) * -1 + -1) * -1 + 32767) && (aux_div_ULTIMATE.start_main_~a~0#1_54 + aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51) * 65536 + 65536 <= (aux_div_ULTIMATE.start_main_~a~0#1_54 * -65536 + (aux_mod_aux_mod_ULTIMATE.start_main_~a~0#1_54_51 + aux_div_aux_mod_ULTIMATE.start_main_~a~0#1_54_51 * 65536) * -1 + -1) * -1 + 65535))) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((a % 65536 <= 32767 && 0 <= a) && a < 65536))) && z * 5 % 6 == 0) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && a < 65536) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && y == 1) && n == 0) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && n <= 1 + 0) && ((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6)) && a <= 50) && ((((a + 65536 < 65536 && a * -1 + -65536 <= (-a + -1) / 65536 * 65536) && 0 <= a + 65536) && a * -1 + -32768 <= (-a + -1) / 65536 * 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535) && a < 65536))) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && z == 6 + 6 * n)) || ((((((((((((((((((n + -1 <= a && z == 6 + 48) && 0 == 12 + ((z + -6) * (z + -6) + -(12 * (y + (z + -6) * -1)) + -(6 * (z + -6)))) && x == 48 + 295 + (48 * 2 + 73)) && 1 + (1 + 5) <= a) && n <= 1 + (1 + (1 + 5))) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((a % 65536 <= 32767 && 0 <= a) && a < 65536))) && ((!(z == 6 + 6 * n) || n <= a) || 0 == 6 * a * x + -(x * z) + 12 * x)) && z * 5 % 6 == 0) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && a < 65536) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535))) && ((((((((((0 == (y + z + (6 + z)) * (6 + 6 * (1 + (1 + n))) + -(18 * (x + y + (y + z))) + -(12 * (y + z + (6 + z))) + 2 * (6 + 6 * (1 + (1 + n))) + -6 || !(6 + 6 * (1 + (1 + n)) == 6 + (6 + z))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) || ((((((((!(z == 6 + 6 * n) || 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && ((((a + 65536 < 65536 && a * -1 + -65536 <= (-a + -1) / 65536 * 65536) && 0 <= a + 65536) && a * -1 + -32768 <= (-a + -1) / 65536 * 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535) && a < 65536))) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && y == 48 * 2 + 73 + 48) && z == 6 + 6 * n)) || (((((((((((((((((((n + -1 <= a && x == 27 + (30 + -6 + 27 + -14) + (91 + 30 * -1) + 91) && 0 == 12 + ((z + -6) * (z + -6) + -(12 * (y + (z + -6) * -1)) + -(6 * (z + -6)))) && (0 == 2 * y * y + -(3 * x * z) + -(18 * x) + -(10 * y) + 3 * z + -10 || !(0 == 6 * a * x + -(x * z) + 12 * x))) && ((!(0 == 6 * a * (x + y) + -((x + y) * (6 + z)) + 12 * (x + y)) || 0 == 2 * (y + z) * (y + z) + -(3 * (x + y) * (6 + z)) + -(18 * (x + y)) + -(10 * (y + z)) + 3 * (6 + z) + -10) || !(n <= a))) && z + -6 == 6 + 30) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((a % 65536 <= 32767 && 0 <= a) && a < 65536))) && ((!(z == 6 + 6 * n) || n <= a) || 0 == 6 * a * x + -(x * z) + 12 * x)) && z * 5 % 6 == 0) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && a < 65536) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535))) && ((((((((((0 == (y + z + (6 + z)) * (6 + 6 * (1 + (1 + n))) + -(18 * (x + y + (y + z))) + -(12 * (y + z + (6 + z))) + 2 * (6 + 6 * (1 + (1 + n))) + -6 || !(6 + 6 * (1 + (1 + n)) == 6 + (6 + z))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) || ((((((((!(z == 6 + 6 * n) || 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))))) && y == 91 + (z + -6)) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && ((((a + 65536 < 65536 && a * -1 + -65536 <= (-a + -1) / 65536 * 65536) && 0 <= a + 65536) && a * -1 + -32768 <= (-a + -1) / 65536 * 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535) && a < 65536))) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && n == 1 + 5) && z == 6 + 6 * n)) || ((((((((((((((((n + -1 <= a && 0 == 12 + ((z + -6) * (z + -6) + -(12 * (y + (z + -6) * -1)) + -(6 * (z + -6)))) && (((((-z / -6 + 1 + 1 <= a || !(z * 5 % 6 == 0)) || !(0 == 6 * a * (x + y + (y + z) + (y + z + (6 + z))) + -((x + y + (y + z) + (y + z + (6 + z))) * (6 + (6 + (6 + z)))) + 12 * (x + y + (y + z) + (y + z + (6 + z))))) || !(1 + (1 + n) <= a)) || !(-z / -6 + 1 + 1 <= 1 + (1 + (1 + n)))) || 0 == 2 * (y + z + (6 + z) + (6 + (6 + z))) * (y + z + (6 + z) + (6 + (6 + z))) + -(3 * (x + y + (y + z) + (y + z + (6 + z))) * (6 + (6 + (6 + z)))) + -(18 * (x + y + (y + z) + (y + z + (6 + z)))) + -(10 * (y + z + (6 + z) + (6 + (6 + z)))) + 3 * (6 + (6 + (6 + z))) + -10)) && (((!(z == 6 + 6 * n) || n <= a) || 0 == 2 * y * y + -(3 * x * z) + -(18 * x) + -(10 * y) + 3 * z + -10) || !(0 == 6 * a * x + -(x * z) + 12 * x))) && ((!(z == 6 + 6 * n) || n <= a) || 0 == 6 * a * x + -(x * z) + 12 * x)) && z * 5 % 6 == 0) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && a < 65536) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535))) && ((((((((((0 == (y + z + (6 + z)) * (6 + 6 * (1 + (1 + n))) + -(18 * (x + y + (y + z))) + -(12 * (y + z + (6 + z))) + 2 * (6 + 6 * (1 + (1 + n))) + -6 || !(6 + 6 * (1 + (1 + n)) == 6 + (6 + z))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) || ((((((((!(z == 6 + 6 * n) || 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && ((((a + 65536 < 65536 && a * -1 + -65536 <= (-a + -1) / 65536 * 65536) && 0 <= a + 65536) && a * -1 + -32768 <= (-a + -1) / 65536 * 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535) && a < 65536))) && (((((!(z * 5 % 6 == 0) || -z / -6 <= a) || !(0 == 6 * a * (x + y) + -((x + y) * (6 + z)) + 12 * (x + y))) || !(-z / -6 <= 1 + n)) || 0 == 2 * (y + z) * (y + z) + -(3 * (x + y) * (6 + z)) + -(18 * (x + y)) + -(10 * (y + z)) + 3 * (6 + z) + -10) || !(n <= a))) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && (((((!(z * 5 % 6 == 0) || !(0 == 6 * a * (x + y + (y + z)) + -((x + y + (y + z)) * (6 + (6 + z))) + 12 * (x + y + (y + z)))) || -z / -6 + 1 <= a) || !(-z / -6 + 1 <= 1 + (1 + n))) || !(1 + n <= a)) || 0 == 2 * (y + z + (6 + z)) * (y + z + (6 + z)) + -(3 * (x + y + (y + z)) * (6 + (6 + z))) + -(18 * (x + y + (y + z))) + -(10 * (y + z + (6 + z))) + 3 * (6 + (6 + z)) + -10)) && z == 6 + 6 * n)) || ((((((((((((((n + -1 <= a && 0 == 12 + ((z + -6) * (z + -6) + -(12 * (y + (z + -6) * -1)) + -(6 * (z + -6)))) && (((!(z == 6 + 6 * n) || n <= a) || 0 == 2 * y * y + -(3 * x * z) + -(18 * x) + -(10 * y) + 3 * z + -10) || !(0 == 6 * a * x + -(x * z) + 12 * x))) && ((!(z == 6 + 6 * n) || n <= a) || 0 == 6 * a * x + -(x * z) + 12 * x)) && z * 5 % 6 == 0) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && a < 65536) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535))) && ((((((((((0 == (y + z + (6 + z)) * (6 + 6 * (1 + (1 + n))) + -(18 * (x + y + (y + z))) + -(12 * (y + z + (6 + z))) + 2 * (6 + 6 * (1 + (1 + n))) + -6 || !(6 + 6 * (1 + (1 + n)) == 6 + (6 + z))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) || ((((((((!(z == 6 + 6 * n) || 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && ((((a + 65536 < 65536 && a * -1 + -65536 <= (-a + -1) / 65536 * 65536) && 0 <= a + 65536) && a * -1 + -32768 <= (-a + -1) / 65536 * 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535) && a < 65536))) && (((((!(z * 5 % 6 == 0) || -z / -6 <= a) || !(0 == 6 * a * (x + y) + -((x + y) * (6 + z)) + 12 * (x + y))) || !(-z / -6 <= 1 + n)) || 0 == 2 * (y + z) * (y + z) + -(3 * (x + y) * (6 + z)) + -(18 * (x + y)) + -(10 * (y + z)) + 3 * (6 + z) + -10) || !(n <= a))) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && z == 6 + 6 * n)) || ((((((((((((((((((((n + -1 <= a && 0 == 12 + ((z + -6) * (z + -6) + -(12 * (y + (z + -6) * -1)) + -(6 * (z + -6)))) && (((((-z / -6 + 1 + 1 <= a || !(z * 5 % 6 == 0)) || !(0 == 6 * a * (x + y + (y + z) + (y + z + (6 + z))) + -((x + y + (y + z) + (y + z + (6 + z))) * (6 + (6 + (6 + z)))) + 12 * (x + y + (y + z) + (y + z + (6 + z))))) || !(1 + (1 + n) <= a)) || !(-z / -6 + 1 + 1 <= 1 + (1 + (1 + n)))) || 0 == 2 * (y + z + (6 + z) + (6 + (6 + z))) * (y + z + (6 + z) + (6 + (6 + z))) + -(3 * (x + y + (y + z) + (y + z + (6 + z))) * (6 + (6 + (6 + z)))) + -(18 * (x + y + (y + z) + (y + z + (6 + z)))) + -(10 * (y + z + (6 + z) + (6 + (6 + z)))) + 3 * (6 + (6 + (6 + z))) + -10)) && (((!(z == 6 + 6 * n) || n <= a) || 0 == 2 * y * y + -(3 * x * z) + -(18 * x) + -(10 * y) + 3 * z + -10) || !(0 == 6 * a * x + -(x * z) + 12 * x))) && (((((!(z * 5 % 6 == 0) || !(-z / -6 + 1 + 1 + 1 <= 1 + (1 + (1 + (1 + n))))) || !(1 + (1 + (1 + n)) <= a)) || 0 == 2 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + -(3 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z)))) * (6 + (6 + (6 + (6 + z))))) + -(18 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))))) + -(10 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))))) + 3 * (6 + (6 + (6 + (6 + z)))) + -10) || -z / -6 + 1 + 1 + 1 <= a) || !(0 == 6 * a * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z)))) + -((x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z)))) * (6 + (6 + (6 + (6 + z))))) + 12 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))))))) && (((((!(z * 5 % 6 == 0) || !(-z / -6 + 1 + 1 + 1 + 1 <= 1 + (1 + (1 + (1 + (1 + n)))))) || !(0 == 6 * a * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))))) + -((x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))))) * (6 + (6 + (6 + (6 + (6 + z)))))) + 12 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))))))) || !(1 + (1 + (1 + (1 + n))) <= a)) || 0 == 2 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))) * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))) + -(3 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))))) * (6 + (6 + (6 + (6 + (6 + z)))))) + -(18 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))))) + -(10 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))))) + 3 * (6 + (6 + (6 + (6 + (6 + z))))) + -10) || -z / -6 + 1 + 1 + 1 + 1 <= a)) && (((((!(0 == 6 * a * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z))))))) + -((x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z))))))) * (6 + (6 + (6 + (6 + (6 + (6 + (6 + z)))))))) + 12 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z)))))))) || !(-z / -6 + 1 + 1 + 1 + 1 + 1 + 1 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + n)))))))) || !(z * 5 % 6 == 0)) || 0 == 2 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z))))) + (6 + (6 + (6 + (6 + (6 + (6 + z))))))) * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z))))) + (6 + (6 + (6 + (6 + (6 + (6 + z))))))) + -(3 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z))))))) * (6 + (6 + (6 + (6 + (6 + (6 + (6 + z)))))))) + -(18 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z)))))))) + -(10 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z))))) + (6 + (6 + (6 + (6 + (6 + (6 + z)))))))) + 3 * (6 + (6 + (6 + (6 + (6 + (6 + (6 + z))))))) + -10) || !(1 + (1 + (1 + (1 + (1 + (1 + n))))) <= a)) || -z / -6 + 1 + 1 + 1 + 1 + 1 + 1 <= a)) && ((!(z == 6 + 6 * n) || n <= a) || 0 == 6 * a * x + -(x * z) + 12 * x)) && z * 5 % 6 == 0) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && a < 65536) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535))) && ((((((((((0 == (y + z + (6 + z)) * (6 + 6 * (1 + (1 + n))) + -(18 * (x + y + (y + z))) + -(12 * (y + z + (6 + z))) + 2 * (6 + 6 * (1 + (1 + n))) + -6 || !(6 + 6 * (1 + (1 + n)) == 6 + (6 + z))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) || ((((((((!(z == 6 + 6 * n) || 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))))) && (((((-z / -6 + 1 + 1 + 1 + 1 + 1 <= a || !(1 + (1 + (1 + (1 + (1 + n)))) <= a)) || !(z * 5 % 6 == 0)) || 0 == 2 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z)))))) * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z)))))) + -(3 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))))) * (6 + (6 + (6 + (6 + (6 + (6 + z))))))) + -(18 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))))) + -(10 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z))))))) + 3 * (6 + (6 + (6 + (6 + (6 + (6 + z)))))) + -10) || !(-z / -6 + 1 + 1 + 1 + 1 + 1 <= 1 + (1 + (1 + (1 + (1 + (1 + n))))))) || !(0 == 6 * a * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))))) + -((x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))))) * (6 + (6 + (6 + (6 + (6 + (6 + z))))))) + 12 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))))))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && ((((a + 65536 < 65536 && a * -1 + -65536 <= (-a + -1) / 65536 * 65536) && 0 <= a + 65536) && a * -1 + -32768 <= (-a + -1) / 65536 * 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535) && a < 65536))) && (((((!(z * 5 % 6 == 0) || -z / -6 <= a) || !(0 == 6 * a * (x + y) + -((x + y) * (6 + z)) + 12 * (x + y))) || !(-z / -6 <= 1 + n)) || 0 == 2 * (y + z) * (y + z) + -(3 * (x + y) * (6 + z)) + -(18 * (x + y)) + -(10 * (y + z)) + 3 * (6 + z) + -10) || !(n <= a))) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && (((((!(z * 5 % 6 == 0) || !(0 == 6 * a * (x + y + (y + z)) + -((x + y + (y + z)) * (6 + (6 + z))) + 12 * (x + y + (y + z)))) || -z / -6 + 1 <= a) || !(-z / -6 + 1 <= 1 + (1 + n))) || !(1 + n <= a)) || 0 == 2 * (y + z + (6 + z)) * (y + z + (6 + z)) + -(3 * (x + y + (y + z)) * (6 + (6 + z))) + -(18 * (x + y + (y + z))) + -(10 * (y + z + (6 + z))) + 3 * (6 + (6 + z)) + -10)) && z == 6 + 6 * n)) || ((((((((((((n + -1 <= a && 0 == 12 + ((z + -6) * (z + -6) + -(12 * (y + (z + -6) * -1)) + -(6 * (z + -6)))) && ((!(z == 6 + 6 * n) || n <= a) || 0 == 6 * a * x + -(x * z) + 12 * x)) && z * 5 % 6 == 0) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && a < 65536) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535))) && ((((((((((0 == (y + z + (6 + z)) * (6 + 6 * (1 + (1 + n))) + -(18 * (x + y + (y + z))) + -(12 * (y + z + (6 + z))) + 2 * (6 + 6 * (1 + (1 + n))) + -6 || !(6 + 6 * (1 + (1 + n)) == 6 + (6 + z))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) || ((((((((!(z == 6 + 6 * n) || 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && ((((a + 65536 < 65536 && a * -1 + -65536 <= (-a + -1) / 65536 * 65536) && 0 <= a + 65536) && a * -1 + -32768 <= (-a + -1) / 65536 * 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535) && a < 65536))) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && z == 6 + 6 * n)) || (((((((((((((((((((((z + -6 + -6 == 6 + (z + -6 + 27 + -14 + (z + -6 + -6) * -1 + -7) && n + -1 <= a) && 0 == 2 * y * y + -(3 * x * z) + -(18 * x) + -(10 * y) + 3 * z + -10) && ((!(0 == 6 * a * (x + y + (y + z)) + -((x + y + (y + z)) * (6 + (6 + z))) + 12 * (x + y + (y + z))) || !(1 + n <= a)) || 0 == 2 * (y + z + (6 + z)) * (y + z + (6 + z)) + -(3 * (x + y + (y + z)) * (6 + (6 + z))) + -(18 * (x + y + (y + z))) + -(10 * (y + z + (6 + z))) + 3 * (6 + (6 + z)) + -10)) && 0 == 12 + ((z + -6) * (z + -6) + -(12 * (y + (z + -6) * -1)) + -(6 * (z + -6)))) && ((!(0 == 6 * a * (x + y) + -((x + y) * (6 + z)) + 12 * (x + y)) || 0 == 2 * (y + z) * (y + z) + -(3 * (x + y) * (6 + z)) + -(18 * (x + y)) + -(10 * (y + z)) + 3 * (6 + z) + -10) || !(n <= a))) && x == 27 + (z + -6 + 27 + -14)) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((a % 65536 <= 32767 && 0 <= a) && a < 65536))) && ((!(z == 6 + 6 * n) || n <= a) || 0 == 6 * a * x + -(x * z) + 12 * x)) && z * 5 % 6 == 0) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && a < 65536) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535))) && ((((((((((0 == (y + z + (6 + z)) * (6 + 6 * (1 + (1 + n))) + -(18 * (x + y + (y + z))) + -(12 * (y + z + (6 + z))) + 2 * (6 + 6 * (1 + (1 + n))) + -6 || !(6 + 6 * (1 + (1 + n)) == 6 + (6 + z))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) || ((((((((!(z == 6 + 6 * n) || 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))))) && n + -1 == 1 + 2) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && ((((a + 65536 < 65536 && a * -1 + -65536 <= (-a + -1) / 65536 * 65536) && 0 <= a + 65536) && a * -1 + -32768 <= (-a + -1) / 65536 * 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535) && a < 65536))) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && y == z + -6 + 27 + -14 + (z + -6)) && ((!(0 == 6 * a * (x + y + (y + z) + (y + z + (6 + z))) + -((x + y + (y + z) + (y + z + (6 + z))) * (6 + (6 + (6 + z)))) + 12 * (x + y + (y + z) + (y + z + (6 + z)))) || !(1 + (1 + n) <= a)) || 0 == 2 * (y + z + (6 + z) + (6 + (6 + z))) * (y + z + (6 + z) + (6 + (6 + z))) + -(3 * (x + y + (y + z) + (y + z + (6 + z))) * (6 + (6 + (6 + z)))) + -(18 * (x + y + (y + z) + (y + z + (6 + z)))) + -(10 * (y + z + (6 + z) + (6 + (6 + z)))) + 3 * (6 + (6 + (6 + z))) + -10)) && z == 6 + 6 * n)) || (((((((((((((n + -1 <= a && 0 == 12 + ((z + -6) * (z + -6) + -(12 * (y + (z + -6) * -1)) + -(6 * (z + -6)))) && (((!(z == 6 + 6 * n) || n <= a) || 0 == 2 * y * y + -(3 * x * z) + -(18 * x) + -(10 * y) + 3 * z + -10) || !(0 == 6 * a * x + -(x * z) + 12 * x))) && ((!(z == 6 + 6 * n) || n <= a) || 0 == 6 * a * x + -(x * z) + 12 * x)) && z * 5 % 6 == 0) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && a < 65536) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535))) && ((((((((((0 == (y + z + (6 + z)) * (6 + 6 * (1 + (1 + n))) + -(18 * (x + y + (y + z))) + -(12 * (y + z + (6 + z))) + 2 * (6 + 6 * (1 + (1 + n))) + -6 || !(6 + 6 * (1 + (1 + n)) == 6 + (6 + z))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) || ((((((((!(z == 6 + 6 * n) || 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && ((((a + 65536 < 65536 && a * -1 + -65536 <= (-a + -1) / 65536 * 65536) && 0 <= a + 65536) && a * -1 + -32768 <= (-a + -1) / 65536 * 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535) && a < 65536))) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && z == 6 + 6 * n)) || (((((((((((((((n + -1 <= a && 0 == 12 + ((z + -6) * (z + -6) + -(12 * (y + (z + -6) * -1)) + -(6 * (z + -6)))) && (((!(z == 6 + 6 * n) || n <= a) || 0 == 2 * y * y + -(3 * x * z) + -(18 * x) + -(10 * y) + 3 * z + -10) || !(0 == 6 * a * x + -(x * z) + 12 * x))) && ((!(z == 6 + 6 * n) || n <= a) || 0 == 6 * a * x + -(x * z) + 12 * x)) && z * 5 % 6 == 0) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && a < 65536) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535))) && ((((((((((0 == (y + z + (6 + z)) * (6 + 6 * (1 + (1 + n))) + -(18 * (x + y + (y + z))) + -(12 * (y + z + (6 + z))) + 2 * (6 + 6 * (1 + (1 + n))) + -6 || !(6 + 6 * (1 + (1 + n)) == 6 + (6 + z))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) || ((((((((!(z == 6 + 6 * n) || 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && ((((a + 65536 < 65536 && a * -1 + -65536 <= (-a + -1) / 65536 * 65536) && 0 <= a + 65536) && a * -1 + -32768 <= (-a + -1) / 65536 * 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535) && a < 65536))) && (((((!(z * 5 % 6 == 0) || -z / -6 <= a) || !(0 == 6 * a * (x + y) + -((x + y) * (6 + z)) + 12 * (x + y))) || !(-z / -6 <= 1 + n)) || 0 == 2 * (y + z) * (y + z) + -(3 * (x + y) * (6 + z)) + -(18 * (x + y)) + -(10 * (y + z)) + 3 * (6 + z) + -10) || !(n <= a))) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && (((((!(z * 5 % 6 == 0) || !(0 == 6 * a * (x + y + (y + z)) + -((x + y + (y + z)) * (6 + (6 + z))) + 12 * (x + y + (y + z)))) || -z / -6 + 1 <= a) || !(-z / -6 + 1 <= 1 + (1 + n))) || !(1 + n <= a)) || 0 == 2 * (y + z + (6 + z)) * (y + z + (6 + z)) + -(3 * (x + y + (y + z)) * (6 + (6 + z))) + -(18 * (x + y + (y + z))) + -(10 * (y + z + (6 + z))) + 3 * (6 + (6 + z)) + -10)) && z == 6 + 6 * n)) || ((((((((((((((((((n + -1 <= a && 0 == 12 + ((z + -6) * (z + -6) + -(12 * (y + (z + -6) * -1)) + -(6 * (z + -6)))) && z + -6 + -6 == 6 + 30) && (0 == 2 * y * y + -(3 * x * z) + -(18 * x) + -(10 * y) + 3 * z + -10 || !(0 == 6 * a * x + -(x * z) + 12 * x))) && n == 1 + (1 + 5)) && y + (z + -6) * -1 == 91 + (z + -6 + -6)) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((a % 65536 <= 32767 && 0 <= a) && a < 65536))) && ((!(z == 6 + 6 * n) || n <= a) || 0 == 6 * a * x + -(x * z) + 12 * x)) && z * 5 % 6 == 0) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && a < 65536) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535))) && ((((((((((0 == (y + z + (6 + z)) * (6 + 6 * (1 + (1 + n))) + -(18 * (x + y + (y + z))) + -(12 * (y + z + (6 + z))) + 2 * (6 + 6 * (1 + (1 + n))) + -6 || !(6 + 6 * (1 + (1 + n)) == 6 + (6 + z))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) || ((((((((!(z == 6 + 6 * n) || 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && ((((a + 65536 < 65536 && a * -1 + -65536 <= (-a + -1) / 65536 * 65536) && 0 <= a + 65536) && a * -1 + -32768 <= (-a + -1) / 65536 * 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535) && a < 65536))) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && x + (y + (z + -6) * -1) * -1 == 27 + (30 + -6 + 27 + -14) + (91 + 30 * -1) + 91) && z == 6 + 6 * n)) || ((((((((((((((((((((n + -1 <= a && ((!(0 == 6 * a * (x + y + (y + z)) + -((x + y + (y + z)) * (6 + (6 + z))) + 12 * (x + y + (y + z))) || !(1 + n <= a)) || 0 == 2 * (y + z + (6 + z)) * (y + z + (6 + z)) + -(3 * (x + y + (y + z)) * (6 + (6 + z))) + -(18 * (x + y + (y + z))) + -(10 * (y + z + (6 + z))) + 3 * (6 + (6 + z)) + -10)) && 0 == 12 + ((z + -6) * (z + -6) + -(12 * (y + (z + -6) * -1)) + -(6 * (z + -6)))) && (0 == 2 * y * y + -(3 * x * z) + -(18 * x) + -(10 * y) + 3 * z + -10 || !(0 == 6 * a * x + -(x * z) + 12 * x))) && ((!(0 == 6 * a * (x + y) + -((x + y) * (6 + z)) + 12 * (x + y)) || 0 == 2 * (y + z) * (y + z) + -(3 * (x + y) * (6 + z)) + -(18 * (x + y)) + -(10 * (y + z)) + 3 * (6 + z) + -10) || !(n <= a))) && y + 30 * -1 == 30 + -6 + 27 + -14 + (30 + -6)) && z == 6 + 30) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((a % 65536 <= 32767 && 0 <= a) && a < 65536))) && ((!(z == 6 + 6 * n) || n <= a) || 0 == 6 * a * x + -(x * z) + 12 * x)) && z * 5 % 6 == 0) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && a < 65536) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535))) && ((((((((((0 == (y + z + (6 + z)) * (6 + 6 * (1 + (1 + n))) + -(18 * (x + y + (y + z))) + -(12 * (y + z + (6 + z))) + 2 * (6 + 6 * (1 + (1 + n))) + -6 || !(6 + 6 * (1 + (1 + n)) == 6 + (6 + z))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) || ((((((((!(z == 6 + 6 * n) || 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && ((((a + 65536 < 65536 && a * -1 + -65536 <= (-a + -1) / 65536 * 65536) && 0 <= a + 65536) && a * -1 + -32768 <= (-a + -1) / 65536 * 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535) && a < 65536))) && n + -1 + -1 == 1 + 2) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && x == 27 + (30 + -6 + 27 + -14) + (y + 30 * -1)) && z == 6 + 6 * n)) || (((((((((((((((((n + -1 <= a && 0 == 12 + ((z + -6) * (z + -6) + -(12 * (y + (z + -6) * -1)) + -(6 * (z + -6)))) && (((((-z / -6 + 1 + 1 <= a || !(z * 5 % 6 == 0)) || !(0 == 6 * a * (x + y + (y + z) + (y + z + (6 + z))) + -((x + y + (y + z) + (y + z + (6 + z))) * (6 + (6 + (6 + z)))) + 12 * (x + y + (y + z) + (y + z + (6 + z))))) || !(1 + (1 + n) <= a)) || !(-z / -6 + 1 + 1 <= 1 + (1 + (1 + n)))) || 0 == 2 * (y + z + (6 + z) + (6 + (6 + z))) * (y + z + (6 + z) + (6 + (6 + z))) + -(3 * (x + y + (y + z) + (y + z + (6 + z))) * (6 + (6 + (6 + z)))) + -(18 * (x + y + (y + z) + (y + z + (6 + z)))) + -(10 * (y + z + (6 + z) + (6 + (6 + z)))) + 3 * (6 + (6 + (6 + z))) + -10)) && (((!(z == 6 + 6 * n) || n <= a) || 0 == 2 * y * y + -(3 * x * z) + -(18 * x) + -(10 * y) + 3 * z + -10) || !(0 == 6 * a * x + -(x * z) + 12 * x))) && (((((!(z * 5 % 6 == 0) || !(-z / -6 + 1 + 1 + 1 <= 1 + (1 + (1 + (1 + n))))) || !(1 + (1 + (1 + n)) <= a)) || 0 == 2 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + -(3 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z)))) * (6 + (6 + (6 + (6 + z))))) + -(18 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))))) + -(10 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))))) + 3 * (6 + (6 + (6 + (6 + z)))) + -10) || -z / -6 + 1 + 1 + 1 <= a) || !(0 == 6 * a * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z)))) + -((x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z)))) * (6 + (6 + (6 + (6 + z))))) + 12 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))))))) && ((!(z == 6 + 6 * n) || n <= a) || 0 == 6 * a * x + -(x * z) + 12 * x)) && z * 5 % 6 == 0) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && a < 65536) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535))) && ((((((((((0 == (y + z + (6 + z)) * (6 + 6 * (1 + (1 + n))) + -(18 * (x + y + (y + z))) + -(12 * (y + z + (6 + z))) + 2 * (6 + 6 * (1 + (1 + n))) + -6 || !(6 + 6 * (1 + (1 + n)) == 6 + (6 + z))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) || ((((((((!(z == 6 + 6 * n) || 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && ((((a + 65536 < 65536 && a * -1 + -65536 <= (-a + -1) / 65536 * 65536) && 0 <= a + 65536) && a * -1 + -32768 <= (-a + -1) / 65536 * 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535) && a < 65536))) && (((((!(z * 5 % 6 == 0) || -z / -6 <= a) || !(0 == 6 * a * (x + y) + -((x + y) * (6 + z)) + 12 * (x + y))) || !(-z / -6 <= 1 + n)) || 0 == 2 * (y + z) * (y + z) + -(3 * (x + y) * (6 + z)) + -(18 * (x + y)) + -(10 * (y + z)) + 3 * (6 + z) + -10) || !(n <= a))) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && (((((!(z * 5 % 6 == 0) || !(0 == 6 * a * (x + y + (y + z)) + -((x + y + (y + z)) * (6 + (6 + z))) + 12 * (x + y + (y + z)))) || -z / -6 + 1 <= a) || !(-z / -6 + 1 <= 1 + (1 + n))) || !(1 + n <= a)) || 0 == 2 * (y + z + (6 + z)) * (y + z + (6 + z)) + -(3 * (x + y + (y + z)) * (6 + (6 + z))) + -(18 * (x + y + (y + z))) + -(10 * (y + z + (6 + z))) + 3 * (6 + (6 + z)) + -10)) && z == 6 + 6 * n)) || ((((((((((((((((((n + -1 <= a && 0 == 12 + ((z + -6) * (z + -6) + -(12 * (y + (z + -6) * -1)) + -(6 * (z + -6)))) && (((((-z / -6 + 1 + 1 <= a || !(z * 5 % 6 == 0)) || !(0 == 6 * a * (x + y + (y + z) + (y + z + (6 + z))) + -((x + y + (y + z) + (y + z + (6 + z))) * (6 + (6 + (6 + z)))) + 12 * (x + y + (y + z) + (y + z + (6 + z))))) || !(1 + (1 + n) <= a)) || !(-z / -6 + 1 + 1 <= 1 + (1 + (1 + n)))) || 0 == 2 * (y + z + (6 + z) + (6 + (6 + z))) * (y + z + (6 + z) + (6 + (6 + z))) + -(3 * (x + y + (y + z) + (y + z + (6 + z))) * (6 + (6 + (6 + z)))) + -(18 * (x + y + (y + z) + (y + z + (6 + z)))) + -(10 * (y + z + (6 + z) + (6 + (6 + z)))) + 3 * (6 + (6 + (6 + z))) + -10)) && (((!(z == 6 + 6 * n) || n <= a) || 0 == 2 * y * y + -(3 * x * z) + -(18 * x) + -(10 * y) + 3 * z + -10) || !(0 == 6 * a * x + -(x * z) + 12 * x))) && (((((!(z * 5 % 6 == 0) || !(-z / -6 + 1 + 1 + 1 <= 1 + (1 + (1 + (1 + n))))) || !(1 + (1 + (1 + n)) <= a)) || 0 == 2 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + -(3 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z)))) * (6 + (6 + (6 + (6 + z))))) + -(18 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))))) + -(10 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))))) + 3 * (6 + (6 + (6 + (6 + z)))) + -10) || -z / -6 + 1 + 1 + 1 <= a) || !(0 == 6 * a * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z)))) + -((x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z)))) * (6 + (6 + (6 + (6 + z))))) + 12 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))))))) && (((((!(z * 5 % 6 == 0) || !(-z / -6 + 1 + 1 + 1 + 1 <= 1 + (1 + (1 + (1 + (1 + n)))))) || !(0 == 6 * a * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))))) + -((x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))))) * (6 + (6 + (6 + (6 + (6 + z)))))) + 12 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))))))) || !(1 + (1 + (1 + (1 + n))) <= a)) || 0 == 2 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))) * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))) + -(3 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))))) * (6 + (6 + (6 + (6 + (6 + z)))))) + -(18 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))))) + -(10 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))))) + 3 * (6 + (6 + (6 + (6 + (6 + z))))) + -10) || -z / -6 + 1 + 1 + 1 + 1 <= a)) && ((!(z == 6 + 6 * n) || n <= a) || 0 == 6 * a * x + -(x * z) + 12 * x)) && z * 5 % 6 == 0) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && a < 65536) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535))) && ((((((((((0 == (y + z + (6 + z)) * (6 + 6 * (1 + (1 + n))) + -(18 * (x + y + (y + z))) + -(12 * (y + z + (6 + z))) + 2 * (6 + 6 * (1 + (1 + n))) + -6 || !(6 + 6 * (1 + (1 + n)) == 6 + (6 + z))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) || ((((((((!(z == 6 + 6 * n) || 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && ((((a + 65536 < 65536 && a * -1 + -65536 <= (-a + -1) / 65536 * 65536) && 0 <= a + 65536) && a * -1 + -32768 <= (-a + -1) / 65536 * 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535) && a < 65536))) && (((((!(z * 5 % 6 == 0) || -z / -6 <= a) || !(0 == 6 * a * (x + y) + -((x + y) * (6 + z)) + 12 * (x + y))) || !(-z / -6 <= 1 + n)) || 0 == 2 * (y + z) * (y + z) + -(3 * (x + y) * (6 + z)) + -(18 * (x + y)) + -(10 * (y + z)) + 3 * (6 + z) + -10) || !(n <= a))) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && (((((!(z * 5 % 6 == 0) || !(0 == 6 * a * (x + y + (y + z)) + -((x + y + (y + z)) * (6 + (6 + z))) + 12 * (x + y + (y + z)))) || -z / -6 + 1 <= a) || !(-z / -6 + 1 <= 1 + (1 + n))) || !(1 + n <= a)) || 0 == 2 * (y + z + (6 + z)) * (y + z + (6 + z)) + -(3 * (x + y + (y + z)) * (6 + (6 + z))) + -(18 * (x + y + (y + z))) + -(10 * (y + z + (6 + z))) + 3 * (6 + (6 + z)) + -10)) && z == 6 + 6 * n)) || (((((((((((((((((((n + -1 <= a && 0 == 12 + ((z + -6) * (z + -6) + -(12 * (y + (z + -6) * -1)) + -(6 * (z + -6)))) && (((((-z / -6 + 1 + 1 <= a || !(z * 5 % 6 == 0)) || !(0 == 6 * a * (x + y + (y + z) + (y + z + (6 + z))) + -((x + y + (y + z) + (y + z + (6 + z))) * (6 + (6 + (6 + z)))) + 12 * (x + y + (y + z) + (y + z + (6 + z))))) || !(1 + (1 + n) <= a)) || !(-z / -6 + 1 + 1 <= 1 + (1 + (1 + n)))) || 0 == 2 * (y + z + (6 + z) + (6 + (6 + z))) * (y + z + (6 + z) + (6 + (6 + z))) + -(3 * (x + y + (y + z) + (y + z + (6 + z))) * (6 + (6 + (6 + z)))) + -(18 * (x + y + (y + z) + (y + z + (6 + z)))) + -(10 * (y + z + (6 + z) + (6 + (6 + z)))) + 3 * (6 + (6 + (6 + z))) + -10)) && (((!(z == 6 + 6 * n) || n <= a) || 0 == 2 * y * y + -(3 * x * z) + -(18 * x) + -(10 * y) + 3 * z + -10) || !(0 == 6 * a * x + -(x * z) + 12 * x))) && (((((!(z * 5 % 6 == 0) || !(-z / -6 + 1 + 1 + 1 <= 1 + (1 + (1 + (1 + n))))) || !(1 + (1 + (1 + n)) <= a)) || 0 == 2 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + -(3 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z)))) * (6 + (6 + (6 + (6 + z))))) + -(18 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))))) + -(10 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))))) + 3 * (6 + (6 + (6 + (6 + z)))) + -10) || -z / -6 + 1 + 1 + 1 <= a) || !(0 == 6 * a * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z)))) + -((x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z)))) * (6 + (6 + (6 + (6 + z))))) + 12 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))))))) && (((((!(z * 5 % 6 == 0) || !(-z / -6 + 1 + 1 + 1 + 1 <= 1 + (1 + (1 + (1 + (1 + n)))))) || !(0 == 6 * a * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))))) + -((x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))))) * (6 + (6 + (6 + (6 + (6 + z)))))) + 12 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))))))) || !(1 + (1 + (1 + (1 + n))) <= a)) || 0 == 2 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))) * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))) + -(3 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))))) * (6 + (6 + (6 + (6 + (6 + z)))))) + -(18 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))))) + -(10 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))))) + 3 * (6 + (6 + (6 + (6 + (6 + z))))) + -10) || -z / -6 + 1 + 1 + 1 + 1 <= a)) && ((!(z == 6 + 6 * n) || n <= a) || 0 == 6 * a * x + -(x * z) + 12 * x)) && z * 5 % 6 == 0) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && a < 65536) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535))) && ((((((((((0 == (y + z + (6 + z)) * (6 + 6 * (1 + (1 + n))) + -(18 * (x + y + (y + z))) + -(12 * (y + z + (6 + z))) + 2 * (6 + 6 * (1 + (1 + n))) + -6 || !(6 + 6 * (1 + (1 + n)) == 6 + (6 + z))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) || ((((((((!(z == 6 + 6 * n) || 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))))) && (((((-z / -6 + 1 + 1 + 1 + 1 + 1 <= a || !(1 + (1 + (1 + (1 + (1 + n)))) <= a)) || !(z * 5 % 6 == 0)) || 0 == 2 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z)))))) * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z)))))) + -(3 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))))) * (6 + (6 + (6 + (6 + (6 + (6 + z))))))) + -(18 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))))) + -(10 * (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))) + (6 + (6 + (6 + (6 + (6 + z))))))) + 3 * (6 + (6 + (6 + (6 + (6 + (6 + z)))))) + -10) || !(-z / -6 + 1 + 1 + 1 + 1 + 1 <= 1 + (1 + (1 + (1 + (1 + (1 + n))))))) || !(0 == 6 * a * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))))) + -((x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z)))))) * (6 + (6 + (6 + (6 + (6 + (6 + z))))))) + 12 * (x + y + (y + z) + (y + z + (6 + z)) + (y + z + (6 + z) + (6 + (6 + z))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z)))) + (y + z + (6 + z) + (6 + (6 + z)) + (6 + (6 + (6 + z))) + (6 + (6 + (6 + (6 + z))))))))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && ((((a + 65536 < 65536 && a * -1 + -65536 <= (-a + -1) / 65536 * 65536) && 0 <= a + 65536) && a * -1 + -32768 <= (-a + -1) / 65536 * 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535) && a < 65536))) && (((((!(z * 5 % 6 == 0) || -z / -6 <= a) || !(0 == 6 * a * (x + y) + -((x + y) * (6 + z)) + 12 * (x + y))) || !(-z / -6 <= 1 + n)) || 0 == 2 * (y + z) * (y + z) + -(3 * (x + y) * (6 + z)) + -(18 * (x + y)) + -(10 * (y + z)) + 3 * (6 + z) + -10) || !(n <= a))) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && (((((!(z * 5 % 6 == 0) || !(0 == 6 * a * (x + y + (y + z)) + -((x + y + (y + z)) * (6 + (6 + z))) + 12 * (x + y + (y + z)))) || -z / -6 + 1 <= a) || !(-z / -6 + 1 <= 1 + (1 + n))) || !(1 + n <= a)) || 0 == 2 * (y + z + (6 + z)) * (y + z + (6 + z)) + -(3 * (x + y + (y + z)) * (6 + (6 + z))) + -(18 * (x + y + (y + z))) + -(10 * (y + z + (6 + z))) + 3 * (6 + (6 + z)) + -10)) && z == 6 + 6 * n)) || ((((((((((((((((((((((((1 + (1 + 0) <= a && 0 == 12 + ((z + -6) * (z + -6) + -(12 * (y + (z + -6) * -1)) + -(6 * (z + -6)))) && z == 6 + 18) && x == 1 + (1 + 6) + (y + (z + -6) * -1)) && n == 1 + 2) && x + 19 * -1 == 1 + (19 + (6 + 6) * -1)) && z * 5 % 6 == 0) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && a < 65536) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a <= 50) && ((((a + 65536 < 65536 && a * -1 + -65536 <= (-a + -1) / 65536 * 65536) && 0 <= a + 65536) && a * -1 + -32768 <= (-a + -1) / 65536 * 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535) && a < 65536))) && n <= 1 + 2) && n + -1 <= a) && y + (z + -6) * -1 + -7 == 6 + 6) && 2 <= a) && y == 7 + (18 + -6) + 18) && z + -6 == 6 + (y + (z + -6) * -1 + -7)) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((a % 65536 <= 32767 && 0 <= a) && a < 65536))) && ((((((((((0 == (y + z + (6 + z)) * (6 + 6 * (1 + (1 + n))) + -(18 * (x + y + (y + z))) + -(12 * (y + z + (6 + z))) + 2 * (6 + 6 * (1 + (1 + n))) + -6 || !(6 + 6 * (1 + (1 + n)) == 6 + (6 + z))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) || ((((((((!(z == 6 + 6 * n) || 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && a >= 0) && a <= 50) && x == n * n * n) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && z == 6 + (6 + (6 + 6))) && a >= 0) && 7 * -1 + (x + (7 + (18 + -6)) * -1 + 7 * -1) + 6 == 0) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && z == 6 + 6 * n)) || ((((((((((((((((((((((((((((((((((((y + (y + x * -1 + (y * -1 + x + z + -6)) * -1) * -1 + (y * -1 + x + z + -6) + 6 == 0 && y == 7 + (z + -6)) && z == 6 + (y + -7)) && y == 1 + (12 + -6) + 12) && 0 == 12 + ((z + -6) * (z + -6) + -(12 * (y + (z + -6) * -1)) + -(6 * (z + -6)))) && n == 1 + 1) && 1 <= a) && n + -1 + -1 == 0) && ((!(z == 6 + 6 * n) || n <= a) || 0 == 6 * a * x + -(x * z) + 12 * x)) && z * 5 % 6 == 0) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && a < 65536) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535))) && (n <= a || 0 == 6 * a * x + -(x * z) + 12 * x)) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a <= 50) && ((((a + 65536 < 65536 && a * -1 + -65536 <= (-a + -1) / 65536 * 65536) && 0 <= a + 65536) && a * -1 + -32768 <= (-a + -1) / 65536 * 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535) && a < 65536))) && x == n * n * n) && z == 6 + 12) && x == 1 + (1 + 6)) && n + -1 <= a) && z == 6 + (6 + 6)) && z + -6 == 6 + 6) && n + -1 == 1 + 0) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((a % 65536 <= 32767 && 0 <= a) && a < 65536))) && y + (6 + 6) * -1 == 1 + 6) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && a >= 0) && y + (y + x * -1 + (y * -1 + x + z + -6)) * -1 + (y + (y + x * -1 + (y * -1 + x + z + -6)) * -1 + ((y + (y + x * -1 + (y * -1 + x + z + -6)) * -1) * -1 + (y * -1 + x + z + -6) + 6) + (y * -1 + x + z + -6) * -1) * -1 == 1) && 7 * -1 + (x + 7 * -1) + 6 == 0) && y + -7 == 6 + 6) && (!(z == 6 + 6 * n) || x + y == (1 + n) * (1 + n) * (1 + n))) && (((a >= 0 && a <= 50) && cond == 1) || (cond == 0 && (!(a <= 50) || !(a >= 0))))) && x == 1 + (y + (6 + 6) * -1)) && n == 1 + (1 + 0)) && y + x * -1 + (y * -1 + x + z + -6) == 6 + (y + (y + x * -1 + (y * -1 + x + z + -6)) * -1 + ((y + (y + x * -1 + (y * -1 + x + z + -6)) * -1) * -1 + (y * -1 + x + z + -6) + 6) + (y * -1 + x + z + -6) * -1)) && z == 6 + 6 * n) RESULT: Ultimate proved your program to be correct! [2023-02-18 16:43:23,652 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