./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-restricted-15/NO_04.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 26d01a9c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-restricted-15/NO_04.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 26441cee42562e2fd703b97b1a86d2baa847af9810285d31267fccda11d2ea67 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-18 08:32:38,487 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 08:32:38,489 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 08:32:38,519 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 08:32:38,520 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 08:32:38,522 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 08:32:38,525 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 08:32:38,527 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 08:32:38,528 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 08:32:38,531 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 08:32:38,532 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 08:32:38,534 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 08:32:38,534 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 08:32:38,536 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 08:32:38,536 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 08:32:38,537 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 08:32:38,538 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 08:32:38,539 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 08:32:38,540 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 08:32:38,544 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 08:32:38,544 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 08:32:38,545 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 08:32:38,546 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 08:32:38,547 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 08:32:38,553 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 08:32:38,553 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 08:32:38,553 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 08:32:38,554 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 08:32:38,554 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 08:32:38,555 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 08:32:38,555 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 08:32:38,556 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 08:32:38,557 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 08:32:38,557 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 08:32:38,558 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 08:32:38,558 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 08:32:38,558 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 08:32:38,559 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 08:32:38,559 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 08:32:38,559 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 08:32:38,560 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 08:32:38,561 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2023-02-18 08:32:38,586 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 08:32:38,587 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 08:32:38,587 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 08:32:38,587 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 08:32:38,588 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 08:32:38,588 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 08:32:38,588 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 08:32:38,589 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 08:32:38,589 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 08:32:38,589 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 08:32:38,590 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-18 08:32:38,590 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 08:32:38,590 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 08:32:38,590 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 08:32:38,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 08:32:38,590 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 08:32:38,591 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-18 08:32:38,591 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 08:32:38,591 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 08:32:38,591 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 08:32:38,591 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 08:32:38,591 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 08:32:38,591 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 08:32:38,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 08:32:38,592 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 08:32:38,592 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 08:32:38,592 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 08:32:38,592 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 08:32:38,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 08:32:38,593 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 08:32:38,593 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 08:32:38,593 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 08:32:38,593 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 08:32:38,593 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 08:32:38,594 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 ! overflow) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 26441cee42562e2fd703b97b1a86d2baa847af9810285d31267fccda11d2ea67 [2023-02-18 08:32:38,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 08:32:38,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 08:32:38,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 08:32:38,814 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 08:32:38,815 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 08:32:38,815 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/NO_04.c [2023-02-18 08:32:39,787 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 08:32:39,944 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 08:32:39,944 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/NO_04.c [2023-02-18 08:32:39,950 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6ef0cdfd/bd3ec00adfb449d3b618d69d6c9c53a4/FLAG52e403689 [2023-02-18 08:32:39,966 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6ef0cdfd/bd3ec00adfb449d3b618d69d6c9c53a4 [2023-02-18 08:32:39,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 08:32:39,969 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 08:32:39,971 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 08:32:39,971 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 08:32:39,973 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 08:32:39,974 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 08:32:39" (1/1) ... [2023-02-18 08:32:39,975 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e3c498c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:32:39, skipping insertion in model container [2023-02-18 08:32:39,975 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 08:32:39" (1/1) ... [2023-02-18 08:32:39,979 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 08:32:39,990 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 08:32:40,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 08:32:40,099 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 08:32:40,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 08:32:40,116 INFO L208 MainTranslator]: Completed translation [2023-02-18 08:32:40,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:32:40 WrapperNode [2023-02-18 08:32:40,117 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 08:32:40,117 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 08:32:40,118 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 08:32:40,118 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 08:32:40,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:32:40" (1/1) ... [2023-02-18 08:32:40,125 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:32:40" (1/1) ... [2023-02-18 08:32:40,135 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 73 [2023-02-18 08:32:40,135 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 08:32:40,136 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 08:32:40,136 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 08:32:40,136 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 08:32:40,142 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:32:40" (1/1) ... [2023-02-18 08:32:40,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:32:40" (1/1) ... [2023-02-18 08:32:40,147 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:32:40" (1/1) ... [2023-02-18 08:32:40,148 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:32:40" (1/1) ... [2023-02-18 08:32:40,149 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:32:40" (1/1) ... [2023-02-18 08:32:40,151 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:32:40" (1/1) ... [2023-02-18 08:32:40,152 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:32:40" (1/1) ... [2023-02-18 08:32:40,152 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:32:40" (1/1) ... [2023-02-18 08:32:40,153 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 08:32:40,154 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 08:32:40,154 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 08:32:40,154 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 08:32:40,155 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:32:40" (1/1) ... [2023-02-18 08:32:40,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 08:32:40,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:32:40,201 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 08:32:40,204 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 08:32:40,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 08:32:40,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 08:32:40,316 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 08:32:40,318 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 08:32:40,447 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 08:32:40,452 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 08:32:40,452 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2023-02-18 08:32:40,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 08:32:40 BoogieIcfgContainer [2023-02-18 08:32:40,454 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 08:32:40,455 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 08:32:40,455 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 08:32:40,457 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 08:32:40,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 08:32:39" (1/3) ... [2023-02-18 08:32:40,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44dcf5a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 08:32:40, skipping insertion in model container [2023-02-18 08:32:40,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:32:40" (2/3) ... [2023-02-18 08:32:40,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44dcf5a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 08:32:40, skipping insertion in model container [2023-02-18 08:32:40,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 08:32:40" (3/3) ... [2023-02-18 08:32:40,459 INFO L112 eAbstractionObserver]: Analyzing ICFG NO_04.c [2023-02-18 08:32:40,470 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 08:32:40,470 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2023-02-18 08:32:40,512 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 08:32:40,517 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;@49606e7a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 08:32:40,517 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2023-02-18 08:32:40,520 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 40 states have (on average 2.0) internal successors, (80), 70 states have internal predecessors, (80), 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 08:32:40,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-18 08:32:40,536 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 08:32:40,537 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-18 08:32:40,537 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-02-18 08:32:40,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:32:40,540 INFO L85 PathProgramCache]: Analyzing trace with hash 925796, now seen corresponding path program 1 times [2023-02-18 08:32:40,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:32:40,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651924474] [2023-02-18 08:32:40,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:32:40,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:32:40,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:32:40,646 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 08:32:40,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:32:40,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651924474] [2023-02-18 08:32:40,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651924474] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 08:32:40,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 08:32:40,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 08:32:40,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118611436] [2023-02-18 08:32:40,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 08:32:40,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 08:32:40,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 08:32:40,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 08:32:40,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 08:32:40,671 INFO L87 Difference]: Start difference. First operand has 71 states, 40 states have (on average 2.0) internal successors, (80), 70 states have internal predecessors, (80), 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) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 08:32:40,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 08:32:40,768 INFO L93 Difference]: Finished difference Result 138 states and 158 transitions. [2023-02-18 08:32:40,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 08:32:40,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) Word has length 4 [2023-02-18 08:32:40,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 08:32:40,788 INFO L225 Difference]: With dead ends: 138 [2023-02-18 08:32:40,788 INFO L226 Difference]: Without dead ends: 65 [2023-02-18 08:32:40,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 08:32:40,792 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 69 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 08:32:40,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 30 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 08:32:40,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-02-18 08:32:40,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2023-02-18 08:32:40,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 37 states have (on average 1.864864864864865) internal successors, (69), 64 states have internal predecessors, (69), 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 08:32:40,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2023-02-18 08:32:40,835 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 4 [2023-02-18 08:32:40,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 08:32:40,835 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2023-02-18 08:32:40,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 08:32:40,835 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2023-02-18 08:32:40,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-18 08:32:40,835 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 08:32:40,835 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-18 08:32:40,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-18 08:32:40,836 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-02-18 08:32:40,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:32:40,836 INFO L85 PathProgramCache]: Analyzing trace with hash 28699721, now seen corresponding path program 1 times [2023-02-18 08:32:40,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:32:40,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148890611] [2023-02-18 08:32:40,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:32:40,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:32:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:32:40,850 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 08:32:40,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:32:40,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148890611] [2023-02-18 08:32:40,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148890611] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 08:32:40,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 08:32:40,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 08:32:40,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520190355] [2023-02-18 08:32:40,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 08:32:40,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 08:32:40,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 08:32:40,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 08:32:40,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 08:32:40,852 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 08:32:40,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 08:32:40,927 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2023-02-18 08:32:40,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 08:32:40,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) Word has length 5 [2023-02-18 08:32:40,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 08:32:40,928 INFO L225 Difference]: With dead ends: 128 [2023-02-18 08:32:40,928 INFO L226 Difference]: Without dead ends: 126 [2023-02-18 08:32:40,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 08:32:40,930 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 62 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 08:32:40,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 53 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 08:32:40,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-02-18 08:32:40,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 100. [2023-02-18 08:32:40,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.8611111111111112) internal successors, (134), 99 states have internal predecessors, (134), 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 08:32:40,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 134 transitions. [2023-02-18 08:32:40,937 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 134 transitions. Word has length 5 [2023-02-18 08:32:40,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 08:32:40,938 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 134 transitions. [2023-02-18 08:32:40,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 08:32:40,938 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 134 transitions. [2023-02-18 08:32:40,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-18 08:32:40,938 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 08:32:40,938 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-18 08:32:40,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-18 08:32:40,938 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-02-18 08:32:40,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:32:40,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1810629835, now seen corresponding path program 1 times [2023-02-18 08:32:40,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:32:40,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905625963] [2023-02-18 08:32:40,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:32:40,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:32:40,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:32:40,989 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 08:32:40,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:32:40,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905625963] [2023-02-18 08:32:40,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905625963] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 08:32:40,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 08:32:40,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 08:32:40,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557022036] [2023-02-18 08:32:40,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 08:32:40,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 08:32:40,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 08:32:40,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 08:32:40,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 08:32:40,990 INFO L87 Difference]: Start difference. First operand 100 states and 134 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 08:32:41,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 08:32:41,044 INFO L93 Difference]: Finished difference Result 100 states and 134 transitions. [2023-02-18 08:32:41,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 08:32:41,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) Word has length 7 [2023-02-18 08:32:41,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 08:32:41,045 INFO L225 Difference]: With dead ends: 100 [2023-02-18 08:32:41,045 INFO L226 Difference]: Without dead ends: 96 [2023-02-18 08:32:41,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 08:32:41,046 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 119 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 08:32:41,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 22 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 08:32:41,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-02-18 08:32:41,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2023-02-18 08:32:41,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 72 states have (on average 1.75) internal successors, (126), 95 states have internal predecessors, (126), 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 08:32:41,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 126 transitions. [2023-02-18 08:32:41,051 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 126 transitions. Word has length 7 [2023-02-18 08:32:41,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 08:32:41,052 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 126 transitions. [2023-02-18 08:32:41,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 08:32:41,052 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 126 transitions. [2023-02-18 08:32:41,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-18 08:32:41,052 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 08:32:41,052 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 08:32:41,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-18 08:32:41,052 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-02-18 08:32:41,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:32:41,064 INFO L85 PathProgramCache]: Analyzing trace with hash 294950095, now seen corresponding path program 1 times [2023-02-18 08:32:41,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:32:41,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455345688] [2023-02-18 08:32:41,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:32:41,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:32:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:32:41,090 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 08:32:41,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:32:41,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455345688] [2023-02-18 08:32:41,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455345688] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 08:32:41,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 08:32:41,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 08:32:41,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836409841] [2023-02-18 08:32:41,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 08:32:41,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 08:32:41,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 08:32:41,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 08:32:41,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 08:32:41,094 INFO L87 Difference]: Start difference. First operand 96 states and 126 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 08:32:41,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 08:32:41,224 INFO L93 Difference]: Finished difference Result 171 states and 184 transitions. [2023-02-18 08:32:41,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 08:32:41,224 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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) Word has length 8 [2023-02-18 08:32:41,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 08:32:41,227 INFO L225 Difference]: With dead ends: 171 [2023-02-18 08:32:41,227 INFO L226 Difference]: Without dead ends: 167 [2023-02-18 08:32:41,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 08:32:41,234 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 161 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 08:32:41,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 88 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 08:32:41,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-02-18 08:32:41,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 124. [2023-02-18 08:32:41,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 100 states have (on average 1.74) internal successors, (174), 123 states have internal predecessors, (174), 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 08:32:41,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 174 transitions. [2023-02-18 08:32:41,249 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 174 transitions. Word has length 8 [2023-02-18 08:32:41,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 08:32:41,249 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 174 transitions. [2023-02-18 08:32:41,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 08:32:41,249 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 174 transitions. [2023-02-18 08:32:41,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-18 08:32:41,249 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 08:32:41,249 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 08:32:41,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-18 08:32:41,250 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-02-18 08:32:41,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:32:41,250 INFO L85 PathProgramCache]: Analyzing trace with hash -615273602, now seen corresponding path program 1 times [2023-02-18 08:32:41,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:32:41,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997826662] [2023-02-18 08:32:41,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:32:41,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:32:41,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:32:41,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 08:32:41,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:32:41,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997826662] [2023-02-18 08:32:41,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997826662] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 08:32:41,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 08:32:41,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 08:32:41,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417227974] [2023-02-18 08:32:41,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 08:32:41,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 08:32:41,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 08:32:41,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 08:32:41,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 08:32:41,276 INFO L87 Difference]: Start difference. First operand 124 states and 174 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 08:32:41,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 08:32:41,305 INFO L93 Difference]: Finished difference Result 124 states and 174 transitions. [2023-02-18 08:32:41,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 08:32:41,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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) Word has length 11 [2023-02-18 08:32:41,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 08:32:41,306 INFO L225 Difference]: With dead ends: 124 [2023-02-18 08:32:41,306 INFO L226 Difference]: Without dead ends: 122 [2023-02-18 08:32:41,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 08:32:41,307 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 58 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 08:32:41,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 27 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 08:32:41,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-02-18 08:32:41,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 90. [2023-02-18 08:32:41,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 68 states have (on average 1.6764705882352942) internal successors, (114), 89 states have internal predecessors, (114), 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 08:32:41,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 114 transitions. [2023-02-18 08:32:41,310 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 114 transitions. Word has length 11 [2023-02-18 08:32:41,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 08:32:41,311 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 114 transitions. [2023-02-18 08:32:41,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 08:32:41,311 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 114 transitions. [2023-02-18 08:32:41,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-18 08:32:41,311 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 08:32:41,311 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 08:32:41,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-18 08:32:41,311 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-02-18 08:32:41,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:32:41,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1487654200, now seen corresponding path program 1 times [2023-02-18 08:32:41,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:32:41,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122198843] [2023-02-18 08:32:41,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:32:41,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:32:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:32:41,334 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 08:32:41,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:32:41,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122198843] [2023-02-18 08:32:41,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122198843] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 08:32:41,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 08:32:41,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 08:32:41,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886969263] [2023-02-18 08:32:41,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 08:32:41,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 08:32:41,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 08:32:41,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 08:32:41,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 08:32:41,335 INFO L87 Difference]: Start difference. First operand 90 states and 114 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 08:32:41,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 08:32:41,363 INFO L93 Difference]: Finished difference Result 90 states and 114 transitions. [2023-02-18 08:32:41,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 08:32:41,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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) Word has length 12 [2023-02-18 08:32:41,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 08:32:41,364 INFO L225 Difference]: With dead ends: 90 [2023-02-18 08:32:41,364 INFO L226 Difference]: Without dead ends: 89 [2023-02-18 08:32:41,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 08:32:41,364 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 52 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 08:32:41,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 31 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 08:32:41,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-02-18 08:32:41,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-02-18 08:32:41,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 68 states have (on average 1.661764705882353) internal successors, (113), 88 states have internal predecessors, (113), 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 08:32:41,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 113 transitions. [2023-02-18 08:32:41,368 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 113 transitions. Word has length 12 [2023-02-18 08:32:41,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 08:32:41,368 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 113 transitions. [2023-02-18 08:32:41,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 08:32:41,368 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 113 transitions. [2023-02-18 08:32:41,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-18 08:32:41,368 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 08:32:41,369 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 08:32:41,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-18 08:32:41,369 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-02-18 08:32:41,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:32:41,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1127359914, now seen corresponding path program 1 times [2023-02-18 08:32:41,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:32:41,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25643058] [2023-02-18 08:32:41,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:32:41,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:32:41,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:32:41,401 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 08:32:41,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:32:41,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25643058] [2023-02-18 08:32:41,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25643058] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 08:32:41,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 08:32:41,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 08:32:41,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639321909] [2023-02-18 08:32:41,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 08:32:41,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 08:32:41,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 08:32:41,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 08:32:41,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 08:32:41,403 INFO L87 Difference]: Start difference. First operand 89 states and 113 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 08:32:41,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 08:32:41,470 INFO L93 Difference]: Finished difference Result 145 states and 173 transitions. [2023-02-18 08:32:41,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 08:32:41,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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) Word has length 13 [2023-02-18 08:32:41,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 08:32:41,471 INFO L225 Difference]: With dead ends: 145 [2023-02-18 08:32:41,471 INFO L226 Difference]: Without dead ends: 144 [2023-02-18 08:32:41,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 08:32:41,471 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 50 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 08:32:41,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 52 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 08:32:41,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-02-18 08:32:41,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 119. [2023-02-18 08:32:41,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 98 states have (on average 1.7040816326530612) internal successors, (167), 118 states have internal predecessors, (167), 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 08:32:41,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 167 transitions. [2023-02-18 08:32:41,478 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 167 transitions. Word has length 13 [2023-02-18 08:32:41,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 08:32:41,479 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 167 transitions. [2023-02-18 08:32:41,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 08:32:41,479 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 167 transitions. [2023-02-18 08:32:41,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-18 08:32:41,479 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 08:32:41,492 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 08:32:41,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-18 08:32:41,493 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-02-18 08:32:41,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:32:41,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1304595834, now seen corresponding path program 1 times [2023-02-18 08:32:41,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:32:41,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999657775] [2023-02-18 08:32:41,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:32:41,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:32:41,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:32:41,529 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 08:32:41,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:32:41,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999657775] [2023-02-18 08:32:41,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999657775] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 08:32:41,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 08:32:41,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 08:32:41,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550620320] [2023-02-18 08:32:41,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 08:32:41,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 08:32:41,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 08:32:41,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 08:32:41,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 08:32:41,530 INFO L87 Difference]: Start difference. First operand 119 states and 167 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 08:32:41,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 08:32:41,590 INFO L93 Difference]: Finished difference Result 141 states and 169 transitions. [2023-02-18 08:32:41,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 08:32:41,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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) Word has length 14 [2023-02-18 08:32:41,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 08:32:41,591 INFO L225 Difference]: With dead ends: 141 [2023-02-18 08:32:41,591 INFO L226 Difference]: Without dead ends: 137 [2023-02-18 08:32:41,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 08:32:41,591 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 156 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 08:32:41,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 41 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 08:32:41,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-02-18 08:32:41,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 88. [2023-02-18 08:32:41,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 67 states have (on average 1.671641791044776) internal successors, (112), 87 states have internal predecessors, (112), 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 08:32:41,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 112 transitions. [2023-02-18 08:32:41,595 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 112 transitions. Word has length 14 [2023-02-18 08:32:41,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 08:32:41,595 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 112 transitions. [2023-02-18 08:32:41,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 08:32:41,595 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 112 transitions. [2023-02-18 08:32:41,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-18 08:32:41,595 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 08:32:41,595 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 08:32:41,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-18 08:32:41,596 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-02-18 08:32:41,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:32:41,596 INFO L85 PathProgramCache]: Analyzing trace with hash -588425771, now seen corresponding path program 1 times [2023-02-18 08:32:41,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:32:41,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584407813] [2023-02-18 08:32:41,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:32:41,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:32:41,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:32:41,627 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 08:32:41,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:32:41,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584407813] [2023-02-18 08:32:41,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584407813] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 08:32:41,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 08:32:41,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 08:32:41,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076553463] [2023-02-18 08:32:41,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 08:32:41,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 08:32:41,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 08:32:41,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 08:32:41,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 08:32:41,629 INFO L87 Difference]: Start difference. First operand 88 states and 112 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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 08:32:41,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 08:32:41,688 INFO L93 Difference]: Finished difference Result 110 states and 137 transitions. [2023-02-18 08:32:41,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 08:32:41,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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) Word has length 14 [2023-02-18 08:32:41,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 08:32:41,689 INFO L225 Difference]: With dead ends: 110 [2023-02-18 08:32:41,689 INFO L226 Difference]: Without dead ends: 107 [2023-02-18 08:32:41,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-18 08:32:41,690 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 165 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 08:32:41,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 17 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 08:32:41,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-02-18 08:32:41,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 85. [2023-02-18 08:32:41,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 67 states have (on average 1.5820895522388059) internal successors, (106), 84 states have internal predecessors, (106), 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 08:32:41,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 106 transitions. [2023-02-18 08:32:41,692 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 106 transitions. Word has length 14 [2023-02-18 08:32:41,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 08:32:41,692 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 106 transitions. [2023-02-18 08:32:41,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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 08:32:41,692 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 106 transitions. [2023-02-18 08:32:41,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-18 08:32:41,693 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 08:32:41,693 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 08:32:41,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-18 08:32:41,693 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-02-18 08:32:41,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:32:41,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1061329638, now seen corresponding path program 1 times [2023-02-18 08:32:41,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:32:41,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145283767] [2023-02-18 08:32:41,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:32:41,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:32:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:32:41,715 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 08:32:41,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:32:41,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145283767] [2023-02-18 08:32:41,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145283767] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 08:32:41,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 08:32:41,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 08:32:41,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506607896] [2023-02-18 08:32:41,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 08:32:41,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 08:32:41,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 08:32:41,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 08:32:41,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 08:32:41,716 INFO L87 Difference]: Start difference. First operand 85 states and 106 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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 08:32:41,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 08:32:41,834 INFO L93 Difference]: Finished difference Result 183 states and 212 transitions. [2023-02-18 08:32:41,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 08:32:41,835 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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) Word has length 15 [2023-02-18 08:32:41,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 08:32:41,835 INFO L225 Difference]: With dead ends: 183 [2023-02-18 08:32:41,835 INFO L226 Difference]: Without dead ends: 180 [2023-02-18 08:32:41,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-18 08:32:41,836 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 171 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 08:32:41,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 104 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 08:32:41,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-02-18 08:32:41,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 116. [2023-02-18 08:32:41,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 98 states have (on average 1.5408163265306123) internal successors, (151), 115 states have internal predecessors, (151), 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 08:32:41,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 151 transitions. [2023-02-18 08:32:41,839 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 151 transitions. Word has length 15 [2023-02-18 08:32:41,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 08:32:41,840 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 151 transitions. [2023-02-18 08:32:41,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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 08:32:41,840 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 151 transitions. [2023-02-18 08:32:41,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-18 08:32:41,840 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 08:32:41,840 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 08:32:41,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-18 08:32:41,840 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-02-18 08:32:41,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:32:41,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1465110434, now seen corresponding path program 1 times [2023-02-18 08:32:41,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:32:41,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563297818] [2023-02-18 08:32:41,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:32:41,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:32:41,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:32:41,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 08:32:41,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:32:41,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563297818] [2023-02-18 08:32:41,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563297818] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 08:32:41,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 08:32:41,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 08:32:41,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760061021] [2023-02-18 08:32:41,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 08:32:41,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 08:32:41,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 08:32:41,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 08:32:41,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 08:32:41,860 INFO L87 Difference]: Start difference. First operand 116 states and 151 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 08:32:41,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 08:32:41,923 INFO L93 Difference]: Finished difference Result 281 states and 371 transitions. [2023-02-18 08:32:41,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 08:32:41,924 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) Word has length 16 [2023-02-18 08:32:41,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 08:32:41,925 INFO L225 Difference]: With dead ends: 281 [2023-02-18 08:32:41,925 INFO L226 Difference]: Without dead ends: 198 [2023-02-18 08:32:41,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-18 08:32:41,926 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 220 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 08:32:41,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 31 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 08:32:41,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2023-02-18 08:32:41,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 182. [2023-02-18 08:32:41,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 164 states have (on average 1.5548780487804879) internal successors, (255), 181 states have internal predecessors, (255), 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 08:32:41,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 255 transitions. [2023-02-18 08:32:41,931 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 255 transitions. Word has length 16 [2023-02-18 08:32:41,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 08:32:41,932 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 255 transitions. [2023-02-18 08:32:41,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 08:32:41,932 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 255 transitions. [2023-02-18 08:32:41,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-18 08:32:41,932 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 08:32:41,932 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 08:32:41,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-18 08:32:41,932 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-02-18 08:32:41,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:32:41,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1210824640, now seen corresponding path program 1 times [2023-02-18 08:32:41,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:32:41,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222436728] [2023-02-18 08:32:41,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:32:41,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:32:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:32:41,965 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 08:32:41,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:32:41,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222436728] [2023-02-18 08:32:41,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222436728] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 08:32:41,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 08:32:41,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 08:32:41,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079093556] [2023-02-18 08:32:41,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 08:32:41,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 08:32:41,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 08:32:41,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 08:32:41,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 08:32:41,967 INFO L87 Difference]: Start difference. First operand 182 states and 255 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 08:32:42,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 08:32:42,081 INFO L93 Difference]: Finished difference Result 278 states and 361 transitions. [2023-02-18 08:32:42,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 08:32:42,081 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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) Word has length 20 [2023-02-18 08:32:42,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 08:32:42,082 INFO L225 Difference]: With dead ends: 278 [2023-02-18 08:32:42,082 INFO L226 Difference]: Without dead ends: 277 [2023-02-18 08:32:42,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-18 08:32:42,083 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 189 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 08:32:42,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 117 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 08:32:42,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2023-02-18 08:32:42,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 182. [2023-02-18 08:32:42,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 164 states have (on average 1.548780487804878) internal successors, (254), 181 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 08:32:42,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 254 transitions. [2023-02-18 08:32:42,088 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 254 transitions. Word has length 20 [2023-02-18 08:32:42,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 08:32:42,088 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 254 transitions. [2023-02-18 08:32:42,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 08:32:42,088 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 254 transitions. [2023-02-18 08:32:42,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-18 08:32:42,088 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 08:32:42,089 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 08:32:42,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-18 08:32:42,089 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-02-18 08:32:42,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:32:42,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1859216911, now seen corresponding path program 1 times [2023-02-18 08:32:42,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:32:42,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376390944] [2023-02-18 08:32:42,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:32:42,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:32:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:32:42,107 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 08:32:42,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:32:42,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376390944] [2023-02-18 08:32:42,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376390944] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 08:32:42,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 08:32:42,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 08:32:42,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143585499] [2023-02-18 08:32:42,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 08:32:42,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 08:32:42,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 08:32:42,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 08:32:42,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 08:32:42,108 INFO L87 Difference]: Start difference. First operand 182 states and 254 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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 08:32:42,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 08:32:42,190 INFO L93 Difference]: Finished difference Result 197 states and 256 transitions. [2023-02-18 08:32:42,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 08:32:42,190 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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) Word has length 21 [2023-02-18 08:32:42,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 08:32:42,191 INFO L225 Difference]: With dead ends: 197 [2023-02-18 08:32:42,191 INFO L226 Difference]: Without dead ends: 194 [2023-02-18 08:32:42,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-18 08:32:42,192 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 171 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 08:32:42,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 48 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 08:32:42,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-02-18 08:32:42,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 182. [2023-02-18 08:32:42,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 164 states have (on average 1.5121951219512195) internal successors, (248), 181 states have internal predecessors, (248), 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 08:32:42,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 248 transitions. [2023-02-18 08:32:42,197 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 248 transitions. Word has length 21 [2023-02-18 08:32:42,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 08:32:42,197 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 248 transitions. [2023-02-18 08:32:42,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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 08:32:42,197 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 248 transitions. [2023-02-18 08:32:42,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-18 08:32:42,197 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 08:32:42,197 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 08:32:42,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-18 08:32:42,198 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-02-18 08:32:42,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:32:42,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1773645378, now seen corresponding path program 1 times [2023-02-18 08:32:42,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:32:42,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739194193] [2023-02-18 08:32:42,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:32:42,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:32:42,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:32:42,220 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 08:32:42,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:32:42,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739194193] [2023-02-18 08:32:42,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739194193] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 08:32:42,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 08:32:42,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 08:32:42,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304457324] [2023-02-18 08:32:42,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 08:32:42,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 08:32:42,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 08:32:42,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 08:32:42,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-18 08:32:42,221 INFO L87 Difference]: Start difference. First operand 182 states and 248 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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 08:32:42,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 08:32:42,280 INFO L93 Difference]: Finished difference Result 182 states and 248 transitions. [2023-02-18 08:32:42,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 08:32:42,281 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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) Word has length 23 [2023-02-18 08:32:42,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 08:32:42,281 INFO L225 Difference]: With dead ends: 182 [2023-02-18 08:32:42,281 INFO L226 Difference]: Without dead ends: 180 [2023-02-18 08:32:42,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-18 08:32:42,282 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 153 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 08:32:42,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 13 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 08:32:42,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-02-18 08:32:42,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2023-02-18 08:32:42,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 164 states have (on average 1.4390243902439024) internal successors, (236), 179 states have internal predecessors, (236), 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 08:32:42,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 236 transitions. [2023-02-18 08:32:42,287 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 236 transitions. Word has length 23 [2023-02-18 08:32:42,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 08:32:42,287 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 236 transitions. [2023-02-18 08:32:42,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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 08:32:42,287 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 236 transitions. [2023-02-18 08:32:42,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-18 08:32:42,287 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 08:32:42,287 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 08:32:42,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-18 08:32:42,288 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-02-18 08:32:42,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:32:42,288 INFO L85 PathProgramCache]: Analyzing trace with hash -851568026, now seen corresponding path program 1 times [2023-02-18 08:32:42,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:32:42,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513075860] [2023-02-18 08:32:42,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:32:42,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:32:42,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:32:42,310 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 08:32:42,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:32:42,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513075860] [2023-02-18 08:32:42,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513075860] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 08:32:42,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 08:32:42,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 08:32:42,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262903885] [2023-02-18 08:32:42,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 08:32:42,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 08:32:42,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 08:32:42,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 08:32:42,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-18 08:32:42,311 INFO L87 Difference]: Start difference. First operand 180 states and 236 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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 08:32:42,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 08:32:42,461 INFO L93 Difference]: Finished difference Result 307 states and 385 transitions. [2023-02-18 08:32:42,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 08:32:42,462 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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) Word has length 24 [2023-02-18 08:32:42,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 08:32:42,463 INFO L225 Difference]: With dead ends: 307 [2023-02-18 08:32:42,463 INFO L226 Difference]: Without dead ends: 305 [2023-02-18 08:32:42,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-18 08:32:42,463 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 256 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 08:32:42,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 112 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 08:32:42,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2023-02-18 08:32:42,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 198. [2023-02-18 08:32:42,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 182 states have (on average 1.4065934065934067) internal successors, (256), 197 states have internal predecessors, (256), 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 08:32:42,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 256 transitions. [2023-02-18 08:32:42,469 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 256 transitions. Word has length 24 [2023-02-18 08:32:42,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 08:32:42,469 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 256 transitions. [2023-02-18 08:32:42,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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 08:32:42,470 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 256 transitions. [2023-02-18 08:32:42,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-18 08:32:42,470 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 08:32:42,470 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 08:32:42,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-18 08:32:42,470 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-02-18 08:32:42,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:32:42,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1481873515, now seen corresponding path program 1 times [2023-02-18 08:32:42,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:32:42,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989472680] [2023-02-18 08:32:42,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:32:42,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:32:42,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:32:42,488 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 08:32:42,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:32:42,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989472680] [2023-02-18 08:32:42,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989472680] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 08:32:42,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 08:32:42,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 08:32:42,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280426326] [2023-02-18 08:32:42,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 08:32:42,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 08:32:42,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 08:32:42,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 08:32:42,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 08:32:42,489 INFO L87 Difference]: Start difference. First operand 198 states and 256 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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 08:32:42,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 08:32:42,567 INFO L93 Difference]: Finished difference Result 218 states and 269 transitions. [2023-02-18 08:32:42,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 08:32:42,567 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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) Word has length 26 [2023-02-18 08:32:42,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 08:32:42,568 INFO L225 Difference]: With dead ends: 218 [2023-02-18 08:32:42,568 INFO L226 Difference]: Without dead ends: 217 [2023-02-18 08:32:42,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-18 08:32:42,568 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 171 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 08:32:42,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 52 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 08:32:42,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2023-02-18 08:32:42,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 198. [2023-02-18 08:32:42,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 182 states have (on average 1.401098901098901) internal successors, (255), 197 states have internal predecessors, (255), 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 08:32:42,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 255 transitions. [2023-02-18 08:32:42,574 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 255 transitions. Word has length 26 [2023-02-18 08:32:42,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 08:32:42,574 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 255 transitions. [2023-02-18 08:32:42,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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 08:32:42,574 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 255 transitions. [2023-02-18 08:32:42,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-18 08:32:42,575 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 08:32:42,575 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 08:32:42,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-18 08:32:42,575 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-02-18 08:32:42,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:32:42,575 INFO L85 PathProgramCache]: Analyzing trace with hash 12694545, now seen corresponding path program 1 times [2023-02-18 08:32:42,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:32:42,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042396191] [2023-02-18 08:32:42,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:32:42,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:32:42,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:32:42,607 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 08:32:42,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:32:42,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042396191] [2023-02-18 08:32:42,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042396191] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 08:32:42,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007537859] [2023-02-18 08:32:42,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:32:42,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 08:32:42,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:32:42,610 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 08:32:42,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:32:42,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-18 08:32:42,684 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 08:32:42,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:32:42,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 08:32:42,730 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 08:32:42,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007537859] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 08:32:42,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 08:32:42,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 9 [2023-02-18 08:32:42,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974798643] [2023-02-18 08:32:42,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 08:32:42,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 08:32:42,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 08:32:42,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 08:32:42,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-02-18 08:32:42,732 INFO L87 Difference]: Start difference. First operand 198 states and 255 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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 08:32:42,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 08:32:42,837 INFO L93 Difference]: Finished difference Result 411 states and 520 transitions. [2023-02-18 08:32:42,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 08:32:42,838 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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) Word has length 26 [2023-02-18 08:32:42,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 08:32:42,839 INFO L225 Difference]: With dead ends: 411 [2023-02-18 08:32:42,839 INFO L226 Difference]: Without dead ends: 253 [2023-02-18 08:32:42,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-02-18 08:32:42,839 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 168 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 08:32:42,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 35 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 08:32:42,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2023-02-18 08:32:42,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 231. [2023-02-18 08:32:42,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 215 states have (on average 1.4186046511627908) internal successors, (305), 230 states have internal predecessors, (305), 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 08:32:42,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 305 transitions. [2023-02-18 08:32:42,851 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 305 transitions. Word has length 26 [2023-02-18 08:32:42,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 08:32:42,851 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 305 transitions. [2023-02-18 08:32:42,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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 08:32:42,851 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 305 transitions. [2023-02-18 08:32:42,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-18 08:32:42,851 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 08:32:42,852 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 08:32:42,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-18 08:32:43,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-02-18 08:32:43,056 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-02-18 08:32:43,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:32:43,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1919961747, now seen corresponding path program 1 times [2023-02-18 08:32:43,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:32:43,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652578233] [2023-02-18 08:32:43,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:32:43,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:32:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:32:43,070 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 08:32:43,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:32:43,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652578233] [2023-02-18 08:32:43,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652578233] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 08:32:43,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 08:32:43,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 08:32:43,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199945353] [2023-02-18 08:32:43,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 08:32:43,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 08:32:43,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 08:32:43,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 08:32:43,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 08:32:43,071 INFO L87 Difference]: Start difference. First operand 231 states and 305 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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 08:32:43,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 08:32:43,085 INFO L93 Difference]: Finished difference Result 248 states and 323 transitions. [2023-02-18 08:32:43,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 08:32:43,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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) Word has length 28 [2023-02-18 08:32:43,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 08:32:43,086 INFO L225 Difference]: With dead ends: 248 [2023-02-18 08:32:43,086 INFO L226 Difference]: Without dead ends: 247 [2023-02-18 08:32:43,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 08:32:43,087 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 42 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 08:32:43,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 81 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 08:32:43,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2023-02-18 08:32:43,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 230. [2023-02-18 08:32:43,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 215 states have (on average 1.3767441860465117) internal successors, (296), 229 states have internal predecessors, (296), 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 08:32:43,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 296 transitions. [2023-02-18 08:32:43,094 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 296 transitions. Word has length 28 [2023-02-18 08:32:43,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 08:32:43,094 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 296 transitions. [2023-02-18 08:32:43,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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 08:32:43,094 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 296 transitions. [2023-02-18 08:32:43,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-18 08:32:43,095 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 08:32:43,095 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 08:32:43,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-18 08:32:43,095 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-02-18 08:32:43,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:32:43,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1919961802, now seen corresponding path program 1 times [2023-02-18 08:32:43,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:32:43,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149556052] [2023-02-18 08:32:43,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:32:43,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:32:43,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:32:43,106 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 08:32:43,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:32:43,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149556052] [2023-02-18 08:32:43,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149556052] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 08:32:43,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 08:32:43,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 08:32:43,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949209951] [2023-02-18 08:32:43,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 08:32:43,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 08:32:43,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 08:32:43,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 08:32:43,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 08:32:43,107 INFO L87 Difference]: Start difference. First operand 230 states and 296 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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 08:32:43,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 08:32:43,119 INFO L93 Difference]: Finished difference Result 439 states and 577 transitions. [2023-02-18 08:32:43,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 08:32:43,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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) Word has length 28 [2023-02-18 08:32:43,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 08:32:43,120 INFO L225 Difference]: With dead ends: 439 [2023-02-18 08:32:43,120 INFO L226 Difference]: Without dead ends: 238 [2023-02-18 08:32:43,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 08:32:43,120 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 2 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 08:32:43,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 100 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 08:32:43,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2023-02-18 08:32:43,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 214. [2023-02-18 08:32:43,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 200 states have (on average 1.32) internal successors, (264), 213 states have internal predecessors, (264), 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 08:32:43,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 264 transitions. [2023-02-18 08:32:43,127 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 264 transitions. Word has length 28 [2023-02-18 08:32:43,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 08:32:43,127 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 264 transitions. [2023-02-18 08:32:43,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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 08:32:43,127 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 264 transitions. [2023-02-18 08:32:43,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-18 08:32:43,127 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 08:32:43,127 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 08:32:43,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-02-18 08:32:43,128 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-02-18 08:32:43,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:32:43,128 INFO L85 PathProgramCache]: Analyzing trace with hash -610726161, now seen corresponding path program 1 times [2023-02-18 08:32:43,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:32:43,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124656682] [2023-02-18 08:32:43,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:32:43,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:32:43,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:32:43,155 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 08:32:43,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:32:43,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124656682] [2023-02-18 08:32:43,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124656682] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 08:32:43,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 08:32:43,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 08:32:43,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639280403] [2023-02-18 08:32:43,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 08:32:43,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 08:32:43,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 08:32:43,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 08:32:43,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-18 08:32:43,157 INFO L87 Difference]: Start difference. First operand 214 states and 264 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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 08:32:43,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 08:32:43,381 INFO L93 Difference]: Finished difference Result 353 states and 421 transitions. [2023-02-18 08:32:43,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 08:32:43,382 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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) Word has length 29 [2023-02-18 08:32:43,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 08:32:43,383 INFO L225 Difference]: With dead ends: 353 [2023-02-18 08:32:43,383 INFO L226 Difference]: Without dead ends: 349 [2023-02-18 08:32:43,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-02-18 08:32:43,383 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 308 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 08:32:43,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 112 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 08:32:43,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2023-02-18 08:32:43,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 215. [2023-02-18 08:32:43,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 201 states have (on average 1.3134328358208955) internal successors, (264), 214 states have internal predecessors, (264), 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 08:32:43,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 264 transitions. [2023-02-18 08:32:43,398 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 264 transitions. Word has length 29 [2023-02-18 08:32:43,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 08:32:43,398 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 264 transitions. [2023-02-18 08:32:43,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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 08:32:43,398 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 264 transitions. [2023-02-18 08:32:43,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-18 08:32:43,399 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 08:32:43,399 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 08:32:43,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-02-18 08:32:43,399 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-02-18 08:32:43,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:32:43,399 INFO L85 PathProgramCache]: Analyzing trace with hash 2146655505, now seen corresponding path program 1 times [2023-02-18 08:32:43,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:32:43,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555329770] [2023-02-18 08:32:43,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:32:43,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:32:43,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:32:43,439 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 08:32:43,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:32:43,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555329770] [2023-02-18 08:32:43,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555329770] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 08:32:43,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 08:32:43,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 08:32:43,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219563281] [2023-02-18 08:32:43,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 08:32:43,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 08:32:43,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 08:32:43,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 08:32:43,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-18 08:32:43,440 INFO L87 Difference]: Start difference. First operand 215 states and 264 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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 08:32:43,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 08:32:43,544 INFO L93 Difference]: Finished difference Result 267 states and 318 transitions. [2023-02-18 08:32:43,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 08:32:43,544 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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) Word has length 30 [2023-02-18 08:32:43,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 08:32:43,545 INFO L225 Difference]: With dead ends: 267 [2023-02-18 08:32:43,545 INFO L226 Difference]: Without dead ends: 265 [2023-02-18 08:32:43,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-18 08:32:43,545 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 222 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 08:32:43,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 46 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 08:32:43,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2023-02-18 08:32:43,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 224. [2023-02-18 08:32:43,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 210 states have (on average 1.2952380952380953) internal successors, (272), 223 states have internal predecessors, (272), 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 08:32:43,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 272 transitions. [2023-02-18 08:32:43,553 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 272 transitions. Word has length 30 [2023-02-18 08:32:43,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 08:32:43,553 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 272 transitions. [2023-02-18 08:32:43,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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 08:32:43,553 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 272 transitions. [2023-02-18 08:32:43,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-18 08:32:43,553 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 08:32:43,553 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 08:32:43,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-02-18 08:32:43,554 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-02-18 08:32:43,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:32:43,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1437187876, now seen corresponding path program 1 times [2023-02-18 08:32:43,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:32:43,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298971422] [2023-02-18 08:32:43,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:32:43,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:32:43,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:32:43,583 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 08:32:43,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:32:43,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298971422] [2023-02-18 08:32:43,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298971422] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 08:32:43,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 08:32:43,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 08:32:43,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186843195] [2023-02-18 08:32:43,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 08:32:43,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 08:32:43,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 08:32:43,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 08:32:43,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-18 08:32:43,585 INFO L87 Difference]: Start difference. First operand 224 states and 272 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 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 08:32:43,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 08:32:43,753 INFO L93 Difference]: Finished difference Result 291 states and 341 transitions. [2023-02-18 08:32:43,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 08:32:43,754 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 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) Word has length 35 [2023-02-18 08:32:43,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 08:32:43,755 INFO L225 Difference]: With dead ends: 291 [2023-02-18 08:32:43,755 INFO L226 Difference]: Without dead ends: 287 [2023-02-18 08:32:43,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2023-02-18 08:32:43,756 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 294 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 08:32:43,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 47 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 08:32:43,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2023-02-18 08:32:43,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 154. [2023-02-18 08:32:43,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 140 states have (on average 1.3357142857142856) internal successors, (187), 153 states have internal predecessors, (187), 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 08:32:43,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 187 transitions. [2023-02-18 08:32:43,761 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 187 transitions. Word has length 35 [2023-02-18 08:32:43,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 08:32:43,762 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 187 transitions. [2023-02-18 08:32:43,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 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 08:32:43,762 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 187 transitions. [2023-02-18 08:32:43,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-18 08:32:43,762 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 08:32:43,762 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 08:32:43,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-02-18 08:32:43,762 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-02-18 08:32:43,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:32:43,762 INFO L85 PathProgramCache]: Analyzing trace with hash -2029769291, now seen corresponding path program 1 times [2023-02-18 08:32:43,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:32:43,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513749883] [2023-02-18 08:32:43,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:32:43,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:32:43,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:32:43,808 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 08:32:43,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:32:43,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513749883] [2023-02-18 08:32:43,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513749883] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 08:32:43,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 08:32:43,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-18 08:32:43,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245845144] [2023-02-18 08:32:43,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 08:32:43,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 08:32:43,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 08:32:43,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 08:32:43,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-18 08:32:43,809 INFO L87 Difference]: Start difference. First operand 154 states and 187 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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 08:32:43,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 08:32:43,875 INFO L93 Difference]: Finished difference Result 184 states and 218 transitions. [2023-02-18 08:32:43,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 08:32:43,875 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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) Word has length 36 [2023-02-18 08:32:43,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 08:32:43,875 INFO L225 Difference]: With dead ends: 184 [2023-02-18 08:32:43,875 INFO L226 Difference]: Without dead ends: 0 [2023-02-18 08:32:43,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-02-18 08:32:43,876 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 55 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 08:32:43,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 7 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 08:32:43,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-18 08:32:43,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-18 08:32:43,877 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 08:32:43,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-18 08:32:43,877 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2023-02-18 08:32:43,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 08:32:43,877 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-18 08:32:43,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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 08:32:43,877 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-18 08:32:43,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-18 08:32:43,879 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 30 remaining) [2023-02-18 08:32:43,879 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 30 remaining) [2023-02-18 08:32:43,879 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 30 remaining) [2023-02-18 08:32:43,879 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 30 remaining) [2023-02-18 08:32:43,879 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 30 remaining) [2023-02-18 08:32:43,879 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 30 remaining) [2023-02-18 08:32:43,880 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 30 remaining) [2023-02-18 08:32:43,880 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 30 remaining) [2023-02-18 08:32:43,880 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 30 remaining) [2023-02-18 08:32:43,880 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 30 remaining) [2023-02-18 08:32:43,880 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 30 remaining) [2023-02-18 08:32:43,880 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 30 remaining) [2023-02-18 08:32:43,880 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 30 remaining) [2023-02-18 08:32:43,880 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 30 remaining) [2023-02-18 08:32:43,880 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 30 remaining) [2023-02-18 08:32:43,893 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 30 remaining) [2023-02-18 08:32:43,893 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 30 remaining) [2023-02-18 08:32:43,893 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 30 remaining) [2023-02-18 08:32:43,893 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 30 remaining) [2023-02-18 08:32:43,893 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 30 remaining) [2023-02-18 08:32:43,893 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 30 remaining) [2023-02-18 08:32:43,893 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 30 remaining) [2023-02-18 08:32:43,893 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 30 remaining) [2023-02-18 08:32:43,893 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 30 remaining) [2023-02-18 08:32:43,893 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 30 remaining) [2023-02-18 08:32:43,893 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 30 remaining) [2023-02-18 08:32:43,893 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 30 remaining) [2023-02-18 08:32:43,894 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 30 remaining) [2023-02-18 08:32:43,894 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 30 remaining) [2023-02-18 08:32:43,894 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 30 remaining) [2023-02-18 08:32:43,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-02-18 08:32:43,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-18 08:32:43,902 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 19) no Hoare annotation was computed. [2023-02-18 08:32:43,902 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-02-18 08:32:43,903 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2023-02-18 08:32:43,903 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-02-18 08:32:43,903 INFO L899 garLoopResultBuilder]: For program point L19-2(line 19) no Hoare annotation was computed. [2023-02-18 08:32:43,903 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-02-18 08:32:43,903 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2023-02-18 08:32:43,903 INFO L895 garLoopResultBuilder]: At program point main_returnLabel#1(lines 5 38) the Hoare annotation is: (<= 0 |ULTIMATE.start_main_~i~0#1|) [2023-02-18 08:32:43,903 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 21) no Hoare annotation was computed. [2023-02-18 08:32:43,903 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 16) no Hoare annotation was computed. [2023-02-18 08:32:43,904 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-18 08:32:43,904 INFO L899 garLoopResultBuilder]: For program point L28(line 28) no Hoare annotation was computed. [2023-02-18 08:32:43,904 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2023-02-18 08:32:43,904 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2023-02-18 08:32:43,904 INFO L895 garLoopResultBuilder]: At program point L20-2(lines 20 31) the Hoare annotation is: (let ((.cse21 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)) (.cse7 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1|))) (let ((.cse0 (<= 0 .cse7)) (.cse1 (<= 0 .cse21)) (.cse2 (<= 0 |ULTIMATE.start_main_~i~0#1|))) (and .cse0 .cse1 .cse2 (let ((.cse14 (<= .cse21 0)) (.cse3 (<= .cse21 99)) (.cse9 (<= |ULTIMATE.start_main_~i~0#1| 0)) (.cse5 (<= |ULTIMATE.start_main_~i~0#1| 99))) (let ((.cse8 (>= |ULTIMATE.start_main_~i~0#1| 0)) (.cse10 (<= 0 (+ (- 3) |ULTIMATE.start_main_~k~0#1|))) (.cse11 (<= |ULTIMATE.start_main_~k~0#1| 102)) (.cse12 (<= (+ .cse21 3) |ULTIMATE.start_main_~k~0#1|)) (.cse13 (>= |ULTIMATE.start_main_~j~0#1| 0)) (.cse6 (<= .cse7 201)) (.cse15 (let ((.cse18 (let ((.cse19 (<= 0 |ULTIMATE.start_main_~j~0#1|)) (.cse20 (<= |ULTIMATE.start_main_~j~0#1| 0))) (or (and .cse3 .cse1 .cse9 .cse19 .cse5 .cse14 .cse2 .cse20) (and .cse3 .cse19 .cse5 .cse20 (or (and .cse1 .cse5 .cse2) (and .cse1 .cse9 .cse5 .cse2))))))) (or (and .cse1 .cse2 .cse18) (and .cse0 .cse1 .cse2 .cse18))))) (let ((.cse4 (let ((.cse16 (and .cse3 .cse0 .cse8 .cse1 .cse10 .cse11 .cse12 .cse13 .cse5 .cse2 .cse6 .cse15 (<= 0 |ULTIMATE.start_main_~l~0#1|))) (.cse17 (and .cse3 .cse0 .cse8 .cse1 .cse10 .cse11 .cse12 .cse13 .cse5 .cse2 .cse6 .cse15))) (or .cse16 (and (<= |ULTIMATE.start_main_~m~0#1| 1003) (or .cse16 .cse17)) .cse17)))) (or (and .cse3 .cse4 .cse5 .cse6) (and .cse3 .cse0 (<= .cse7 3) .cse8 .cse1 .cse9 .cse10 .cse11 .cse12 .cse13 .cse5 .cse14 .cse2 (<= |ULTIMATE.start_main_~k~0#1| 3) .cse6 .cse15) (and .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_main_~m~0#1| 1201))))))))) [2023-02-18 08:32:43,907 INFO L899 garLoopResultBuilder]: For program point L20-3(lines 20 31) no Hoare annotation was computed. [2023-02-18 08:32:43,908 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 21) no Hoare annotation was computed. [2023-02-18 08:32:43,908 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 16) no Hoare annotation was computed. [2023-02-18 08:32:43,908 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2023-02-18 08:32:43,908 INFO L899 garLoopResultBuilder]: For program point L21(line 21) no Hoare annotation was computed. [2023-02-18 08:32:43,908 INFO L899 garLoopResultBuilder]: For program point L21-1(line 21) no Hoare annotation was computed. [2023-02-18 08:32:43,908 INFO L899 garLoopResultBuilder]: For program point L21-2(line 21) no Hoare annotation was computed. [2023-02-18 08:32:43,908 INFO L899 garLoopResultBuilder]: For program point L21-3(line 21) no Hoare annotation was computed. [2023-02-18 08:32:43,908 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2023-02-18 08:32:43,908 INFO L899 garLoopResultBuilder]: For program point L21-4(line 21) no Hoare annotation was computed. [2023-02-18 08:32:43,909 INFO L899 garLoopResultBuilder]: For program point L21-5(line 21) no Hoare annotation was computed. [2023-02-18 08:32:43,909 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 21) no Hoare annotation was computed. [2023-02-18 08:32:43,909 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-18 08:32:43,909 INFO L899 garLoopResultBuilder]: For program point L30(line 30) no Hoare annotation was computed. [2023-02-18 08:32:43,909 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2023-02-18 08:32:43,909 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW(line 32) no Hoare annotation was computed. [2023-02-18 08:32:43,909 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 21) no Hoare annotation was computed. [2023-02-18 08:32:43,909 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2023-02-18 08:32:43,910 INFO L895 garLoopResultBuilder]: At program point L23-2(lines 23 29) the Hoare annotation is: (let ((.cse24 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)) (.cse13 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~l~0#1|)) (.cse10 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1|))) (let ((.cse0 (<= 0 .cse10)) (.cse3 (<= 0 .cse13)) (.cse1 (<= 0 .cse24)) (.cse2 (<= 0 |ULTIMATE.start_main_~i~0#1|))) (and .cse0 .cse1 .cse2 .cse3 (let ((.cse18 (<= .cse24 0)) (.cse4 (<= .cse24 99)) (.cse12 (<= |ULTIMATE.start_main_~i~0#1| 0)) (.cse6 (<= |ULTIMATE.start_main_~i~0#1| 99))) (let ((.cse9 (<= 3 (+ |ULTIMATE.start_main_~b~0#1| (- 4)))) (.cse11 (>= |ULTIMATE.start_main_~i~0#1| 0)) (.cse14 (<= 0 (+ (- 3) |ULTIMATE.start_main_~k~0#1|))) (.cse15 (<= |ULTIMATE.start_main_~k~0#1| 102)) (.cse16 (<= (+ .cse24 3) |ULTIMATE.start_main_~k~0#1|)) (.cse17 (>= |ULTIMATE.start_main_~j~0#1| 0)) (.cse19 (let ((.cse22 (<= 0 |ULTIMATE.start_main_~j~0#1|)) (.cse23 (<= |ULTIMATE.start_main_~j~0#1| 0))) (or (and .cse4 .cse1 .cse12 .cse22 .cse6 .cse18 .cse2 .cse23) (and .cse4 .cse22 .cse6 .cse23 (or (and .cse1 .cse6 .cse2) (and .cse1 .cse12 .cse6 .cse2)))))) (.cse20 (<= |ULTIMATE.start_main_~l~0#1| 0)) (.cse7 (<= .cse10 201)) (.cse21 (<= 0 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse5 (<= .cse13 201)) (.cse8 (or (and .cse9 .cse4 .cse0 .cse11 .cse1 .cse14 .cse15 .cse16 .cse17 .cse6 .cse2 .cse19 .cse3 .cse20 .cse7 .cse21) (and .cse9 .cse4 .cse0 .cse11 .cse1 .cse14 .cse15 .cse16 .cse17 .cse6 (<= |ULTIMATE.start_main_~m~0#1| 1003) .cse2 .cse19 .cse3 .cse20 .cse7 .cse21)))) (or (and .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse4 .cse0 (<= .cse10 3) .cse11 .cse1 .cse12 (<= .cse13 3) .cse14 .cse15 .cse16 .cse5 .cse17 .cse6 .cse18 .cse2 (<= |ULTIMATE.start_main_~k~0#1| 3) .cse19 .cse3 .cse20 .cse7 .cse21) (and .cse4 .cse5 .cse6 .cse7 (<= |ULTIMATE.start_main_~m~0#1| 1201) .cse8)))))))) [2023-02-18 08:32:43,910 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW(line 32) no Hoare annotation was computed. [2023-02-18 08:32:43,910 INFO L899 garLoopResultBuilder]: For program point L23-3(lines 23 29) no Hoare annotation was computed. [2023-02-18 08:32:43,910 INFO L895 garLoopResultBuilder]: At program point L15-2(lines 15 35) the Hoare annotation is: (let ((.cse2 (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))) (.cse0 (<= 0 |ULTIMATE.start_main_~i~0#1|))) (let ((.cse1 (let ((.cse7 (<= |ULTIMATE.start_main_~i~0#1| 0)) (.cse9 (<= |ULTIMATE.start_main_~i~0#1| 99))) (let ((.cse8 (let ((.cse13 (let ((.cse14 (<= 0 |ULTIMATE.start_main_~j~0#1|))) (or (and .cse2 .cse14 .cse0) (and .cse7 .cse9 .cse0) (and .cse2 .cse14 .cse0 (<= |ULTIMATE.start_main_~j~0#1| 0)))))) (or (and .cse2 .cse13 .cse0) (and .cse13 .cse0) (and (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1|)) .cse2 .cse13 .cse0))))) (let ((.cse6 (>= |ULTIMATE.start_main_~i~0#1| 0)) (.cse10 (let ((.cse12 (or (and .cse2 .cse8 .cse0 (<= |ULTIMATE.start_main_~k~0#1| 3)) (and .cse2 .cse8 .cse0)))) (or (and .cse2 .cse12 .cse0) (and .cse2 .cse12 (<= |ULTIMATE.start_main_~k~0#1| 102) .cse0)))) (.cse11 (>= |ULTIMATE.start_main_~j~0#1| 0))) (let ((.cse3 (and .cse6 .cse10 .cse11 (<= 0 |ULTIMATE.start_main_~l~0#1|))) (.cse5 (and .cse6 .cse10 .cse11))) (let ((.cse4 (and (or .cse3 .cse5) (<= |ULTIMATE.start_main_~m~0#1| 1003)))) (or (and (or .cse3 .cse4 .cse5) (<= |ULTIMATE.start_main_~m~0#1| 1201)) .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse0))))))))) (or (and .cse0 .cse1) (and .cse2 .cse0 .cse1)))) [2023-02-18 08:32:43,910 INFO L899 garLoopResultBuilder]: For program point L15-3(lines 15 35) no Hoare annotation was computed. [2023-02-18 08:32:43,910 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 21) no Hoare annotation was computed. [2023-02-18 08:32:43,910 INFO L899 garLoopResultBuilder]: For program point L32(line 32) no Hoare annotation was computed. [2023-02-18 08:32:43,911 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-18 08:32:43,911 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 19) no Hoare annotation was computed. [2023-02-18 08:32:43,911 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW(line 34) no Hoare annotation was computed. [2023-02-18 08:32:43,911 INFO L899 garLoopResultBuilder]: For program point L24(line 24) no Hoare annotation was computed. [2023-02-18 08:32:43,911 INFO L899 garLoopResultBuilder]: For program point L24-1(line 24) no Hoare annotation was computed. [2023-02-18 08:32:43,911 INFO L899 garLoopResultBuilder]: For program point L24-2(line 24) no Hoare annotation was computed. [2023-02-18 08:32:43,911 INFO L899 garLoopResultBuilder]: For program point L24-3(line 24) no Hoare annotation was computed. [2023-02-18 08:32:43,912 INFO L899 garLoopResultBuilder]: For program point L24-4(line 24) no Hoare annotation was computed. [2023-02-18 08:32:43,912 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2023-02-18 08:32:43,912 INFO L899 garLoopResultBuilder]: For program point L24-5(line 24) no Hoare annotation was computed. [2023-02-18 08:32:43,912 INFO L899 garLoopResultBuilder]: For program point L24-6(line 24) no Hoare annotation was computed. [2023-02-18 08:32:43,912 INFO L899 garLoopResultBuilder]: For program point L24-7(line 24) no Hoare annotation was computed. [2023-02-18 08:32:43,912 INFO L899 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2023-02-18 08:32:43,912 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2023-02-18 08:32:43,913 INFO L899 garLoopResultBuilder]: For program point L16-1(line 16) no Hoare annotation was computed. [2023-02-18 08:32:43,913 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-18 08:32:43,913 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 19) no Hoare annotation was computed. [2023-02-18 08:32:43,913 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW(line 34) no Hoare annotation was computed. [2023-02-18 08:32:43,914 INFO L895 garLoopResultBuilder]: At program point L25-2(lines 25 27) the Hoare annotation is: (let ((.cse41 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))) (let ((.cse1 (<= 0 .cse41)) (.cse19 (<= |ULTIMATE.start_main_~i~0#1| 0)) (.cse12 (<= |ULTIMATE.start_main_~i~0#1| 99)) (.cse2 (<= 0 |ULTIMATE.start_main_~i~0#1|)) (.cse45 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1|))) (let ((.cse0 (<= 0 .cse45)) (.cse22 (<= .cse41 0)) (.cse5 (<= .cse41 99)) (.cse43 (<= 0 |ULTIMATE.start_main_~j~0#1|)) (.cse44 (or (and .cse1 .cse12 .cse2) (and .cse1 .cse19 .cse12 .cse2))) (.cse35 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~l~0#1|))) (let ((.cse20 (<= .cse35 3)) (.cse18 (<= .cse45 3)) (.cse40 (<= |ULTIMATE.start_main_~k~0#1| 3)) (.cse13 (let ((.cse46 (<= |ULTIMATE.start_main_~j~0#1| 0))) (or (and .cse5 .cse1 .cse19 .cse43 .cse12 .cse22 .cse2 .cse46) (and .cse5 .cse43 .cse12 .cse46 .cse44)))) (.cse15 (<= .cse45 201)) (.cse3 (<= 0 .cse35)) (.cse7 (<= 0 (+ (- 3) |ULTIMATE.start_main_~k~0#1|))) (.cse39 (or (and .cse0 .cse1 .cse43 .cse12 .cse2 .cse44) (and .cse0 .cse1 .cse19 .cse43 .cse12 .cse2 .cse44)))) (let ((.cse37 (let ((.cse42 (or (and .cse1 .cse19 .cse7 .cse2 .cse39) (and .cse1 .cse7 .cse2 .cse39)))) (or (and .cse0 .cse1 .cse42 .cse12 .cse2 .cse3) (and .cse0 .cse1 .cse19 .cse42 .cse12 .cse2 .cse3)))) (.cse23 (or (and .cse5 .cse0 .cse18 .cse1 .cse19 .cse20 .cse7 .cse12 .cse22 .cse2 .cse40 .cse13 .cse3 .cse15) (and .cse5 .cse0 .cse18 .cse1 .cse19 .cse7 .cse12 .cse22 .cse2 .cse40 .cse13 .cse3 .cse15))) (.cse4 (<= 3 (+ |ULTIMATE.start_main_~b~0#1| (- 4)))) (.cse14 (<= |ULTIMATE.start_main_~l~0#1| 0)) (.cse9 (<= (+ .cse41 3) |ULTIMATE.start_main_~k~0#1|)) (.cse6 (>= |ULTIMATE.start_main_~i~0#1| 0)) (.cse36 (<= 0 |ULTIMATE.start_main_~m~0#1|)) (.cse8 (<= |ULTIMATE.start_main_~k~0#1| 102)) (.cse11 (>= |ULTIMATE.start_main_~j~0#1| 0)) (.cse17 (<= 0 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse26 (and .cse5 .cse6 .cse36 .cse8 .cse11 .cse12 (or (and .cse5 .cse0 .cse18 .cse1 .cse19 .cse20 .cse12 .cse22 .cse2 .cse40 .cse13 .cse3 .cse15) (and .cse5 .cse0 .cse18 .cse1 .cse19 .cse12 .cse22 .cse2 .cse40 .cse13 .cse3 .cse15)) .cse17)) (.cse27 (and .cse5 .cse0 .cse6 .cse1 .cse36 .cse7 .cse8 .cse9 .cse11 .cse12 .cse2 .cse13 .cse3 .cse15 .cse17)) (.cse28 (and .cse4 .cse5 .cse0 .cse6 .cse1 .cse36 .cse7 .cse8 .cse9 .cse11 .cse12 .cse2 .cse13 .cse3 .cse14 .cse15 .cse17)) (.cse29 (and .cse6 .cse36 (let ((.cse38 (or (and .cse1 .cse19 .cse2 .cse39) (and .cse1 .cse2 .cse39)))) (or (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse38) (and .cse0 .cse1 .cse19 .cse12 .cse2 .cse3 .cse38))) .cse11 .cse12 .cse17)) (.cse30 (and .cse5 .cse6 .cse36 .cse8 .cse9 .cse11 .cse12 .cse23 .cse17)) (.cse31 (and .cse6 .cse36 .cse9 .cse11 .cse12 .cse37 .cse17)) (.cse32 (and .cse4 .cse6 .cse36 .cse9 .cse11 .cse12 .cse37 .cse14 .cse17)) (.cse33 (and .cse5 .cse0 .cse6 .cse1 .cse36 .cse8 .cse11 .cse12 .cse2 .cse13 .cse3 .cse15 .cse17)) (.cse34 (and .cse4 .cse5 .cse6 .cse36 .cse8 .cse9 .cse11 .cse12 .cse23 .cse14 .cse17))) (let ((.cse21 (<= |ULTIMATE.start_main_~m~0#1| 1003)) (.cse16 (<= |ULTIMATE.start_main_~m~0#1| 1201)) (.cse10 (<= .cse35 201)) (.cse24 (or .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 0 (+ |ULTIMATE.start_main_~m~0#1| (- 1000))) (or (and .cse4 .cse5 .cse0 .cse6 .cse1 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse2 .cse13 .cse3 .cse14 .cse15 .cse16 .cse17) (and .cse4 .cse5 .cse18 .cse6 .cse19 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse22 .cse23 .cse14 .cse15 .cse16 .cse17))) (and .cse18 .cse19 .cse20 .cse21 .cse22 .cse24) (and .cse5 .cse10 .cse12 .cse15 .cse16 (let ((.cse25 (or .cse26 (and .cse19 .cse24) .cse27 .cse28 .cse29 .cse30 (and .cse18 .cse19 .cse22 .cse24) .cse31 .cse32 .cse33 .cse34))) (or (and .cse5 .cse25 .cse12 .cse15) (and .cse5 .cse25 .cse10 .cse12 .cse15) (and .cse25 .cse12)))))))))))) [2023-02-18 08:32:43,914 INFO L899 garLoopResultBuilder]: For program point L25-3(lines 25 27) no Hoare annotation was computed. [2023-02-18 08:32:43,914 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2023-02-18 08:32:43,914 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2023-02-18 08:32:43,915 INFO L899 garLoopResultBuilder]: For program point L34(line 34) no Hoare annotation was computed. [2023-02-18 08:32:43,915 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2023-02-18 08:32:43,915 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 19) no Hoare annotation was computed. [2023-02-18 08:32:43,915 INFO L899 garLoopResultBuilder]: For program point L26(line 26) no Hoare annotation was computed. [2023-02-18 08:32:43,916 INFO L899 garLoopResultBuilder]: For program point L26-1(line 26) no Hoare annotation was computed. [2023-02-18 08:32:43,916 INFO L895 garLoopResultBuilder]: At program point L18-2(lines 18 33) the Hoare annotation is: (let ((.cse16 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))) (let ((.cse0 (<= 0 .cse16)) (.cse8 (<= 0 |ULTIMATE.start_main_~i~0#1|))) (and .cse0 (let ((.cse7 (<= .cse16 0)) (.cse1 (<= .cse16 99)) (.cse5 (<= |ULTIMATE.start_main_~i~0#1| 0)) (.cse2 (<= |ULTIMATE.start_main_~i~0#1| 99))) (let ((.cse4 (>= |ULTIMATE.start_main_~i~0#1| 0)) (.cse6 (>= |ULTIMATE.start_main_~j~0#1| 0)) (.cse9 (let ((.cse14 (<= 0 |ULTIMATE.start_main_~j~0#1|)) (.cse15 (<= |ULTIMATE.start_main_~j~0#1| 0))) (or (and .cse1 .cse0 .cse5 .cse14 .cse2 .cse7 .cse8 .cse15) (and .cse1 .cse14 .cse2 .cse15 (or (and .cse0 .cse2 .cse8) (and .cse0 .cse5 .cse2 .cse8))))))) (let ((.cse3 (let ((.cse12 (let ((.cse13 (or (and .cse0 .cse8 (<= |ULTIMATE.start_main_~k~0#1| 3) .cse9) (and .cse0 .cse8 .cse9)))) (or (and .cse1 .cse0 .cse2 .cse8 .cse13) (and .cse1 .cse0 (<= |ULTIMATE.start_main_~k~0#1| 102) .cse2 .cse8 .cse13))))) (let ((.cse10 (and .cse4 .cse12 .cse6 (<= 0 |ULTIMATE.start_main_~l~0#1|))) (.cse11 (and .cse4 .cse12 .cse6))) (or .cse10 .cse11 (and (or .cse10 .cse11) (<= |ULTIMATE.start_main_~m~0#1| 1003))))))) (or (and .cse1 .cse2 .cse3) (and .cse1 .cse4 .cse0 .cse5 .cse6 .cse2 .cse7 .cse8 .cse9) (and .cse1 .cse2 (<= |ULTIMATE.start_main_~m~0#1| 1201) .cse3))))) .cse8))) [2023-02-18 08:32:43,916 INFO L899 garLoopResultBuilder]: For program point L18-3(lines 18 33) no Hoare annotation was computed. [2023-02-18 08:32:43,916 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2023-02-18 08:32:43,916 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 21) no Hoare annotation was computed. [2023-02-18 08:32:43,918 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 08:32:43,920 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 08:32:44,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 08:32:44 BoogieIcfgContainer [2023-02-18 08:32:44,047 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 08:32:44,048 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 08:32:44,048 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 08:32:44,048 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 08:32:44,049 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 08:32:40" (3/4) ... [2023-02-18 08:32:44,051 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-18 08:32:44,061 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-18 08:32:44,062 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-02-18 08:32:44,062 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-18 08:32:44,133 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 08:32:44,133 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 08:32:44,137 INFO L158 Benchmark]: Toolchain (without parser) took 4164.43ms. Allocated memory was 167.8MB in the beginning and 216.0MB in the end (delta: 48.2MB). Free memory was 124.5MB in the beginning and 162.7MB in the end (delta: -38.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-18 08:32:44,137 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 111.1MB. Free memory was 86.7MB in the beginning and 86.7MB in the end (delta: 72.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 08:32:44,137 INFO L158 Benchmark]: CACSL2BoogieTranslator took 145.75ms. Allocated memory is still 167.8MB. Free memory was 124.1MB in the beginning and 114.8MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-18 08:32:44,137 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.15ms. Allocated memory is still 167.8MB. Free memory was 114.8MB in the beginning and 113.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 08:32:44,137 INFO L158 Benchmark]: Boogie Preprocessor took 17.39ms. Allocated memory is still 167.8MB. Free memory was 113.2MB in the beginning and 112.3MB in the end (delta: 814.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 08:32:44,138 INFO L158 Benchmark]: RCFGBuilder took 299.93ms. Allocated memory is still 167.8MB. Free memory was 111.9MB in the beginning and 100.6MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 08:32:44,138 INFO L158 Benchmark]: TraceAbstraction took 3592.38ms. Allocated memory was 167.8MB in the beginning and 216.0MB in the end (delta: 48.2MB). Free memory was 99.9MB in the beginning and 171.0MB in the end (delta: -71.1MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. [2023-02-18 08:32:44,139 INFO L158 Benchmark]: Witness Printer took 85.38ms. Allocated memory is still 216.0MB. Free memory was 171.0MB in the beginning and 162.7MB in the end (delta: 8.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-02-18 08:32:44,144 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.10ms. Allocated memory is still 111.1MB. Free memory was 86.7MB in the beginning and 86.7MB in the end (delta: 72.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 145.75ms. Allocated memory is still 167.8MB. Free memory was 124.1MB in the beginning and 114.8MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.15ms. Allocated memory is still 167.8MB. Free memory was 114.8MB in the beginning and 113.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.39ms. Allocated memory is still 167.8MB. Free memory was 113.2MB in the beginning and 112.3MB in the end (delta: 814.4kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 299.93ms. Allocated memory is still 167.8MB. Free memory was 111.9MB in the beginning and 100.6MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3592.38ms. Allocated memory was 167.8MB in the beginning and 216.0MB in the end (delta: 48.2MB). Free memory was 99.9MB in the beginning and 171.0MB in the end (delta: -71.1MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. * Witness Printer took 85.38ms. Allocated memory is still 216.0MB. Free memory was 171.0MB in the beginning and 162.7MB in the end (delta: 8.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 71 locations, 30 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3314 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3314 mSDsluCounter, 1266 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 763 mSDsCounter, 83 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3087 IncrementalHoareTripleChecker+Invalid, 3170 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 83 mSolverCounterUnsat, 503 mSDtfsCounter, 3087 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 164 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=231occurred in iteration=17, InterpolantAutomatonStates: 119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 881 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 15 NumberOfFragments, 47048 HoareAnnotationTreeSize, 6 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 471 NumberOfCodeBlocks, 471 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 447 ConstructedInterpolants, 0 QuantifiedInterpolants, 1711 SizeOfPredicates, 5 NumberOfNonLiveVariables, 43 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 24 InterpolantComputations, 23 PerfectInterpolantSequences, 38/41 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 30 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ((((((0 <= i + j + k && 0 <= i + j) && 0 <= i) && 0 <= i + j + k + l) && 0 <= m + -1000) && ((((((((((((((((((3 <= b + -4 && i + j <= 99) && 0 <= i + j + k) && i >= 0) && 0 <= i + j) && 0 <= -3 + k) && k <= 102) && i + j + 3 <= k) && i + j + k + l <= 201) && j >= 0) && i <= 99) && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && l <= 0) && i + j + k <= 201) && m <= 1201) && 0 <= l) || (((((((((((((((((3 <= b + -4 && i + j <= 99) && i + j + k <= 3) && i >= 0) && i <= 0) && i + j + k + l <= 3) && k <= 102) && i + j + 3 <= k) && i + j + k + l <= 201) && j >= 0) && i <= 99) && m <= 1003) && i + j <= 0) && ((((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && i + j + k + l <= 3) && 0 <= -3 + k) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) || ((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && 0 <= -3 + k) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201))) && l <= 0) && i + j + k <= 201) && m <= 1201) && 0 <= l))) || (((((i + j + k <= 3 && i <= 0) && i + j + k + l <= 3) && m <= 1003) && i + j <= 0) && (((((((((((((((i + j <= 99 && i >= 0) && 0 <= m) && k <= 102) && j >= 0) && i <= 99) && (((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && i + j + k + l <= 3) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) || (((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201))) && 0 <= l) || ((((((((((((((i + j <= 99 && 0 <= i + j + k) && i >= 0) && 0 <= i + j) && 0 <= m) && 0 <= -3 + k) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) && 0 <= l)) || ((((((((((((((((3 <= b + -4 && i + j <= 99) && 0 <= i + j + k) && i >= 0) && 0 <= i + j) && 0 <= m) && 0 <= -3 + k) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && l <= 0) && i + j + k <= 201) && 0 <= l)) || (((((i >= 0 && 0 <= m) && ((((((0 <= i + j + k && 0 <= i + j) && i <= 99) && 0 <= i) && 0 <= i + j + k + l) && ((((0 <= i + j && i <= 0) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || ((0 <= i + j && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && i <= 99) && 0 <= i) && 0 <= i + j + k + l) && ((((0 <= i + j && i <= 0) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || ((0 <= i + j && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))))) && j >= 0) && i <= 99) && 0 <= l)) || ((((((((i + j <= 99 && i >= 0) && 0 <= m) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && ((((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && i + j + k + l <= 3) && 0 <= -3 + k) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) || ((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && 0 <= -3 + k) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201))) && 0 <= l)) || ((((((i >= 0 && 0 <= m) && i + j + 3 <= k) && j >= 0) && i <= 99) && ((((((0 <= i + j + k && 0 <= i + j) && (((((0 <= i + j && i <= 0) && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) && i <= 99) && 0 <= i) && 0 <= i + j + k + l) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && (((((0 <= i + j && i <= 0) && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) && i <= 99) && 0 <= i) && 0 <= i + j + k + l))) && 0 <= l)) || ((((((((3 <= b + -4 && i >= 0) && 0 <= m) && i + j + 3 <= k) && j >= 0) && i <= 99) && ((((((0 <= i + j + k && 0 <= i + j) && (((((0 <= i + j && i <= 0) && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) && i <= 99) && 0 <= i) && 0 <= i + j + k + l) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && (((((0 <= i + j && i <= 0) && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) && i <= 99) && 0 <= i) && 0 <= i + j + k + l))) && l <= 0) && 0 <= l)) || ((((((((((((i + j <= 99 && 0 <= i + j + k) && i >= 0) && 0 <= i + j) && 0 <= m) && k <= 102) && j >= 0) && i <= 99) && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) && 0 <= l)) || ((((((((((3 <= b + -4 && i + j <= 99) && i >= 0) && 0 <= m) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && ((((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && i + j + k + l <= 3) && 0 <= -3 + k) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) || ((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && 0 <= -3 + k) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201))) && l <= 0) && 0 <= l)))) || (((((i + j <= 99 && i + j + k + l <= 201) && i <= 99) && i + j + k <= 201) && m <= 1201) && (((((i + j <= 99 && (((((((((((((((((i + j <= 99 && i >= 0) && 0 <= m) && k <= 102) && j >= 0) && i <= 99) && (((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && i + j + k + l <= 3) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) || (((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201))) && 0 <= l) || (i <= 0 && (((((((((((((((i + j <= 99 && i >= 0) && 0 <= m) && k <= 102) && j >= 0) && i <= 99) && (((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && i + j + k + l <= 3) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) || (((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201))) && 0 <= l) || ((((((((((((((i + j <= 99 && 0 <= i + j + k) && i >= 0) && 0 <= i + j) && 0 <= m) && 0 <= -3 + k) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) && 0 <= l)) || ((((((((((((((((3 <= b + -4 && i + j <= 99) && 0 <= i + j + k) && i >= 0) && 0 <= i + j) && 0 <= m) && 0 <= -3 + k) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && l <= 0) && i + j + k <= 201) && 0 <= l)) || (((((i >= 0 && 0 <= m) && ((((((0 <= i + j + k && 0 <= i + j) && i <= 99) && 0 <= i) && 0 <= i + j + k + l) && ((((0 <= i + j && i <= 0) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || ((0 <= i + j && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && i <= 99) && 0 <= i) && 0 <= i + j + k + l) && ((((0 <= i + j && i <= 0) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || ((0 <= i + j && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))))) && j >= 0) && i <= 99) && 0 <= l)) || ((((((((i + j <= 99 && i >= 0) && 0 <= m) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && ((((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && i + j + k + l <= 3) && 0 <= -3 + k) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) || ((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && 0 <= -3 + k) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201))) && 0 <= l)) || ((((((i >= 0 && 0 <= m) && i + j + 3 <= k) && j >= 0) && i <= 99) && ((((((0 <= i + j + k && 0 <= i + j) && (((((0 <= i + j && i <= 0) && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) && i <= 99) && 0 <= i) && 0 <= i + j + k + l) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && (((((0 <= i + j && i <= 0) && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) && i <= 99) && 0 <= i) && 0 <= i + j + k + l))) && 0 <= l)) || ((((((((3 <= b + -4 && i >= 0) && 0 <= m) && i + j + 3 <= k) && j >= 0) && i <= 99) && ((((((0 <= i + j + k && 0 <= i + j) && (((((0 <= i + j && i <= 0) && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) && i <= 99) && 0 <= i) && 0 <= i + j + k + l) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && (((((0 <= i + j && i <= 0) && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) && i <= 99) && 0 <= i) && 0 <= i + j + k + l))) && l <= 0) && 0 <= l)) || ((((((((((((i + j <= 99 && 0 <= i + j + k) && i >= 0) && 0 <= i + j) && 0 <= m) && k <= 102) && j >= 0) && i <= 99) && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) && 0 <= l)) || ((((((((((3 <= b + -4 && i + j <= 99) && i >= 0) && 0 <= m) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && ((((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && i + j + k + l <= 3) && 0 <= -3 + k) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) || ((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && 0 <= -3 + k) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201))) && l <= 0) && 0 <= l)))) || ((((((((((((((i + j <= 99 && 0 <= i + j + k) && i >= 0) && 0 <= i + j) && 0 <= m) && 0 <= -3 + k) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) && 0 <= l)) || ((((((((((((((((3 <= b + -4 && i + j <= 99) && 0 <= i + j + k) && i >= 0) && 0 <= i + j) && 0 <= m) && 0 <= -3 + k) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && l <= 0) && i + j + k <= 201) && 0 <= l)) || (((((i >= 0 && 0 <= m) && ((((((0 <= i + j + k && 0 <= i + j) && i <= 99) && 0 <= i) && 0 <= i + j + k + l) && ((((0 <= i + j && i <= 0) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || ((0 <= i + j && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && i <= 99) && 0 <= i) && 0 <= i + j + k + l) && ((((0 <= i + j && i <= 0) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || ((0 <= i + j && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))))) && j >= 0) && i <= 99) && 0 <= l)) || ((((((((i + j <= 99 && i >= 0) && 0 <= m) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && ((((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && i + j + k + l <= 3) && 0 <= -3 + k) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) || ((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && 0 <= -3 + k) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201))) && 0 <= l)) || (((i + j + k <= 3 && i <= 0) && i + j <= 0) && (((((((((((((((i + j <= 99 && i >= 0) && 0 <= m) && k <= 102) && j >= 0) && i <= 99) && (((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && i + j + k + l <= 3) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) || (((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201))) && 0 <= l) || ((((((((((((((i + j <= 99 && 0 <= i + j + k) && i >= 0) && 0 <= i + j) && 0 <= m) && 0 <= -3 + k) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) && 0 <= l)) || ((((((((((((((((3 <= b + -4 && i + j <= 99) && 0 <= i + j + k) && i >= 0) && 0 <= i + j) && 0 <= m) && 0 <= -3 + k) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && l <= 0) && i + j + k <= 201) && 0 <= l)) || (((((i >= 0 && 0 <= m) && ((((((0 <= i + j + k && 0 <= i + j) && i <= 99) && 0 <= i) && 0 <= i + j + k + l) && ((((0 <= i + j && i <= 0) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || ((0 <= i + j && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && i <= 99) && 0 <= i) && 0 <= i + j + k + l) && ((((0 <= i + j && i <= 0) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || ((0 <= i + j && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))))) && j >= 0) && i <= 99) && 0 <= l)) || ((((((((i + j <= 99 && i >= 0) && 0 <= m) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && ((((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && i + j + k + l <= 3) && 0 <= -3 + k) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) || ((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && 0 <= -3 + k) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201))) && 0 <= l)) || ((((((i >= 0 && 0 <= m) && i + j + 3 <= k) && j >= 0) && i <= 99) && ((((((0 <= i + j + k && 0 <= i + j) && (((((0 <= i + j && i <= 0) && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) && i <= 99) && 0 <= i) && 0 <= i + j + k + l) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && (((((0 <= i + j && i <= 0) && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) && i <= 99) && 0 <= i) && 0 <= i + j + k + l))) && 0 <= l)) || ((((((((3 <= b + -4 && i >= 0) && 0 <= m) && i + j + 3 <= k) && j >= 0) && i <= 99) && ((((((0 <= i + j + k && 0 <= i + j) && (((((0 <= i + j && i <= 0) && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) && i <= 99) && 0 <= i) && 0 <= i + j + k + l) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && (((((0 <= i + j && i <= 0) && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) && i <= 99) && 0 <= i) && 0 <= i + j + k + l))) && l <= 0) && 0 <= l)) || ((((((((((((i + j <= 99 && 0 <= i + j + k) && i >= 0) && 0 <= i + j) && 0 <= m) && k <= 102) && j >= 0) && i <= 99) && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) && 0 <= l)) || ((((((((((3 <= b + -4 && i + j <= 99) && i >= 0) && 0 <= m) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && ((((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && i + j + k + l <= 3) && 0 <= -3 + k) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) || ((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && 0 <= -3 + k) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201))) && l <= 0) && 0 <= l)))) || ((((((i >= 0 && 0 <= m) && i + j + 3 <= k) && j >= 0) && i <= 99) && ((((((0 <= i + j + k && 0 <= i + j) && (((((0 <= i + j && i <= 0) && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) && i <= 99) && 0 <= i) && 0 <= i + j + k + l) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && (((((0 <= i + j && i <= 0) && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) && i <= 99) && 0 <= i) && 0 <= i + j + k + l))) && 0 <= l)) || ((((((((3 <= b + -4 && i >= 0) && 0 <= m) && i + j + 3 <= k) && j >= 0) && i <= 99) && ((((((0 <= i + j + k && 0 <= i + j) && (((((0 <= i + j && i <= 0) && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) && i <= 99) && 0 <= i) && 0 <= i + j + k + l) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && (((((0 <= i + j && i <= 0) && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) && i <= 99) && 0 <= i) && 0 <= i + j + k + l))) && l <= 0) && 0 <= l)) || ((((((((((((i + j <= 99 && 0 <= i + j + k) && i >= 0) && 0 <= i + j) && 0 <= m) && k <= 102) && j >= 0) && i <= 99) && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) && 0 <= l)) || ((((((((((3 <= b + -4 && i + j <= 99) && i >= 0) && 0 <= m) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && ((((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && i + j + k + l <= 3) && 0 <= -3 + k) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) || ((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && 0 <= -3 + k) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201))) && l <= 0) && 0 <= l))) && i <= 99) && i + j + k <= 201) || ((((i + j <= 99 && (((((((((((((((((i + j <= 99 && i >= 0) && 0 <= m) && k <= 102) && j >= 0) && i <= 99) && (((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && i + j + k + l <= 3) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) || (((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201))) && 0 <= l) || (i <= 0 && (((((((((((((((i + j <= 99 && i >= 0) && 0 <= m) && k <= 102) && j >= 0) && i <= 99) && (((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && i + j + k + l <= 3) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) || (((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201))) && 0 <= l) || ((((((((((((((i + j <= 99 && 0 <= i + j + k) && i >= 0) && 0 <= i + j) && 0 <= m) && 0 <= -3 + k) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) && 0 <= l)) || ((((((((((((((((3 <= b + -4 && i + j <= 99) && 0 <= i + j + k) && i >= 0) && 0 <= i + j) && 0 <= m) && 0 <= -3 + k) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && l <= 0) && i + j + k <= 201) && 0 <= l)) || (((((i >= 0 && 0 <= m) && ((((((0 <= i + j + k && 0 <= i + j) && i <= 99) && 0 <= i) && 0 <= i + j + k + l) && ((((0 <= i + j && i <= 0) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || ((0 <= i + j && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && i <= 99) && 0 <= i) && 0 <= i + j + k + l) && ((((0 <= i + j && i <= 0) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || ((0 <= i + j && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))))) && j >= 0) && i <= 99) && 0 <= l)) || ((((((((i + j <= 99 && i >= 0) && 0 <= m) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && ((((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && i + j + k + l <= 3) && 0 <= -3 + k) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) || ((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && 0 <= -3 + k) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201))) && 0 <= l)) || ((((((i >= 0 && 0 <= m) && i + j + 3 <= k) && j >= 0) && i <= 99) && ((((((0 <= i + j + k && 0 <= i + j) && (((((0 <= i + j && i <= 0) && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) && i <= 99) && 0 <= i) && 0 <= i + j + k + l) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && (((((0 <= i + j && i <= 0) && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) && i <= 99) && 0 <= i) && 0 <= i + j + k + l))) && 0 <= l)) || ((((((((3 <= b + -4 && i >= 0) && 0 <= m) && i + j + 3 <= k) && j >= 0) && i <= 99) && ((((((0 <= i + j + k && 0 <= i + j) && (((((0 <= i + j && i <= 0) && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) && i <= 99) && 0 <= i) && 0 <= i + j + k + l) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && (((((0 <= i + j && i <= 0) && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) && i <= 99) && 0 <= i) && 0 <= i + j + k + l))) && l <= 0) && 0 <= l)) || ((((((((((((i + j <= 99 && 0 <= i + j + k) && i >= 0) && 0 <= i + j) && 0 <= m) && k <= 102) && j >= 0) && i <= 99) && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) && 0 <= l)) || ((((((((((3 <= b + -4 && i + j <= 99) && i >= 0) && 0 <= m) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && ((((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && i + j + k + l <= 3) && 0 <= -3 + k) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) || ((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && 0 <= -3 + k) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201))) && l <= 0) && 0 <= l)))) || ((((((((((((((i + j <= 99 && 0 <= i + j + k) && i >= 0) && 0 <= i + j) && 0 <= m) && 0 <= -3 + k) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) && 0 <= l)) || ((((((((((((((((3 <= b + -4 && i + j <= 99) && 0 <= i + j + k) && i >= 0) && 0 <= i + j) && 0 <= m) && 0 <= -3 + k) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && l <= 0) && i + j + k <= 201) && 0 <= l)) || (((((i >= 0 && 0 <= m) && ((((((0 <= i + j + k && 0 <= i + j) && i <= 99) && 0 <= i) && 0 <= i + j + k + l) && ((((0 <= i + j && i <= 0) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || ((0 <= i + j && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && i <= 99) && 0 <= i) && 0 <= i + j + k + l) && ((((0 <= i + j && i <= 0) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || ((0 <= i + j && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))))) && j >= 0) && i <= 99) && 0 <= l)) || ((((((((i + j <= 99 && i >= 0) && 0 <= m) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && ((((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && i + j + k + l <= 3) && 0 <= -3 + k) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) || ((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && 0 <= -3 + k) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201))) && 0 <= l)) || (((i + j + k <= 3 && i <= 0) && i + j <= 0) && (((((((((((((((i + j <= 99 && i >= 0) && 0 <= m) && k <= 102) && j >= 0) && i <= 99) && (((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && i + j + k + l <= 3) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) || (((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201))) && 0 <= l) || ((((((((((((((i + j <= 99 && 0 <= i + j + k) && i >= 0) && 0 <= i + j) && 0 <= m) && 0 <= -3 + k) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) && 0 <= l)) || ((((((((((((((((3 <= b + -4 && i + j <= 99) && 0 <= i + j + k) && i >= 0) && 0 <= i + j) && 0 <= m) && 0 <= -3 + k) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && l <= 0) && i + j + k <= 201) && 0 <= l)) || (((((i >= 0 && 0 <= m) && ((((((0 <= i + j + k && 0 <= i + j) && i <= 99) && 0 <= i) && 0 <= i + j + k + l) && ((((0 <= i + j && i <= 0) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || ((0 <= i + j && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && i <= 99) && 0 <= i) && 0 <= i + j + k + l) && ((((0 <= i + j && i <= 0) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || ((0 <= i + j && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))))) && j >= 0) && i <= 99) && 0 <= l)) || ((((((((i + j <= 99 && i >= 0) && 0 <= m) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && ((((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && i + j + k + l <= 3) && 0 <= -3 + k) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) || ((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && 0 <= -3 + k) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201))) && 0 <= l)) || ((((((i >= 0 && 0 <= m) && i + j + 3 <= k) && j >= 0) && i <= 99) && ((((((0 <= i + j + k && 0 <= i + j) && (((((0 <= i + j && i <= 0) && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) && i <= 99) && 0 <= i) && 0 <= i + j + k + l) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && (((((0 <= i + j && i <= 0) && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) && i <= 99) && 0 <= i) && 0 <= i + j + k + l))) && 0 <= l)) || ((((((((3 <= b + -4 && i >= 0) && 0 <= m) && i + j + 3 <= k) && j >= 0) && i <= 99) && ((((((0 <= i + j + k && 0 <= i + j) && (((((0 <= i + j && i <= 0) && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) && i <= 99) && 0 <= i) && 0 <= i + j + k + l) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && (((((0 <= i + j && i <= 0) && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) && i <= 99) && 0 <= i) && 0 <= i + j + k + l))) && l <= 0) && 0 <= l)) || ((((((((((((i + j <= 99 && 0 <= i + j + k) && i >= 0) && 0 <= i + j) && 0 <= m) && k <= 102) && j >= 0) && i <= 99) && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) && 0 <= l)) || ((((((((((3 <= b + -4 && i + j <= 99) && i >= 0) && 0 <= m) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && ((((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && i + j + k + l <= 3) && 0 <= -3 + k) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) || ((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && 0 <= -3 + k) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201))) && l <= 0) && 0 <= l)))) || ((((((i >= 0 && 0 <= m) && i + j + 3 <= k) && j >= 0) && i <= 99) && ((((((0 <= i + j + k && 0 <= i + j) && (((((0 <= i + j && i <= 0) && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) && i <= 99) && 0 <= i) && 0 <= i + j + k + l) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && (((((0 <= i + j && i <= 0) && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) && i <= 99) && 0 <= i) && 0 <= i + j + k + l))) && 0 <= l)) || ((((((((3 <= b + -4 && i >= 0) && 0 <= m) && i + j + 3 <= k) && j >= 0) && i <= 99) && ((((((0 <= i + j + k && 0 <= i + j) && (((((0 <= i + j && i <= 0) && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) && i <= 99) && 0 <= i) && 0 <= i + j + k + l) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && (((((0 <= i + j && i <= 0) && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) && i <= 99) && 0 <= i) && 0 <= i + j + k + l))) && l <= 0) && 0 <= l)) || ((((((((((((i + j <= 99 && 0 <= i + j + k) && i >= 0) && 0 <= i + j) && 0 <= m) && k <= 102) && j >= 0) && i <= 99) && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) && 0 <= l)) || ((((((((((3 <= b + -4 && i + j <= 99) && i >= 0) && 0 <= m) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && ((((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && i + j + k + l <= 3) && 0 <= -3 + k) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) || ((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && 0 <= -3 + k) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201))) && l <= 0) && 0 <= l))) && i + j + k + l <= 201) && i <= 99) && i + j + k <= 201)) || ((((((((((((((((((i + j <= 99 && i >= 0) && 0 <= m) && k <= 102) && j >= 0) && i <= 99) && (((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && i + j + k + l <= 3) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) || (((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201))) && 0 <= l) || (i <= 0 && (((((((((((((((i + j <= 99 && i >= 0) && 0 <= m) && k <= 102) && j >= 0) && i <= 99) && (((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && i + j + k + l <= 3) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) || (((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201))) && 0 <= l) || ((((((((((((((i + j <= 99 && 0 <= i + j + k) && i >= 0) && 0 <= i + j) && 0 <= m) && 0 <= -3 + k) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) && 0 <= l)) || ((((((((((((((((3 <= b + -4 && i + j <= 99) && 0 <= i + j + k) && i >= 0) && 0 <= i + j) && 0 <= m) && 0 <= -3 + k) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && l <= 0) && i + j + k <= 201) && 0 <= l)) || (((((i >= 0 && 0 <= m) && ((((((0 <= i + j + k && 0 <= i + j) && i <= 99) && 0 <= i) && 0 <= i + j + k + l) && ((((0 <= i + j && i <= 0) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || ((0 <= i + j && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && i <= 99) && 0 <= i) && 0 <= i + j + k + l) && ((((0 <= i + j && i <= 0) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || ((0 <= i + j && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))))) && j >= 0) && i <= 99) && 0 <= l)) || ((((((((i + j <= 99 && i >= 0) && 0 <= m) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && ((((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && i + j + k + l <= 3) && 0 <= -3 + k) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) || ((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && 0 <= -3 + k) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201))) && 0 <= l)) || ((((((i >= 0 && 0 <= m) && i + j + 3 <= k) && j >= 0) && i <= 99) && ((((((0 <= i + j + k && 0 <= i + j) && (((((0 <= i + j && i <= 0) && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) && i <= 99) && 0 <= i) && 0 <= i + j + k + l) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && (((((0 <= i + j && i <= 0) && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) && i <= 99) && 0 <= i) && 0 <= i + j + k + l))) && 0 <= l)) || ((((((((3 <= b + -4 && i >= 0) && 0 <= m) && i + j + 3 <= k) && j >= 0) && i <= 99) && ((((((0 <= i + j + k && 0 <= i + j) && (((((0 <= i + j && i <= 0) && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) && i <= 99) && 0 <= i) && 0 <= i + j + k + l) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && (((((0 <= i + j && i <= 0) && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) && i <= 99) && 0 <= i) && 0 <= i + j + k + l))) && l <= 0) && 0 <= l)) || ((((((((((((i + j <= 99 && 0 <= i + j + k) && i >= 0) && 0 <= i + j) && 0 <= m) && k <= 102) && j >= 0) && i <= 99) && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) && 0 <= l)) || ((((((((((3 <= b + -4 && i + j <= 99) && i >= 0) && 0 <= m) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && ((((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && i + j + k + l <= 3) && 0 <= -3 + k) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) || ((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && 0 <= -3 + k) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201))) && l <= 0) && 0 <= l)))) || ((((((((((((((i + j <= 99 && 0 <= i + j + k) && i >= 0) && 0 <= i + j) && 0 <= m) && 0 <= -3 + k) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) && 0 <= l)) || ((((((((((((((((3 <= b + -4 && i + j <= 99) && 0 <= i + j + k) && i >= 0) && 0 <= i + j) && 0 <= m) && 0 <= -3 + k) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && l <= 0) && i + j + k <= 201) && 0 <= l)) || (((((i >= 0 && 0 <= m) && ((((((0 <= i + j + k && 0 <= i + j) && i <= 99) && 0 <= i) && 0 <= i + j + k + l) && ((((0 <= i + j && i <= 0) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || ((0 <= i + j && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && i <= 99) && 0 <= i) && 0 <= i + j + k + l) && ((((0 <= i + j && i <= 0) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || ((0 <= i + j && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))))) && j >= 0) && i <= 99) && 0 <= l)) || ((((((((i + j <= 99 && i >= 0) && 0 <= m) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && ((((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && i + j + k + l <= 3) && 0 <= -3 + k) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) || ((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && 0 <= -3 + k) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201))) && 0 <= l)) || (((i + j + k <= 3 && i <= 0) && i + j <= 0) && (((((((((((((((i + j <= 99 && i >= 0) && 0 <= m) && k <= 102) && j >= 0) && i <= 99) && (((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && i + j + k + l <= 3) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) || (((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201))) && 0 <= l) || ((((((((((((((i + j <= 99 && 0 <= i + j + k) && i >= 0) && 0 <= i + j) && 0 <= m) && 0 <= -3 + k) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) && 0 <= l)) || ((((((((((((((((3 <= b + -4 && i + j <= 99) && 0 <= i + j + k) && i >= 0) && 0 <= i + j) && 0 <= m) && 0 <= -3 + k) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && l <= 0) && i + j + k <= 201) && 0 <= l)) || (((((i >= 0 && 0 <= m) && ((((((0 <= i + j + k && 0 <= i + j) && i <= 99) && 0 <= i) && 0 <= i + j + k + l) && ((((0 <= i + j && i <= 0) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || ((0 <= i + j && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && i <= 99) && 0 <= i) && 0 <= i + j + k + l) && ((((0 <= i + j && i <= 0) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || ((0 <= i + j && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))))) && j >= 0) && i <= 99) && 0 <= l)) || ((((((((i + j <= 99 && i >= 0) && 0 <= m) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && ((((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && i + j + k + l <= 3) && 0 <= -3 + k) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) || ((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && 0 <= -3 + k) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201))) && 0 <= l)) || ((((((i >= 0 && 0 <= m) && i + j + 3 <= k) && j >= 0) && i <= 99) && ((((((0 <= i + j + k && 0 <= i + j) && (((((0 <= i + j && i <= 0) && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) && i <= 99) && 0 <= i) && 0 <= i + j + k + l) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && (((((0 <= i + j && i <= 0) && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) && i <= 99) && 0 <= i) && 0 <= i + j + k + l))) && 0 <= l)) || ((((((((3 <= b + -4 && i >= 0) && 0 <= m) && i + j + 3 <= k) && j >= 0) && i <= 99) && ((((((0 <= i + j + k && 0 <= i + j) && (((((0 <= i + j && i <= 0) && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) && i <= 99) && 0 <= i) && 0 <= i + j + k + l) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && (((((0 <= i + j && i <= 0) && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) && i <= 99) && 0 <= i) && 0 <= i + j + k + l))) && l <= 0) && 0 <= l)) || ((((((((((((i + j <= 99 && 0 <= i + j + k) && i >= 0) && 0 <= i + j) && 0 <= m) && k <= 102) && j >= 0) && i <= 99) && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) && 0 <= l)) || ((((((((((3 <= b + -4 && i + j <= 99) && i >= 0) && 0 <= m) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && ((((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && i + j + k + l <= 3) && 0 <= -3 + k) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) || ((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && 0 <= -3 + k) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201))) && l <= 0) && 0 <= l)))) || ((((((i >= 0 && 0 <= m) && i + j + 3 <= k) && j >= 0) && i <= 99) && ((((((0 <= i + j + k && 0 <= i + j) && (((((0 <= i + j && i <= 0) && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) && i <= 99) && 0 <= i) && 0 <= i + j + k + l) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && (((((0 <= i + j && i <= 0) && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) && i <= 99) && 0 <= i) && 0 <= i + j + k + l))) && 0 <= l)) || ((((((((3 <= b + -4 && i >= 0) && 0 <= m) && i + j + 3 <= k) && j >= 0) && i <= 99) && ((((((0 <= i + j + k && 0 <= i + j) && (((((0 <= i + j && i <= 0) && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) && i <= 99) && 0 <= i) && 0 <= i + j + k + l) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && (((((0 <= i + j && i <= 0) && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j && 0 <= -3 + k) && 0 <= i) && ((((((0 <= i + j + k && 0 <= i + j) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))) || ((((((0 <= i + j + k && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && 0 <= i) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) && i <= 99) && 0 <= i) && 0 <= i + j + k + l))) && l <= 0) && 0 <= l)) || ((((((((((((i + j <= 99 && 0 <= i + j + k) && i >= 0) && 0 <= i + j) && 0 <= m) && k <= 102) && j >= 0) && i <= 99) && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) && 0 <= l)) || ((((((((((3 <= b + -4 && i + j <= 99) && i >= 0) && 0 <= m) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && ((((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && i + j + k + l <= 3) && 0 <= -3 + k) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201) || ((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && 0 <= i + j) && i <= 0) && 0 <= -3 + k) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && i + j + k <= 201))) && l <= 0) && 0 <= l)) && i <= 99))) - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 <= i - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((0 <= i + j + k && 0 <= i + j) && 0 <= i) && 0 <= i + j + k + l) && ((((((i + j <= 99 && i + j + k + l <= 201) && i <= 99) && i + j + k <= 201) && ((((((((((((((((3 <= b + -4 && i + j <= 99) && 0 <= i + j + k) && i >= 0) && 0 <= i + j) && 0 <= -3 + k) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && l <= 0) && i + j + k <= 201) && 0 <= l) || ((((((((((((((((3 <= b + -4 && i + j <= 99) && 0 <= i + j + k) && i >= 0) && 0 <= i + j) && 0 <= -3 + k) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && m <= 1003) && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && l <= 0) && i + j + k <= 201) && 0 <= l))) || (((((((((((((((((((((3 <= b + -4 && i + j <= 99) && 0 <= i + j + k) && i + j + k <= 3) && i >= 0) && 0 <= i + j) && i <= 0) && i + j + k + l <= 3) && 0 <= -3 + k) && k <= 102) && i + j + 3 <= k) && i + j + k + l <= 201) && j >= 0) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && l <= 0) && i + j + k <= 201) && 0 <= l)) || (((((i + j <= 99 && i + j + k + l <= 201) && i <= 99) && i + j + k <= 201) && m <= 1201) && ((((((((((((((((3 <= b + -4 && i + j <= 99) && 0 <= i + j + k) && i >= 0) && 0 <= i + j) && 0 <= -3 + k) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && l <= 0) && i + j + k <= 201) && 0 <= l) || ((((((((((((((((3 <= b + -4 && i + j <= 99) && 0 <= i + j + k) && i >= 0) && 0 <= i + j) && 0 <= -3 + k) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && m <= 1003) && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) && 0 <= i + j + k + l) && l <= 0) && i + j + k <= 201) && 0 <= l)))) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (0 <= i + j && ((((i + j <= 99 && i <= 99) && (((((i >= 0 && (((((i + j <= 99 && 0 <= i + j) && i <= 99) && 0 <= i) && ((((0 <= i + j && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || ((0 <= i + j && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) || (((((i + j <= 99 && 0 <= i + j) && k <= 102) && i <= 99) && 0 <= i) && ((((0 <= i + j && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || ((0 <= i + j && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))))) && j >= 0) && 0 <= l) || ((i >= 0 && (((((i + j <= 99 && 0 <= i + j) && i <= 99) && 0 <= i) && ((((0 <= i + j && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || ((0 <= i + j && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) || (((((i + j <= 99 && 0 <= i + j) && k <= 102) && i <= 99) && 0 <= i) && ((((0 <= i + j && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || ((0 <= i + j && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))))) && j >= 0)) || (((((i >= 0 && (((((i + j <= 99 && 0 <= i + j) && i <= 99) && 0 <= i) && ((((0 <= i + j && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || ((0 <= i + j && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) || (((((i + j <= 99 && 0 <= i + j) && k <= 102) && i <= 99) && 0 <= i) && ((((0 <= i + j && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || ((0 <= i + j && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))))) && j >= 0) && 0 <= l) || ((i >= 0 && (((((i + j <= 99 && 0 <= i + j) && i <= 99) && 0 <= i) && ((((0 <= i + j && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || ((0 <= i + j && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) || (((((i + j <= 99 && 0 <= i + j) && k <= 102) && i <= 99) && 0 <= i) && ((((0 <= i + j && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || ((0 <= i + j && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))))) && j >= 0)) && m <= 1003))) || ((((((((i + j <= 99 && i >= 0) && 0 <= i + j) && i <= 0) && j >= 0) && i <= 99) && i + j <= 0) && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i)))))) || (((i + j <= 99 && i <= 99) && m <= 1201) && (((((i >= 0 && (((((i + j <= 99 && 0 <= i + j) && i <= 99) && 0 <= i) && ((((0 <= i + j && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || ((0 <= i + j && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) || (((((i + j <= 99 && 0 <= i + j) && k <= 102) && i <= 99) && 0 <= i) && ((((0 <= i + j && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || ((0 <= i + j && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))))) && j >= 0) && 0 <= l) || ((i >= 0 && (((((i + j <= 99 && 0 <= i + j) && i <= 99) && 0 <= i) && ((((0 <= i + j && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || ((0 <= i + j && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) || (((((i + j <= 99 && 0 <= i + j) && k <= 102) && i <= 99) && 0 <= i) && ((((0 <= i + j && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || ((0 <= i + j && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))))) && j >= 0)) || (((((i >= 0 && (((((i + j <= 99 && 0 <= i + j) && i <= 99) && 0 <= i) && ((((0 <= i + j && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || ((0 <= i + j && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) || (((((i + j <= 99 && 0 <= i + j) && k <= 102) && i <= 99) && 0 <= i) && ((((0 <= i + j && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || ((0 <= i + j && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))))) && j >= 0) && 0 <= l) || ((i >= 0 && (((((i + j <= 99 && 0 <= i + j) && i <= 99) && 0 <= i) && ((((0 <= i + j && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || ((0 <= i + j && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) || (((((i + j <= 99 && 0 <= i + j) && k <= 102) && i <= 99) && 0 <= i) && ((((0 <= i + j && 0 <= i) && k <= 3) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || ((0 <= i + j && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))))) && j >= 0)) && m <= 1003))))) && 0 <= i - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((0 <= i + j + k && 0 <= i + j) && 0 <= i) && (((((i + j <= 99 && ((((((((((((((i + j <= 99 && 0 <= i + j + k) && i >= 0) && 0 <= i + j) && 0 <= -3 + k) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && 0 <= i) && i + j + k <= 201) && (((0 <= i + j && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j + k && 0 <= i + j) && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) && 0 <= l) || (m <= 1003 && (((((((((((((i + j <= 99 && 0 <= i + j + k) && i >= 0) && 0 <= i + j) && 0 <= -3 + k) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && 0 <= i) && i + j + k <= 201) && (((0 <= i + j && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j + k && 0 <= i + j) && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) && 0 <= l) || (((((((((((i + j <= 99 && 0 <= i + j + k) && i >= 0) && 0 <= i + j) && 0 <= -3 + k) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && 0 <= i) && i + j + k <= 201) && (((0 <= i + j && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j + k && 0 <= i + j) && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i)))))))))) || (((((((((((i + j <= 99 && 0 <= i + j + k) && i >= 0) && 0 <= i + j) && 0 <= -3 + k) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && 0 <= i) && i + j + k <= 201) && (((0 <= i + j && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j + k && 0 <= i + j) && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))))) && i <= 99) && i + j + k <= 201) || (((((((((((((((i + j <= 99 && 0 <= i + j + k) && i + j + k <= 3) && i >= 0) && 0 <= i + j) && i <= 0) && 0 <= -3 + k) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && i + j <= 0) && 0 <= i) && k <= 3) && i + j + k <= 201) && (((0 <= i + j && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j + k && 0 <= i + j) && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i)))))))) || ((((i + j <= 99 && ((((((((((((((i + j <= 99 && 0 <= i + j + k) && i >= 0) && 0 <= i + j) && 0 <= -3 + k) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && 0 <= i) && i + j + k <= 201) && (((0 <= i + j && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j + k && 0 <= i + j) && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) && 0 <= l) || (m <= 1003 && (((((((((((((i + j <= 99 && 0 <= i + j + k) && i >= 0) && 0 <= i + j) && 0 <= -3 + k) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && 0 <= i) && i + j + k <= 201) && (((0 <= i + j && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j + k && 0 <= i + j) && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))) && 0 <= l) || (((((((((((i + j <= 99 && 0 <= i + j + k) && i >= 0) && 0 <= i + j) && 0 <= -3 + k) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && 0 <= i) && i + j + k <= 201) && (((0 <= i + j && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j + k && 0 <= i + j) && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i)))))))))) || (((((((((((i + j <= 99 && 0 <= i + j + k) && i >= 0) && 0 <= i + j) && 0 <= -3 + k) && k <= 102) && i + j + 3 <= k) && j >= 0) && i <= 99) && 0 <= i) && i + j + k <= 201) && (((0 <= i + j && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))) || (((0 <= i + j + k && 0 <= i + j) && 0 <= i) && ((((((((i + j <= 99 && 0 <= i + j) && i <= 0) && 0 <= j) && i <= 99) && i + j <= 0) && 0 <= i) && j <= 0) || ((((i + j <= 99 && 0 <= j) && i <= 99) && j <= 0) && (((0 <= i + j && i <= 99) && 0 <= i) || (((0 <= i + j && i <= 0) && i <= 99) && 0 <= i))))))))) && i <= 99) && i + j + k <= 201) && m <= 1201)) - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: (0 <= i && ((((((((((i >= 0 && (((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i) && k <= 3) || ((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i))) && 0 <= i) || (((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i) && k <= 3) || ((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i))) && k <= 102) && 0 <= i))) && j >= 0) && 0 <= l) || (((((i >= 0 && (((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i) && k <= 3) || ((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i))) && 0 <= i) || (((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i) && k <= 3) || ((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i))) && k <= 102) && 0 <= i))) && j >= 0) && 0 <= l) || ((i >= 0 && (((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i) && k <= 3) || ((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i))) && 0 <= i) || (((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i) && k <= 3) || ((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i))) && k <= 102) && 0 <= i))) && j >= 0)) && m <= 1003)) || ((i >= 0 && (((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i) && k <= 3) || ((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i))) && 0 <= i) || (((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i) && k <= 3) || ((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i))) && k <= 102) && 0 <= i))) && j >= 0)) && m <= 1201) || (((i >= 0 && (((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i) && k <= 3) || ((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i))) && 0 <= i) || (((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i) && k <= 3) || ((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i))) && k <= 102) && 0 <= i))) && j >= 0) && 0 <= l)) || (((((i >= 0 && (((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i) && k <= 3) || ((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i))) && 0 <= i) || (((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i) && k <= 3) || ((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i))) && k <= 102) && 0 <= i))) && j >= 0) && 0 <= l) || ((i >= 0 && (((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i) && k <= 3) || ((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i))) && 0 <= i) || (((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i) && k <= 3) || ((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i))) && k <= 102) && 0 <= i))) && j >= 0)) && m <= 1003)) || ((i >= 0 && (((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i) && k <= 3) || ((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i))) && 0 <= i) || (((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i) && k <= 3) || ((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i))) && k <= 102) && 0 <= i))) && j >= 0)) || ((((i >= 0 && i <= 0) && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && i <= 99) && 0 <= i))) || ((0 <= i + j && 0 <= i) && ((((((((((i >= 0 && (((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i) && k <= 3) || ((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i))) && 0 <= i) || (((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i) && k <= 3) || ((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i))) && k <= 102) && 0 <= i))) && j >= 0) && 0 <= l) || (((((i >= 0 && (((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i) && k <= 3) || ((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i))) && 0 <= i) || (((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i) && k <= 3) || ((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i))) && k <= 102) && 0 <= i))) && j >= 0) && 0 <= l) || ((i >= 0 && (((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i) && k <= 3) || ((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i))) && 0 <= i) || (((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i) && k <= 3) || ((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i))) && k <= 102) && 0 <= i))) && j >= 0)) && m <= 1003)) || ((i >= 0 && (((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i) && k <= 3) || ((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i))) && 0 <= i) || (((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i) && k <= 3) || ((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i))) && k <= 102) && 0 <= i))) && j >= 0)) && m <= 1201) || (((i >= 0 && (((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i) && k <= 3) || ((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i))) && 0 <= i) || (((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i) && k <= 3) || ((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i))) && k <= 102) && 0 <= i))) && j >= 0) && 0 <= l)) || (((((i >= 0 && (((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i) && k <= 3) || ((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i))) && 0 <= i) || (((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i) && k <= 3) || ((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i))) && k <= 102) && 0 <= i))) && j >= 0) && 0 <= l) || ((i >= 0 && (((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i) && k <= 3) || ((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i))) && 0 <= i) || (((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i) && k <= 3) || ((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i))) && k <= 102) && 0 <= i))) && j >= 0)) && m <= 1003)) || ((i >= 0 && (((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i) && k <= 3) || ((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i))) && 0 <= i) || (((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i) && k <= 3) || ((0 <= i + j && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && 0 <= i))) && k <= 102) && 0 <= i))) && j >= 0)) || ((((i >= 0 && i <= 0) && ((((0 <= i + j && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i) || (((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0)) && 0 <= i)) || (((0 <= i + j + k && 0 <= i + j) && ((((0 <= i + j && 0 <= j) && 0 <= i) || ((i <= 0 && i <= 99) && 0 <= i)) || (((0 <= i + j && 0 <= j) && 0 <= i) && j <= 0))) && 0 <= i))) && i <= 99) && 0 <= i))) RESULT: Ultimate proved your program to be correct! [2023-02-18 08:32:44,293 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