./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/gr2006.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26d01a9c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-lit/gr2006.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3ef045eb54c58e8ecfe4972142a43378e1f3b08091dc3d5b7e399cf5703f1724 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-18 00:19:36,308 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 00:19:36,310 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 00:19:36,351 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 00:19:36,352 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 00:19:36,354 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 00:19:36,356 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 00:19:36,358 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 00:19:36,360 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 00:19:36,364 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 00:19:36,365 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 00:19:36,367 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 00:19:36,367 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 00:19:36,369 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 00:19:36,371 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 00:19:36,372 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 00:19:36,372 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 00:19:36,374 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 00:19:36,375 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 00:19:36,379 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 00:19:36,380 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 00:19:36,381 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 00:19:36,382 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 00:19:36,383 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 00:19:36,391 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 00:19:36,391 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 00:19:36,392 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 00:19:36,393 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 00:19:36,394 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 00:19:36,394 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 00:19:36,395 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 00:19:36,395 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 00:19:36,397 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 00:19:36,403 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 00:19:36,404 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 00:19:36,404 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 00:19:36,405 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 00:19:36,405 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 00:19:36,405 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 00:19:36,406 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 00:19:36,407 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 00:19:36,408 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-18 00:19:36,443 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 00:19:36,443 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 00:19:36,444 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 00:19:36,444 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 00:19:36,445 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 00:19:36,445 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 00:19:36,445 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 00:19:36,445 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 00:19:36,446 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 00:19:36,446 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 00:19:36,447 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 00:19:36,447 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 00:19:36,447 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 00:19:36,447 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 00:19:36,448 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 00:19:36,448 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 00:19:36,448 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 00:19:36,448 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 00:19:36,448 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 00:19:36,449 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 00:19:36,449 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 00:19:36,449 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 00:19:36,449 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 00:19:36,449 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 00:19:36,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 00:19:36,450 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 00:19:36,450 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 00:19:36,450 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 00:19:36,450 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 00:19:36,451 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 00:19:36,451 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 00:19:36,451 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 00:19:36,451 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 00:19:36,452 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 00:19:36,452 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 00:19:36,452 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3ef045eb54c58e8ecfe4972142a43378e1f3b08091dc3d5b7e399cf5703f1724 [2023-02-18 00:19:36,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 00:19:36,735 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 00:19:36,738 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 00:19:36,739 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 00:19:36,739 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 00:19:36,740 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/gr2006.i [2023-02-18 00:19:37,955 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 00:19:38,153 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 00:19:38,153 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/gr2006.i [2023-02-18 00:19:38,159 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e79e1735/4bd6d3e2e5544339be33f6733348b80f/FLAGf37ebc98a [2023-02-18 00:19:38,176 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e79e1735/4bd6d3e2e5544339be33f6733348b80f [2023-02-18 00:19:38,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 00:19:38,180 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 00:19:38,182 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 00:19:38,182 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 00:19:38,185 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 00:19:38,186 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 12:19:38" (1/1) ... [2023-02-18 00:19:38,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76696979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:19:38, skipping insertion in model container [2023-02-18 00:19:38,187 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 12:19:38" (1/1) ... [2023-02-18 00:19:38,193 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 00:19:38,207 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 00:19:38,358 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/gr2006.i[895,908] [2023-02-18 00:19:38,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 00:19:38,380 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 00:19:38,390 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/gr2006.i[895,908] [2023-02-18 00:19:38,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 00:19:38,403 INFO L208 MainTranslator]: Completed translation [2023-02-18 00:19:38,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:19:38 WrapperNode [2023-02-18 00:19:38,404 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 00:19:38,405 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 00:19:38,405 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 00:19:38,405 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 00:19:38,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:19:38" (1/1) ... [2023-02-18 00:19:38,417 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:19:38" (1/1) ... [2023-02-18 00:19:38,428 INFO L138 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 38 [2023-02-18 00:19:38,428 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 00:19:38,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 00:19:38,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 00:19:38,429 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 00:19:38,435 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:19:38" (1/1) ... [2023-02-18 00:19:38,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:19:38" (1/1) ... [2023-02-18 00:19:38,436 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:19:38" (1/1) ... [2023-02-18 00:19:38,437 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:19:38" (1/1) ... [2023-02-18 00:19:38,439 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:19:38" (1/1) ... [2023-02-18 00:19:38,442 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:19:38" (1/1) ... [2023-02-18 00:19:38,447 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:19:38" (1/1) ... [2023-02-18 00:19:38,448 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:19:38" (1/1) ... [2023-02-18 00:19:38,454 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 00:19:38,455 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 00:19:38,455 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 00:19:38,456 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 00:19:38,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:19:38" (1/1) ... [2023-02-18 00:19:38,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 00:19:38,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:19:38,482 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 00:19:38,503 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 00:19:38,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 00:19:38,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 00:19:38,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 00:19:38,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 00:19:38,571 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 00:19:38,573 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 00:19:38,657 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 00:19:38,662 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 00:19:38,662 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-18 00:19:38,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 12:19:38 BoogieIcfgContainer [2023-02-18 00:19:38,664 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 00:19:38,666 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 00:19:38,666 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 00:19:38,669 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 00:19:38,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 12:19:38" (1/3) ... [2023-02-18 00:19:38,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7603f2fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 12:19:38, skipping insertion in model container [2023-02-18 00:19:38,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:19:38" (2/3) ... [2023-02-18 00:19:38,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7603f2fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 12:19:38, skipping insertion in model container [2023-02-18 00:19:38,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 12:19:38" (3/3) ... [2023-02-18 00:19:38,672 INFO L112 eAbstractionObserver]: Analyzing ICFG gr2006.i [2023-02-18 00:19:38,687 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 00:19:38,687 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 00:19:38,742 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 00:19:38,749 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;@5abc282e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 00:19:38,750 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 00:19:38,753 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 states have internal predecessors, (17), 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 00:19:38,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-18 00:19:38,759 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:19:38,760 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-18 00:19:38,761 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:19:38,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:19:38,767 INFO L85 PathProgramCache]: Analyzing trace with hash 890091623, now seen corresponding path program 1 times [2023-02-18 00:19:38,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:19:38,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226717422] [2023-02-18 00:19:38,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:19:38,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:19:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:19:38,900 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 00:19:38,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:19:38,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226717422] [2023-02-18 00:19:38,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226717422] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:19:38,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 00:19:38,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 00:19:38,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127352738] [2023-02-18 00:19:38,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:19:38,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 00:19:38,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:19:38,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 00:19:38,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 00:19:38,947 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 states have internal predecessors, (17), 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 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 00:19:38,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:19:38,964 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2023-02-18 00:19:38,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 00:19:38,966 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2023-02-18 00:19:38,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:19:38,973 INFO L225 Difference]: With dead ends: 21 [2023-02-18 00:19:38,973 INFO L226 Difference]: Without dead ends: 9 [2023-02-18 00:19:38,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 00:19:38,979 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 00:19:38,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 00:19:38,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-02-18 00:19:39,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2023-02-18 00:19:39,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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 00:19:39,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2023-02-18 00:19:39,005 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2023-02-18 00:19:39,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:19:39,006 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2023-02-18 00:19:39,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 00:19:39,007 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2023-02-18 00:19:39,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-18 00:19:39,007 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:19:39,007 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:19:39,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-18 00:19:39,008 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:19:39,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:19:39,009 INFO L85 PathProgramCache]: Analyzing trace with hash 297871632, now seen corresponding path program 1 times [2023-02-18 00:19:39,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:19:39,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848423795] [2023-02-18 00:19:39,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:19:39,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:19:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:19:39,089 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 00:19:39,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:19:39,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848423795] [2023-02-18 00:19:39,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848423795] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:19:39,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 00:19:39,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 00:19:39,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690550074] [2023-02-18 00:19:39,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:19:39,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 00:19:39,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:19:39,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 00:19:39,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 00:19:39,094 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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 00:19:39,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:19:39,129 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2023-02-18 00:19:39,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 00:19:39,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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 00:19:39,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:19:39,131 INFO L225 Difference]: With dead ends: 23 [2023-02-18 00:19:39,131 INFO L226 Difference]: Without dead ends: 16 [2023-02-18 00:19:39,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 00:19:39,133 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 5 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 00:19:39,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 12 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 00:19:39,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-02-18 00:19:39,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2023-02-18 00:19:39,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 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 00:19:39,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2023-02-18 00:19:39,141 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2023-02-18 00:19:39,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:19:39,142 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2023-02-18 00:19:39,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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 00:19:39,143 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2023-02-18 00:19:39,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-18 00:19:39,144 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:19:39,144 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:19:39,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-18 00:19:39,145 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:19:39,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:19:39,146 INFO L85 PathProgramCache]: Analyzing trace with hash 296024590, now seen corresponding path program 1 times [2023-02-18 00:19:39,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:19:39,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382609993] [2023-02-18 00:19:39,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:19:39,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:19:39,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:19:39,233 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 00:19:39,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:19:39,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382609993] [2023-02-18 00:19:39,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382609993] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:19:39,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 00:19:39,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 00:19:39,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753994788] [2023-02-18 00:19:39,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:19:39,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 00:19:39,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:19:39,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 00:19:39,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 00:19:39,260 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 4 states, 4 states have (on average 2.0) 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 00:19:39,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:19:39,309 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2023-02-18 00:19:39,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 00:19:39,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) 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 00:19:39,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:19:39,311 INFO L225 Difference]: With dead ends: 21 [2023-02-18 00:19:39,324 INFO L226 Difference]: Without dead ends: 17 [2023-02-18 00:19:39,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 00:19:39,326 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 00:19:39,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 18 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 00:19:39,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-02-18 00:19:39,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-02-18 00:19:39,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 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 00:19:39,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2023-02-18 00:19:39,340 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 8 [2023-02-18 00:19:39,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:19:39,341 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2023-02-18 00:19:39,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) 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 00:19:39,341 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2023-02-18 00:19:39,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-18 00:19:39,342 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:19:39,342 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:19:39,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-18 00:19:39,343 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:19:39,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:19:39,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1662849797, now seen corresponding path program 1 times [2023-02-18 00:19:39,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:19:39,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775719376] [2023-02-18 00:19:39,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:19:39,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:19:39,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:19:39,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:19:39,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:19:39,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775719376] [2023-02-18 00:19:39,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775719376] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 00:19:39,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023435341] [2023-02-18 00:19:39,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:19:39,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:19:39,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:19:39,408 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 00:19:39,409 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 00:19:39,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:19:39,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-18 00:19:39,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 00:19:39,494 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 00:19:39,495 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 00:19:39,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023435341] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:19:39,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 00:19:39,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-02-18 00:19:39,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793002322] [2023-02-18 00:19:39,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:19:39,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 00:19:39,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:19:39,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 00:19:39,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-18 00:19:39,498 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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 00:19:39,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:19:39,522 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2023-02-18 00:19:39,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 00:19:39,523 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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 00:19:39,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:19:39,523 INFO L225 Difference]: With dead ends: 28 [2023-02-18 00:19:39,524 INFO L226 Difference]: Without dead ends: 24 [2023-02-18 00:19:39,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-18 00:19:39,525 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 00:19:39,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 19 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 00:19:39,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-02-18 00:19:39,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2023-02-18 00:19:39,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 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 00:19:39,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2023-02-18 00:19:39,531 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 11 [2023-02-18 00:19:39,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:19:39,531 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2023-02-18 00:19:39,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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 00:19:39,532 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2023-02-18 00:19:39,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-18 00:19:39,532 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:19:39,532 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:19:39,544 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 00:19:39,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:19:39,739 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:19:39,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:19:39,740 INFO L85 PathProgramCache]: Analyzing trace with hash 718405550, now seen corresponding path program 1 times [2023-02-18 00:19:39,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:19:39,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466479791] [2023-02-18 00:19:39,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:19:39,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:19:39,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:19:39,806 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 00:19:39,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:19:39,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466479791] [2023-02-18 00:19:39,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466479791] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 00:19:39,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003601835] [2023-02-18 00:19:39,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:19:39,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:19:39,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:19:39,809 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 00:19:39,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-18 00:19:39,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:19:39,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-18 00:19:39,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 00:19:39,878 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 00:19:39,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 00:19:39,901 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 00:19:39,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003601835] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 00:19:39,903 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 00:19:39,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-02-18 00:19:39,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990903518] [2023-02-18 00:19:39,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 00:19:39,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 00:19:39,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:19:39,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 00:19:39,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-02-18 00:19:39,907 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 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 00:19:39,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:19:39,946 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2023-02-18 00:19:39,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 00:19:39,946 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 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 14 [2023-02-18 00:19:39,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:19:39,947 INFO L225 Difference]: With dead ends: 42 [2023-02-18 00:19:39,947 INFO L226 Difference]: Without dead ends: 28 [2023-02-18 00:19:39,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-02-18 00:19:39,948 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 00:19:39,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 21 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 00:19:39,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-02-18 00:19:39,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2023-02-18 00:19:39,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 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 00:19:39,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-02-18 00:19:39,953 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 14 [2023-02-18 00:19:39,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:19:39,954 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-02-18 00:19:39,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 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 00:19:39,954 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2023-02-18 00:19:39,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-18 00:19:39,955 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:19:39,955 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 4, 3, 1, 1, 1, 1, 1, 1] [2023-02-18 00:19:39,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-18 00:19:40,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:19:40,161 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:19:40,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:19:40,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1481971984, now seen corresponding path program 2 times [2023-02-18 00:19:40,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:19:40,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400390542] [2023-02-18 00:19:40,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:19:40,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:19:40,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:19:40,295 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 32 proven. 26 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-18 00:19:40,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:19:40,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400390542] [2023-02-18 00:19:40,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400390542] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 00:19:40,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869229153] [2023-02-18 00:19:40,297 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 00:19:40,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:19:40,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:19:40,298 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 00:19:40,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-18 00:19:40,348 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 00:19:40,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 00:19:40,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-18 00:19:40,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 00:19:40,394 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 32 proven. 26 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-18 00:19:40,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 00:19:40,456 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 32 proven. 26 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-18 00:19:40,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869229153] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 00:19:40,465 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 00:19:40,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-02-18 00:19:40,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142581343] [2023-02-18 00:19:40,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 00:19:40,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-18 00:19:40,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:19:40,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-18 00:19:40,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-02-18 00:19:40,467 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 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 00:19:40,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:19:40,507 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2023-02-18 00:19:40,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-18 00:19:40,507 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 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 00:19:40,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:19:40,508 INFO L225 Difference]: With dead ends: 60 [2023-02-18 00:19:40,508 INFO L226 Difference]: Without dead ends: 46 [2023-02-18 00:19:40,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-02-18 00:19:40,509 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 00:19:40,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 23 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 00:19:40,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-02-18 00:19:40,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2023-02-18 00:19:40,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 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 00:19:40,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2023-02-18 00:19:40,515 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 26 [2023-02-18 00:19:40,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:19:40,515 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2023-02-18 00:19:40,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 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 00:19:40,516 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2023-02-18 00:19:40,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-18 00:19:40,517 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:19:40,517 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 10, 3, 1, 1, 1, 1, 1, 1] [2023-02-18 00:19:40,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-18 00:19:40,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:19:40,729 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:19:40,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:19:40,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1581415824, now seen corresponding path program 3 times [2023-02-18 00:19:40,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:19:40,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18560450] [2023-02-18 00:19:40,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:19:40,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:19:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:19:40,906 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 74 proven. 155 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-18 00:19:40,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:19:40,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18560450] [2023-02-18 00:19:40,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18560450] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 00:19:40,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175403149] [2023-02-18 00:19:40,907 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 00:19:40,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:19:40,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:19:40,908 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 00:19:40,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-18 00:19:40,955 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2023-02-18 00:19:40,955 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 00:19:40,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 00:19:40,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 00:19:41,060 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 148 proven. 17 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2023-02-18 00:19:41,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 00:19:41,136 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 148 proven. 17 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2023-02-18 00:19:41,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175403149] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 00:19:41,137 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 00:19:41,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6, 6] total 17 [2023-02-18 00:19:41,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013170669] [2023-02-18 00:19:41,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 00:19:41,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-18 00:19:41,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:19:41,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-18 00:19:41,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2023-02-18 00:19:41,139 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 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 00:19:41,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:19:41,248 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2023-02-18 00:19:41,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-18 00:19:41,249 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 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 44 [2023-02-18 00:19:41,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:19:41,250 INFO L225 Difference]: With dead ends: 73 [2023-02-18 00:19:41,250 INFO L226 Difference]: Without dead ends: 59 [2023-02-18 00:19:41,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 75 SyntacticMatches, 9 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=304, Invalid=626, Unknown=0, NotChecked=0, Total=930 [2023-02-18 00:19:41,251 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 00:19:41,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 47 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 00:19:41,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-02-18 00:19:41,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2023-02-18 00:19:41,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.1) internal successors, (55), 50 states have internal predecessors, (55), 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 00:19:41,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2023-02-18 00:19:41,258 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 44 [2023-02-18 00:19:41,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:19:41,258 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2023-02-18 00:19:41,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 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 00:19:41,259 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2023-02-18 00:19:41,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-18 00:19:41,260 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:19:41,260 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 11, 4, 1, 1, 1, 1, 1, 1] [2023-02-18 00:19:41,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-18 00:19:41,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:19:41,466 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:19:41,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:19:41,467 INFO L85 PathProgramCache]: Analyzing trace with hash -644375122, now seen corresponding path program 4 times [2023-02-18 00:19:41,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:19:41,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303218577] [2023-02-18 00:19:41,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:19:41,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:19:41,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:19:41,607 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 116 proven. 187 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-18 00:19:41,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:19:41,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303218577] [2023-02-18 00:19:41,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303218577] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 00:19:41,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880567374] [2023-02-18 00:19:41,608 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-18 00:19:41,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:19:41,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:19:41,610 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 00:19:41,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-18 00:19:41,667 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-18 00:19:41,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 00:19:41,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-18 00:19:41,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 00:19:41,751 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 116 proven. 187 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-18 00:19:41,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 00:19:41,942 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 116 proven. 187 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-18 00:19:41,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880567374] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 00:19:41,942 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 00:19:41,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2023-02-18 00:19:41,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253984655] [2023-02-18 00:19:41,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 00:19:41,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-02-18 00:19:41,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:19:41,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-02-18 00:19:41,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2023-02-18 00:19:41,945 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 27 states, 27 states have (on average 3.111111111111111) internal successors, (84), 27 states have internal predecessors, (84), 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 00:19:42,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:19:42,017 INFO L93 Difference]: Finished difference Result 109 states and 130 transitions. [2023-02-18 00:19:42,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-18 00:19:42,018 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.111111111111111) internal successors, (84), 27 states have internal predecessors, (84), 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 50 [2023-02-18 00:19:42,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:19:42,022 INFO L225 Difference]: With dead ends: 109 [2023-02-18 00:19:42,023 INFO L226 Difference]: Without dead ends: 92 [2023-02-18 00:19:42,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 76 SyntacticMatches, 11 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2023-02-18 00:19:42,024 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 00:19:42,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 44 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 00:19:42,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-02-18 00:19:42,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2023-02-18 00:19:42,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.0561797752808988) internal successors, (94), 89 states have internal predecessors, (94), 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 00:19:42,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2023-02-18 00:19:42,044 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 50 [2023-02-18 00:19:42,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:19:42,045 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2023-02-18 00:19:42,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.111111111111111) internal successors, (84), 27 states have internal predecessors, (84), 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 00:19:42,046 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2023-02-18 00:19:42,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-02-18 00:19:42,052 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:19:42,052 INFO L195 NwaCegarLoop]: trace histogram [28, 27, 24, 4, 1, 1, 1, 1, 1, 1] [2023-02-18 00:19:42,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-18 00:19:42,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:19:42,258 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:19:42,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:19:42,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1957262565, now seen corresponding path program 5 times [2023-02-18 00:19:42,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:19:42,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452518564] [2023-02-18 00:19:42,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:19:42,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:19:42,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:19:42,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 246 proven. 876 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-18 00:19:42,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:19:42,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452518564] [2023-02-18 00:19:42,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452518564] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 00:19:42,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864168952] [2023-02-18 00:19:42,759 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-18 00:19:42,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:19:42,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:19:42,761 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 00:19:42,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-18 00:19:42,837 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 28 check-sat command(s) [2023-02-18 00:19:42,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 00:19:42,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-18 00:19:42,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 00:19:43,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 246 proven. 876 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-18 00:19:43,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 00:19:43,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 246 proven. 876 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-18 00:19:43,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864168952] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 00:19:43,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 00:19:43,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2023-02-18 00:19:43,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815721284] [2023-02-18 00:19:43,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 00:19:43,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-02-18 00:19:43,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:19:43,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-02-18 00:19:43,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2023-02-18 00:19:43,920 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand has 53 states, 53 states have (on average 3.056603773584906) internal successors, (162), 53 states have internal predecessors, (162), 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 00:19:44,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:19:44,066 INFO L93 Difference]: Finished difference Result 187 states and 221 transitions. [2023-02-18 00:19:44,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-02-18 00:19:44,067 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.056603773584906) internal successors, (162), 53 states have internal predecessors, (162), 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 89 [2023-02-18 00:19:44,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:19:44,068 INFO L225 Difference]: With dead ends: 187 [2023-02-18 00:19:44,068 INFO L226 Difference]: Without dead ends: 170 [2023-02-18 00:19:44,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 128 SyntacticMatches, 24 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2023-02-18 00:19:44,070 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 00:19:44,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 82 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 00:19:44,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2023-02-18 00:19:44,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2023-02-18 00:19:44,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.029940119760479) internal successors, (172), 167 states have internal predecessors, (172), 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 00:19:44,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 172 transitions. [2023-02-18 00:19:44,091 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 172 transitions. Word has length 89 [2023-02-18 00:19:44,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:19:44,092 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 172 transitions. [2023-02-18 00:19:44,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 3.056603773584906) internal successors, (162), 53 states have internal predecessors, (162), 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 00:19:44,092 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 172 transitions. [2023-02-18 00:19:44,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-02-18 00:19:44,093 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:19:44,093 INFO L195 NwaCegarLoop]: trace histogram [54, 53, 50, 4, 1, 1, 1, 1, 1, 1] [2023-02-18 00:19:44,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-18 00:19:44,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:19:44,307 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:19:44,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:19:44,308 INFO L85 PathProgramCache]: Analyzing trace with hash 313724859, now seen corresponding path program 6 times [2023-02-18 00:19:44,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:19:44,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892578318] [2023-02-18 00:19:44,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:19:44,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:19:44,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:19:44,514 INFO L134 CoverageAnalysis]: Checked inductivity of 4293 backedges. 1145 proven. 34 refuted. 0 times theorem prover too weak. 3114 trivial. 0 not checked. [2023-02-18 00:19:44,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:19:44,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892578318] [2023-02-18 00:19:44,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892578318] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 00:19:44,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989655150] [2023-02-18 00:19:44,515 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-18 00:19:44,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:19:44,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:19:44,522 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 00:19:44,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-18 00:19:44,594 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2023-02-18 00:19:44,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 00:19:44,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 00:19:44,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 00:19:44,634 INFO L134 CoverageAnalysis]: Checked inductivity of 4293 backedges. 1145 proven. 34 refuted. 0 times theorem prover too weak. 3114 trivial. 0 not checked. [2023-02-18 00:19:44,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 00:19:44,668 INFO L134 CoverageAnalysis]: Checked inductivity of 4293 backedges. 1145 proven. 34 refuted. 0 times theorem prover too weak. 3114 trivial. 0 not checked. [2023-02-18 00:19:44,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989655150] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 00:19:44,669 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 00:19:44,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2023-02-18 00:19:44,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651126921] [2023-02-18 00:19:44,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 00:19:44,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 00:19:44,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:19:44,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 00:19:44,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-02-18 00:19:44,673 INFO L87 Difference]: Start difference. First operand 168 states and 172 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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 00:19:44,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:19:44,696 INFO L93 Difference]: Finished difference Result 185 states and 193 transitions. [2023-02-18 00:19:44,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 00:19:44,696 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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 167 [2023-02-18 00:19:44,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:19:44,699 INFO L225 Difference]: With dead ends: 185 [2023-02-18 00:19:44,699 INFO L226 Difference]: Without dead ends: 181 [2023-02-18 00:19:44,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 321 SyntacticMatches, 17 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-02-18 00:19:44,700 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 00:19:44,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 00:19:44,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-02-18 00:19:44,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 171. [2023-02-18 00:19:44,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.035294117647059) internal successors, (176), 170 states have internal predecessors, (176), 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 00:19:44,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 176 transitions. [2023-02-18 00:19:44,720 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 176 transitions. Word has length 167 [2023-02-18 00:19:44,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:19:44,721 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 176 transitions. [2023-02-18 00:19:44,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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 00:19:44,721 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 176 transitions. [2023-02-18 00:19:44,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-02-18 00:19:44,726 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:19:44,726 INFO L195 NwaCegarLoop]: trace histogram [55, 54, 50, 5, 1, 1, 1, 1, 1, 1] [2023-02-18 00:19:44,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-02-18 00:19:44,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:19:44,932 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:19:44,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:19:44,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1661700912, now seen corresponding path program 7 times [2023-02-18 00:19:44,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:19:44,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554692048] [2023-02-18 00:19:44,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:19:44,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:19:44,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:19:45,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4455 backedges. 1416 proven. 57 refuted. 0 times theorem prover too weak. 2982 trivial. 0 not checked. [2023-02-18 00:19:45,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:19:45,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554692048] [2023-02-18 00:19:45,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554692048] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 00:19:45,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840894048] [2023-02-18 00:19:45,165 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-18 00:19:45,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:19:45,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:19:45,167 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 00:19:45,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-18 00:19:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:19:45,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 57 conjunts are in the unsatisfiable core [2023-02-18 00:19:45,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 00:19:46,516 INFO L134 CoverageAnalysis]: Checked inductivity of 4455 backedges. 4385 proven. 57 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-18 00:19:46,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 00:19:47,553 INFO L134 CoverageAnalysis]: Checked inductivity of 4455 backedges. 4385 proven. 57 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-18 00:19:47,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840894048] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 00:19:47,554 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 00:19:47,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 53, 53] total 98 [2023-02-18 00:19:47,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849590793] [2023-02-18 00:19:47,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 00:19:47,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2023-02-18 00:19:47,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:19:47,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2023-02-18 00:19:47,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2023-02-18 00:19:47,560 INFO L87 Difference]: Start difference. First operand 171 states and 176 transitions. Second operand has 98 states, 98 states have (on average 3.1530612244897958) internal successors, (309), 98 states have internal predecessors, (309), 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 00:19:48,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:19:48,175 INFO L93 Difference]: Finished difference Result 911 states and 1191 transitions. [2023-02-18 00:19:48,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-02-18 00:19:48,176 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 3.1530612244897958) internal successors, (309), 98 states have internal predecessors, (309), 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 170 [2023-02-18 00:19:48,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:19:48,180 INFO L225 Difference]: With dead ends: 911 [2023-02-18 00:19:48,180 INFO L226 Difference]: Without dead ends: 907 [2023-02-18 00:19:48,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 234 SyntacticMatches, 21 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5051 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2023-02-18 00:19:48,184 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 12 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 00:19:48,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 278 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 00:19:48,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2023-02-18 00:19:48,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 309. [2023-02-18 00:19:48,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 1.1688311688311688) internal successors, (360), 308 states have internal predecessors, (360), 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 00:19:48,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 360 transitions. [2023-02-18 00:19:48,203 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 360 transitions. Word has length 170 [2023-02-18 00:19:48,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:19:48,204 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 360 transitions. [2023-02-18 00:19:48,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 3.1530612244897958) internal successors, (309), 98 states have internal predecessors, (309), 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 00:19:48,204 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 360 transitions. [2023-02-18 00:19:48,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2023-02-18 00:19:48,207 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:19:48,207 INFO L195 NwaCegarLoop]: trace histogram [101, 100, 51, 50, 1, 1, 1, 1, 1, 1] [2023-02-18 00:19:48,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-18 00:19:48,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-02-18 00:19:48,419 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:19:48,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:19:48,420 INFO L85 PathProgramCache]: Analyzing trace with hash -338193904, now seen corresponding path program 8 times [2023-02-18 00:19:48,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:19:48,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777754035] [2023-02-18 00:19:48,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:19:48,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:19:48,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:19:53,687 INFO L134 CoverageAnalysis]: Checked inductivity of 15150 backedges. 0 proven. 15150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:19:53,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:19:53,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777754035] [2023-02-18 00:19:53,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777754035] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 00:19:53,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540922757] [2023-02-18 00:19:53,688 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 00:19:53,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:19:53,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:19:53,690 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 00:19:53,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-18 00:19:53,834 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 00:19:53,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 00:19:53,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 737 conjuncts, 208 conjunts are in the unsatisfiable core [2023-02-18 00:19:53,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 00:19:58,688 INFO L134 CoverageAnalysis]: Checked inductivity of 15150 backedges. 0 proven. 15150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:19:58,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 00:20:03,284 INFO L134 CoverageAnalysis]: Checked inductivity of 15150 backedges. 0 proven. 15150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:20:03,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540922757] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 00:20:03,284 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 00:20:03,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 104, 104] total 155 [2023-02-18 00:20:03,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629921850] [2023-02-18 00:20:03,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 00:20:03,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 155 states [2023-02-18 00:20:03,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:20:03,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2023-02-18 00:20:03,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2858, Invalid=21012, Unknown=0, NotChecked=0, Total=23870 [2023-02-18 00:20:03,292 INFO L87 Difference]: Start difference. First operand 309 states and 360 transitions. Second operand has 155 states, 155 states have (on average 2.967741935483871) internal successors, (460), 155 states have internal predecessors, (460), 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 00:20:09,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:20:09,896 INFO L93 Difference]: Finished difference Result 4542 states and 5921 transitions. [2023-02-18 00:20:09,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2023-02-18 00:20:09,897 INFO L78 Accepts]: Start accepts. Automaton has has 155 states, 155 states have (on average 2.967741935483871) internal successors, (460), 155 states have internal predecessors, (460), 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 308 [2023-02-18 00:20:09,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:20:09,910 INFO L225 Difference]: With dead ends: 4542 [2023-02-18 00:20:09,910 INFO L226 Difference]: Without dead ends: 4382 [2023-02-18 00:20:09,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 720 GetRequests, 414 SyntacticMatches, 152 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22800 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=2863, Invalid=21317, Unknown=0, NotChecked=0, Total=24180 [2023-02-18 00:20:09,919 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 197 mSDsluCounter, 18567 mSDsCounter, 0 mSdLazyCounter, 19853 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 18820 SdHoareTripleChecker+Invalid, 19905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 19853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2023-02-18 00:20:09,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 18820 Invalid, 19905 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [52 Valid, 19853 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2023-02-18 00:20:09,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4382 states. [2023-02-18 00:20:10,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4382 to 4186. [2023-02-18 00:20:10,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4186 states, 4185 states have (on average 1.0241338112305853) internal successors, (4286), 4185 states have internal predecessors, (4286), 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 00:20:10,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4186 states to 4186 states and 4286 transitions. [2023-02-18 00:20:10,206 INFO L78 Accepts]: Start accepts. Automaton has 4186 states and 4286 transitions. Word has length 308 [2023-02-18 00:20:10,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:20:10,206 INFO L495 AbstractCegarLoop]: Abstraction has 4186 states and 4286 transitions. [2023-02-18 00:20:10,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 155 states, 155 states have (on average 2.967741935483871) internal successors, (460), 155 states have internal predecessors, (460), 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 00:20:10,207 INFO L276 IsEmpty]: Start isEmpty. Operand 4186 states and 4286 transitions. [2023-02-18 00:20:10,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2023-02-18 00:20:10,210 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:20:10,210 INFO L195 NwaCegarLoop]: trace histogram [102, 101, 52, 50, 1, 1, 1, 1, 1, 1] [2023-02-18 00:20:10,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-02-18 00:20:10,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:20:10,416 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:20:10,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:20:10,416 INFO L85 PathProgramCache]: Analyzing trace with hash -2103022405, now seen corresponding path program 9 times [2023-02-18 00:20:10,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:20:10,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855269398] [2023-02-18 00:20:10,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:20:10,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:20:10,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:20:13,388 INFO L134 CoverageAnalysis]: Checked inductivity of 15453 backedges. 7899 proven. 7410 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-02-18 00:20:13,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:20:13,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855269398] [2023-02-18 00:20:13,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855269398] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 00:20:13,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644816135] [2023-02-18 00:20:13,389 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 00:20:13,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:20:13,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:20:13,390 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 00:20:13,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-18 00:20:13,588 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 102 check-sat command(s) [2023-02-18 00:20:13,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 00:20:13,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 744 conjuncts, 103 conjunts are in the unsatisfiable core [2023-02-18 00:20:13,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 00:20:15,258 INFO L134 CoverageAnalysis]: Checked inductivity of 15453 backedges. 7903 proven. 7401 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2023-02-18 00:20:15,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 00:20:16,992 INFO L134 CoverageAnalysis]: Checked inductivity of 15453 backedges. 7903 proven. 7401 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2023-02-18 00:20:16,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644816135] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 00:20:16,993 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 00:20:16,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 54, 54] total 56 [2023-02-18 00:20:16,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285135980] [2023-02-18 00:20:16,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 00:20:16,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-02-18 00:20:16,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:20:16,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-02-18 00:20:16,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1536, Invalid=1544, Unknown=0, NotChecked=0, Total=3080 [2023-02-18 00:20:16,996 INFO L87 Difference]: Start difference. First operand 4186 states and 4286 transitions. Second operand has 56 states, 56 states have (on average 3.892857142857143) internal successors, (218), 56 states have internal predecessors, (218), 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 00:20:17,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:20:17,250 INFO L93 Difference]: Finished difference Result 4337 states and 4437 transitions. [2023-02-18 00:20:17,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2023-02-18 00:20:17,251 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 3.892857142857143) internal successors, (218), 56 states have internal predecessors, (218), 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 311 [2023-02-18 00:20:17,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:20:17,251 INFO L225 Difference]: With dead ends: 4337 [2023-02-18 00:20:17,252 INFO L226 Difference]: Without dead ends: 0 [2023-02-18 00:20:17,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 724 GetRequests, 467 SyntacticMatches, 203 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7036 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1536, Invalid=1544, Unknown=0, NotChecked=0, Total=3080 [2023-02-18 00:20:17,256 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 00:20:17,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 00:20:17,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-18 00:20:17,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-18 00:20:17,257 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 00:20:17,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-18 00:20:17,258 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 311 [2023-02-18 00:20:17,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:20:17,258 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-18 00:20:17,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 3.892857142857143) internal successors, (218), 56 states have internal predecessors, (218), 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 00:20:17,258 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-18 00:20:17,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-18 00:20:17,261 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-18 00:20:17,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-18 00:20:17,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-02-18 00:20:17,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-18 00:20:17,483 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-18 00:20:17,484 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 33) no Hoare annotation was computed. [2023-02-18 00:20:17,484 INFO L899 garLoopResultBuilder]: For program point L29-2(lines 28 36) no Hoare annotation was computed. [2023-02-18 00:20:17,484 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-02-18 00:20:17,484 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-18 00:20:17,484 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 24 39) the Hoare annotation is: true [2023-02-18 00:20:17,485 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-18 00:20:17,485 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-18 00:20:17,492 INFO L895 garLoopResultBuilder]: At program point L28-2(lines 28 36) the Hoare annotation is: (let ((.cse89 (+ (- 1) |ULTIMATE.start_main_~y~0#1|))) (let ((.cse61 (<= 0 .cse89)) (.cse63 (= .cse89 0)) (.cse114 (= |ULTIMATE.start_main_~y~0#1| 0)) (.cse115 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse1 (+ (- 1) |ULTIMATE.start_main_~x~0#1|))) (let ((.cse27 (+ (- 1) .cse1)) (.cse15 (or .cse115 (and .cse114 .cse115))) (.cse0 (<= 0 (+ (- 2) |ULTIMATE.start_main_~y~0#1|))) (.cse62 (or .cse61 (and .cse61 .cse63))) (.cse67 (<= 1 .cse89))) (let ((.cse2 (<= 0 (+ (- 3) |ULTIMATE.start_main_~y~0#1|))) (.cse5 (<= 2 .cse89)) (.cse130 (or (and .cse0 .cse67) (and .cse62 .cse67))) (.cse14 (not (< |ULTIMATE.start_main_~y~0#1| 0))) (.cse131 (or (and .cse61 .cse62) (and .cse61 .cse15))) (.cse60 (+ (- 1) .cse27)) (.cse25 (+ |ULTIMATE.start_main_~x~0#1| 1))) (let ((.cse3 (<= |ULTIMATE.start_main_~y~0#1| 3)) (.cse36 (<= 34 .cse89)) (.cse37 (<= |ULTIMATE.start_main_~y~0#1| 35)) (.cse30 (<= |ULTIMATE.start_main_~y~0#1| 46)) (.cse29 (<= 45 .cse89)) (.cse43 (<= |ULTIMATE.start_main_~y~0#1| 30)) (.cse42 (<= 29 .cse89)) (.cse53 (<= |ULTIMATE.start_main_~y~0#1| 45)) (.cse54 (<= 44 .cse89)) (.cse26 (<= |ULTIMATE.start_main_~y~0#1| 28)) (.cse28 (<= 27 .cse89)) (.cse34 (<= 12 .cse89)) (.cse35 (<= |ULTIMATE.start_main_~y~0#1| 13)) (.cse40 (<= |ULTIMATE.start_main_~y~0#1| 33)) (.cse41 (<= 32 .cse89)) (.cse59 (<= |ULTIMATE.start_main_~y~0#1| 2)) (.cse51 (<= 22 .cse89)) (.cse52 (<= |ULTIMATE.start_main_~y~0#1| 23)) (.cse47 (<= 48 .cse89)) (.cse48 (<= |ULTIMATE.start_main_~y~0#1| 49)) (.cse4 (< |ULTIMATE.start_main_~x~0#1| 50)) (.cse38 (<= 24 .cse89)) (.cse39 (<= |ULTIMATE.start_main_~y~0#1| 25)) (.cse32 (<= 18 .cse89)) (.cse33 (<= |ULTIMATE.start_main_~y~0#1| 19)) (.cse74 (< .cse25 46)) (.cse70 (<= |ULTIMATE.start_main_~y~0#1| 21)) (.cse69 (<= 20 .cse89)) (.cse24 (<= |ULTIMATE.start_main_~y~0#1| 17)) (.cse23 (<= 16 .cse89)) (.cse84 (< .cse25 45)) (.cse45 (<= |ULTIMATE.start_main_~y~0#1| 47)) (.cse46 (<= 46 .cse89)) (.cse85 (<= |ULTIMATE.start_main_~y~0#1| 10)) (.cse86 (<= 9 .cse89)) (.cse21 (<= 5 .cse89)) (.cse22 (<= |ULTIMATE.start_main_~y~0#1| 6)) (.cse55 (<= |ULTIMATE.start_main_~y~0#1| 26)) (.cse56 (<= 25 .cse89)) (.cse68 (< .cse25 49)) (.cse98 (<= |ULTIMATE.start_main_~y~0#1| 7)) (.cse97 (<= 6 .cse89)) (.cse90 (<= |ULTIMATE.start_main_~y~0#1| 40)) (.cse91 (<= 39 .cse89)) (.cse20 (< .cse25 42)) (.cse102 (< .cse25 43)) (.cse11 (<= 35 .cse89)) (.cse17 (<= |ULTIMATE.start_main_~y~0#1| 36)) (.cse71 (<= 28 .cse89)) (.cse72 (<= |ULTIMATE.start_main_~y~0#1| 29)) (.cse64 (<= |ULTIMATE.start_main_~y~0#1| 24)) (.cse65 (<= 23 .cse89)) (.cse82 (<= |ULTIMATE.start_main_~y~0#1| 43)) (.cse83 (<= 42 .cse89)) (.cse99 (<= 30 .cse89)) (.cse100 (<= |ULTIMATE.start_main_~y~0#1| 31)) (.cse58 (< .cse25 41)) (.cse19 (<= 13 .cse89)) (.cse18 (<= |ULTIMATE.start_main_~y~0#1| 14)) (.cse112 (<= |ULTIMATE.start_main_~y~0#1| 5)) (.cse31 (< .cse25 47)) (.cse113 (<= 0 (+ |ULTIMATE.start_main_~y~0#1| (- 5)))) (.cse96 (<= 10 .cse89)) (.cse95 (<= |ULTIMATE.start_main_~y~0#1| 11)) (.cse87 (<= |ULTIMATE.start_main_~y~0#1| 18)) (.cse88 (<= 17 .cse89)) (.cse106 (<= |ULTIMATE.start_main_~y~0#1| 15)) (.cse107 (<= 14 .cse89)) (.cse92 (< .cse25 44)) (.cse57 (<= |ULTIMATE.start_main_~y~0#1| 4)) (.cse120 (<= 11 .cse89)) (.cse121 (<= |ULTIMATE.start_main_~y~0#1| 12)) (.cse116 (<= |ULTIMATE.start_main_~y~0#1| 37)) (.cse117 (<= 36 .cse89)) (.cse111 (<= |ULTIMATE.start_main_~y~0#1| 32)) (.cse110 (<= 31 .cse89)) (.cse78 (<= |ULTIMATE.start_main_~y~0#1| 48)) (.cse79 (<= 47 .cse89)) (.cse101 (<= 40 .cse89)) (.cse103 (<= |ULTIMATE.start_main_~y~0#1| 41)) (.cse126 (<= |ULTIMATE.start_main_~y~0#1| 38)) (.cse125 (< .cse25 40)) (.cse8 (+ (- 1) .cse60)) (.cse127 (<= 37 .cse89)) (.cse118 (<= |ULTIMATE.start_main_~y~0#1| 39)) (.cse119 (<= 38 .cse89)) (.cse122 (+ |ULTIMATE.start_main_~x~0#1| (- 99))) (.cse76 (<= |ULTIMATE.start_main_~y~0#1| 27)) (.cse77 (<= 26 .cse89)) (.cse124 (<= 41 .cse89)) (.cse123 (<= |ULTIMATE.start_main_~y~0#1| 42)) (.cse104 (<= 33 .cse89)) (.cse105 (<= |ULTIMATE.start_main_~y~0#1| 34)) (.cse7 (<= 8 .cse89)) (.cse9 (<= |ULTIMATE.start_main_~y~0#1| 9)) (.cse93 (<= 15 .cse89)) (.cse94 (<= |ULTIMATE.start_main_~y~0#1| 16)) (.cse73 (<= |ULTIMATE.start_main_~y~0#1| 44)) (.cse13 (<= 0 |ULTIMATE.start_main_~y~0#1|)) (.cse12 (or (and .cse61 .cse14 .cse15) (and .cse61 .cse131))) (.cse10 (or (and .cse0 .cse131) (and .cse130 .cse0))) (.cse75 (<= 43 .cse89)) (.cse16 (or (and .cse130 .cse2) (and .cse0 .cse2 .cse5))) (.cse108 (<= 21 .cse89)) (.cse109 (<= |ULTIMATE.start_main_~y~0#1| 22)) (.cse81 (<= |ULTIMATE.start_main_~y~0#1| 20)) (.cse80 (<= 19 .cse89)) (.cse44 (< .cse25 48)) (.cse66 (< .cse25 50)) (.cse6 (<= 0 (+ |ULTIMATE.start_main_~y~0#1| (- 4)))) (.cse50 (<= 7 .cse89)) (.cse49 (<= |ULTIMATE.start_main_~y~0#1| 8))) (or (and .cse0 (<= |ULTIMATE.start_main_~x~0#1| 3) (= 2 .cse1) .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 (= 5 .cse8) .cse9 .cse0 (<= |ULTIMATE.start_main_~x~0#1| 9) .cse4 .cse5) (and (<= |ULTIMATE.start_main_~x~0#1| 64) (<= 0 (+ (- 64) |ULTIMATE.start_main_~x~0#1|)) (or (and .cse10 .cse11) (and .cse6 .cse11 .cse0 .cse5) (and .cse11 .cse12) (and .cse11 .cse13 .cse14 .cse15) (and .cse11 .cse16)) .cse17) (and (<= |ULTIMATE.start_main_~x~0#1| 14) .cse6 .cse0 (= 13 .cse1) .cse18 .cse19 .cse20 .cse5) (and (or (and .cse13 .cse14 .cse21 .cse15) (and .cse21 .cse16) (and .cse21 .cse12) (and .cse6 .cse0 .cse21 .cse5) (and .cse10 .cse21)) .cse22 (<= 0 (+ (- 94) |ULTIMATE.start_main_~x~0#1|)) (<= |ULTIMATE.start_main_~x~0#1| 94)) (and (<= 0 (+ |ULTIMATE.start_main_~x~0#1| (- 83))) (or (and .cse23 .cse16) (and .cse13 .cse14 .cse23 .cse15) (and .cse10 .cse23) (and .cse23 .cse12) (and .cse6 .cse0 .cse23 .cse5)) .cse24 (<= |ULTIMATE.start_main_~x~0#1| 83)) (and (<= 0 (+ |ULTIMATE.start_main_~x~0#1| (- 97))) (<= |ULTIMATE.start_main_~x~0#1| 97) (or (and .cse13 .cse14 .cse15 .cse2) (and .cse2 .cse16) (and .cse10 .cse2) (and .cse12 .cse2)) .cse3) (and (< .cse25 30) .cse26 .cse6 (= 26 .cse27) .cse0 .cse28 .cse5) (and (or (and .cse13 .cse14 .cse15 .cse29) (and .cse12 .cse29) (and .cse29 .cse16) (and .cse6 .cse0 .cse29 .cse5) (and .cse10 .cse29)) (<= 0 (+ |ULTIMATE.start_main_~x~0#1| (- 54))) (<= |ULTIMATE.start_main_~x~0#1| 54) .cse30) (and .cse6 .cse31 .cse0 (<= |ULTIMATE.start_main_~x~0#1| 19) (= 18 .cse1) .cse32 .cse33 .cse5) (and (or (and .cse12 .cse34) (and .cse13 .cse14 .cse15 .cse34) (and .cse6 .cse0 .cse34 .cse5) (and .cse34 .cse16) (and .cse10 .cse34)) (<= 0 (+ (- 87) |ULTIMATE.start_main_~x~0#1|)) (<= |ULTIMATE.start_main_~x~0#1| 87) .cse35) (and (or (and .cse36 .cse10) (and .cse36 .cse13 .cse14 .cse15) (and .cse36 .cse16) (and .cse36 .cse6 .cse0 .cse5) (and .cse36 .cse12)) .cse37 (<= 0 (+ |ULTIMATE.start_main_~x~0#1| (- 65))) (<= |ULTIMATE.start_main_~x~0#1| 65)) (and (or (and .cse10 .cse38) (and .cse6 .cse0 .cse38 .cse5) (and .cse38 .cse12) (and .cse38 .cse16) (and .cse13 .cse14 .cse38 .cse15)) (<= 0 (+ (- 75) |ULTIMATE.start_main_~x~0#1|)) (<= |ULTIMATE.start_main_~x~0#1| 75) .cse39) (and (<= |ULTIMATE.start_main_~x~0#1| 67) (<= 0 (+ (- 67) |ULTIMATE.start_main_~x~0#1|)) .cse40 (or (and .cse13 .cse14 .cse15 .cse41) (and .cse12 .cse41) (and .cse10 .cse41) (and .cse41 .cse16) (and .cse6 .cse0 .cse41 .cse5))) (and .cse36 .cse6 .cse37 (= 33 .cse27) .cse0 (< .cse25 37) .cse5) (and .cse42 .cse6 .cse0 (< .cse25 32) (= 28 .cse27) .cse43 .cse5) (and .cse6 .cse30 .cse0 (= 45 .cse1) .cse29 .cse44 .cse5) (and .cse45 (or (and .cse6 .cse46 .cse0 .cse5) (and .cse10 .cse46) (and .cse46 .cse12) (and .cse46 .cse16)) (<= |ULTIMATE.start_main_~x~0#1| 53) (<= 0 (+ (- 53) |ULTIMATE.start_main_~x~0#1|))) (and (<= 0 (+ (- 51) |ULTIMATE.start_main_~x~0#1|)) (or (and .cse47 .cse16) (and .cse47 .cse6 .cse0 .cse5)) .cse48 (<= |ULTIMATE.start_main_~x~0#1| 51)) (and (<= |ULTIMATE.start_main_~x~0#1| 92) (<= 0 (+ |ULTIMATE.start_main_~x~0#1| (- 92))) .cse49 (or (and .cse50 .cse13 .cse14 .cse15) (and .cse50 .cse12) (and .cse6 .cse50 .cse0 .cse5) (and .cse50 .cse10) (and .cse50 .cse16))) (and .cse6 .cse51 (<= |ULTIMATE.start_main_~x~0#1| 23) .cse0 (= 22 .cse1) .cse52 .cse4 .cse5) (and .cse6 .cse31 .cse53 .cse0 (= 44 .cse1) .cse54 .cse5) (and (<= |ULTIMATE.start_main_~x~0#1| 74) .cse55 (<= 0 (+ |ULTIMATE.start_main_~x~0#1| (- 74))) (or (and .cse10 .cse56) (and .cse13 .cse56 .cse14 .cse15) (and .cse56 .cse16) (and .cse56 .cse12) (and .cse6 .cse56 .cse0 .cse5))) (and (<= |ULTIMATE.start_main_~x~0#1| 70) .cse43 (or (and .cse42 .cse6 .cse0 .cse5) (and .cse42 .cse10) (and .cse42 .cse12) (and .cse42 .cse16) (and .cse42 .cse13 .cse14 .cse15)) (<= 0 (+ |ULTIMATE.start_main_~x~0#1| (- 70)))) (and .cse53 (<= |ULTIMATE.start_main_~x~0#1| 55) (or (and .cse54 .cse16) (and .cse10 .cse54) (and .cse54 .cse12) (and .cse13 .cse14 .cse54 .cse15) (and .cse6 .cse0 .cse54 .cse5)) (<= 0 (+ (- 55) |ULTIMATE.start_main_~x~0#1|))) (and (<= 0 (+ (- 72) |ULTIMATE.start_main_~x~0#1|)) .cse26 (or (and .cse13 .cse14 .cse15 .cse28) (and .cse28 .cse16) (and .cse10 .cse28) (and .cse6 .cse0 .cse28 .cse5) (and .cse12 .cse28)) (<= |ULTIMATE.start_main_~x~0#1| 72)) (and (or (and .cse6 .cse0 .cse5) (and .cse6 .cse13 .cse14 .cse15) (and .cse6 .cse16) (and .cse6 .cse10) (and .cse6 .cse12)) .cse57 (<= |ULTIMATE.start_main_~x~0#1| 96) (<= 0 (+ |ULTIMATE.start_main_~x~0#1| (- 96)))) (and .cse6 .cse0 (<= |ULTIMATE.start_main_~x~0#1| 13) .cse58 .cse34 .cse35 .cse5 (= 12 .cse1)) (and .cse59 (<= |ULTIMATE.start_main_~x~0#1| 98) (<= 0 (+ (- 98) |ULTIMATE.start_main_~x~0#1|)) (or (and .cse0 .cse12) (and .cse10 .cse0) (and .cse13 .cse0 .cse14 .cse15))) (and .cse6 .cse0 .cse40 .cse41 (< .cse25 35) (= 30 .cse60) .cse5) (and (= .cse1 0) .cse61 .cse62 .cse63 (<= |ULTIMATE.start_main_~x~0#1| 1)) (and .cse64 (<= 0 (+ (- 76) |ULTIMATE.start_main_~x~0#1|)) (or (and .cse10 .cse65) (and .cse65 .cse16) (and .cse65 .cse13 .cse14 .cse15) (and .cse6 .cse65 .cse0 .cse5) (and .cse65 .cse12)) (<= |ULTIMATE.start_main_~x~0#1| 76)) (and .cse66 .cse59 .cse0 (= 0 .cse27) (<= |ULTIMATE.start_main_~x~0#1| 2) .cse67) (and (<= 0 (+ (- 77) |ULTIMATE.start_main_~x~0#1|)) (or (and .cse10 .cse51) (and .cse51 .cse12) (and .cse6 .cse51 .cse0 .cse5) (and .cse51 .cse16) (and .cse51 .cse13 .cse14 .cse15)) (<= |ULTIMATE.start_main_~x~0#1| 77) .cse52) (and .cse6 .cse68 .cse69 (<= |ULTIMATE.start_main_~x~0#1| 21) .cse0 .cse70 (= 19 .cse27) .cse5) (and .cse47 .cse6 (= 48 .cse1) .cse0 .cse48 .cse4 .cse5) (and (<= 0 (+ (- 71) |ULTIMATE.start_main_~x~0#1|)) (or (and .cse10 .cse71) (and .cse71 .cse12) (and .cse6 .cse0 .cse71 .cse5) (and .cse13 .cse14 .cse15 .cse71) (and .cse71 .cse16)) (<= |ULTIMATE.start_main_~x~0#1| 71) .cse72) (and .cse6 (= 23 .cse27) .cse0 (< .cse25 27) .cse38 .cse39 .cse5) (and .cse6 .cse73 (= 43 .cse1) .cse0 .cse74 .cse75 .cse5) (and .cse76 (<= 0 (+ |ULTIMATE.start_main_~x~0#1| (- 73))) (<= |ULTIMATE.start_main_~x~0#1| 73) (or (and .cse12 .cse77) (and .cse13 .cse14 .cse15 .cse77) (and .cse10 .cse77) (and .cse6 .cse0 .cse77 .cse5) (and .cse77 .cse16))) (and .cse78 (or (and .cse79 .cse16) (and .cse10 .cse79) (and .cse6 .cse79 .cse0 .cse5)) (<= 0 (+ |ULTIMATE.start_main_~x~0#1| (- 52))) (<= |ULTIMATE.start_main_~x~0#1| 52)) (and (or (and .cse6 .cse0 .cse32 .cse5) (and .cse12 .cse32) (and .cse10 .cse32) (and .cse13 .cse14 .cse15 .cse32) (and .cse32 .cse16)) (<= |ULTIMATE.start_main_~x~0#1| 81) .cse33 (<= 0 (+ |ULTIMATE.start_main_~x~0#1| (- 81)))) (and (<= 0 (+ (- 80) |ULTIMATE.start_main_~x~0#1|)) (or (and .cse80 .cse16) (and .cse6 .cse0 .cse80 .cse5) (and .cse10 .cse80) (and .cse12 .cse80) (and .cse13 .cse14 .cse15 .cse80)) .cse81 (<= |ULTIMATE.start_main_~x~0#1| 80)) (and .cse82 .cse6 .cse83 .cse0 (= 41 .cse27) .cse84 .cse5) (and .cse6 .cse85 .cse0 (<= |ULTIMATE.start_main_~x~0#1| 10) (= 9 .cse1) .cse86 .cse5) (and .cse6 .cse87 .cse88 .cse0 .cse74 (= 16 .cse27) (<= |ULTIMATE.start_main_~x~0#1| 18) .cse5) (and .cse70 (<= 0 (+ (- 79) |ULTIMATE.start_main_~x~0#1|)) (<= |ULTIMATE.start_main_~x~0#1| 79) (or (and .cse69 .cse16) (and .cse10 .cse69) (and .cse6 .cse69 .cse0 .cse5) (and .cse69 .cse12) (and .cse13 .cse69 .cse14 .cse15))) (and .cse6 (<= |ULTIMATE.start_main_~x~0#1| 50) .cse0 (<= 0 (+ |ULTIMATE.start_main_~x~0#1| (- 50))) (<= |ULTIMATE.start_main_~y~0#1| 50) (<= 49 .cse89) .cse5) (and .cse6 .cse0 .cse24 .cse23 (<= |ULTIMATE.start_main_~x~0#1| 17) .cse84 (= 16 .cse1) .cse5) (and .cse6 .cse68 .cse45 .cse46 .cse0 (= 46 .cse1) .cse5) (and .cse90 (<= |ULTIMATE.start_main_~x~0#1| 60) (or (and .cse13 .cse91 .cse14 .cse15) (and .cse91 .cse16) (and .cse10 .cse91) (and .cse6 .cse91 .cse0 .cse5) (and .cse91 .cse12)) (<= 0 (+ |ULTIMATE.start_main_~x~0#1| (- 60)))) (and (<= |ULTIMATE.start_main_~x~0#1| 90) .cse85 (<= 0 (+ |ULTIMATE.start_main_~x~0#1| (- 90))) (or (and .cse86 .cse16) (and .cse10 .cse86) (and .cse13 .cse14 .cse15 .cse86) (and .cse6 .cse0 .cse86 .cse5) (and .cse12 .cse86))) (and .cse6 .cse0 (= 15 .cse1) .cse92 (<= |ULTIMATE.start_main_~x~0#1| 16) .cse93 .cse94 .cse5) (and (<= |ULTIMATE.start_main_~x~0#1| 89) .cse95 (<= 0 (+ (- 89) |ULTIMATE.start_main_~x~0#1|)) (or (and .cse96 .cse16) (and .cse13 .cse14 .cse96 .cse15) (and .cse6 .cse0 .cse96 .cse5) (and .cse96 .cse12) (and .cse10 .cse96))) (and .cse6 .cse0 .cse21 (= 5 .cse1) .cse22 .cse44 (<= |ULTIMATE.start_main_~x~0#1| 6) .cse5) (and .cse6 .cse55 (< .cse25 28) .cse56 .cse0 (= 23 .cse60) .cse5) (and .cse97 .cse6 .cse68 .cse98 .cse0 (= 5 .cse27) (<= |ULTIMATE.start_main_~x~0#1| 7) .cse5) (and .cse98 (or (and .cse97 .cse13 .cse14 .cse15) (and .cse97 .cse10) (and .cse97 .cse12) (and .cse97 .cse6 .cse0 .cse5) (and .cse97 .cse16)) (<= 0 (+ |ULTIMATE.start_main_~x~0#1| (- 93))) (<= |ULTIMATE.start_main_~x~0#1| 93)) (and .cse6 .cse0 (= 30 .cse1) (< .cse25 33) .cse99 .cse100 .cse5) (and .cse90 .cse6 .cse91 .cse0 (= 39 .cse1) .cse20 .cse5) (and .cse6 .cse0 .cse101 .cse102 .cse103 (= 39 .cse27) .cse5) (and (<= |ULTIMATE.start_main_~x~0#1| 66) (or (and .cse104 .cse12) (and .cse104 .cse13 .cse14 .cse15) (and .cse6 .cse104 .cse0 .cse5) (and .cse104 .cse16) (and .cse104 .cse10)) (<= 0 (+ |ULTIMATE.start_main_~x~0#1| (- 66))) .cse105) (and .cse106 .cse6 .cse0 (<= |ULTIMATE.start_main_~x~0#1| 15) .cse107 .cse102 (= 13 .cse27) .cse5) (and .cse6 (= 33 .cse60) .cse11 .cse0 .cse17 .cse5 (< .cse25 38)) (and (or (and .cse10 .cse108) (and .cse108 .cse16) (and .cse6 .cse108 .cse0 .cse5) (and .cse13 .cse108 .cse14 .cse15) (and .cse108 .cse12)) (<= 0 (+ |ULTIMATE.start_main_~x~0#1| (- 78))) (<= |ULTIMATE.start_main_~x~0#1| 78) .cse109) (and (= 28 .cse1) .cse6 (< .cse25 31) .cse0 .cse71 .cse72 .cse5) (and .cse64 .cse6 (= 23 .cse1) .cse65 .cse0 (<= |ULTIMATE.start_main_~x~0#1| 24) .cse5) (and .cse82 (or (and .cse83 .cse12) (and .cse83 .cse16) (and .cse83 .cse13 .cse14 .cse15) (and .cse6 .cse83 .cse0 .cse5) (and .cse83 .cse10)) (<= 0 (+ |ULTIMATE.start_main_~x~0#1| (- 57))) (<= |ULTIMATE.start_main_~x~0#1| 57)) (and (or (and .cse13 .cse14 .cse15 .cse110) (and .cse10 .cse110) (and .cse16 .cse110) (and .cse6 .cse0 .cse110 .cse5) (and .cse12 .cse110)) .cse111 (<= |ULTIMATE.start_main_~x~0#1| 68) (<= 0 (+ |ULTIMATE.start_main_~x~0#1| (- 68)))) (and .cse112 (<= |ULTIMATE.start_main_~x~0#1| 95) (<= 0 (+ |ULTIMATE.start_main_~x~0#1| (- 95))) (or (and .cse13 .cse14 .cse15 .cse113) (and .cse16 .cse113) (and .cse12 .cse113) (and .cse6 .cse0 .cse113 .cse5) (and .cse10 .cse113))) (and (<= 0 (+ (- 69) |ULTIMATE.start_main_~x~0#1|)) (or (and .cse12 .cse99) (and .cse13 .cse14 .cse15 .cse99) (and .cse10 .cse99) (and .cse16 .cse99) (and .cse6 .cse0 .cse99 .cse5)) .cse100 (<= |ULTIMATE.start_main_~x~0#1| 69)) (and .cse13 .cse14 .cse114 .cse115 (= |ULTIMATE.start_main_~x~0#1| 0)) (and (<= |ULTIMATE.start_main_~x~0#1| 63) .cse116 (or (and .cse117 .cse16) (and .cse117 .cse12) (and .cse10 .cse117) (and .cse13 .cse117 .cse14 .cse15) (and .cse6 .cse117 .cse0 .cse5)) (<= 0 (+ (- 63) |ULTIMATE.start_main_~x~0#1|))) (and .cse6 .cse118 .cse0 .cse119 .cse58 (= 38 .cse1) .cse5) (and (or (and .cse120 .cse6 .cse0 .cse5) (and .cse120 .cse16) (and .cse120 .cse12) (and .cse120 .cse10) (and .cse120 .cse13 .cse14 .cse15)) .cse121 (<= 0 (+ (- 88) |ULTIMATE.start_main_~x~0#1|)) (<= |ULTIMATE.start_main_~x~0#1| 88)) (and (<= 0 .cse122) (<= |ULTIMATE.start_main_~y~0#1| 1) (or (and .cse61 .cse12) (and .cse13 .cse61 .cse14 .cse15)) (<= |ULTIMATE.start_main_~x~0#1| 99)) (and (<= 0 (+ (- 86) |ULTIMATE.start_main_~x~0#1|)) (<= |ULTIMATE.start_main_~x~0#1| 86) (or (and .cse10 .cse19) (and .cse6 .cse0 .cse19 .cse5) (and .cse13 .cse14 .cse15 .cse19) (and .cse19 .cse16) (and .cse19 .cse12)) .cse18) (and (<= |ULTIMATE.start_main_~x~0#1| 5) .cse6 .cse112 .cse31 .cse0 (= 2 .cse60) .cse113 .cse5) (and .cse6 (= 9 .cse27) .cse0 (<= |ULTIMATE.start_main_~x~0#1| 11) .cse96 .cse95 .cse5) (and (<= 0 (+ |ULTIMATE.start_main_~x~0#1| (- 82))) .cse87 (<= |ULTIMATE.start_main_~x~0#1| 82) (or (and .cse6 .cse88 .cse0 .cse5) (and .cse88 .cse16) (and .cse13 .cse88 .cse14 .cse15) (and .cse10 .cse88) (and .cse88 .cse12))) (and .cse106 (<= 0 (+ |ULTIMATE.start_main_~x~0#1| (- 85))) (<= |ULTIMATE.start_main_~x~0#1| 85) (or (and .cse107 .cse12) (and .cse6 .cse0 .cse107 .cse5) (and .cse107 .cse16) (and .cse10 .cse107) (and .cse13 .cse14 .cse15 .cse107))) (and (= 41 .cse1) .cse6 .cse0 .cse123 .cse92 .cse124 .cse5) (and .cse6 .cse57 (<= |ULTIMATE.start_main_~x~0#1| 4) .cse0 (= 2 .cse27) .cse5) (and .cse120 .cse6 (= 9 .cse60) .cse125 .cse121 .cse0 (<= |ULTIMATE.start_main_~x~0#1| 12) .cse5) (and .cse6 .cse116 .cse117 .cse0 (= .cse8 33) (< .cse25 39) .cse5) (and .cse6 (< .cse25 34) .cse0 .cse111 (= 30 .cse27) .cse110 .cse5) (and .cse66 .cse78 .cse6 .cse79 .cse0 (= 47 .cse1) .cse5) (and .cse126 (or (and .cse13 .cse14 .cse15 .cse127) (and .cse16 .cse127) (and .cse6 .cse0 .cse127 .cse5) (and .cse12 .cse127) (and .cse10 .cse127)) (<= 0 (+ (- 62) |ULTIMATE.start_main_~x~0#1|)) (<= |ULTIMATE.start_main_~x~0#1| 62)) (and (<= 0 (+ (- 59) |ULTIMATE.start_main_~x~0#1|)) (or (and .cse101 .cse16) (and .cse6 .cse0 .cse101 .cse5) (and .cse13 .cse14 .cse15 .cse101) (and .cse101 .cse12) (and .cse10 .cse101)) (<= |ULTIMATE.start_main_~x~0#1| 59) .cse103) (and .cse6 .cse126 .cse125 .cse0 (= (+ (- 1) .cse8) 33) .cse127 .cse5) (and (<= |ULTIMATE.start_main_~x~0#1| 61) .cse118 (or (and .cse10 .cse119) (and .cse6 .cse0 .cse119 .cse5) (and .cse119 .cse16) (and .cse119 .cse12) (and .cse13 .cse14 .cse15 .cse119)) (<= 0 (+ (- 61) |ULTIMATE.start_main_~x~0#1|))) (let ((.cse128 (+ (- 100) |ULTIMATE.start_main_~x~0#1|)) (.cse129 (<= .cse122 0))) (and (or (<= 0 .cse128) (not .cse129)) .cse13 .cse14 .cse114 .cse15 (or (<= .cse128 0) (<= |ULTIMATE.start_main_~x~0#1| 100) .cse129))) (and .cse76 .cse6 (< .cse25 29) .cse0 (= 26 .cse1) .cse77 .cse5) (and (or (and .cse10 .cse124) (and .cse124 .cse16) (and .cse6 .cse0 .cse124 .cse5) (and .cse13 .cse14 .cse15 .cse124) (and .cse124 .cse12)) (<= 0 (+ (- 58) |ULTIMATE.start_main_~x~0#1|)) .cse123 (<= |ULTIMATE.start_main_~x~0#1| 58)) (and .cse6 .cse104 (< .cse25 36) .cse0 .cse105 .cse5 (= 33 .cse1)) (and (<= |ULTIMATE.start_main_~x~0#1| 91) (or (and .cse7 .cse16) (and .cse7 .cse12) (and .cse13 .cse7 .cse14 .cse15) (and .cse6 .cse7 .cse0 .cse5) (and .cse10 .cse7)) .cse9 (<= 0 (+ (- 91) |ULTIMATE.start_main_~x~0#1|))) (and (<= |ULTIMATE.start_main_~x~0#1| 84) (<= 0 (+ |ULTIMATE.start_main_~x~0#1| (- 84))) (or (and .cse6 .cse0 .cse93 .cse5) (and .cse10 .cse93) (and .cse12 .cse93) (and .cse93 .cse16) (and .cse13 .cse14 .cse15 .cse93)) .cse94) (and (<= |ULTIMATE.start_main_~x~0#1| 56) .cse73 (or (and .cse13 .cse14 .cse15 .cse75) (and .cse12 .cse75) (and .cse10 .cse75) (and .cse6 .cse0 .cse75 .cse5) (and .cse75 .cse16)) (<= 0 (+ |ULTIMATE.start_main_~x~0#1| (- 56)))) (and (<= |ULTIMATE.start_main_~x~0#1| 22) .cse66 .cse6 .cse108 (= 21 .cse1) .cse0 .cse109 .cse5) (and .cse6 .cse0 (= 19 .cse1) .cse81 .cse80 (<= |ULTIMATE.start_main_~x~0#1| 20) .cse44 .cse5) (and .cse66 .cse6 (= 5 .cse60) .cse50 .cse0 (<= |ULTIMATE.start_main_~x~0#1| 8) .cse49 .cse5))))))) [2023-02-18 00:20:17,495 INFO L899 garLoopResultBuilder]: For program point L28-3(lines 28 36) no Hoare annotation was computed. [2023-02-18 00:20:17,496 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-02-18 00:20:17,496 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2023-02-18 00:20:17,496 INFO L902 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: true [2023-02-18 00:20:17,502 INFO L445 BasicCegarLoop]: Path program histogram: [9, 1, 1, 1, 1] [2023-02-18 00:20:17,504 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 00:20:17,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 12:20:17 BoogieIcfgContainer [2023-02-18 00:20:17,613 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 00:20:17,613 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 00:20:17,613 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 00:20:17,614 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 00:20:17,614 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 12:19:38" (3/4) ... [2023-02-18 00:20:17,616 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-18 00:20:17,626 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2023-02-18 00:20:17,627 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-02-18 00:20:17,627 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-18 00:20:17,627 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-18 00:20:17,670 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 00:20:17,670 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 00:20:17,671 INFO L158 Benchmark]: Toolchain (without parser) took 39490.63ms. Allocated memory was 142.6MB in the beginning and 551.6MB in the end (delta: 408.9MB). Free memory was 96.2MB in the beginning and 362.6MB in the end (delta: -266.5MB). Peak memory consumption was 145.3MB. Max. memory is 16.1GB. [2023-02-18 00:20:17,671 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 142.6MB. Free memory is still 108.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 00:20:17,671 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.76ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 85.7MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 00:20:17,672 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.60ms. Allocated memory is still 142.6MB. Free memory was 85.7MB in the beginning and 84.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 00:20:17,672 INFO L158 Benchmark]: Boogie Preprocessor took 24.99ms. Allocated memory is still 142.6MB. Free memory was 84.4MB in the beginning and 83.4MB in the end (delta: 938.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 00:20:17,672 INFO L158 Benchmark]: RCFGBuilder took 208.96ms. Allocated memory is still 142.6MB. Free memory was 83.4MB in the beginning and 74.3MB in the end (delta: 9.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 00:20:17,672 INFO L158 Benchmark]: TraceAbstraction took 38946.50ms. Allocated memory was 142.6MB in the beginning and 551.6MB in the end (delta: 408.9MB). Free memory was 73.5MB in the beginning and 365.9MB in the end (delta: -292.4MB). Peak memory consumption was 118.1MB. Max. memory is 16.1GB. [2023-02-18 00:20:17,673 INFO L158 Benchmark]: Witness Printer took 56.79ms. Allocated memory is still 551.6MB. Free memory was 365.9MB in the beginning and 362.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-18 00:20:17,675 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.20ms. Allocated memory is still 142.6MB. Free memory is still 108.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 221.76ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 85.7MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.60ms. Allocated memory is still 142.6MB. Free memory was 85.7MB in the beginning and 84.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.99ms. Allocated memory is still 142.6MB. Free memory was 84.4MB in the beginning and 83.4MB in the end (delta: 938.0kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 208.96ms. Allocated memory is still 142.6MB. Free memory was 83.4MB in the beginning and 74.3MB in the end (delta: 9.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 38946.50ms. Allocated memory was 142.6MB in the beginning and 551.6MB in the end (delta: 408.9MB). Free memory was 73.5MB in the beginning and 365.9MB in the end (delta: -292.4MB). Peak memory consumption was 118.1MB. Max. memory is 16.1GB. * Witness Printer took 56.79ms. Allocated memory is still 551.6MB. Free memory was 365.9MB in the beginning and 362.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. 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: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 38.8s, OverallIterations: 13, TraceHistogramMax: 102, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 229 SdHoareTripleChecker+Valid, 6.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 229 mSDsluCounter, 19459 SdHoareTripleChecker+Invalid, 5.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19055 mSDsCounter, 241 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21064 IncrementalHoareTripleChecker+Invalid, 21305 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 241 mSolverCounterUnsat, 404 mSDtfsCounter, 21064 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2678 GetRequests, 1796 SyntacticMatches, 444 SemanticMatches, 438 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35739 ImplicationChecksByTransitivity, 20.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4186occurred in iteration=12, InterpolantAutomatonStates: 353, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 829 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 106 NumberOfFragments, 15561 HoareAnnotationTreeSize, 3 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 26.4s InterpolantComputationTime, 2402 NumberOfCodeBlocks, 2297 NumberOfCodeBlocksAsserted, 184 NumberOfCheckSat, 3549 ConstructedInterpolants, 0 QuantifiedInterpolants, 14168 SizeOfPredicates, 12 NumberOfNonLiveVariables, 2715 ConjunctsInSsa, 438 ConjunctsInUnsatCore, 32 InterpolantComputations, 4 PerfectInterpolantSequences, 51924/123324 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= -2 + y && x <= 3) && 2 == -1 + x) && 0 <= -3 + y) && y <= 3) && x < 50) && 2 <= -1 + y) || (((((((0 <= y + -4 && 8 <= -1 + y) && 5 == -1 + (-1 + (-1 + (-1 + x)))) && y <= 9) && 0 <= -2 + y) && x <= 9) && x < 50) && 2 <= -1 + y)) || (((x <= 64 && 0 <= -64 + x) && (((((((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y)) && 35 <= -1 + y) || (((0 <= y + -4 && 35 <= -1 + y) && 0 <= -2 + y) && 2 <= -1 + y)) || (35 <= -1 + y && (((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0)))))))) || (((35 <= -1 + y && 0 <= y) && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0)))) || (35 <= -1 + y && ((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y))))) && y <= 36)) || (((((((x <= 14 && 0 <= y + -4) && 0 <= -2 + y) && 13 == -1 + x) && y <= 14) && 13 <= -1 + y) && x + 1 < 42) && 2 <= -1 + y)) || ((((((((((0 <= y && !(y < 0)) && 5 <= -1 + y) && (y >= 0 || (y == 0 && y >= 0))) || (5 <= -1 + y && ((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y)))) || (5 <= -1 + y && (((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0)))))))) || (((0 <= y + -4 && 0 <= -2 + y) && 5 <= -1 + y) && 2 <= -1 + y)) || (((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y)) && 5 <= -1 + y)) && y <= 6) && 0 <= -94 + x) && x <= 94)) || (((0 <= x + -83 && (((((16 <= -1 + y && ((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y))) || (((0 <= y && !(y < 0)) && 16 <= -1 + y) && (y >= 0 || (y == 0 && y >= 0)))) || (((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y)) && 16 <= -1 + y)) || (16 <= -1 + y && (((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0)))))))) || (((0 <= y + -4 && 0 <= -2 + y) && 16 <= -1 + y) && 2 <= -1 + y))) && y <= 17) && x <= 83)) || (((0 <= x + -97 && x <= 97) && ((((((0 <= y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) && 0 <= -3 + y) || (0 <= -3 + y && ((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y)))) || (((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y)) && 0 <= -3 + y)) || ((((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0)))))) && 0 <= -3 + y))) && y <= 3)) || ((((((x + 1 < 30 && y <= 28) && 0 <= y + -4) && 26 == -1 + (-1 + x)) && 0 <= -2 + y) && 27 <= -1 + y) && 2 <= -1 + y)) || ((((((((((0 <= y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) && 45 <= -1 + y) || ((((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0)))))) && 45 <= -1 + y)) || (45 <= -1 + y && ((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y)))) || (((0 <= y + -4 && 0 <= -2 + y) && 45 <= -1 + y) && 2 <= -1 + y)) || (((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y)) && 45 <= -1 + y)) && 0 <= x + -54) && x <= 54) && y <= 46)) || (((((((0 <= y + -4 && x + 1 < 47) && 0 <= -2 + y) && x <= 19) && 18 == -1 + x) && 18 <= -1 + y) && y <= 19) && 2 <= -1 + y)) || (((((((((((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0)))))) && 12 <= -1 + y) || (((0 <= y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) && 12 <= -1 + y)) || (((0 <= y + -4 && 0 <= -2 + y) && 12 <= -1 + y) && 2 <= -1 + y)) || (12 <= -1 + y && ((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y)))) || (((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y)) && 12 <= -1 + y)) && 0 <= -87 + x) && x <= 87) && y <= 13)) || ((((((((34 <= -1 + y && ((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y))) || (((34 <= -1 + y && 0 <= y) && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0)))) || (34 <= -1 + y && ((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y)))) || (((34 <= -1 + y && 0 <= y + -4) && 0 <= -2 + y) && 2 <= -1 + y)) || (34 <= -1 + y && (((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0)))))))) && y <= 35) && 0 <= x + -65) && x <= 65)) || ((((((((((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y)) && 24 <= -1 + y) || (((0 <= y + -4 && 0 <= -2 + y) && 24 <= -1 + y) && 2 <= -1 + y)) || (24 <= -1 + y && (((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0)))))))) || (24 <= -1 + y && ((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y)))) || (((0 <= y && !(y < 0)) && 24 <= -1 + y) && (y >= 0 || (y == 0 && y >= 0)))) && 0 <= -75 + x) && x <= 75) && y <= 25)) || (((x <= 67 && 0 <= -67 + x) && y <= 33) && (((((((0 <= y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) && 32 <= -1 + y) || ((((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0)))))) && 32 <= -1 + y)) || (((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y)) && 32 <= -1 + y)) || (32 <= -1 + y && ((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y)))) || (((0 <= y + -4 && 0 <= -2 + y) && 32 <= -1 + y) && 2 <= -1 + y)))) || ((((((34 <= -1 + y && 0 <= y + -4) && y <= 35) && 33 == -1 + (-1 + x)) && 0 <= -2 + y) && x + 1 < 37) && 2 <= -1 + y)) || ((((((29 <= -1 + y && 0 <= y + -4) && 0 <= -2 + y) && x + 1 < 32) && 28 == -1 + (-1 + x)) && y <= 30) && 2 <= -1 + y)) || ((((((0 <= y + -4 && y <= 46) && 0 <= -2 + y) && 45 == -1 + x) && 45 <= -1 + y) && x + 1 < 48) && 2 <= -1 + y)) || (((y <= 47 && ((((((0 <= y + -4 && 46 <= -1 + y) && 0 <= -2 + y) && 2 <= -1 + y) || (((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y)) && 46 <= -1 + y)) || (46 <= -1 + y && (((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0)))))))) || (46 <= -1 + y && ((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y))))) && x <= 53) && 0 <= -53 + x)) || (((0 <= -51 + x && ((48 <= -1 + y && ((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y))) || (((48 <= -1 + y && 0 <= y + -4) && 0 <= -2 + y) && 2 <= -1 + y))) && y <= 49) && x <= 51)) || (((x <= 92 && 0 <= x + -92) && y <= 8) && (((((((7 <= -1 + y && 0 <= y) && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (7 <= -1 + y && (((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0)))))))) || (((0 <= y + -4 && 7 <= -1 + y) && 0 <= -2 + y) && 2 <= -1 + y)) || (7 <= -1 + y && ((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y)))) || (7 <= -1 + y && ((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y)))))) || (((((((0 <= y + -4 && 22 <= -1 + y) && x <= 23) && 0 <= -2 + y) && 22 == -1 + x) && y <= 23) && x < 50) && 2 <= -1 + y)) || ((((((0 <= y + -4 && x + 1 < 47) && y <= 45) && 0 <= -2 + y) && 44 == -1 + x) && 44 <= -1 + y) && 2 <= -1 + y)) || (((x <= 74 && y <= 26) && 0 <= x + -74) && (((((((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y)) && 25 <= -1 + y) || (((0 <= y && 25 <= -1 + y) && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0)))) || (25 <= -1 + y && ((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y)))) || (25 <= -1 + y && (((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0)))))))) || (((0 <= y + -4 && 25 <= -1 + y) && 0 <= -2 + y) && 2 <= -1 + y)))) || (((x <= 70 && y <= 30) && (((((((29 <= -1 + y && 0 <= y + -4) && 0 <= -2 + y) && 2 <= -1 + y) || (29 <= -1 + y && ((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y)))) || (29 <= -1 + y && (((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0)))))))) || (29 <= -1 + y && ((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y)))) || (((29 <= -1 + y && 0 <= y) && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))))) && 0 <= x + -70)) || (((y <= 45 && x <= 55) && (((((44 <= -1 + y && ((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y))) || (((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y)) && 44 <= -1 + y)) || (44 <= -1 + y && (((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0)))))))) || (((0 <= y && !(y < 0)) && 44 <= -1 + y) && (y >= 0 || (y == 0 && y >= 0)))) || (((0 <= y + -4 && 0 <= -2 + y) && 44 <= -1 + y) && 2 <= -1 + y))) && 0 <= -55 + x)) || (((0 <= -72 + x && y <= 28) && (((((((0 <= y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) && 27 <= -1 + y) || (27 <= -1 + y && ((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y)))) || (((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y)) && 27 <= -1 + y)) || (((0 <= y + -4 && 0 <= -2 + y) && 27 <= -1 + y) && 2 <= -1 + y)) || ((((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0)))))) && 27 <= -1 + y))) && x <= 72)) || (((((((((0 <= y + -4 && 0 <= -2 + y) && 2 <= -1 + y) || (((0 <= y + -4 && 0 <= y) && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0)))) || (0 <= y + -4 && ((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y)))) || (0 <= y + -4 && ((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y)))) || (0 <= y + -4 && (((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0)))))))) && y <= 4) && x <= 96) && 0 <= x + -96)) || (((((((0 <= y + -4 && 0 <= -2 + y) && x <= 13) && x + 1 < 41) && 12 <= -1 + y) && y <= 13) && 2 <= -1 + y) && 12 == -1 + x)) || (((y <= 2 && x <= 98) && 0 <= -98 + x) && (((0 <= -2 + y && (((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))))) || (((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y)) && 0 <= -2 + y)) || (((0 <= y && 0 <= -2 + y) && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0)))))) || ((((((0 <= y + -4 && 0 <= -2 + y) && y <= 33) && 32 <= -1 + y) && x + 1 < 35) && 30 == -1 + (-1 + (-1 + x))) && 2 <= -1 + y)) || ((((-1 + x == 0 && 0 <= -1 + y) && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) && -1 + y == 0) && x <= 1)) || (((y <= 24 && 0 <= -76 + x) && (((((((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y)) && 23 <= -1 + y) || (23 <= -1 + y && ((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y)))) || (((23 <= -1 + y && 0 <= y) && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0)))) || (((0 <= y + -4 && 23 <= -1 + y) && 0 <= -2 + y) && 2 <= -1 + y)) || (23 <= -1 + y && (((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))))))) && x <= 76)) || (((((x + 1 < 50 && y <= 2) && 0 <= -2 + y) && 0 == -1 + (-1 + x)) && x <= 2) && 1 <= -1 + y)) || (((0 <= -77 + x && (((((((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y)) && 22 <= -1 + y) || (22 <= -1 + y && (((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0)))))))) || (((0 <= y + -4 && 22 <= -1 + y) && 0 <= -2 + y) && 2 <= -1 + y)) || (22 <= -1 + y && ((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y)))) || (((22 <= -1 + y && 0 <= y) && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))))) && x <= 77) && y <= 23)) || (((((((0 <= y + -4 && x + 1 < 49) && 20 <= -1 + y) && x <= 21) && 0 <= -2 + y) && y <= 21) && 19 == -1 + (-1 + x)) && 2 <= -1 + y)) || ((((((48 <= -1 + y && 0 <= y + -4) && 48 == -1 + x) && 0 <= -2 + y) && y <= 49) && x < 50) && 2 <= -1 + y)) || (((0 <= -71 + x && (((((((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y)) && 28 <= -1 + y) || (28 <= -1 + y && (((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0)))))))) || (((0 <= y + -4 && 0 <= -2 + y) && 28 <= -1 + y) && 2 <= -1 + y)) || (((0 <= y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) && 28 <= -1 + y)) || (28 <= -1 + y && ((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y))))) && x <= 71) && y <= 29)) || ((((((0 <= y + -4 && 23 == -1 + (-1 + x)) && 0 <= -2 + y) && x + 1 < 27) && 24 <= -1 + y) && y <= 25) && 2 <= -1 + y)) || ((((((0 <= y + -4 && y <= 44) && 43 == -1 + x) && 0 <= -2 + y) && x + 1 < 46) && 43 <= -1 + y) && 2 <= -1 + y)) || (((y <= 27 && 0 <= x + -73) && x <= 73) && ((((((((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0)))))) && 26 <= -1 + y) || (((0 <= y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) && 26 <= -1 + y)) || (((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y)) && 26 <= -1 + y)) || (((0 <= y + -4 && 0 <= -2 + y) && 26 <= -1 + y) && 2 <= -1 + y)) || (26 <= -1 + y && ((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y)))))) || (((y <= 48 && (((47 <= -1 + y && ((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y))) || (((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y)) && 47 <= -1 + y)) || (((0 <= y + -4 && 47 <= -1 + y) && 0 <= -2 + y) && 2 <= -1 + y))) && 0 <= x + -52) && x <= 52)) || ((((((((((0 <= y + -4 && 0 <= -2 + y) && 18 <= -1 + y) && 2 <= -1 + y) || ((((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0)))))) && 18 <= -1 + y)) || (((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y)) && 18 <= -1 + y)) || (((0 <= y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) && 18 <= -1 + y)) || (18 <= -1 + y && ((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y)))) && x <= 81) && y <= 19) && 0 <= x + -81)) || (((0 <= -80 + x && (((((19 <= -1 + y && ((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y))) || (((0 <= y + -4 && 0 <= -2 + y) && 19 <= -1 + y) && 2 <= -1 + y)) || (((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y)) && 19 <= -1 + y)) || ((((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0)))))) && 19 <= -1 + y)) || (((0 <= y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) && 19 <= -1 + y))) && y <= 20) && x <= 80)) || ((((((y <= 43 && 0 <= y + -4) && 42 <= -1 + y) && 0 <= -2 + y) && 41 == -1 + (-1 + x)) && x + 1 < 45) && 2 <= -1 + y)) || ((((((0 <= y + -4 && y <= 10) && 0 <= -2 + y) && x <= 10) && 9 == -1 + x) && 9 <= -1 + y) && 2 <= -1 + y)) || (((((((0 <= y + -4 && y <= 18) && 17 <= -1 + y) && 0 <= -2 + y) && x + 1 < 46) && 16 == -1 + (-1 + x)) && x <= 18) && 2 <= -1 + y)) || (((y <= 21 && 0 <= -79 + x) && x <= 79) && (((((20 <= -1 + y && ((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y))) || (((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y)) && 20 <= -1 + y)) || (((0 <= y + -4 && 20 <= -1 + y) && 0 <= -2 + y) && 2 <= -1 + y)) || (20 <= -1 + y && (((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0)))))))) || (((0 <= y && 20 <= -1 + y) && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0)))))) || ((((((0 <= y + -4 && x <= 50) && 0 <= -2 + y) && 0 <= x + -50) && y <= 50) && 49 <= -1 + y) && 2 <= -1 + y)) || (((((((0 <= y + -4 && 0 <= -2 + y) && y <= 17) && 16 <= -1 + y) && x <= 17) && x + 1 < 45) && 16 == -1 + x) && 2 <= -1 + y)) || ((((((0 <= y + -4 && x + 1 < 49) && y <= 47) && 46 <= -1 + y) && 0 <= -2 + y) && 46 == -1 + x) && 2 <= -1 + y)) || (((y <= 40 && x <= 60) && (((((((0 <= y && 39 <= -1 + y) && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (39 <= -1 + y && ((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y)))) || (((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y)) && 39 <= -1 + y)) || (((0 <= y + -4 && 39 <= -1 + y) && 0 <= -2 + y) && 2 <= -1 + y)) || (39 <= -1 + y && (((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))))))) && 0 <= x + -60)) || (((x <= 90 && y <= 10) && 0 <= x + -90) && (((((9 <= -1 + y && ((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y))) || (((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y)) && 9 <= -1 + y)) || (((0 <= y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) && 9 <= -1 + y)) || (((0 <= y + -4 && 0 <= -2 + y) && 9 <= -1 + y) && 2 <= -1 + y)) || ((((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0)))))) && 9 <= -1 + y)))) || (((((((0 <= y + -4 && 0 <= -2 + y) && 15 == -1 + x) && x + 1 < 44) && x <= 16) && 15 <= -1 + y) && y <= 16) && 2 <= -1 + y)) || (((x <= 89 && y <= 11) && 0 <= -89 + x) && (((((10 <= -1 + y && ((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y))) || (((0 <= y && !(y < 0)) && 10 <= -1 + y) && (y >= 0 || (y == 0 && y >= 0)))) || (((0 <= y + -4 && 0 <= -2 + y) && 10 <= -1 + y) && 2 <= -1 + y)) || (10 <= -1 + y && (((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0)))))))) || (((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y)) && 10 <= -1 + y)))) || (((((((0 <= y + -4 && 0 <= -2 + y) && 5 <= -1 + y) && 5 == -1 + x) && y <= 6) && x + 1 < 48) && x <= 6) && 2 <= -1 + y)) || ((((((0 <= y + -4 && y <= 26) && x + 1 < 28) && 25 <= -1 + y) && 0 <= -2 + y) && 23 == -1 + (-1 + (-1 + x))) && 2 <= -1 + y)) || (((((((6 <= -1 + y && 0 <= y + -4) && x + 1 < 49) && y <= 7) && 0 <= -2 + y) && 5 == -1 + (-1 + x)) && x <= 7) && 2 <= -1 + y)) || (((y <= 7 && (((((((6 <= -1 + y && 0 <= y) && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (6 <= -1 + y && ((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y)))) || (6 <= -1 + y && (((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0)))))))) || (((6 <= -1 + y && 0 <= y + -4) && 0 <= -2 + y) && 2 <= -1 + y)) || (6 <= -1 + y && ((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y))))) && 0 <= x + -93) && x <= 93)) || ((((((0 <= y + -4 && 0 <= -2 + y) && 30 == -1 + x) && x + 1 < 33) && 30 <= -1 + y) && y <= 31) && 2 <= -1 + y)) || ((((((y <= 40 && 0 <= y + -4) && 39 <= -1 + y) && 0 <= -2 + y) && 39 == -1 + x) && x + 1 < 42) && 2 <= -1 + y)) || ((((((0 <= y + -4 && 0 <= -2 + y) && 40 <= -1 + y) && x + 1 < 43) && y <= 41) && 39 == -1 + (-1 + x)) && 2 <= -1 + y)) || (((x <= 66 && (((((33 <= -1 + y && (((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))))) || (((33 <= -1 + y && 0 <= y) && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0)))) || (((0 <= y + -4 && 33 <= -1 + y) && 0 <= -2 + y) && 2 <= -1 + y)) || (33 <= -1 + y && ((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y)))) || (33 <= -1 + y && ((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y))))) && 0 <= x + -66) && y <= 34)) || (((((((y <= 15 && 0 <= y + -4) && 0 <= -2 + y) && x <= 15) && 14 <= -1 + y) && x + 1 < 43) && 13 == -1 + (-1 + x)) && 2 <= -1 + y)) || ((((((0 <= y + -4 && 33 == -1 + (-1 + (-1 + x))) && 35 <= -1 + y) && 0 <= -2 + y) && y <= 36) && 2 <= -1 + y) && x + 1 < 38)) || ((((((((((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y)) && 21 <= -1 + y) || (21 <= -1 + y && ((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y)))) || (((0 <= y + -4 && 21 <= -1 + y) && 0 <= -2 + y) && 2 <= -1 + y)) || (((0 <= y && 21 <= -1 + y) && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0)))) || (21 <= -1 + y && (((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0)))))))) && 0 <= x + -78) && x <= 78) && y <= 22)) || ((((((28 == -1 + x && 0 <= y + -4) && x + 1 < 31) && 0 <= -2 + y) && 28 <= -1 + y) && y <= 29) && 2 <= -1 + y)) || ((((((y <= 24 && 0 <= y + -4) && 23 == -1 + x) && 23 <= -1 + y) && 0 <= -2 + y) && x <= 24) && 2 <= -1 + y)) || (((y <= 43 && (((((42 <= -1 + y && (((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))))) || (42 <= -1 + y && ((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y)))) || (((42 <= -1 + y && 0 <= y) && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0)))) || (((0 <= y + -4 && 42 <= -1 + y) && 0 <= -2 + y) && 2 <= -1 + y)) || (42 <= -1 + y && ((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y))))) && 0 <= x + -57) && x <= 57)) || ((((((((((0 <= y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) && 31 <= -1 + y) || (((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y)) && 31 <= -1 + y)) || (((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y)) && 31 <= -1 + y)) || (((0 <= y + -4 && 0 <= -2 + y) && 31 <= -1 + y) && 2 <= -1 + y)) || ((((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0)))))) && 31 <= -1 + y)) && y <= 32) && x <= 68) && 0 <= x + -68)) || (((y <= 5 && x <= 95) && 0 <= x + -95) && (((((((0 <= y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) && 0 <= y + -5) || (((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y)) && 0 <= y + -5)) || ((((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0)))))) && 0 <= y + -5)) || (((0 <= y + -4 && 0 <= -2 + y) && 0 <= y + -5) && 2 <= -1 + y)) || (((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y)) && 0 <= y + -5)))) || (((0 <= -69 + x && ((((((((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0)))))) && 30 <= -1 + y) || (((0 <= y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) && 30 <= -1 + y)) || (((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y)) && 30 <= -1 + y)) || (((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y)) && 30 <= -1 + y)) || (((0 <= y + -4 && 0 <= -2 + y) && 30 <= -1 + y) && 2 <= -1 + y))) && y <= 31) && x <= 69)) || ((((0 <= y && !(y < 0)) && y == 0) && y >= 0) && x == 0)) || (((x <= 63 && y <= 37) && (((((36 <= -1 + y && ((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y))) || (36 <= -1 + y && (((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0)))))))) || (((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y)) && 36 <= -1 + y)) || (((0 <= y && 36 <= -1 + y) && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0)))) || (((0 <= y + -4 && 36 <= -1 + y) && 0 <= -2 + y) && 2 <= -1 + y))) && 0 <= -63 + x)) || ((((((0 <= y + -4 && y <= 39) && 0 <= -2 + y) && 38 <= -1 + y) && x + 1 < 41) && 38 == -1 + x) && 2 <= -1 + y)) || ((((((((((11 <= -1 + y && 0 <= y + -4) && 0 <= -2 + y) && 2 <= -1 + y) || (11 <= -1 + y && ((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y)))) || (11 <= -1 + y && (((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0)))))))) || (11 <= -1 + y && ((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y)))) || (((11 <= -1 + y && 0 <= y) && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0)))) && y <= 12) && 0 <= -88 + x) && x <= 88)) || (((0 <= x + -99 && y <= 1) && ((0 <= -1 + y && (((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))))) || (((0 <= y && 0 <= -1 + y) && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))))) && x <= 99)) || (((0 <= -86 + x && x <= 86) && (((((((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y)) && 13 <= -1 + y) || (((0 <= y + -4 && 0 <= -2 + y) && 13 <= -1 + y) && 2 <= -1 + y)) || (((0 <= y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) && 13 <= -1 + y)) || (13 <= -1 + y && ((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y)))) || (13 <= -1 + y && (((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))))))) && y <= 14)) || (((((((x <= 5 && 0 <= y + -4) && y <= 5) && x + 1 < 47) && 0 <= -2 + y) && 2 == -1 + (-1 + (-1 + x))) && 0 <= y + -5) && 2 <= -1 + y)) || ((((((0 <= y + -4 && 9 == -1 + (-1 + x)) && 0 <= -2 + y) && x <= 11) && 10 <= -1 + y) && y <= 11) && 2 <= -1 + y)) || (((0 <= x + -82 && y <= 18) && x <= 82) && (((((((0 <= y + -4 && 17 <= -1 + y) && 0 <= -2 + y) && 2 <= -1 + y) || (17 <= -1 + y && ((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y)))) || (((0 <= y && 17 <= -1 + y) && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0)))) || (((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y)) && 17 <= -1 + y)) || (17 <= -1 + y && (((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0)))))))))) || (((y <= 15 && 0 <= x + -85) && x <= 85) && (((((14 <= -1 + y && (((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))))) || (((0 <= y + -4 && 0 <= -2 + y) && 14 <= -1 + y) && 2 <= -1 + y)) || (14 <= -1 + y && ((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y)))) || (((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y)) && 14 <= -1 + y)) || (((0 <= y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) && 14 <= -1 + y)))) || ((((((41 == -1 + x && 0 <= y + -4) && 0 <= -2 + y) && y <= 42) && x + 1 < 44) && 41 <= -1 + y) && 2 <= -1 + y)) || (((((0 <= y + -4 && y <= 4) && x <= 4) && 0 <= -2 + y) && 2 == -1 + (-1 + x)) && 2 <= -1 + y)) || (((((((11 <= -1 + y && 0 <= y + -4) && 9 == -1 + (-1 + (-1 + x))) && x + 1 < 40) && y <= 12) && 0 <= -2 + y) && x <= 12) && 2 <= -1 + y)) || ((((((0 <= y + -4 && y <= 37) && 36 <= -1 + y) && 0 <= -2 + y) && -1 + (-1 + (-1 + (-1 + x))) == 33) && x + 1 < 39) && 2 <= -1 + y)) || ((((((0 <= y + -4 && x + 1 < 34) && 0 <= -2 + y) && y <= 32) && 30 == -1 + (-1 + x)) && 31 <= -1 + y) && 2 <= -1 + y)) || ((((((x + 1 < 50 && y <= 48) && 0 <= y + -4) && 47 <= -1 + y) && 0 <= -2 + y) && 47 == -1 + x) && 2 <= -1 + y)) || (((y <= 38 && (((((((0 <= y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) && 37 <= -1 + y) || (((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y)) && 37 <= -1 + y)) || (((0 <= y + -4 && 0 <= -2 + y) && 37 <= -1 + y) && 2 <= -1 + y)) || ((((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0)))))) && 37 <= -1 + y)) || (((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y)) && 37 <= -1 + y))) && 0 <= -62 + x) && x <= 62)) || (((0 <= -59 + x && (((((40 <= -1 + y && ((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y))) || (((0 <= y + -4 && 0 <= -2 + y) && 40 <= -1 + y) && 2 <= -1 + y)) || (((0 <= y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) && 40 <= -1 + y)) || (40 <= -1 + y && (((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0)))))))) || (((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y)) && 40 <= -1 + y))) && x <= 59) && y <= 41)) || ((((((0 <= y + -4 && y <= 38) && x + 1 < 40) && 0 <= -2 + y) && -1 + (-1 + (-1 + (-1 + (-1 + x)))) == 33) && 37 <= -1 + y) && 2 <= -1 + y)) || (((x <= 61 && y <= 39) && (((((((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y)) && 38 <= -1 + y) || (((0 <= y + -4 && 0 <= -2 + y) && 38 <= -1 + y) && 2 <= -1 + y)) || (38 <= -1 + y && ((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y)))) || (38 <= -1 + y && (((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0)))))))) || (((0 <= y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) && 38 <= -1 + y))) && 0 <= -61 + x)) || ((((((0 <= -100 + x || !(x + -99 <= 0)) && 0 <= y) && !(y < 0)) && y == 0) && (y >= 0 || (y == 0 && y >= 0))) && ((-100 + x <= 0 || x <= 100) || x + -99 <= 0))) || ((((((y <= 27 && 0 <= y + -4) && x + 1 < 29) && 0 <= -2 + y) && 26 == -1 + x) && 26 <= -1 + y) && 2 <= -1 + y)) || ((((((((((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y)) && 41 <= -1 + y) || (41 <= -1 + y && ((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y)))) || (((0 <= y + -4 && 0 <= -2 + y) && 41 <= -1 + y) && 2 <= -1 + y)) || (((0 <= y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) && 41 <= -1 + y)) || (41 <= -1 + y && (((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0)))))))) && 0 <= -58 + x) && y <= 42) && x <= 58)) || ((((((0 <= y + -4 && 33 <= -1 + y) && x + 1 < 36) && 0 <= -2 + y) && y <= 34) && 2 <= -1 + y) && 33 == -1 + x)) || (((x <= 91 && (((((8 <= -1 + y && ((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y))) || (8 <= -1 + y && (((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0)))))))) || (((0 <= y && 8 <= -1 + y) && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0)))) || (((0 <= y + -4 && 8 <= -1 + y) && 0 <= -2 + y) && 2 <= -1 + y)) || (((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y)) && 8 <= -1 + y))) && y <= 9) && 0 <= -91 + x)) || (((x <= 84 && 0 <= x + -84) && (((((((0 <= y + -4 && 0 <= -2 + y) && 15 <= -1 + y) && 2 <= -1 + y) || (((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y)) && 15 <= -1 + y)) || ((((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0)))))) && 15 <= -1 + y)) || (15 <= -1 + y && ((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y)))) || (((0 <= y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) && 15 <= -1 + y))) && y <= 16)) || (((x <= 56 && y <= 44) && (((((((0 <= y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) && 43 <= -1 + y) || ((((0 <= -1 + y && !(y < 0)) && (y >= 0 || (y == 0 && y >= 0))) || (0 <= -1 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0)))))) && 43 <= -1 + y)) || (((0 <= -2 + y && ((0 <= -1 + y && (0 <= -1 + y || (0 <= -1 + y && -1 + y == 0))) || (0 <= -1 + y && (y >= 0 || (y == 0 && y >= 0))))) || (((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -2 + y)) && 43 <= -1 + y)) || (((0 <= y + -4 && 0 <= -2 + y) && 43 <= -1 + y) && 2 <= -1 + y)) || (43 <= -1 + y && ((((0 <= -2 + y && 1 <= -1 + y) || ((0 <= -1 + y || (0 <= -1 + y && -1 + y == 0)) && 1 <= -1 + y)) && 0 <= -3 + y) || ((0 <= -2 + y && 0 <= -3 + y) && 2 <= -1 + y))))) && 0 <= x + -56)) || (((((((x <= 22 && x + 1 < 50) && 0 <= y + -4) && 21 <= -1 + y) && 21 == -1 + x) && 0 <= -2 + y) && y <= 22) && 2 <= -1 + y)) || (((((((0 <= y + -4 && 0 <= -2 + y) && 19 == -1 + x) && y <= 20) && 19 <= -1 + y) && x <= 20) && x + 1 < 48) && 2 <= -1 + y)) || (((((((x + 1 < 50 && 0 <= y + -4) && 5 == -1 + (-1 + (-1 + x))) && 7 <= -1 + y) && 0 <= -2 + y) && x <= 8) && y <= 8) && 2 <= -1 + y) RESULT: Ultimate proved your program to be correct! [2023-02-18 00:20:17,729 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