./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound100.c --full-output --witness-type violation_witness --validate ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/bresenham-ll_unwindbound100.yml/witness.yml --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26998269 Calling Ultimate with: /root/.sdkman/candidates/java/current/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/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound100.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/bresenham-ll_unwindbound100.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.yaml-violation-witnesses-2699826-m [2024-08-14 14:30:58,139 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-14 14:30:58,194 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-08-14 14:30:58,198 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-14 14:30:58,198 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-14 14:30:58,214 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-14 14:30:58,216 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-14 14:30:58,216 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-14 14:30:58,216 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-14 14:30:58,217 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-14 14:30:58,217 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-14 14:30:58,217 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-14 14:30:58,217 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-14 14:30:58,218 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-14 14:30:58,218 INFO L153 SettingsManager]: * Use SBE=true [2024-08-14 14:30:58,218 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-14 14:30:58,218 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-14 14:30:58,218 INFO L153 SettingsManager]: * sizeof long=4 [2024-08-14 14:30:58,219 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-14 14:30:58,219 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-08-14 14:30:58,223 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-14 14:30:58,224 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-14 14:30:58,224 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-14 14:30:58,225 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-14 14:30:58,225 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-14 14:30:58,225 INFO L153 SettingsManager]: * sizeof long double=12 [2024-08-14 14:30:58,225 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-14 14:30:58,225 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-14 14:30:58,226 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-14 14:30:58,226 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-14 14:30:58,227 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-14 14:30:58,227 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-14 14:30:58,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-14 14:30:58,227 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-14 14:30:58,228 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-14 14:30:58,228 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-14 14:30:58,229 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-14 14:30:58,229 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-14 14:30:58,229 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-14 14:30:58,229 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-14 14:30:58,230 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-14 14:30:58,230 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-14 14:30:58,230 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-14 14:30:58,230 INFO L153 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.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder: Size of a code block -> SequenceOfStatements [2024-08-14 14:30:58,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-14 14:30:58,457 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-14 14:30:58,461 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-14 14:30:58,462 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-14 14:30:58,462 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-14 14:30:58,463 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/bresenham-ll_unwindbound100.yml/witness.yml [2024-08-14 14:30:58,669 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-14 14:30:58,670 INFO L274 PluginConnector]: CDTParser initialized [2024-08-14 14:30:58,670 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound100.c [2024-08-14 14:30:59,921 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-14 14:31:00,063 INFO L384 CDTParser]: Found 1 translation units. [2024-08-14 14:31:00,064 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound100.c [2024-08-14 14:31:00,069 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e767b4e7b/cd18d3aa05dc4738bf53b75382b895b6/FLAG90fc021b5 [2024-08-14 14:31:00,080 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e767b4e7b/cd18d3aa05dc4738bf53b75382b895b6 [2024-08-14 14:31:00,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-14 14:31:00,082 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-14 14:31:00,084 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-14 14:31:00,085 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-14 14:31:00,088 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-14 14:31:00,089 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:30:58" (1/2) ... [2024-08-14 14:31:00,089 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75311a4d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:31:00, skipping insertion in model container [2024-08-14 14:31:00,089 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:30:58" (1/2) ... [2024-08-14 14:31:00,090 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3bb8420e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:31:00, skipping insertion in model container [2024-08-14 14:31:00,090 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:31:00" (2/2) ... [2024-08-14 14:31:00,091 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75311a4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:31:00, skipping insertion in model container [2024-08-14 14:31:00,091 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:31:00" (2/2) ... [2024-08-14 14:31:00,106 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-14 14:31:00,237 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound100.c[597,610] [2024-08-14 14:31:00,264 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:31:00,272 INFO L200 MainTranslator]: Completed pre-run [2024-08-14 14:31:00,281 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound100.c[597,610] [2024-08-14 14:31:00,288 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:31:00,302 INFO L204 MainTranslator]: Completed translation [2024-08-14 14:31:00,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:31:00 WrapperNode [2024-08-14 14:31:00,303 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-14 14:31:00,304 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-14 14:31:00,304 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-14 14:31:00,304 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-14 14:31:00,312 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:31:00" (1/1) ... [2024-08-14 14:31:00,313 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:31:00" (1/1) ... [2024-08-14 14:31:00,317 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:31:00" (1/1) ... [2024-08-14 14:31:00,330 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-08-14 14:31:00,330 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:31:00" (1/1) ... [2024-08-14 14:31:00,330 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:31:00" (1/1) ... [2024-08-14 14:31:00,333 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:31:00" (1/1) ... [2024-08-14 14:31:00,337 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:31:00" (1/1) ... [2024-08-14 14:31:00,337 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:31:00" (1/1) ... [2024-08-14 14:31:00,338 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-14 14:31:00,339 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-14 14:31:00,339 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-14 14:31:00,340 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-14 14:31:00,340 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:31:00" (1/1) ... [2024-08-14 14:31:00,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-14 14:31:00,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:31:00,370 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-08-14 14:31:00,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-08-14 14:31:00,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-14 14:31:00,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-14 14:31:00,411 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-14 14:31:00,411 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-14 14:31:00,411 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-08-14 14:31:00,411 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-14 14:31:00,411 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-14 14:31:00,411 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-14 14:31:00,412 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-14 14:31:00,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-14 14:31:00,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2024-08-14 14:31:00,413 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-14 14:31:00,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-08-14 14:31:00,413 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-14 14:31:00,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-14 14:31:00,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-08-14 14:31:00,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-14 14:31:00,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-08-14 14:31:00,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-08-14 14:31:00,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-14 14:31:00,474 INFO L273 CfgBuilder]: Building ICFG [2024-08-14 14:31:00,477 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-14 14:31:00,592 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-08-14 14:31:00,592 INFO L327 CfgBuilder]: Performing block encoding [2024-08-14 14:31:00,598 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-14 14:31:00,599 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-14 14:31:00,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:31:00 BoogieIcfgContainer [2024-08-14 14:31:00,599 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-14 14:31:00,600 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-14 14:31:00,601 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-14 14:31:00,603 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-14 14:31:00,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:30:58" (1/4) ... [2024-08-14 14:31:00,603 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88da90f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 14.08 02:31:00, skipping insertion in model container [2024-08-14 14:31:00,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.08 02:31:00" (2/4) ... [2024-08-14 14:31:00,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88da90f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:31:00, skipping insertion in model container [2024-08-14 14:31:00,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:31:00" (3/4) ... [2024-08-14 14:31:00,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88da90f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:31:00, skipping insertion in model container [2024-08-14 14:31:00,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:31:00" (4/4) ... [2024-08-14 14:31:00,605 INFO L119 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound100.c [2024-08-14 14:31:00,605 WARN L130 eAbstractionObserver]: Found a witness in the YAML format. I will only consider traces that are accepted by the witness [2024-08-14 14:31:00,619 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-14 14:31:00,619 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-14 14:31:00,642 INFO L92 WitnessUtils]: Constructing product of automaton with 27 states and violation witness of the following lengths: [604] [2024-08-14 14:31:00,645 INFO L82 GeneralOperation]: Start removeDeadEnds. Operand has 27 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:31:01,126 INFO L88 GeneralOperation]: Finished removeDeadEnds. Reduced from 9546 states to 3524 states. [2024-08-14 14:31:01,140 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-14 14:31:01,147 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@72c17ea9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 14:31:01,147 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-14 14:31:01,148 INFO L276 IsEmpty]: Start isEmpty. Operand 3524 states. [2024-08-14 14:31:01,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2024-08-14 14:31:01,205 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:31:01,207 INFO L195 NwaCegarLoop]: trace histogram [101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:31:01,207 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:31:01,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:31:01,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1298456020, now seen corresponding path program 1 times [2024-08-14 14:31:01,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:31:01,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215607323] [2024-08-14 14:31:01,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:31:01,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:31:01,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:31:02,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-08-14 14:31:02,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-08-14 14:31:02,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-08-14 14:31:02,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-08-14 14:31:02,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:31:02,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-08-14 14:31:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-08-14 14:31:02,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-08-14 14:31:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-08-14 14:31:02,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-08-14 14:31:02,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-08-14 14:31:02,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-08-14 14:31:02,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-08-14 14:31:02,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-08-14 14:31:02,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-08-14 14:31:02,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-08-14 14:31:02,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-08-14 14:31:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-08-14 14:31:02,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2024-08-14 14:31:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-08-14 14:31:02,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-08-14 14:31:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-08-14 14:31:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2024-08-14 14:31:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-08-14 14:31:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2024-08-14 14:31:02,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2024-08-14 14:31:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 322 [2024-08-14 14:31:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2024-08-14 14:31:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2024-08-14 14:31:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2024-08-14 14:31:02,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 370 [2024-08-14 14:31:02,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 382 [2024-08-14 14:31:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 394 [2024-08-14 14:31:02,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 406 [2024-08-14 14:31:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 418 [2024-08-14 14:31:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 430 [2024-08-14 14:31:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2024-08-14 14:31:02,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 454 [2024-08-14 14:31:02,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 466 [2024-08-14 14:31:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 478 [2024-08-14 14:31:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 490 [2024-08-14 14:31:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 502 [2024-08-14 14:31:02,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 514 [2024-08-14 14:31:02,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 526 [2024-08-14 14:31:02,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 538 [2024-08-14 14:31:02,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 550 [2024-08-14 14:31:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 562 [2024-08-14 14:31:02,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 574 [2024-08-14 14:31:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 586 [2024-08-14 14:31:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 598 [2024-08-14 14:31:02,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 610 [2024-08-14 14:31:02,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 622 [2024-08-14 14:31:02,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 634 [2024-08-14 14:31:02,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2024-08-14 14:31:02,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 658 [2024-08-14 14:31:02,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 670 [2024-08-14 14:31:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 682 [2024-08-14 14:31:02,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 694 [2024-08-14 14:31:02,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 706 [2024-08-14 14:31:02,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 718 [2024-08-14 14:31:02,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 730 [2024-08-14 14:31:02,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 742 [2024-08-14 14:31:02,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 754 [2024-08-14 14:31:02,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 766 [2024-08-14 14:31:02,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 778 [2024-08-14 14:31:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 790 [2024-08-14 14:31:02,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 802 [2024-08-14 14:31:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 814 [2024-08-14 14:31:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 826 [2024-08-14 14:31:02,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 838 [2024-08-14 14:31:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 850 [2024-08-14 14:31:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 862 [2024-08-14 14:31:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 874 [2024-08-14 14:31:02,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 886 [2024-08-14 14:31:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 898 [2024-08-14 14:31:02,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 910 [2024-08-14 14:31:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 922 [2024-08-14 14:31:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 934 [2024-08-14 14:31:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 946 [2024-08-14 14:31:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 958 [2024-08-14 14:31:02,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 970 [2024-08-14 14:31:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 982 [2024-08-14 14:31:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 994 [2024-08-14 14:31:02,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1006 [2024-08-14 14:31:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1018 [2024-08-14 14:31:02,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1030 [2024-08-14 14:31:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1042 [2024-08-14 14:31:02,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1054 [2024-08-14 14:31:02,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1066 [2024-08-14 14:31:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1078 [2024-08-14 14:31:02,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1090 [2024-08-14 14:31:02,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1102 [2024-08-14 14:31:02,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1114 [2024-08-14 14:31:02,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1126 [2024-08-14 14:31:02,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1138 [2024-08-14 14:31:02,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1150 [2024-08-14 14:31:02,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1162 [2024-08-14 14:31:02,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1174 [2024-08-14 14:31:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1186 [2024-08-14 14:31:02,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1198 [2024-08-14 14:31:02,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:02,421 INFO L134 CoverageAnalysis]: Checked inductivity of 59700 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 59500 trivial. 0 not checked. [2024-08-14 14:31:02,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:31:02,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215607323] [2024-08-14 14:31:02,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215607323] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:31:02,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:31:02,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-08-14 14:31:02,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752351142] [2024-08-14 14:31:02,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:31:02,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-14 14:31:02,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:31:02,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-14 14:31:02,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-14 14:31:02,458 INFO L87 Difference]: Start difference. First operand 3524 states. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-14 14:31:02,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:31:02,512 INFO L93 Difference]: Finished difference Result 2524 states and 2625 transitions. [2024-08-14 14:31:02,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 14:31:02,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 1212 [2024-08-14 14:31:02,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:31:02,527 INFO L225 Difference]: With dead ends: 2524 [2024-08-14 14:31:02,527 INFO L226 Difference]: Without dead ends: 2323 [2024-08-14 14:31:02,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-14 14:31:02,531 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 7 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-08-14 14:31:02,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 29 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-14 14:31:02,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2323 states. [2024-08-14 14:31:02,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2323 to 1224. [2024-08-14 14:31:02,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 1017 states have (on average 1.1002949852507375) internal successors, (1119), 1017 states have internal predecessors, (1119), 104 states have call successors, (104), 104 states have call predecessors, (104), 102 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2024-08-14 14:31:02,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1325 transitions. [2024-08-14 14:31:02,630 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1325 transitions. Word has length 1212 [2024-08-14 14:31:02,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:31:02,632 INFO L495 AbstractCegarLoop]: Abstraction has 1224 states and 1325 transitions. [2024-08-14 14:31:02,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-14 14:31:02,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1325 transitions. [2024-08-14 14:31:02,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1215 [2024-08-14 14:31:02,661 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:31:02,662 INFO L195 NwaCegarLoop]: trace histogram [101, 101, 101, 100, 100, 100, 100, 100, 100, 100, 100, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:31:02,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-14 14:31:02,662 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:31:02,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:31:02,663 INFO L85 PathProgramCache]: Analyzing trace with hash 52802734, now seen corresponding path program 1 times [2024-08-14 14:31:02,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:31:02,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845849998] [2024-08-14 14:31:02,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:31:02,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:31:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-08-14 14:31:03,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1903293394] [2024-08-14 14:31:03,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:31:03,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:31:03,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:31:03,618 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) [2024-08-14 14:31:03,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-08-14 14:31:04,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:31:04,303 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-14 14:31:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:31:05,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-14 14:31:05,513 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-14 14:31:05,514 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-14 14:31:05,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-08-14 14:31:05,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:31:05,718 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-08-14 14:31:05,722 INFO L196 ceAbstractionStarter]: Computing trace abstraction results [2024-08-14 14:31:05,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.08 02:31:05 BoogieIcfgContainer [2024-08-14 14:31:05,891 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-14 14:31:05,891 INFO L158 Benchmark]: Toolchain (without parser) took 5809.71ms. Allocated memory was 159.4MB in the beginning and 281.0MB in the end (delta: 121.6MB). Free memory was 108.5MB in the beginning and 157.0MB in the end (delta: -48.5MB). Peak memory consumption was 74.9MB. Max. memory is 16.1GB. [2024-08-14 14:31:05,892 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 130.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:31:05,892 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:31:05,893 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.42ms. Allocated memory is still 159.4MB. Free memory was 108.5MB in the beginning and 96.8MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-08-14 14:31:05,893 INFO L158 Benchmark]: Boogie Preprocessor took 34.45ms. Allocated memory is still 159.4MB. Free memory was 96.8MB in the beginning and 94.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-14 14:31:05,893 INFO L158 Benchmark]: IcfgBuilder took 260.19ms. Allocated memory is still 159.4MB. Free memory was 94.7MB in the beginning and 82.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-08-14 14:31:05,893 INFO L158 Benchmark]: TraceAbstraction took 5290.49ms. Allocated memory was 159.4MB in the beginning and 281.0MB in the end (delta: 121.6MB). Free memory was 81.2MB in the beginning and 157.0MB in the end (delta: -75.7MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. [2024-08-14 14:31:05,894 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 130.8MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 219.42ms. Allocated memory is still 159.4MB. Free memory was 108.5MB in the beginning and 96.8MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.45ms. Allocated memory is still 159.4MB. Free memory was 96.8MB in the beginning and 94.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 260.19ms. Allocated memory is still 159.4MB. Free memory was 94.7MB in the beginning and 82.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5290.49ms. Allocated memory was 159.4MB in the beginning and 281.0MB in the end (delta: 121.6MB). Free memory was 81.2MB in the beginning and 157.0MB in the end (delta: -75.7MB). Peak memory consumption was 47.7MB. 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 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L21] int counter = 0; VAL [\old(counter)=200, counter=0] [L23] int X, Y; [L24] long long x, y, v, xy, yx; [L25] X = __VERIFIER_nondet_int() [L26] Y = __VERIFIER_nondet_int() [L27] v = ((long long) 2 * Y) - X [L28] y = 0 [L29] x = 0 VAL [X=199, Y=1, \old(counter)=0, counter=0, v=-197, x=0, y=0] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=1, v=-197, x=0, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=1, v=-197, x=0, xy=0, y=0, yx=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=1, v=-197, x=0, xy=0, y=0, yx=0] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=1, v=-197, x=0, xy=0, y=0, yx=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=1, v=-195, x=0, xy=0, y=0, yx=0] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=1, v=-195, x=1, xy=0, y=0, yx=0] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=2, v=-195, x=1, xy=0, y=0, yx=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=2, v=-195, x=1, xy=0, y=0, yx=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=2, v=-195, x=1, xy=0, y=0, yx=1] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=2, v=-195, x=1, xy=0, y=0, yx=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=2, v=-193, x=1, xy=0, y=0, yx=1] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=2, v=-193, x=2, xy=0, y=0, yx=1] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=3, v=-193, x=2, xy=0, y=0, yx=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=3, v=-193, x=2, xy=0, y=0, yx=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=3, v=-193, x=2, xy=0, y=0, yx=2] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=3, v=-193, x=2, xy=0, y=0, yx=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=3, v=-191, x=2, xy=0, y=0, yx=2] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=3, v=-191, x=3, xy=0, y=0, yx=2] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=4, v=-191, x=3, xy=0, y=0, yx=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=4, v=-191, x=3, xy=0, y=0, yx=3] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=4, v=-191, x=3, xy=0, y=0, yx=3] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=4, v=-191, x=3, xy=0, y=0, yx=3] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=4, v=-189, x=3, xy=0, y=0, yx=3] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=4, v=-189, x=4, xy=0, y=0, yx=3] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=5, v=-189, x=4, xy=0, y=0, yx=3] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=5, v=-189, x=4, xy=0, y=0, yx=4] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=5, v=-189, x=4, xy=0, y=0, yx=4] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=5, v=-189, x=4, xy=0, y=0, yx=4] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=5, v=-187, x=4, xy=0, y=0, yx=4] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=5, v=-187, x=5, xy=0, y=0, yx=4] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=6, v=-187, x=5, xy=0, y=0, yx=4] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=6, v=-187, x=5, xy=0, y=0, yx=5] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=6, v=-187, x=5, xy=0, y=0, yx=5] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=6, v=-187, x=5, xy=0, y=0, yx=5] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=6, v=-185, x=5, xy=0, y=0, yx=5] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=6, v=-185, x=6, xy=0, y=0, yx=5] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=7, v=-185, x=6, xy=0, y=0, yx=5] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=7, v=-185, x=6, xy=0, y=0, yx=6] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=7, v=-185, x=6, xy=0, y=0, yx=6] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=7, v=-185, x=6, xy=0, y=0, yx=6] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=7, v=-183, x=6, xy=0, y=0, yx=6] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=7, v=-183, x=7, xy=0, y=0, yx=6] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=8, v=-183, x=7, xy=0, y=0, yx=6] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=8, v=-183, x=7, xy=0, y=0, yx=7] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=8, v=-183, x=7, xy=0, y=0, yx=7] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=8, v=-183, x=7, xy=0, y=0, yx=7] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=8, v=-181, x=7, xy=0, y=0, yx=7] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=8, v=-181, x=8, xy=0, y=0, yx=7] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=9, v=-181, x=8, xy=0, y=0, yx=7] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=9, v=-181, x=8, xy=0, y=0, yx=8] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=9, v=-181, x=8, xy=0, y=0, yx=8] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=9, v=-181, x=8, xy=0, y=0, yx=8] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=9, v=-179, x=8, xy=0, y=0, yx=8] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=9, v=-179, x=9, xy=0, y=0, yx=8] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=10, v=-179, x=9, xy=0, y=0, yx=8] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=10, v=-179, x=9, xy=0, y=0, yx=9] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=10, v=-179, x=9, xy=0, y=0, yx=9] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=10, v=-179, x=9, xy=0, y=0, yx=9] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=10, v=-177, x=9, xy=0, y=0, yx=9] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=10, v=-177, x=10, xy=0, y=0, yx=9] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=11, v=-177, x=10, xy=0, y=0, yx=9] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=11, v=-177, x=10, xy=0, y=0, yx=10] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=11, v=-177, x=10, xy=0, y=0, yx=10] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=11, v=-177, x=10, xy=0, y=0, yx=10] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=11, v=-175, x=10, xy=0, y=0, yx=10] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=11, v=-175, x=11, xy=0, y=0, yx=10] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=12, v=-175, x=11, xy=0, y=0, yx=10] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=12, v=-175, x=11, xy=0, y=0, yx=11] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=12, v=-175, x=11, xy=0, y=0, yx=11] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=12, v=-175, x=11, xy=0, y=0, yx=11] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=12, v=-173, x=11, xy=0, y=0, yx=11] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=12, v=-173, x=12, xy=0, y=0, yx=11] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=13, v=-173, x=12, xy=0, y=0, yx=11] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=13, v=-173, x=12, xy=0, y=0, yx=12] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=13, v=-173, x=12, xy=0, y=0, yx=12] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=13, v=-173, x=12, xy=0, y=0, yx=12] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=13, v=-171, x=12, xy=0, y=0, yx=12] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=13, v=-171, x=13, xy=0, y=0, yx=12] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=14, v=-171, x=13, xy=0, y=0, yx=12] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=14, v=-171, x=13, xy=0, y=0, yx=13] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=14, v=-171, x=13, xy=0, y=0, yx=13] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=14, v=-171, x=13, xy=0, y=0, yx=13] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=14, v=-169, x=13, xy=0, y=0, yx=13] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=14, v=-169, x=14, xy=0, y=0, yx=13] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=15, v=-169, x=14, xy=0, y=0, yx=13] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=15, v=-169, x=14, xy=0, y=0, yx=14] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=15, v=-169, x=14, xy=0, y=0, yx=14] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=15, v=-169, x=14, xy=0, y=0, yx=14] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=15, v=-167, x=14, xy=0, y=0, yx=14] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=15, v=-167, x=15, xy=0, y=0, yx=14] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=16, v=-167, x=15, xy=0, y=0, yx=14] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=16, v=-167, x=15, xy=0, y=0, yx=15] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=16, v=-167, x=15, xy=0, y=0, yx=15] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=16, v=-167, x=15, xy=0, y=0, yx=15] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=16, v=-165, x=15, xy=0, y=0, yx=15] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=16, v=-165, x=16, xy=0, y=0, yx=15] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=17, v=-165, x=16, xy=0, y=0, yx=15] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=17, v=-165, x=16, xy=0, y=0, yx=16] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=17, v=-165, x=16, xy=0, y=0, yx=16] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=17, v=-165, x=16, xy=0, y=0, yx=16] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=17, v=-163, x=16, xy=0, y=0, yx=16] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=17, v=-163, x=17, xy=0, y=0, yx=16] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=18, v=-163, x=17, xy=0, y=0, yx=16] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=18, v=-163, x=17, xy=0, y=0, yx=17] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=18, v=-163, x=17, xy=0, y=0, yx=17] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=18, v=-163, x=17, xy=0, y=0, yx=17] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=18, v=-161, x=17, xy=0, y=0, yx=17] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=18, v=-161, x=18, xy=0, y=0, yx=17] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=19, v=-161, x=18, xy=0, y=0, yx=17] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=19, v=-161, x=18, xy=0, y=0, yx=18] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=19, v=-161, x=18, xy=0, y=0, yx=18] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=19, v=-161, x=18, xy=0, y=0, yx=18] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=19, v=-159, x=18, xy=0, y=0, yx=18] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=19, v=-159, x=19, xy=0, y=0, yx=18] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=20, v=-159, x=19, xy=0, y=0, yx=18] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=20, v=-159, x=19, xy=0, y=0, yx=19] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=20, v=-159, x=19, xy=0, y=0, yx=19] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=20, v=-159, x=19, xy=0, y=0, yx=19] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=20, v=-157, x=19, xy=0, y=0, yx=19] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=20, v=-157, x=20, xy=0, y=0, yx=19] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=21, v=-157, x=20, xy=0, y=0, yx=19] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=21, v=-157, x=20, xy=0, y=0, yx=20] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=21] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=21] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=21, v=-157, x=20, xy=0, y=0, yx=20] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=21, v=-157, x=20, xy=0, y=0, yx=20] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=21, v=-155, x=20, xy=0, y=0, yx=20] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=21, v=-155, x=21, xy=0, y=0, yx=20] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=22, v=-155, x=21, xy=0, y=0, yx=20] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=22, v=-155, x=21, xy=0, y=0, yx=21] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=22] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=22] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=22, v=-155, x=21, xy=0, y=0, yx=21] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=22, v=-155, x=21, xy=0, y=0, yx=21] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=22, v=-153, x=21, xy=0, y=0, yx=21] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=22, v=-153, x=22, xy=0, y=0, yx=21] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=23, v=-153, x=22, xy=0, y=0, yx=21] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=23, v=-153, x=22, xy=0, y=0, yx=22] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=23] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=23] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=23, v=-153, x=22, xy=0, y=0, yx=22] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=23, v=-153, x=22, xy=0, y=0, yx=22] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=23, v=-151, x=22, xy=0, y=0, yx=22] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=23, v=-151, x=23, xy=0, y=0, yx=22] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=24, v=-151, x=23, xy=0, y=0, yx=22] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=24, v=-151, x=23, xy=0, y=0, yx=23] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=24] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=24] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=24, v=-151, x=23, xy=0, y=0, yx=23] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=24, v=-151, x=23, xy=0, y=0, yx=23] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=24, v=-149, x=23, xy=0, y=0, yx=23] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=24, v=-149, x=24, xy=0, y=0, yx=23] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=25, v=-149, x=24, xy=0, y=0, yx=23] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=25, v=-149, x=24, xy=0, y=0, yx=24] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=25] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=25] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=25, v=-149, x=24, xy=0, y=0, yx=24] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=25, v=-149, x=24, xy=0, y=0, yx=24] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=25, v=-147, x=24, xy=0, y=0, yx=24] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=25, v=-147, x=25, xy=0, y=0, yx=24] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=26, v=-147, x=25, xy=0, y=0, yx=24] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=26, v=-147, x=25, xy=0, y=0, yx=25] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=26] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=26] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=26, v=-147, x=25, xy=0, y=0, yx=25] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=26, v=-147, x=25, xy=0, y=0, yx=25] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=26, v=-145, x=25, xy=0, y=0, yx=25] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=26, v=-145, x=26, xy=0, y=0, yx=25] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=27, v=-145, x=26, xy=0, y=0, yx=25] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=27, v=-145, x=26, xy=0, y=0, yx=26] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=27] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=27] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=27, v=-145, x=26, xy=0, y=0, yx=26] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=27, v=-145, x=26, xy=0, y=0, yx=26] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=27, v=-143, x=26, xy=0, y=0, yx=26] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=27, v=-143, x=27, xy=0, y=0, yx=26] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=28, v=-143, x=27, xy=0, y=0, yx=26] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=28, v=-143, x=27, xy=0, y=0, yx=27] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=28] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=28] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=28, v=-143, x=27, xy=0, y=0, yx=27] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=28, v=-143, x=27, xy=0, y=0, yx=27] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=28, v=-141, x=27, xy=0, y=0, yx=27] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=28, v=-141, x=28, xy=0, y=0, yx=27] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=29, v=-141, x=28, xy=0, y=0, yx=27] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=29, v=-141, x=28, xy=0, y=0, yx=28] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=29] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=29] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=29, v=-141, x=28, xy=0, y=0, yx=28] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=29, v=-141, x=28, xy=0, y=0, yx=28] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=29, v=-139, x=28, xy=0, y=0, yx=28] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=29, v=-139, x=29, xy=0, y=0, yx=28] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=30, v=-139, x=29, xy=0, y=0, yx=28] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=30, v=-139, x=29, xy=0, y=0, yx=29] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=30] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=30] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=30, v=-139, x=29, xy=0, y=0, yx=29] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=30, v=-139, x=29, xy=0, y=0, yx=29] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=30, v=-137, x=29, xy=0, y=0, yx=29] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=30, v=-137, x=30, xy=0, y=0, yx=29] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=31, v=-137, x=30, xy=0, y=0, yx=29] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=31, v=-137, x=30, xy=0, y=0, yx=30] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=31] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=31] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=31, v=-137, x=30, xy=0, y=0, yx=30] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=31, v=-137, x=30, xy=0, y=0, yx=30] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=31, v=-135, x=30, xy=0, y=0, yx=30] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=31, v=-135, x=31, xy=0, y=0, yx=30] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=32, v=-135, x=31, xy=0, y=0, yx=30] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=32, v=-135, x=31, xy=0, y=0, yx=31] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=32] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=32] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=32, v=-135, x=31, xy=0, y=0, yx=31] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=32, v=-135, x=31, xy=0, y=0, yx=31] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=32, v=-133, x=31, xy=0, y=0, yx=31] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=32, v=-133, x=32, xy=0, y=0, yx=31] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=33, v=-133, x=32, xy=0, y=0, yx=31] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=33, v=-133, x=32, xy=0, y=0, yx=32] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=33] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=33] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=33, v=-133, x=32, xy=0, y=0, yx=32] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=33, v=-133, x=32, xy=0, y=0, yx=32] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=33, v=-131, x=32, xy=0, y=0, yx=32] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=33, v=-131, x=33, xy=0, y=0, yx=32] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=34, v=-131, x=33, xy=0, y=0, yx=32] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=34, v=-131, x=33, xy=0, y=0, yx=33] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=34] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=34] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=34, v=-131, x=33, xy=0, y=0, yx=33] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=34, v=-131, x=33, xy=0, y=0, yx=33] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=34, v=-129, x=33, xy=0, y=0, yx=33] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=34, v=-129, x=34, xy=0, y=0, yx=33] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=35, v=-129, x=34, xy=0, y=0, yx=33] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=35, v=-129, x=34, xy=0, y=0, yx=34] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=35] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=35] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=35, v=-129, x=34, xy=0, y=0, yx=34] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=35, v=-129, x=34, xy=0, y=0, yx=34] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=35, v=-127, x=34, xy=0, y=0, yx=34] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=35, v=-127, x=35, xy=0, y=0, yx=34] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=36, v=-127, x=35, xy=0, y=0, yx=34] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=36, v=-127, x=35, xy=0, y=0, yx=35] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=36] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=36] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=36, v=-127, x=35, xy=0, y=0, yx=35] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=36, v=-127, x=35, xy=0, y=0, yx=35] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=36, v=-125, x=35, xy=0, y=0, yx=35] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=36, v=-125, x=36, xy=0, y=0, yx=35] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=37, v=-125, x=36, xy=0, y=0, yx=35] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=37, v=-125, x=36, xy=0, y=0, yx=36] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=37] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=37] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=37, v=-125, x=36, xy=0, y=0, yx=36] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=37, v=-125, x=36, xy=0, y=0, yx=36] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=37, v=-123, x=36, xy=0, y=0, yx=36] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=37, v=-123, x=37, xy=0, y=0, yx=36] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=38, v=-123, x=37, xy=0, y=0, yx=36] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=38, v=-123, x=37, xy=0, y=0, yx=37] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=38] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=38] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=38, v=-123, x=37, xy=0, y=0, yx=37] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=38, v=-123, x=37, xy=0, y=0, yx=37] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=38, v=-121, x=37, xy=0, y=0, yx=37] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=38, v=-121, x=38, xy=0, y=0, yx=37] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=39, v=-121, x=38, xy=0, y=0, yx=37] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=39, v=-121, x=38, xy=0, y=0, yx=38] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=39] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=39] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=39, v=-121, x=38, xy=0, y=0, yx=38] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=39, v=-121, x=38, xy=0, y=0, yx=38] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=39, v=-119, x=38, xy=0, y=0, yx=38] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=39, v=-119, x=39, xy=0, y=0, yx=38] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=40, v=-119, x=39, xy=0, y=0, yx=38] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=40, v=-119, x=39, xy=0, y=0, yx=39] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=40] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=40] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=40, v=-119, x=39, xy=0, y=0, yx=39] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=40, v=-119, x=39, xy=0, y=0, yx=39] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=40, v=-117, x=39, xy=0, y=0, yx=39] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=40, v=-117, x=40, xy=0, y=0, yx=39] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=41, v=-117, x=40, xy=0, y=0, yx=39] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=41, v=-117, x=40, xy=0, y=0, yx=40] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=41] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=41] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=41, v=-117, x=40, xy=0, y=0, yx=40] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=41, v=-117, x=40, xy=0, y=0, yx=40] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=41, v=-115, x=40, xy=0, y=0, yx=40] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=41, v=-115, x=41, xy=0, y=0, yx=40] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=42, v=-115, x=41, xy=0, y=0, yx=40] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=42, v=-115, x=41, xy=0, y=0, yx=41] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=42] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=42] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=42, v=-115, x=41, xy=0, y=0, yx=41] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=42, v=-115, x=41, xy=0, y=0, yx=41] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=42, v=-113, x=41, xy=0, y=0, yx=41] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=42, v=-113, x=42, xy=0, y=0, yx=41] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=43, v=-113, x=42, xy=0, y=0, yx=41] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=43, v=-113, x=42, xy=0, y=0, yx=42] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=43] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=43] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=43, v=-113, x=42, xy=0, y=0, yx=42] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=43, v=-113, x=42, xy=0, y=0, yx=42] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=43, v=-111, x=42, xy=0, y=0, yx=42] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=43, v=-111, x=43, xy=0, y=0, yx=42] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=44, v=-111, x=43, xy=0, y=0, yx=42] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=44, v=-111, x=43, xy=0, y=0, yx=43] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=44] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=44] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=44, v=-111, x=43, xy=0, y=0, yx=43] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=44, v=-111, x=43, xy=0, y=0, yx=43] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=44, v=-109, x=43, xy=0, y=0, yx=43] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=44, v=-109, x=44, xy=0, y=0, yx=43] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=45, v=-109, x=44, xy=0, y=0, yx=43] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=45, v=-109, x=44, xy=0, y=0, yx=44] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=45] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=45] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=45, v=-109, x=44, xy=0, y=0, yx=44] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=45, v=-109, x=44, xy=0, y=0, yx=44] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=45, v=-107, x=44, xy=0, y=0, yx=44] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=45, v=-107, x=45, xy=0, y=0, yx=44] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=46, v=-107, x=45, xy=0, y=0, yx=44] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=46, v=-107, x=45, xy=0, y=0, yx=45] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=46] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=46] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=46, v=-107, x=45, xy=0, y=0, yx=45] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=46, v=-107, x=45, xy=0, y=0, yx=45] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=46, v=-105, x=45, xy=0, y=0, yx=45] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=46, v=-105, x=46, xy=0, y=0, yx=45] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=47, v=-105, x=46, xy=0, y=0, yx=45] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=47, v=-105, x=46, xy=0, y=0, yx=46] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=47] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=47] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=47, v=-105, x=46, xy=0, y=0, yx=46] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=47, v=-105, x=46, xy=0, y=0, yx=46] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=47, v=-103, x=46, xy=0, y=0, yx=46] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=47, v=-103, x=47, xy=0, y=0, yx=46] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=48, v=-103, x=47, xy=0, y=0, yx=46] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=48, v=-103, x=47, xy=0, y=0, yx=47] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=48] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=48] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=48, v=-103, x=47, xy=0, y=0, yx=47] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=48, v=-103, x=47, xy=0, y=0, yx=47] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=48, v=-101, x=47, xy=0, y=0, yx=47] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=48, v=-101, x=48, xy=0, y=0, yx=47] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=49, v=-101, x=48, xy=0, y=0, yx=47] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=49, v=-101, x=48, xy=0, y=0, yx=48] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=49] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=49] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=49, v=-101, x=48, xy=0, y=0, yx=48] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=49, v=-101, x=48, xy=0, y=0, yx=48] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=49, v=-99, x=48, xy=0, y=0, yx=48] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=49, v=-99, x=49, xy=0, y=0, yx=48] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=50, v=-99, x=49, xy=0, y=0, yx=48] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=50, v=-99, x=49, xy=0, y=0, yx=49] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=50] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=50] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=50, v=-99, x=49, xy=0, y=0, yx=49] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=50, v=-99, x=49, xy=0, y=0, yx=49] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=50, v=-97, x=49, xy=0, y=0, yx=49] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=50, v=-97, x=50, xy=0, y=0, yx=49] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=51, v=-97, x=50, xy=0, y=0, yx=49] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=51, v=-97, x=50, xy=0, y=0, yx=50] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=51] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=51] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=51, v=-97, x=50, xy=0, y=0, yx=50] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=51, v=-97, x=50, xy=0, y=0, yx=50] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=51, v=-95, x=50, xy=0, y=0, yx=50] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=51, v=-95, x=51, xy=0, y=0, yx=50] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=52, v=-95, x=51, xy=0, y=0, yx=50] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=52, v=-95, x=51, xy=0, y=0, yx=51] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=52] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=52] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=52, v=-95, x=51, xy=0, y=0, yx=51] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=52, v=-95, x=51, xy=0, y=0, yx=51] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=52, v=-93, x=51, xy=0, y=0, yx=51] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=52, v=-93, x=52, xy=0, y=0, yx=51] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=53, v=-93, x=52, xy=0, y=0, yx=51] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=53, v=-93, x=52, xy=0, y=0, yx=52] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=53] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=53] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=53, v=-93, x=52, xy=0, y=0, yx=52] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=53, v=-93, x=52, xy=0, y=0, yx=52] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=53, v=-91, x=52, xy=0, y=0, yx=52] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=53, v=-91, x=53, xy=0, y=0, yx=52] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=54, v=-91, x=53, xy=0, y=0, yx=52] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=54, v=-91, x=53, xy=0, y=0, yx=53] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=54] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=54] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=54, v=-91, x=53, xy=0, y=0, yx=53] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=54, v=-91, x=53, xy=0, y=0, yx=53] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=54, v=-89, x=53, xy=0, y=0, yx=53] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=54, v=-89, x=54, xy=0, y=0, yx=53] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=55, v=-89, x=54, xy=0, y=0, yx=53] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=55, v=-89, x=54, xy=0, y=0, yx=54] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=55] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=55] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=55, v=-89, x=54, xy=0, y=0, yx=54] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=55, v=-89, x=54, xy=0, y=0, yx=54] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=55, v=-87, x=54, xy=0, y=0, yx=54] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=55, v=-87, x=55, xy=0, y=0, yx=54] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=56, v=-87, x=55, xy=0, y=0, yx=54] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=56, v=-87, x=55, xy=0, y=0, yx=55] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=56] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=56] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=56, v=-87, x=55, xy=0, y=0, yx=55] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=56, v=-87, x=55, xy=0, y=0, yx=55] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=56, v=-85, x=55, xy=0, y=0, yx=55] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=56, v=-85, x=56, xy=0, y=0, yx=55] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=57, v=-85, x=56, xy=0, y=0, yx=55] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=57, v=-85, x=56, xy=0, y=0, yx=56] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=57] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=57] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=57, v=-85, x=56, xy=0, y=0, yx=56] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=57, v=-85, x=56, xy=0, y=0, yx=56] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=57, v=-83, x=56, xy=0, y=0, yx=56] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=57, v=-83, x=57, xy=0, y=0, yx=56] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=58, v=-83, x=57, xy=0, y=0, yx=56] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=58, v=-83, x=57, xy=0, y=0, yx=57] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=58] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=58] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=58, v=-83, x=57, xy=0, y=0, yx=57] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=58, v=-83, x=57, xy=0, y=0, yx=57] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=58, v=-81, x=57, xy=0, y=0, yx=57] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=58, v=-81, x=58, xy=0, y=0, yx=57] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=59, v=-81, x=58, xy=0, y=0, yx=57] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=59, v=-81, x=58, xy=0, y=0, yx=58] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=59] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=59] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=59, v=-81, x=58, xy=0, y=0, yx=58] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=59, v=-81, x=58, xy=0, y=0, yx=58] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=59, v=-79, x=58, xy=0, y=0, yx=58] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=59, v=-79, x=59, xy=0, y=0, yx=58] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=60, v=-79, x=59, xy=0, y=0, yx=58] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=60, v=-79, x=59, xy=0, y=0, yx=59] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=60] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=60] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=60, v=-79, x=59, xy=0, y=0, yx=59] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=60, v=-79, x=59, xy=0, y=0, yx=59] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=60, v=-77, x=59, xy=0, y=0, yx=59] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=60, v=-77, x=60, xy=0, y=0, yx=59] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=61, v=-77, x=60, xy=0, y=0, yx=59] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=61, v=-77, x=60, xy=0, y=0, yx=60] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=61] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=61] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=61, v=-77, x=60, xy=0, y=0, yx=60] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=61, v=-77, x=60, xy=0, y=0, yx=60] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=61, v=-75, x=60, xy=0, y=0, yx=60] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=61, v=-75, x=61, xy=0, y=0, yx=60] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=62, v=-75, x=61, xy=0, y=0, yx=60] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=62, v=-75, x=61, xy=0, y=0, yx=61] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=62] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=62] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=62, v=-75, x=61, xy=0, y=0, yx=61] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=62, v=-75, x=61, xy=0, y=0, yx=61] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=62, v=-73, x=61, xy=0, y=0, yx=61] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=62, v=-73, x=62, xy=0, y=0, yx=61] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=63, v=-73, x=62, xy=0, y=0, yx=61] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=63, v=-73, x=62, xy=0, y=0, yx=62] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=63] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=63] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=63, v=-73, x=62, xy=0, y=0, yx=62] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=63, v=-73, x=62, xy=0, y=0, yx=62] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=63, v=-71, x=62, xy=0, y=0, yx=62] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=63, v=-71, x=63, xy=0, y=0, yx=62] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=64, v=-71, x=63, xy=0, y=0, yx=62] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=64, v=-71, x=63, xy=0, y=0, yx=63] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=64] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=64] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=64, v=-71, x=63, xy=0, y=0, yx=63] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=64, v=-71, x=63, xy=0, y=0, yx=63] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=64, v=-69, x=63, xy=0, y=0, yx=63] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=64, v=-69, x=64, xy=0, y=0, yx=63] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=65, v=-69, x=64, xy=0, y=0, yx=63] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=65, v=-69, x=64, xy=0, y=0, yx=64] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=65] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=65] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=65, v=-69, x=64, xy=0, y=0, yx=64] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=65, v=-69, x=64, xy=0, y=0, yx=64] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=65, v=-67, x=64, xy=0, y=0, yx=64] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=65, v=-67, x=65, xy=0, y=0, yx=64] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=66, v=-67, x=65, xy=0, y=0, yx=64] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=66, v=-67, x=65, xy=0, y=0, yx=65] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=66] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=66] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=66, v=-67, x=65, xy=0, y=0, yx=65] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=66, v=-67, x=65, xy=0, y=0, yx=65] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=66, v=-65, x=65, xy=0, y=0, yx=65] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=66, v=-65, x=66, xy=0, y=0, yx=65] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=67, v=-65, x=66, xy=0, y=0, yx=65] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=67, v=-65, x=66, xy=0, y=0, yx=66] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=67] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=67] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=67, v=-65, x=66, xy=0, y=0, yx=66] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=67, v=-65, x=66, xy=0, y=0, yx=66] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=67, v=-63, x=66, xy=0, y=0, yx=66] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=67, v=-63, x=67, xy=0, y=0, yx=66] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=68, v=-63, x=67, xy=0, y=0, yx=66] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=68, v=-63, x=67, xy=0, y=0, yx=67] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=68] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=68] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=68, v=-63, x=67, xy=0, y=0, yx=67] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=68, v=-63, x=67, xy=0, y=0, yx=67] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=68, v=-61, x=67, xy=0, y=0, yx=67] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=68, v=-61, x=68, xy=0, y=0, yx=67] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=69, v=-61, x=68, xy=0, y=0, yx=67] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=69, v=-61, x=68, xy=0, y=0, yx=68] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=69] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=69] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=69, v=-61, x=68, xy=0, y=0, yx=68] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=69, v=-61, x=68, xy=0, y=0, yx=68] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=69, v=-59, x=68, xy=0, y=0, yx=68] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=69, v=-59, x=69, xy=0, y=0, yx=68] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=70, v=-59, x=69, xy=0, y=0, yx=68] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=70, v=-59, x=69, xy=0, y=0, yx=69] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=70] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=70] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=70, v=-59, x=69, xy=0, y=0, yx=69] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=70, v=-59, x=69, xy=0, y=0, yx=69] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=70, v=-57, x=69, xy=0, y=0, yx=69] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=70, v=-57, x=70, xy=0, y=0, yx=69] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=71, v=-57, x=70, xy=0, y=0, yx=69] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=71, v=-57, x=70, xy=0, y=0, yx=70] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=71] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=71] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=71, v=-57, x=70, xy=0, y=0, yx=70] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=71, v=-57, x=70, xy=0, y=0, yx=70] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=71, v=-55, x=70, xy=0, y=0, yx=70] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=71, v=-55, x=71, xy=0, y=0, yx=70] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=72, v=-55, x=71, xy=0, y=0, yx=70] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=72, v=-55, x=71, xy=0, y=0, yx=71] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=72] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=72] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=72, v=-55, x=71, xy=0, y=0, yx=71] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=72, v=-55, x=71, xy=0, y=0, yx=71] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=72, v=-53, x=71, xy=0, y=0, yx=71] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=72, v=-53, x=72, xy=0, y=0, yx=71] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=73, v=-53, x=72, xy=0, y=0, yx=71] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=73, v=-53, x=72, xy=0, y=0, yx=72] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=73] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=73] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=73, v=-53, x=72, xy=0, y=0, yx=72] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=73, v=-53, x=72, xy=0, y=0, yx=72] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=73, v=-51, x=72, xy=0, y=0, yx=72] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=73, v=-51, x=73, xy=0, y=0, yx=72] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=74, v=-51, x=73, xy=0, y=0, yx=72] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=74, v=-51, x=73, xy=0, y=0, yx=73] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=74] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=74] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=74, v=-51, x=73, xy=0, y=0, yx=73] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=74, v=-51, x=73, xy=0, y=0, yx=73] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=74, v=-49, x=73, xy=0, y=0, yx=73] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=74, v=-49, x=74, xy=0, y=0, yx=73] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=75, v=-49, x=74, xy=0, y=0, yx=73] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=75, v=-49, x=74, xy=0, y=0, yx=74] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=75] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=75] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=75, v=-49, x=74, xy=0, y=0, yx=74] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=75, v=-49, x=74, xy=0, y=0, yx=74] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=75, v=-47, x=74, xy=0, y=0, yx=74] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=75, v=-47, x=75, xy=0, y=0, yx=74] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=76, v=-47, x=75, xy=0, y=0, yx=74] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=76, v=-47, x=75, xy=0, y=0, yx=75] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=76] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=76] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=76, v=-47, x=75, xy=0, y=0, yx=75] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=76, v=-47, x=75, xy=0, y=0, yx=75] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=76, v=-45, x=75, xy=0, y=0, yx=75] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=76, v=-45, x=76, xy=0, y=0, yx=75] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=77, v=-45, x=76, xy=0, y=0, yx=75] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=77, v=-45, x=76, xy=0, y=0, yx=76] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=77] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=77] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=77, v=-45, x=76, xy=0, y=0, yx=76] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=77, v=-45, x=76, xy=0, y=0, yx=76] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=77, v=-43, x=76, xy=0, y=0, yx=76] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=77, v=-43, x=77, xy=0, y=0, yx=76] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=78, v=-43, x=77, xy=0, y=0, yx=76] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=78, v=-43, x=77, xy=0, y=0, yx=77] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=78] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=78] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=78, v=-43, x=77, xy=0, y=0, yx=77] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=78, v=-43, x=77, xy=0, y=0, yx=77] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=78, v=-41, x=77, xy=0, y=0, yx=77] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=78, v=-41, x=78, xy=0, y=0, yx=77] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=79, v=-41, x=78, xy=0, y=0, yx=77] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=79, v=-41, x=78, xy=0, y=0, yx=78] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=79] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=79] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=79, v=-41, x=78, xy=0, y=0, yx=78] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=79, v=-41, x=78, xy=0, y=0, yx=78] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=79, v=-39, x=78, xy=0, y=0, yx=78] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=79, v=-39, x=79, xy=0, y=0, yx=78] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=80, v=-39, x=79, xy=0, y=0, yx=78] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=80, v=-39, x=79, xy=0, y=0, yx=79] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=80] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=80] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=80, v=-39, x=79, xy=0, y=0, yx=79] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=80, v=-39, x=79, xy=0, y=0, yx=79] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=80, v=-37, x=79, xy=0, y=0, yx=79] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=80, v=-37, x=80, xy=0, y=0, yx=79] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=81, v=-37, x=80, xy=0, y=0, yx=79] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=81, v=-37, x=80, xy=0, y=0, yx=80] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=81] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=81] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=81, v=-37, x=80, xy=0, y=0, yx=80] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=81, v=-37, x=80, xy=0, y=0, yx=80] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=81, v=-35, x=80, xy=0, y=0, yx=80] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=81, v=-35, x=81, xy=0, y=0, yx=80] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=82, v=-35, x=81, xy=0, y=0, yx=80] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=82, v=-35, x=81, xy=0, y=0, yx=81] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=82] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=82] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=82, v=-35, x=81, xy=0, y=0, yx=81] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=82, v=-35, x=81, xy=0, y=0, yx=81] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=82, v=-33, x=81, xy=0, y=0, yx=81] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=82, v=-33, x=82, xy=0, y=0, yx=81] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=83, v=-33, x=82, xy=0, y=0, yx=81] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=83, v=-33, x=82, xy=0, y=0, yx=82] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=83] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=83] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=83, v=-33, x=82, xy=0, y=0, yx=82] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=83, v=-33, x=82, xy=0, y=0, yx=82] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=83, v=-31, x=82, xy=0, y=0, yx=82] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=83, v=-31, x=83, xy=0, y=0, yx=82] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=84, v=-31, x=83, xy=0, y=0, yx=82] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=84, v=-31, x=83, xy=0, y=0, yx=83] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=84] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=84] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=84, v=-31, x=83, xy=0, y=0, yx=83] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=84, v=-31, x=83, xy=0, y=0, yx=83] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=84, v=-29, x=83, xy=0, y=0, yx=83] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=84, v=-29, x=84, xy=0, y=0, yx=83] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=85, v=-29, x=84, xy=0, y=0, yx=83] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=85, v=-29, x=84, xy=0, y=0, yx=84] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=85] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=85] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=85, v=-29, x=84, xy=0, y=0, yx=84] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=85, v=-29, x=84, xy=0, y=0, yx=84] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=85, v=-27, x=84, xy=0, y=0, yx=84] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=85, v=-27, x=85, xy=0, y=0, yx=84] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=86, v=-27, x=85, xy=0, y=0, yx=84] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=86, v=-27, x=85, xy=0, y=0, yx=85] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=86] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=86] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=86, v=-27, x=85, xy=0, y=0, yx=85] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=86, v=-27, x=85, xy=0, y=0, yx=85] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=86, v=-25, x=85, xy=0, y=0, yx=85] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=86, v=-25, x=86, xy=0, y=0, yx=85] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=87, v=-25, x=86, xy=0, y=0, yx=85] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=87, v=-25, x=86, xy=0, y=0, yx=86] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=87] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=87] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=87, v=-25, x=86, xy=0, y=0, yx=86] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=87, v=-25, x=86, xy=0, y=0, yx=86] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=87, v=-23, x=86, xy=0, y=0, yx=86] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=87, v=-23, x=87, xy=0, y=0, yx=86] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=88, v=-23, x=87, xy=0, y=0, yx=86] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=88, v=-23, x=87, xy=0, y=0, yx=87] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=88] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=88] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=88, v=-23, x=87, xy=0, y=0, yx=87] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=88, v=-23, x=87, xy=0, y=0, yx=87] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=88, v=-21, x=87, xy=0, y=0, yx=87] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=88, v=-21, x=88, xy=0, y=0, yx=87] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=89, v=-21, x=88, xy=0, y=0, yx=87] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=89, v=-21, x=88, xy=0, y=0, yx=88] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=89] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=89] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=89, v=-21, x=88, xy=0, y=0, yx=88] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=89, v=-21, x=88, xy=0, y=0, yx=88] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=89, v=-19, x=88, xy=0, y=0, yx=88] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=89, v=-19, x=89, xy=0, y=0, yx=88] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=90, v=-19, x=89, xy=0, y=0, yx=88] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=90, v=-19, x=89, xy=0, y=0, yx=89] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=90] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=90] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=90, v=-19, x=89, xy=0, y=0, yx=89] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=90, v=-19, x=89, xy=0, y=0, yx=89] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=90, v=-17, x=89, xy=0, y=0, yx=89] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=90, v=-17, x=90, xy=0, y=0, yx=89] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=91, v=-17, x=90, xy=0, y=0, yx=89] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=91, v=-17, x=90, xy=0, y=0, yx=90] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=91] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=91] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=91, v=-17, x=90, xy=0, y=0, yx=90] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=91, v=-17, x=90, xy=0, y=0, yx=90] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=91, v=-15, x=90, xy=0, y=0, yx=90] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=91, v=-15, x=91, xy=0, y=0, yx=90] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=92, v=-15, x=91, xy=0, y=0, yx=90] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=92, v=-15, x=91, xy=0, y=0, yx=91] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=92] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=92] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=92, v=-15, x=91, xy=0, y=0, yx=91] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=92, v=-15, x=91, xy=0, y=0, yx=91] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=92, v=-13, x=91, xy=0, y=0, yx=91] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=92, v=-13, x=92, xy=0, y=0, yx=91] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=93, v=-13, x=92, xy=0, y=0, yx=91] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=93, v=-13, x=92, xy=0, y=0, yx=92] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=93] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=93] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=93, v=-13, x=92, xy=0, y=0, yx=92] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=93, v=-13, x=92, xy=0, y=0, yx=92] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=93, v=-11, x=92, xy=0, y=0, yx=92] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=93, v=-11, x=93, xy=0, y=0, yx=92] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=94, v=-11, x=93, xy=0, y=0, yx=92] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=94, v=-11, x=93, xy=0, y=0, yx=93] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=94] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=94] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=94, v=-11, x=93, xy=0, y=0, yx=93] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=94, v=-11, x=93, xy=0, y=0, yx=93] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=94, v=-9, x=93, xy=0, y=0, yx=93] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=94, v=-9, x=94, xy=0, y=0, yx=93] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=95, v=-9, x=94, xy=0, y=0, yx=93] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=95, v=-9, x=94, xy=0, y=0, yx=94] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=95] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=95] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=95, v=-9, x=94, xy=0, y=0, yx=94] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=95, v=-9, x=94, xy=0, y=0, yx=94] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=95, v=-7, x=94, xy=0, y=0, yx=94] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=95, v=-7, x=95, xy=0, y=0, yx=94] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=96, v=-7, x=95, xy=0, y=0, yx=94] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=96, v=-7, x=95, xy=0, y=0, yx=95] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=96] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=96] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=96, v=-7, x=95, xy=0, y=0, yx=95] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=96, v=-7, x=95, xy=0, y=0, yx=95] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=96, v=-5, x=95, xy=0, y=0, yx=95] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=96, v=-5, x=96, xy=0, y=0, yx=95] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=97, v=-5, x=96, xy=0, y=0, yx=95] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=97, v=-5, x=96, xy=0, y=0, yx=96] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=97] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=97] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=97, v=-5, x=96, xy=0, y=0, yx=96] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=97, v=-5, x=96, xy=0, y=0, yx=96] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=97, v=-3, x=96, xy=0, y=0, yx=96] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=97, v=-3, x=97, xy=0, y=0, yx=96] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=98, v=-3, x=97, xy=0, y=0, yx=96] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=98, v=-3, x=97, xy=0, y=0, yx=97] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=98] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=98] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=98, v=-3, x=97, xy=0, y=0, yx=97] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=98, v=-3, x=97, xy=0, y=0, yx=97] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=98, v=-1, x=97, xy=0, y=0, yx=97] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=98, v=-1, x=98, xy=0, y=0, yx=97] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=99, v=-1, x=98, xy=0, y=0, yx=97] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=99, v=-1, x=98, xy=0, y=0, yx=98] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=99] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=99] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=99, v=-1, x=98, xy=0, y=0, yx=98] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=99, v=-1, x=98, xy=0, y=0, yx=98] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=199, Y=1, \old(counter)=0, counter=99, v=1, x=98, xy=0, y=0, yx=98] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=99, v=1, x=99, xy=0, y=0, yx=98] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=100, v=1, x=99, xy=0, y=0, yx=98] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=199, Y=1, \old(counter)=0, counter=100, v=1, x=99, xy=0, y=0, yx=99] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=100] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=100] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=199, Y=1, \old(counter)=0, counter=100, v=1, x=99, xy=0, y=0, yx=99] [L35] COND FALSE !(!(x <= X)) VAL [X=199, Y=1, \old(counter)=0, counter=100, v=1, x=99, xy=0, y=0, yx=99] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [X=199, Y=1, \old(counter)=0, counter=100, v=-395, x=99, xy=0, y=1, yx=99] [L45] x++ VAL [X=199, Y=1, \old(counter)=0, counter=100, v=-395, x=100, xy=0, y=1, yx=99] [L31] EXPR counter++ VAL [X=199, Y=1, \old(counter)=0, counter=101, v=-395, x=100, xy=0, y=1, yx=99] [L31] COND FALSE !(counter++<100) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [X=199, Y=1, \old(counter)=0, counter=101, v=-395, xy=100, y=1, yx=100] [L49] CALL __VERIFIER_assert(2*yx - 2*xy - X + (long long) 2*Y - v + 2*y == 0) VAL [\old(cond)=0, \old(counter)=0, counter=101] [L14] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, counter=101] [L16] reach_error() VAL [\old(cond)=0, \old(counter)=0, counter=101] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 2, TraceHistogramMax: 101, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7 mSDsluCounter, 29 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9 IncrementalHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 18 mSDtfsCounter, 9 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 204 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3524occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 1 MinimizatonAttempts, 1099 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 3640 NumberOfCodeBlocks, 3640 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 1211 ConstructedInterpolants, 0 QuantifiedInterpolants, 1213 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 59700/59700 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 RESULT: Ultimate proved your program to be incorrect! [2024-08-14 14:31:05,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE