./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound50.c --full-output --witness-type violation_witness --validate ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/bresenham-ll_unwindbound50.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_unwindbound50.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/bresenham-ll_unwindbound50.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:31:01,059 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-14 14:31:01,114 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-08-14 14:31:01,119 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-14 14:31:01,119 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-14 14:31:01,146 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-14 14:31:01,146 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-14 14:31:01,146 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-14 14:31:01,147 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-14 14:31:01,147 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-14 14:31:01,148 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-14 14:31:01,149 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-14 14:31:01,149 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-14 14:31:01,152 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-14 14:31:01,152 INFO L153 SettingsManager]: * Use SBE=true [2024-08-14 14:31:01,153 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-14 14:31:01,153 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-14 14:31:01,153 INFO L153 SettingsManager]: * sizeof long=4 [2024-08-14 14:31:01,153 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-14 14:31:01,153 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-08-14 14:31:01,153 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-14 14:31:01,155 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-14 14:31:01,155 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-14 14:31:01,156 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-14 14:31:01,156 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-14 14:31:01,156 INFO L153 SettingsManager]: * sizeof long double=12 [2024-08-14 14:31:01,156 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-14 14:31:01,156 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-14 14:31:01,157 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-14 14:31:01,157 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-14 14:31:01,157 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-14 14:31:01,157 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-14 14:31:01,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-14 14:31:01,158 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-14 14:31:01,158 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-14 14:31:01,158 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-14 14:31:01,158 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-14 14:31:01,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-14 14:31:01,159 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-14 14:31:01,159 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-14 14:31:01,159 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-14 14:31:01,160 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-14 14:31:01,160 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-14 14:31:01,160 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:31:01,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-14 14:31:01,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-14 14:31:01,356 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-14 14:31:01,357 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-14 14:31:01,357 INFO L274 PluginConnector]: CDTParser initialized [2024-08-14 14:31:01,358 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound50.c [2024-08-14 14:31:02,586 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-14 14:31:02,708 INFO L384 CDTParser]: Found 1 translation units. [2024-08-14 14:31:02,708 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound50.c [2024-08-14 14:31:02,715 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbfd0910f/538b0def8a2a48f5b67c5263b34933dc/FLAGa664028fd [2024-08-14 14:31:03,133 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbfd0910f/538b0def8a2a48f5b67c5263b34933dc [2024-08-14 14:31:03,135 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-14 14:31:03,138 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-14 14:31:03,138 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_unwindbound50.yml/witness.yml [2024-08-14 14:31:03,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-14 14:31:03,291 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-14 14:31:03,292 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-14 14:31:03,292 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-14 14:31:03,296 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-14 14:31:03,296 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:31:03" (1/2) ... [2024-08-14 14:31:03,297 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51938110 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:31:03, skipping insertion in model container [2024-08-14 14:31:03,297 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:31:03" (1/2) ... [2024-08-14 14:31:03,298 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@58ed71ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:31:03, skipping insertion in model container [2024-08-14 14:31:03,299 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:31:03" (2/2) ... [2024-08-14 14:31:03,299 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51938110 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:31:03, skipping insertion in model container [2024-08-14 14:31:03,299 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:31:03" (2/2) ... [2024-08-14 14:31:03,315 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-14 14:31:03,460 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_unwindbound50.c[597,610] [2024-08-14 14:31:03,478 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:31:03,484 INFO L200 MainTranslator]: Completed pre-run [2024-08-14 14:31:03,492 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_unwindbound50.c[597,610] [2024-08-14 14:31:03,497 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:31:03,507 INFO L204 MainTranslator]: Completed translation [2024-08-14 14:31:03,508 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:31:03 WrapperNode [2024-08-14 14:31:03,508 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-14 14:31:03,509 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-14 14:31:03,509 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-14 14:31:03,509 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-14 14:31:03,517 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:31:03" (1/1) ... [2024-08-14 14:31:03,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:31:03" (1/1) ... [2024-08-14 14:31:03,522 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:31:03" (1/1) ... [2024-08-14 14:31:03,533 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:03,534 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:31:03" (1/1) ... [2024-08-14 14:31:03,534 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:31:03" (1/1) ... [2024-08-14 14:31:03,536 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:31:03" (1/1) ... [2024-08-14 14:31:03,537 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:31:03" (1/1) ... [2024-08-14 14:31:03,537 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:31:03" (1/1) ... [2024-08-14 14:31:03,539 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-14 14:31:03,540 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-14 14:31:03,540 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-14 14:31:03,540 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-14 14:31:03,540 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:31:03" (1/1) ... [2024-08-14 14:31:03,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-14 14:31:03,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:31:03,567 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:03,569 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:03,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-14 14:31:03,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-14 14:31:03,605 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-14 14:31:03,605 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-14 14:31:03,605 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-08-14 14:31:03,605 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-14 14:31:03,606 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-14 14:31:03,606 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-14 14:31:03,607 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-14 14:31:03,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-14 14:31:03,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2024-08-14 14:31:03,607 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-14 14:31:03,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-08-14 14:31:03,607 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-14 14:31:03,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-14 14:31:03,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-08-14 14:31:03,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-14 14:31:03,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-08-14 14:31:03,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-08-14 14:31:03,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-14 14:31:03,668 INFO L273 CfgBuilder]: Building ICFG [2024-08-14 14:31:03,669 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-14 14:31:03,783 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-08-14 14:31:03,783 INFO L327 CfgBuilder]: Performing block encoding [2024-08-14 14:31:03,790 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-14 14:31:03,790 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-14 14:31:03,790 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:31:03 BoogieIcfgContainer [2024-08-14 14:31:03,790 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-14 14:31:03,792 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-14 14:31:03,792 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-14 14:31:03,795 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-14 14:31:03,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.08 02:31:03" (1/4) ... [2024-08-14 14:31:03,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e81a7b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:31:03, skipping insertion in model container [2024-08-14 14:31:03,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:31:03" (2/4) ... [2024-08-14 14:31:03,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e81a7b4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 14.08 02:31:03, skipping insertion in model container [2024-08-14 14:31:03,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:31:03" (3/4) ... [2024-08-14 14:31:03,797 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e81a7b4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 14.08 02:31:03, skipping insertion in model container [2024-08-14 14:31:03,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:31:03" (4/4) ... [2024-08-14 14:31:03,798 INFO L119 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound50.c [2024-08-14 14:31:03,799 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:03,813 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-14 14:31:03,814 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-14 14:31:03,832 INFO L92 WitnessUtils]: Constructing product of automaton with 27 states and violation witness of the following lengths: [304] [2024-08-14 14:31:03,836 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:04,136 INFO L88 GeneralOperation]: Finished removeDeadEnds. Reduced from 4796 states to 1774 states. [2024-08-14 14:31:04,152 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-14 14:31:04,158 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;@4bb607de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 14:31:04,158 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-14 14:31:04,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1774 states. [2024-08-14 14:31:04,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2024-08-14 14:31:04,195 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:31:04,196 INFO L195 NwaCegarLoop]: trace histogram [51, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:31:04,196 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:31:04,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:31:04,201 INFO L85 PathProgramCache]: Analyzing trace with hash 931407638, now seen corresponding path program 1 times [2024-08-14 14:31:04,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:31:04,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308126725] [2024-08-14 14:31:04,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:31:04,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:31:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:04,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:31:04,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:04,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-08-14 14:31:04,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:04,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-08-14 14:31:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:04,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-08-14 14:31:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:04,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-08-14 14:31:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:04,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:31:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:04,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-08-14 14:31:04,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:04,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-08-14 14:31:04,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:04,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-08-14 14:31:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:04,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-08-14 14:31:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:04,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-08-14 14:31:04,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:04,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-08-14 14:31:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:04,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-08-14 14:31:04,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:04,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-08-14 14:31:04,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:04,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-08-14 14:31:04,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:04,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-08-14 14:31:04,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:04,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-08-14 14:31:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:04,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-08-14 14:31:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:04,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-08-14 14:31:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:04,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2024-08-14 14:31:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:04,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-08-14 14:31:04,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:04,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-08-14 14:31:04,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:04,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-08-14 14:31:04,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:04,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2024-08-14 14:31:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:04,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-08-14 14:31:04,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:04,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2024-08-14 14:31:04,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:04,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2024-08-14 14:31:04,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:04,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 322 [2024-08-14 14:31:04,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:04,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2024-08-14 14:31:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:04,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2024-08-14 14:31:04,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:04,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2024-08-14 14:31:04,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:04,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 370 [2024-08-14 14:31:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:04,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 382 [2024-08-14 14:31:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:04,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 394 [2024-08-14 14:31:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:04,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 406 [2024-08-14 14:31:04,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:04,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 418 [2024-08-14 14:31:04,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:04,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 430 [2024-08-14 14:31:04,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:04,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2024-08-14 14:31:04,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:04,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 454 [2024-08-14 14:31:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:04,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 466 [2024-08-14 14:31:04,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:04,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 478 [2024-08-14 14:31:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:04,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 490 [2024-08-14 14:31:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:04,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 502 [2024-08-14 14:31:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:04,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 514 [2024-08-14 14:31:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:04,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 526 [2024-08-14 14:31:05,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:05,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 538 [2024-08-14 14:31:05,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:05,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 550 [2024-08-14 14:31:05,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:05,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 562 [2024-08-14 14:31:05,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:05,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 574 [2024-08-14 14:31:05,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:05,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 586 [2024-08-14 14:31:05,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:05,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 598 [2024-08-14 14:31:05,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:31:05,026 INFO L134 CoverageAnalysis]: Checked inductivity of 14850 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 14750 trivial. 0 not checked. [2024-08-14 14:31:05,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:31:05,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308126725] [2024-08-14 14:31:05,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308126725] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:31:05,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:31:05,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-08-14 14:31:05,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192897760] [2024-08-14 14:31:05,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:31:05,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-14 14:31:05,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:31:05,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-14 14:31:05,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-14 14:31:05,062 INFO L87 Difference]: Start difference. First operand 1774 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:05,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:31:05,107 INFO L93 Difference]: Finished difference Result 1274 states and 1325 transitions. [2024-08-14 14:31:05,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 14:31:05,110 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 612 [2024-08-14 14:31:05,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:31:05,117 INFO L225 Difference]: With dead ends: 1274 [2024-08-14 14:31:05,118 INFO L226 Difference]: Without dead ends: 1173 [2024-08-14 14:31:05,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 103 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:05,123 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:05,124 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:05,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2024-08-14 14:31:05,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 624. [2024-08-14 14:31:05,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 517 states have (on average 1.1005802707930368) internal successors, (569), 517 states have internal predecessors, (569), 54 states have call successors, (54), 54 states have call predecessors, (54), 52 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-08-14 14:31:05,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 675 transitions. [2024-08-14 14:31:05,200 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 675 transitions. Word has length 612 [2024-08-14 14:31:05,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:31:05,201 INFO L495 AbstractCegarLoop]: Abstraction has 624 states and 675 transitions. [2024-08-14 14:31:05,202 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:05,203 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 675 transitions. [2024-08-14 14:31:05,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 615 [2024-08-14 14:31:05,209 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:31:05,209 INFO L195 NwaCegarLoop]: trace histogram [51, 51, 51, 50, 50, 50, 50, 50, 50, 50, 50, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:31:05,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-14 14:31:05,209 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:31:05,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:31:05,210 INFO L85 PathProgramCache]: Analyzing trace with hash -236902632, now seen corresponding path program 1 times [2024-08-14 14:31:05,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:31:05,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394490877] [2024-08-14 14:31:05,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:31:05,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:31:05,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-08-14 14:31:05,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1197422570] [2024-08-14 14:31:05,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:31:05,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:31:05,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:31:05,652 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:05,653 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:05,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:31:05,969 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-14 14:31:06,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:31:06,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-14 14:31:06,325 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-14 14:31:06,326 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-14 14:31:06,346 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:06,528 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:06,531 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-08-14 14:31:06,534 INFO L196 ceAbstractionStarter]: Computing trace abstraction results [2024-08-14 14:31:06,647 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.08 02:31:06 BoogieIcfgContainer [2024-08-14 14:31:06,647 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-14 14:31:06,647 INFO L158 Benchmark]: Toolchain (without parser) took 3356.84ms. Allocated memory was 159.4MB in the beginning and 264.2MB in the end (delta: 104.9MB). Free memory was 71.8MB in the beginning and 178.8MB in the end (delta: -107.0MB). Peak memory consumption was 354.1kB. Max. memory is 16.1GB. [2024-08-14 14:31:06,648 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 108.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:31:06,648 INFO L158 Benchmark]: Witness Parser took 0.09ms. Allocated memory is still 159.4MB. Free memory is still 86.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:31:06,648 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.69ms. Allocated memory was 159.4MB in the beginning and 220.2MB in the end (delta: 60.8MB). Free memory was 71.6MB in the beginning and 187.0MB in the end (delta: -115.4MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2024-08-14 14:31:06,649 INFO L158 Benchmark]: Boogie Preprocessor took 30.02ms. Allocated memory is still 220.2MB. Free memory was 187.0MB in the beginning and 184.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-14 14:31:06,649 INFO L158 Benchmark]: IcfgBuilder took 250.74ms. Allocated memory is still 220.2MB. Free memory was 184.9MB in the beginning and 171.3MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-08-14 14:31:06,650 INFO L158 Benchmark]: TraceAbstraction took 2855.04ms. Allocated memory was 220.2MB in the beginning and 264.2MB in the end (delta: 44.0MB). Free memory was 170.2MB in the beginning and 178.8MB in the end (delta: -8.5MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. [2024-08-14 14:31:06,651 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 108.7MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.09ms. Allocated memory is still 159.4MB. Free memory is still 86.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 216.69ms. Allocated memory was 159.4MB in the beginning and 220.2MB in the end (delta: 60.8MB). Free memory was 71.6MB in the beginning and 187.0MB in the end (delta: -115.4MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.02ms. Allocated memory is still 220.2MB. Free memory was 187.0MB in the beginning and 184.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 250.74ms. Allocated memory is still 220.2MB. Free memory was 184.9MB in the beginning and 171.3MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2855.04ms. Allocated memory was 220.2MB in the beginning and 264.2MB in the end (delta: 44.0MB). Free memory was 170.2MB in the beginning and 178.8MB in the end (delta: -8.5MB). Peak memory consumption was 35.5MB. 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)=100, 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=99, Y=1, \old(counter)=0, counter=0, v=-97, x=0, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=1, v=-97, x=0, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=1, v=-97, 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=99, Y=1, \old(counter)=0, counter=1, v=-97, x=0, xy=0, y=0, yx=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=1, v=-97, x=0, xy=0, y=0, yx=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=1, v=-95, x=0, xy=0, y=0, yx=0] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=1, v=-95, x=1, xy=0, y=0, yx=0] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=2, v=-95, x=1, xy=0, y=0, yx=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=2, v=-95, 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=99, Y=1, \old(counter)=0, counter=2, v=-95, x=1, xy=0, y=0, yx=1] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=2, v=-95, x=1, xy=0, y=0, yx=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=2, v=-93, x=1, xy=0, y=0, yx=1] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=2, v=-93, x=2, xy=0, y=0, yx=1] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=3, v=-93, x=2, xy=0, y=0, yx=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=3, v=-93, 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=99, Y=1, \old(counter)=0, counter=3, v=-93, x=2, xy=0, y=0, yx=2] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=3, v=-93, x=2, xy=0, y=0, yx=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=3, v=-91, x=2, xy=0, y=0, yx=2] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=3, v=-91, x=3, xy=0, y=0, yx=2] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=4, v=-91, x=3, xy=0, y=0, yx=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=4, v=-91, 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=99, Y=1, \old(counter)=0, counter=4, v=-91, x=3, xy=0, y=0, yx=3] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=4, v=-91, x=3, xy=0, y=0, yx=3] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=4, v=-89, x=3, xy=0, y=0, yx=3] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=4, v=-89, x=4, xy=0, y=0, yx=3] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=5, v=-89, x=4, xy=0, y=0, yx=3] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=5, v=-89, 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=99, Y=1, \old(counter)=0, counter=5, v=-89, x=4, xy=0, y=0, yx=4] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=5, v=-89, x=4, xy=0, y=0, yx=4] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=5, v=-87, x=4, xy=0, y=0, yx=4] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=5, v=-87, x=5, xy=0, y=0, yx=4] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=6, v=-87, x=5, xy=0, y=0, yx=4] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=6, v=-87, 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=99, Y=1, \old(counter)=0, counter=6, v=-87, x=5, xy=0, y=0, yx=5] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=6, v=-87, x=5, xy=0, y=0, yx=5] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=6, v=-85, x=5, xy=0, y=0, yx=5] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=6, v=-85, x=6, xy=0, y=0, yx=5] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=7, v=-85, x=6, xy=0, y=0, yx=5] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=7, v=-85, 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=99, Y=1, \old(counter)=0, counter=7, v=-85, x=6, xy=0, y=0, yx=6] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=7, v=-85, x=6, xy=0, y=0, yx=6] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=7, v=-83, x=6, xy=0, y=0, yx=6] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=7, v=-83, x=7, xy=0, y=0, yx=6] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=8, v=-83, x=7, xy=0, y=0, yx=6] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=8, v=-83, 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=99, Y=1, \old(counter)=0, counter=8, v=-83, x=7, xy=0, y=0, yx=7] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=8, v=-83, x=7, xy=0, y=0, yx=7] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=8, v=-81, x=7, xy=0, y=0, yx=7] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=8, v=-81, x=8, xy=0, y=0, yx=7] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=9, v=-81, x=8, xy=0, y=0, yx=7] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=9, v=-81, 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=99, Y=1, \old(counter)=0, counter=9, v=-81, x=8, xy=0, y=0, yx=8] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=9, v=-81, x=8, xy=0, y=0, yx=8] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=9, v=-79, x=8, xy=0, y=0, yx=8] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=9, v=-79, x=9, xy=0, y=0, yx=8] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=10, v=-79, x=9, xy=0, y=0, yx=8] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=10, v=-79, 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=99, Y=1, \old(counter)=0, counter=10, v=-79, x=9, xy=0, y=0, yx=9] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=10, v=-79, x=9, xy=0, y=0, yx=9] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=10, v=-77, x=9, xy=0, y=0, yx=9] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=10, v=-77, x=10, xy=0, y=0, yx=9] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=11, v=-77, x=10, xy=0, y=0, yx=9] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=11, v=-77, 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=99, Y=1, \old(counter)=0, counter=11, v=-77, x=10, xy=0, y=0, yx=10] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=11, v=-77, x=10, xy=0, y=0, yx=10] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=11, v=-75, x=10, xy=0, y=0, yx=10] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=11, v=-75, x=11, xy=0, y=0, yx=10] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=12, v=-75, x=11, xy=0, y=0, yx=10] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=12, v=-75, 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=99, Y=1, \old(counter)=0, counter=12, v=-75, x=11, xy=0, y=0, yx=11] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=12, v=-75, x=11, xy=0, y=0, yx=11] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=12, v=-73, x=11, xy=0, y=0, yx=11] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=12, v=-73, x=12, xy=0, y=0, yx=11] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=13, v=-73, x=12, xy=0, y=0, yx=11] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=13, v=-73, 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=99, Y=1, \old(counter)=0, counter=13, v=-73, x=12, xy=0, y=0, yx=12] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=13, v=-73, x=12, xy=0, y=0, yx=12] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=13, v=-71, x=12, xy=0, y=0, yx=12] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=13, v=-71, x=13, xy=0, y=0, yx=12] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=14, v=-71, x=13, xy=0, y=0, yx=12] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=14, v=-71, 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=99, Y=1, \old(counter)=0, counter=14, v=-71, x=13, xy=0, y=0, yx=13] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=14, v=-71, x=13, xy=0, y=0, yx=13] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=14, v=-69, x=13, xy=0, y=0, yx=13] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=14, v=-69, x=14, xy=0, y=0, yx=13] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=15, v=-69, x=14, xy=0, y=0, yx=13] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=15, v=-69, 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=99, Y=1, \old(counter)=0, counter=15, v=-69, x=14, xy=0, y=0, yx=14] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=15, v=-69, x=14, xy=0, y=0, yx=14] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=15, v=-67, x=14, xy=0, y=0, yx=14] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=15, v=-67, x=15, xy=0, y=0, yx=14] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=16, v=-67, x=15, xy=0, y=0, yx=14] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=16, v=-67, 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=99, Y=1, \old(counter)=0, counter=16, v=-67, x=15, xy=0, y=0, yx=15] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=16, v=-67, x=15, xy=0, y=0, yx=15] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=16, v=-65, x=15, xy=0, y=0, yx=15] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=16, v=-65, x=16, xy=0, y=0, yx=15] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=17, v=-65, x=16, xy=0, y=0, yx=15] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=17, v=-65, 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=99, Y=1, \old(counter)=0, counter=17, v=-65, x=16, xy=0, y=0, yx=16] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=17, v=-65, x=16, xy=0, y=0, yx=16] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=17, v=-63, x=16, xy=0, y=0, yx=16] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=17, v=-63, x=17, xy=0, y=0, yx=16] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=18, v=-63, x=17, xy=0, y=0, yx=16] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=18, v=-63, 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=99, Y=1, \old(counter)=0, counter=18, v=-63, x=17, xy=0, y=0, yx=17] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=18, v=-63, x=17, xy=0, y=0, yx=17] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=18, v=-61, x=17, xy=0, y=0, yx=17] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=18, v=-61, x=18, xy=0, y=0, yx=17] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=19, v=-61, x=18, xy=0, y=0, yx=17] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=19, v=-61, 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=99, Y=1, \old(counter)=0, counter=19, v=-61, x=18, xy=0, y=0, yx=18] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=19, v=-61, x=18, xy=0, y=0, yx=18] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=19, v=-59, x=18, xy=0, y=0, yx=18] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=19, v=-59, x=19, xy=0, y=0, yx=18] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=20, v=-59, x=19, xy=0, y=0, yx=18] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=20, v=-59, 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=99, Y=1, \old(counter)=0, counter=20, v=-59, x=19, xy=0, y=0, yx=19] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=20, v=-59, x=19, xy=0, y=0, yx=19] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=20, v=-57, x=19, xy=0, y=0, yx=19] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=20, v=-57, x=20, xy=0, y=0, yx=19] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=21, v=-57, x=20, xy=0, y=0, yx=19] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=21, v=-57, 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=99, Y=1, \old(counter)=0, counter=21, v=-57, x=20, xy=0, y=0, yx=20] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=21, v=-57, x=20, xy=0, y=0, yx=20] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=21, v=-55, x=20, xy=0, y=0, yx=20] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=21, v=-55, x=21, xy=0, y=0, yx=20] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=22, v=-55, x=21, xy=0, y=0, yx=20] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=22, v=-55, 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=99, Y=1, \old(counter)=0, counter=22, v=-55, x=21, xy=0, y=0, yx=21] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=22, v=-55, x=21, xy=0, y=0, yx=21] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=22, v=-53, x=21, xy=0, y=0, yx=21] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=22, v=-53, x=22, xy=0, y=0, yx=21] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=23, v=-53, x=22, xy=0, y=0, yx=21] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=23, v=-53, 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=99, Y=1, \old(counter)=0, counter=23, v=-53, x=22, xy=0, y=0, yx=22] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=23, v=-53, x=22, xy=0, y=0, yx=22] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=23, v=-51, x=22, xy=0, y=0, yx=22] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=23, v=-51, x=23, xy=0, y=0, yx=22] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=24, v=-51, x=23, xy=0, y=0, yx=22] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=24, v=-51, 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=99, Y=1, \old(counter)=0, counter=24, v=-51, x=23, xy=0, y=0, yx=23] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=24, v=-51, x=23, xy=0, y=0, yx=23] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=24, v=-49, x=23, xy=0, y=0, yx=23] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=24, v=-49, x=24, xy=0, y=0, yx=23] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=25, v=-49, x=24, xy=0, y=0, yx=23] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=25, v=-49, 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=99, Y=1, \old(counter)=0, counter=25, v=-49, x=24, xy=0, y=0, yx=24] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=25, v=-49, x=24, xy=0, y=0, yx=24] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=25, v=-47, x=24, xy=0, y=0, yx=24] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=25, v=-47, x=25, xy=0, y=0, yx=24] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=26, v=-47, x=25, xy=0, y=0, yx=24] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=26, v=-47, 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=99, Y=1, \old(counter)=0, counter=26, v=-47, x=25, xy=0, y=0, yx=25] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=26, v=-47, x=25, xy=0, y=0, yx=25] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=26, v=-45, x=25, xy=0, y=0, yx=25] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=26, v=-45, x=26, xy=0, y=0, yx=25] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=27, v=-45, x=26, xy=0, y=0, yx=25] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=27, v=-45, 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=99, Y=1, \old(counter)=0, counter=27, v=-45, x=26, xy=0, y=0, yx=26] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=27, v=-45, x=26, xy=0, y=0, yx=26] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=27, v=-43, x=26, xy=0, y=0, yx=26] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=27, v=-43, x=27, xy=0, y=0, yx=26] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=28, v=-43, x=27, xy=0, y=0, yx=26] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=28, v=-43, 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=99, Y=1, \old(counter)=0, counter=28, v=-43, x=27, xy=0, y=0, yx=27] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=28, v=-43, x=27, xy=0, y=0, yx=27] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=28, v=-41, x=27, xy=0, y=0, yx=27] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=28, v=-41, x=28, xy=0, y=0, yx=27] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=29, v=-41, x=28, xy=0, y=0, yx=27] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=29, v=-41, 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=99, Y=1, \old(counter)=0, counter=29, v=-41, x=28, xy=0, y=0, yx=28] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=29, v=-41, x=28, xy=0, y=0, yx=28] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=29, v=-39, x=28, xy=0, y=0, yx=28] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=29, v=-39, x=29, xy=0, y=0, yx=28] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=30, v=-39, x=29, xy=0, y=0, yx=28] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=30, v=-39, 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=99, Y=1, \old(counter)=0, counter=30, v=-39, x=29, xy=0, y=0, yx=29] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=30, v=-39, x=29, xy=0, y=0, yx=29] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=30, v=-37, x=29, xy=0, y=0, yx=29] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=30, v=-37, x=30, xy=0, y=0, yx=29] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=31, v=-37, x=30, xy=0, y=0, yx=29] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=31, v=-37, 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=99, Y=1, \old(counter)=0, counter=31, v=-37, x=30, xy=0, y=0, yx=30] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=31, v=-37, x=30, xy=0, y=0, yx=30] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=31, v=-35, x=30, xy=0, y=0, yx=30] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=31, v=-35, x=31, xy=0, y=0, yx=30] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=32, v=-35, x=31, xy=0, y=0, yx=30] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=32, v=-35, 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=99, Y=1, \old(counter)=0, counter=32, v=-35, x=31, xy=0, y=0, yx=31] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=32, v=-35, x=31, xy=0, y=0, yx=31] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=32, v=-33, x=31, xy=0, y=0, yx=31] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=32, v=-33, x=32, xy=0, y=0, yx=31] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=33, v=-33, x=32, xy=0, y=0, yx=31] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=33, v=-33, 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=99, Y=1, \old(counter)=0, counter=33, v=-33, x=32, xy=0, y=0, yx=32] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=33, v=-33, x=32, xy=0, y=0, yx=32] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=33, v=-31, x=32, xy=0, y=0, yx=32] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=33, v=-31, x=33, xy=0, y=0, yx=32] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=34, v=-31, x=33, xy=0, y=0, yx=32] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=34, v=-31, 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=99, Y=1, \old(counter)=0, counter=34, v=-31, x=33, xy=0, y=0, yx=33] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=34, v=-31, x=33, xy=0, y=0, yx=33] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=34, v=-29, x=33, xy=0, y=0, yx=33] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=34, v=-29, x=34, xy=0, y=0, yx=33] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=35, v=-29, x=34, xy=0, y=0, yx=33] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=35, v=-29, 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=99, Y=1, \old(counter)=0, counter=35, v=-29, x=34, xy=0, y=0, yx=34] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=35, v=-29, x=34, xy=0, y=0, yx=34] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=35, v=-27, x=34, xy=0, y=0, yx=34] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=35, v=-27, x=35, xy=0, y=0, yx=34] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=36, v=-27, x=35, xy=0, y=0, yx=34] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=36, v=-27, 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=99, Y=1, \old(counter)=0, counter=36, v=-27, x=35, xy=0, y=0, yx=35] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=36, v=-27, x=35, xy=0, y=0, yx=35] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=36, v=-25, x=35, xy=0, y=0, yx=35] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=36, v=-25, x=36, xy=0, y=0, yx=35] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=37, v=-25, x=36, xy=0, y=0, yx=35] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=37, v=-25, 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=99, Y=1, \old(counter)=0, counter=37, v=-25, x=36, xy=0, y=0, yx=36] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=37, v=-25, x=36, xy=0, y=0, yx=36] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=37, v=-23, x=36, xy=0, y=0, yx=36] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=37, v=-23, x=37, xy=0, y=0, yx=36] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=38, v=-23, x=37, xy=0, y=0, yx=36] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=38, v=-23, 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=99, Y=1, \old(counter)=0, counter=38, v=-23, x=37, xy=0, y=0, yx=37] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=38, v=-23, x=37, xy=0, y=0, yx=37] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=38, v=-21, x=37, xy=0, y=0, yx=37] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=38, v=-21, x=38, xy=0, y=0, yx=37] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=39, v=-21, x=38, xy=0, y=0, yx=37] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=39, v=-21, 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=99, Y=1, \old(counter)=0, counter=39, v=-21, x=38, xy=0, y=0, yx=38] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=39, v=-21, x=38, xy=0, y=0, yx=38] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=39, v=-19, x=38, xy=0, y=0, yx=38] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=39, v=-19, x=39, xy=0, y=0, yx=38] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=40, v=-19, x=39, xy=0, y=0, yx=38] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=40, v=-19, 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=99, Y=1, \old(counter)=0, counter=40, v=-19, x=39, xy=0, y=0, yx=39] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=40, v=-19, x=39, xy=0, y=0, yx=39] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=40, v=-17, x=39, xy=0, y=0, yx=39] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=40, v=-17, x=40, xy=0, y=0, yx=39] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=41, v=-17, x=40, xy=0, y=0, yx=39] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=41, v=-17, 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=99, Y=1, \old(counter)=0, counter=41, v=-17, x=40, xy=0, y=0, yx=40] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=41, v=-17, x=40, xy=0, y=0, yx=40] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=41, v=-15, x=40, xy=0, y=0, yx=40] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=41, v=-15, x=41, xy=0, y=0, yx=40] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=42, v=-15, x=41, xy=0, y=0, yx=40] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=42, v=-15, 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=99, Y=1, \old(counter)=0, counter=42, v=-15, x=41, xy=0, y=0, yx=41] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=42, v=-15, x=41, xy=0, y=0, yx=41] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=42, v=-13, x=41, xy=0, y=0, yx=41] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=42, v=-13, x=42, xy=0, y=0, yx=41] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=43, v=-13, x=42, xy=0, y=0, yx=41] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=43, v=-13, 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=99, Y=1, \old(counter)=0, counter=43, v=-13, x=42, xy=0, y=0, yx=42] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=43, v=-13, x=42, xy=0, y=0, yx=42] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=43, v=-11, x=42, xy=0, y=0, yx=42] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=43, v=-11, x=43, xy=0, y=0, yx=42] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=44, v=-11, x=43, xy=0, y=0, yx=42] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=44, v=-11, 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=99, Y=1, \old(counter)=0, counter=44, v=-11, x=43, xy=0, y=0, yx=43] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=44, v=-11, x=43, xy=0, y=0, yx=43] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=44, v=-9, x=43, xy=0, y=0, yx=43] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=44, v=-9, x=44, xy=0, y=0, yx=43] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=45, v=-9, x=44, xy=0, y=0, yx=43] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=45, v=-9, 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=99, Y=1, \old(counter)=0, counter=45, v=-9, x=44, xy=0, y=0, yx=44] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=45, v=-9, x=44, xy=0, y=0, yx=44] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=45, v=-7, x=44, xy=0, y=0, yx=44] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=45, v=-7, x=45, xy=0, y=0, yx=44] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=46, v=-7, x=45, xy=0, y=0, yx=44] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=46, v=-7, 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=99, Y=1, \old(counter)=0, counter=46, v=-7, x=45, xy=0, y=0, yx=45] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=46, v=-7, x=45, xy=0, y=0, yx=45] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=46, v=-5, x=45, xy=0, y=0, yx=45] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=46, v=-5, x=46, xy=0, y=0, yx=45] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=47, v=-5, x=46, xy=0, y=0, yx=45] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=47, v=-5, 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=99, Y=1, \old(counter)=0, counter=47, v=-5, x=46, xy=0, y=0, yx=46] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=47, v=-5, x=46, xy=0, y=0, yx=46] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=47, v=-3, x=46, xy=0, y=0, yx=46] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=47, v=-3, x=47, xy=0, y=0, yx=46] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=48, v=-3, x=47, xy=0, y=0, yx=46] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=48, v=-3, 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=99, Y=1, \old(counter)=0, counter=48, v=-3, x=47, xy=0, y=0, yx=47] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=48, v=-3, x=47, xy=0, y=0, yx=47] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=48, v=-1, x=47, xy=0, y=0, yx=47] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=48, v=-1, x=48, xy=0, y=0, yx=47] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=49, v=-1, x=48, xy=0, y=0, yx=47] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=49, v=-1, 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=99, Y=1, \old(counter)=0, counter=49, v=-1, x=48, xy=0, y=0, yx=48] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=49, v=-1, x=48, xy=0, y=0, yx=48] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, \old(counter)=0, counter=49, v=1, x=48, xy=0, y=0, yx=48] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=49, v=1, x=49, xy=0, y=0, yx=48] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=50, v=1, x=49, xy=0, y=0, yx=48] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, \old(counter)=0, counter=50, v=1, 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=99, Y=1, \old(counter)=0, counter=50, v=1, x=49, xy=0, y=0, yx=49] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, \old(counter)=0, counter=50, v=1, x=49, xy=0, y=0, yx=49] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [X=99, Y=1, \old(counter)=0, counter=50, v=-195, x=49, xy=0, y=1, yx=49] [L45] x++ VAL [X=99, Y=1, \old(counter)=0, counter=50, v=-195, x=50, xy=0, y=1, yx=49] [L31] EXPR counter++ VAL [X=99, Y=1, \old(counter)=0, counter=51, v=-195, x=50, xy=0, y=1, yx=49] [L31] COND FALSE !(counter++<50) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [X=99, Y=1, \old(counter)=0, counter=51, v=-195, xy=50, y=1, yx=50] [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=51] [L14] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, counter=51] [L16] reach_error() VAL [\old(cond)=0, \old(counter)=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 2, TraceHistogramMax: 51, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, 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, 104 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1774occurred 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, 549 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 1840 NumberOfCodeBlocks, 1840 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 611 ConstructedInterpolants, 0 QuantifiedInterpolants, 613 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 14850/14850 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:06,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, 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