/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml -i ../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-02 01:51:19,470 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-02 01:51:19,472 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-02 01:51:19,501 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-02 01:51:19,501 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-02 01:51:19,502 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-02 01:51:19,503 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-02 01:51:19,504 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-02 01:51:19,506 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-02 01:51:19,506 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-02 01:51:19,507 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-02 01:51:19,508 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-02 01:51:19,508 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-02 01:51:19,509 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-02 01:51:19,510 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-02 01:51:19,511 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-02 01:51:19,511 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-02 01:51:19,512 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-02 01:51:19,513 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-02 01:51:19,515 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-02 01:51:19,516 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-02 01:51:19,517 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-02 01:51:19,518 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-02 01:51:19,518 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-02 01:51:19,526 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-02 01:51:19,526 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-02 01:51:19,527 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-02 01:51:19,527 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-02 01:51:19,528 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-02 01:51:19,528 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-02 01:51:19,529 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-02 01:51:19,529 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-02 01:51:19,530 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-02 01:51:19,531 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-02 01:51:19,531 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-02 01:51:19,532 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-02 01:51:19,532 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-02 01:51:19,532 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-02 01:51:19,533 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-02 01:51:19,533 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-02 01:51:19,534 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-02 01:51:19,542 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-04-02 01:51:19,573 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-02 01:51:19,573 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-02 01:51:19,574 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-02 01:51:19,574 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-02 01:51:19,575 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-02 01:51:19,575 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-02 01:51:19,576 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-04-02 01:51:19,576 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-04-02 01:51:19,576 INFO L138 SettingsManager]: * Use SBE=true [2023-04-02 01:51:19,576 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-02 01:51:19,577 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-02 01:51:19,577 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-02 01:51:19,577 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-02 01:51:19,577 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-02 01:51:19,577 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-02 01:51:19,577 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-02 01:51:19,578 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-02 01:51:19,578 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-02 01:51:19,578 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-02 01:51:19,578 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-02 01:51:19,578 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-02 01:51:19,578 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-02 01:51:19,578 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-04-02 01:51:19,578 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-02 01:51:19,578 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 01:51:19,579 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-02 01:51:19,579 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-02 01:51:19,579 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-02 01:51:19,579 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-04-02 01:51:19,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-02 01:51:19,580 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-04-02 01:51:19,580 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-02 01:51:19,580 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-04-02 01:51:19,580 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-04-02 01:51:19,580 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-04-02 01:51:19,580 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-04-02 01:51:19,792 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-02 01:51:19,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-02 01:51:19,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-02 01:51:19,814 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-02 01:51:19,814 INFO L275 PluginConnector]: CDTParser initialized [2023-04-02 01:51:19,815 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c [2023-04-02 01:51:20,948 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-02 01:51:21,129 INFO L351 CDTParser]: Found 1 translation units. [2023-04-02 01:51:21,129 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c [2023-04-02 01:51:21,135 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7142807f3/4ae0176505d14aaab433b7f5bbc0737d/FLAG23b01ed74 [2023-04-02 01:51:21,150 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7142807f3/4ae0176505d14aaab433b7f5bbc0737d [2023-04-02 01:51:21,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-02 01:51:21,154 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-02 01:51:21,157 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-02 01:51:21,157 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-02 01:51:21,159 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-02 01:51:21,160 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 01:51:21" (1/1) ... [2023-04-02 01:51:21,161 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28acad6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:51:21, skipping insertion in model container [2023-04-02 01:51:21,161 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 01:51:21" (1/1) ... [2023-04-02 01:51:21,167 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-02 01:51:21,185 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-02 01:51:21,317 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c[597,610] [2023-04-02 01:51:21,331 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 01:51:21,343 INFO L203 MainTranslator]: Completed pre-run [2023-04-02 01:51:21,355 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c[597,610] [2023-04-02 01:51:21,367 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 01:51:21,379 INFO L208 MainTranslator]: Completed translation [2023-04-02 01:51:21,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:51:21 WrapperNode [2023-04-02 01:51:21,379 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-02 01:51:21,380 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-02 01:51:21,380 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-02 01:51:21,380 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-02 01:51:21,388 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:51:21" (1/1) ... [2023-04-02 01:51:21,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:51:21" (1/1) ... [2023-04-02 01:51:21,394 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:51:21" (1/1) ... [2023-04-02 01:51:21,394 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:51:21" (1/1) ... [2023-04-02 01:51:21,398 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:51:21" (1/1) ... [2023-04-02 01:51:21,401 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:51:21" (1/1) ... [2023-04-02 01:51:21,402 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:51:21" (1/1) ... [2023-04-02 01:51:21,403 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:51:21" (1/1) ... [2023-04-02 01:51:21,404 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-02 01:51:21,405 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-02 01:51:21,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-02 01:51:21,405 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-02 01:51:21,406 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:51:21" (1/1) ... [2023-04-02 01:51:21,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 01:51:21,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:51:21,432 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-04-02 01:51:21,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-04-02 01:51:21,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-02 01:51:21,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-02 01:51:21,471 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-02 01:51:21,471 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-04-02 01:51:21,471 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-04-02 01:51:21,472 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-02 01:51:21,472 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-02 01:51:21,472 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-02 01:51:21,472 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-02 01:51:21,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-02 01:51:21,472 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-02 01:51:21,472 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-04-02 01:51:21,472 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-04-02 01:51:21,473 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-02 01:51:21,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-02 01:51:21,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-02 01:51:21,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-02 01:51:21,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-02 01:51:21,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-02 01:51:21,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-02 01:51:21,538 INFO L236 CfgBuilder]: Building ICFG [2023-04-02 01:51:21,540 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-02 01:51:21,702 INFO L277 CfgBuilder]: Performing block encoding [2023-04-02 01:51:21,710 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-02 01:51:21,710 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-04-02 01:51:21,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 01:51:21 BoogieIcfgContainer [2023-04-02 01:51:21,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-02 01:51:21,718 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-02 01:51:21,718 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-02 01:51:21,721 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-02 01:51:21,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.04 01:51:21" (1/3) ... [2023-04-02 01:51:21,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e770703 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 01:51:21, skipping insertion in model container [2023-04-02 01:51:21,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:51:21" (2/3) ... [2023-04-02 01:51:21,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e770703 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 01:51:21, skipping insertion in model container [2023-04-02 01:51:21,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 01:51:21" (3/3) ... [2023-04-02 01:51:21,724 INFO L112 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound100.c [2023-04-02 01:51:21,739 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-02 01:51:21,739 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-02 01:51:21,778 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-02 01:51:21,784 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1931725c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-04-02 01:51:21,784 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-02 01:51:21,788 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 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) [2023-04-02 01:51:21,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-04-02 01:51:21,794 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:51:21,794 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:51:21,795 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:51:21,799 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:51:21,799 INFO L85 PathProgramCache]: Analyzing trace with hash 2019451875, now seen corresponding path program 1 times [2023-04-02 01:51:21,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:51:21,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182717139] [2023-04-02 01:51:21,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:21,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:51:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:51:21,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:51:21,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182717139] [2023-04-02 01:51:21,906 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-04-02 01:51:21,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086049238] [2023-04-02 01:51:21,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:21,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:51:21,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:51:21,913 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 01:51:21,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-04-02 01:51:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:51:21,977 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 1 conjunts are in the unsatisfiable core [2023-04-02 01:51:21,981 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:51:21,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:51:22,000 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-02 01:51:22,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086049238] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 01:51:22,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 01:51:22,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-04-02 01:51:22,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482349594] [2023-04-02 01:51:22,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:51:22,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-04-02 01:51:22,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:51:22,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-04-02 01:51:22,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-04-02 01:51:22,033 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 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) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:51:22,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:51:22,050 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2023-04-02 01:51:22,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-04-02 01:51:22,052 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-04-02 01:51:22,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:51:22,057 INFO L225 Difference]: With dead ends: 44 [2023-04-02 01:51:22,058 INFO L226 Difference]: Without dead ends: 20 [2023-04-02 01:51:22,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-04-02 01:51:22,063 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 01:51:22,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 01:51:22,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-04-02 01:51:22,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-04-02 01:51:22,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-02 01:51:22,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2023-04-02 01:51:22,099 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2023-04-02 01:51:22,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:51:22,099 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2023-04-02 01:51:22,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:51:22,101 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2023-04-02 01:51:22,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-04-02 01:51:22,102 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:51:22,102 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:51:22,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-04-02 01:51:22,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-04-02 01:51:22,314 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:51:22,314 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:51:22,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1431109416, now seen corresponding path program 1 times [2023-04-02 01:51:22,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:51:22,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939980021] [2023-04-02 01:51:22,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:22,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:51:22,331 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 01:51:22,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [385314862] [2023-04-02 01:51:22,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:22,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:51:22,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:51:22,337 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 01:51:22,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-04-02 01:51:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:51:22,395 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 16 conjunts are in the unsatisfiable core [2023-04-02 01:51:22,398 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:51:22,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:51:22,509 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-02 01:51:22,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:51:22,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939980021] [2023-04-02 01:51:22,509 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 01:51:22,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385314862] [2023-04-02 01:51:22,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385314862] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 01:51:22,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 01:51:22,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-04-02 01:51:22,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424415254] [2023-04-02 01:51:22,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:51:22,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-02 01:51:22,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:51:22,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-02 01:51:22,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-04-02 01:51:22,538 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:51:22,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:51:22,647 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2023-04-02 01:51:22,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-02 01:51:22,648 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-04-02 01:51:22,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:51:22,649 INFO L225 Difference]: With dead ends: 34 [2023-04-02 01:51:22,649 INFO L226 Difference]: Without dead ends: 29 [2023-04-02 01:51:22,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-04-02 01:51:22,651 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 01:51:22,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 61 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 01:51:22,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-04-02 01:51:22,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2023-04-02 01:51:22,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-02 01:51:22,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2023-04-02 01:51:22,660 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 12 [2023-04-02 01:51:22,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:51:22,660 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2023-04-02 01:51:22,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:51:22,660 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2023-04-02 01:51:22,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-04-02 01:51:22,661 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:51:22,661 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:51:22,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-04-02 01:51:22,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-04-02 01:51:22,867 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:51:22,867 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:51:22,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1603905768, now seen corresponding path program 1 times [2023-04-02 01:51:22,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:51:22,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605905089] [2023-04-02 01:51:22,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:22,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:51:22,903 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 01:51:22,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [143377005] [2023-04-02 01:51:22,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:22,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:51:22,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:51:22,908 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 01:51:22,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-04-02 01:51:22,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:51:22,970 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 25 conjunts are in the unsatisfiable core [2023-04-02 01:51:22,975 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:51:23,204 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:51:23,204 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:51:23,590 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:51:23,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:51:23,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605905089] [2023-04-02 01:51:23,591 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 01:51:23,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143377005] [2023-04-02 01:51:23,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143377005] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:51:23,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 01:51:23,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2023-04-02 01:51:23,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620486809] [2023-04-02 01:51:23,591 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 01:51:23,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-04-02 01:51:23,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:51:23,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-04-02 01:51:23,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2023-04-02 01:51:23,593 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 16 states, 14 states have (on average 2.0) internal successors, (28), 15 states have internal predecessors, (28), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-02 01:51:23,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:51:23,902 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2023-04-02 01:51:23,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-04-02 01:51:23,903 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0) internal successors, (28), 15 states have internal predecessors, (28), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 22 [2023-04-02 01:51:23,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:51:23,904 INFO L225 Difference]: With dead ends: 45 [2023-04-02 01:51:23,904 INFO L226 Difference]: Without dead ends: 38 [2023-04-02 01:51:23,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2023-04-02 01:51:23,905 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 27 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-02 01:51:23,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 136 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-02 01:51:23,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-04-02 01:51:23,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2023-04-02 01:51:23,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 01:51:23,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2023-04-02 01:51:23,916 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2023-04-02 01:51:23,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:51:23,916 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2023-04-02 01:51:23,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.0) internal successors, (28), 15 states have internal predecessors, (28), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-02 01:51:23,917 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2023-04-02 01:51:23,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-04-02 01:51:23,918 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:51:23,918 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:51:23,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-04-02 01:51:24,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:51:24,124 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:51:24,124 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:51:24,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1213814707, now seen corresponding path program 1 times [2023-04-02 01:51:24,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:51:24,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303811450] [2023-04-02 01:51:24,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:24,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:51:24,140 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 01:51:24,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1576488263] [2023-04-02 01:51:24,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:24,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:51:24,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:51:24,142 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 01:51:24,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-04-02 01:51:24,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:51:24,188 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 7 conjunts are in the unsatisfiable core [2023-04-02 01:51:24,190 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:51:24,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:51:24,234 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:51:24,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:51:24,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:51:24,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303811450] [2023-04-02 01:51:24,285 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 01:51:24,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576488263] [2023-04-02 01:51:24,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576488263] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:51:24,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 01:51:24,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-04-02 01:51:24,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903147891] [2023-04-02 01:51:24,286 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 01:51:24,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-04-02 01:51:24,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:51:24,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-04-02 01:51:24,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-04-02 01:51:24,289 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-04-02 01:51:24,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:51:24,368 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2023-04-02 01:51:24,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-02 01:51:24,369 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 23 [2023-04-02 01:51:24,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:51:24,371 INFO L225 Difference]: With dead ends: 77 [2023-04-02 01:51:24,371 INFO L226 Difference]: Without dead ends: 71 [2023-04-02 01:51:24,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-04-02 01:51:24,381 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 36 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 01:51:24,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 90 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 01:51:24,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-04-02 01:51:24,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 59. [2023-04-02 01:51:24,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-04-02 01:51:24,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2023-04-02 01:51:24,395 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 23 [2023-04-02 01:51:24,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:51:24,395 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2023-04-02 01:51:24,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-04-02 01:51:24,395 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2023-04-02 01:51:24,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-04-02 01:51:24,396 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:51:24,396 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:51:24,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-04-02 01:51:24,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:51:24,608 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:51:24,608 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:51:24,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1132431350, now seen corresponding path program 1 times [2023-04-02 01:51:24,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:51:24,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909316386] [2023-04-02 01:51:24,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:24,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:51:24,621 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 01:51:24,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [774955993] [2023-04-02 01:51:24,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:24,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:51:24,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:51:24,623 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 01:51:24,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-04-02 01:51:24,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:51:24,683 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 29 conjunts are in the unsatisfiable core [2023-04-02 01:51:24,685 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:51:24,899 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 01:51:24,900 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:51:25,191 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 01:51:25,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:51:25,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909316386] [2023-04-02 01:51:25,191 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 01:51:25,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774955993] [2023-04-02 01:51:25,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774955993] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:51:25,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 01:51:25,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2023-04-02 01:51:25,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121792666] [2023-04-02 01:51:25,192 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 01:51:25,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-04-02 01:51:25,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:51:25,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-04-02 01:51:25,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2023-04-02 01:51:25,194 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand has 23 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 20 states have internal predecessors, (35), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-04-02 01:51:25,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:51:25,888 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2023-04-02 01:51:25,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-04-02 01:51:25,889 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 20 states have internal predecessors, (35), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2023-04-02 01:51:25,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:51:25,890 INFO L225 Difference]: With dead ends: 69 [2023-04-02 01:51:25,890 INFO L226 Difference]: Without dead ends: 61 [2023-04-02 01:51:25,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=261, Invalid=1299, Unknown=0, NotChecked=0, Total=1560 [2023-04-02 01:51:25,891 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 53 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 01:51:25,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 123 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 01:51:25,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-04-02 01:51:25,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2023-04-02 01:51:25,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-02 01:51:25,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2023-04-02 01:51:25,905 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 29 [2023-04-02 01:51:25,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:51:25,905 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2023-04-02 01:51:25,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 20 states have internal predecessors, (35), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-04-02 01:51:25,906 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2023-04-02 01:51:25,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-04-02 01:51:25,907 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:51:25,907 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:51:25,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-04-02 01:51:26,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:51:26,112 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:51:26,113 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:51:26,113 INFO L85 PathProgramCache]: Analyzing trace with hash -587557621, now seen corresponding path program 1 times [2023-04-02 01:51:26,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:51:26,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741592662] [2023-04-02 01:51:26,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:26,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:51:26,125 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 01:51:26,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [678885031] [2023-04-02 01:51:26,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:26,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:51:26,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:51:26,127 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 01:51:26,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-04-02 01:51:26,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:51:26,182 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2023-04-02 01:51:26,184 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:51:26,269 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:51:26,269 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:51:26,384 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-04-02 01:51:26,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:51:26,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741592662] [2023-04-02 01:51:26,384 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 01:51:26,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678885031] [2023-04-02 01:51:26,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678885031] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:51:26,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 01:51:26,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-04-02 01:51:26,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469224760] [2023-04-02 01:51:26,385 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 01:51:26,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-04-02 01:51:26,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:51:26,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-04-02 01:51:26,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-04-02 01:51:26,388 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2023-04-02 01:51:26,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:51:26,565 INFO L93 Difference]: Finished difference Result 120 states and 135 transitions. [2023-04-02 01:51:26,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-04-02 01:51:26,565 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) Word has length 53 [2023-04-02 01:51:26,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:51:26,569 INFO L225 Difference]: With dead ends: 120 [2023-04-02 01:51:26,569 INFO L226 Difference]: Without dead ends: 114 [2023-04-02 01:51:26,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2023-04-02 01:51:26,570 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 59 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 01:51:26,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 142 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 01:51:26,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-04-02 01:51:26,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2023-04-02 01:51:26,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 89 states have internal predecessors, (100), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-04-02 01:51:26,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2023-04-02 01:51:26,613 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 53 [2023-04-02 01:51:26,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:51:26,615 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2023-04-02 01:51:26,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2023-04-02 01:51:26,618 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2023-04-02 01:51:26,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-04-02 01:51:26,625 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:51:26,625 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:51:26,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-04-02 01:51:26,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:51:26,832 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:51:26,833 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:51:26,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1126840971, now seen corresponding path program 2 times [2023-04-02 01:51:26,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:51:26,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743290863] [2023-04-02 01:51:26,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:26,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:51:26,848 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 01:51:26,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2050471582] [2023-04-02 01:51:26,849 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-04-02 01:51:26,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:51:26,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:51:26,850 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 01:51:26,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-04-02 01:51:26,939 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-04-02 01:51:26,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 01:51:26,941 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 25 conjunts are in the unsatisfiable core [2023-04-02 01:51:26,954 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:51:27,153 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 470 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:51:27,154 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:51:27,433 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 290 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-04-02 01:51:27,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:51:27,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743290863] [2023-04-02 01:51:27,434 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 01:51:27,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050471582] [2023-04-02 01:51:27,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050471582] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:51:27,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 01:51:27,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-04-02 01:51:27,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488581322] [2023-04-02 01:51:27,434 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 01:51:27,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-04-02 01:51:27,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:51:27,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-04-02 01:51:27,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2023-04-02 01:51:27,436 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand has 26 states, 26 states have (on average 5.653846153846154) internal successors, (147), 26 states have internal predecessors, (147), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (22), 22 states have call predecessors, (22), 21 states have call successors, (22) [2023-04-02 01:51:27,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:51:27,845 INFO L93 Difference]: Finished difference Result 240 states and 273 transitions. [2023-04-02 01:51:27,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-04-02 01:51:27,846 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.653846153846154) internal successors, (147), 26 states have internal predecessors, (147), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (22), 22 states have call predecessors, (22), 21 states have call successors, (22) Word has length 113 [2023-04-02 01:51:27,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:51:27,847 INFO L225 Difference]: With dead ends: 240 [2023-04-02 01:51:27,848 INFO L226 Difference]: Without dead ends: 234 [2023-04-02 01:51:27,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2023-04-02 01:51:27,849 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 182 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 01:51:27,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 207 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 01:51:27,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2023-04-02 01:51:27,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2023-04-02 01:51:27,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 185 states have (on average 1.1243243243243244) internal successors, (208), 185 states have internal predecessors, (208), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-04-02 01:51:27,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 256 transitions. [2023-04-02 01:51:27,899 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 256 transitions. Word has length 113 [2023-04-02 01:51:27,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:51:27,900 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 256 transitions. [2023-04-02 01:51:27,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.653846153846154) internal successors, (147), 26 states have internal predecessors, (147), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (22), 22 states have call predecessors, (22), 21 states have call successors, (22) [2023-04-02 01:51:27,900 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 256 transitions. [2023-04-02 01:51:27,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2023-04-02 01:51:27,907 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:51:27,907 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:51:27,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-04-02 01:51:28,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:51:28,114 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:51:28,114 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:51:28,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1899087243, now seen corresponding path program 3 times [2023-04-02 01:51:28,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:51:28,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380038243] [2023-04-02 01:51:28,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:28,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:51:28,140 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 01:51:28,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [399814452] [2023-04-02 01:51:28,140 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-02 01:51:28,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:51:28,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:51:28,141 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 01:51:28,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-04-02 01:51:28,227 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-04-02 01:51:28,227 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 01:51:28,228 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 25 conjunts are in the unsatisfiable core [2023-04-02 01:51:28,236 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:51:28,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 234 proven. 1 refuted. 0 times theorem prover too weak. 2163 trivial. 0 not checked. [2023-04-02 01:51:28,484 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:51:28,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 106 proven. 129 refuted. 0 times theorem prover too weak. 2163 trivial. 0 not checked. [2023-04-02 01:51:28,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:51:28,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380038243] [2023-04-02 01:51:28,784 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 01:51:28,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399814452] [2023-04-02 01:51:28,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399814452] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:51:28,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 01:51:28,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-04-02 01:51:28,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100404370] [2023-04-02 01:51:28,785 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 01:51:28,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-04-02 01:51:28,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:51:28,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-04-02 01:51:28,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2023-04-02 01:51:28,786 INFO L87 Difference]: Start difference. First operand 234 states and 256 transitions. Second operand has 18 states, 14 states have (on average 2.5) internal successors, (35), 17 states have internal predecessors, (35), 6 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 01:51:29,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:51:29,014 INFO L93 Difference]: Finished difference Result 453 states and 496 transitions. [2023-04-02 01:51:29,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-02 01:51:29,015 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 2.5) internal successors, (35), 17 states have internal predecessors, (35), 6 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 233 [2023-04-02 01:51:29,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:51:29,020 INFO L225 Difference]: With dead ends: 453 [2023-04-02 01:51:29,020 INFO L226 Difference]: Without dead ends: 447 [2023-04-02 01:51:29,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 448 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2023-04-02 01:51:29,022 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 24 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 01:51:29,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 116 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 01:51:29,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2023-04-02 01:51:29,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 444. [2023-04-02 01:51:29,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 353 states have (on average 1.1246458923512748) internal successors, (397), 353 states have internal predecessors, (397), 46 states have call successors, (46), 46 states have call predecessors, (46), 44 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-04-02 01:51:29,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 487 transitions. [2023-04-02 01:51:29,093 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 487 transitions. Word has length 233 [2023-04-02 01:51:29,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:51:29,094 INFO L495 AbstractCegarLoop]: Abstraction has 444 states and 487 transitions. [2023-04-02 01:51:29,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 2.5) internal successors, (35), 17 states have internal predecessors, (35), 6 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 01:51:29,094 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 487 transitions. [2023-04-02 01:51:29,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2023-04-02 01:51:29,097 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:51:29,097 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:51:29,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-04-02 01:51:29,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-04-02 01:51:29,303 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:51:29,303 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:51:29,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1715821683, now seen corresponding path program 1 times [2023-04-02 01:51:29,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:51:29,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600171656] [2023-04-02 01:51:29,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:29,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:51:29,321 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 01:51:29,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [568757103] [2023-04-02 01:51:29,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:29,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:51:29,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:51:29,322 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 01:51:29,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-04-02 01:51:29,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:51:29,458 INFO L262 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 49 conjunts are in the unsatisfiable core [2023-04-02 01:51:29,462 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:51:29,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 44 proven. 2354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:51:29,912 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:51:30,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 44 proven. 1430 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-04-02 01:51:30,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:51:30,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600171656] [2023-04-02 01:51:30,835 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 01:51:30,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568757103] [2023-04-02 01:51:30,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568757103] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:51:30,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 01:51:30,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-04-02 01:51:30,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463870632] [2023-04-02 01:51:30,836 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 01:51:30,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-04-02 01:51:30,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:51:30,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-04-02 01:51:30,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2023-04-02 01:51:30,839 INFO L87 Difference]: Start difference. First operand 444 states and 487 transitions. Second operand has 50 states, 50 states have (on average 6.06) internal successors, (303), 50 states have internal predecessors, (303), 48 states have call successors, (48), 26 states have call predecessors, (48), 25 states have return successors, (46), 46 states have call predecessors, (46), 45 states have call successors, (46) [2023-04-02 01:51:32,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:51:32,159 INFO L93 Difference]: Finished difference Result 933 states and 1047 transitions. [2023-04-02 01:51:32,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2023-04-02 01:51:32,159 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 6.06) internal successors, (303), 50 states have internal predecessors, (303), 48 states have call successors, (48), 26 states have call predecessors, (48), 25 states have return successors, (46), 46 states have call predecessors, (46), 45 states have call successors, (46) Word has length 233 [2023-04-02 01:51:32,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:51:32,163 INFO L225 Difference]: With dead ends: 933 [2023-04-02 01:51:32,163 INFO L226 Difference]: Without dead ends: 927 [2023-04-02 01:51:32,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2023-04-02 01:51:32,167 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 375 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-02 01:51:32,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 375 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-02 01:51:32,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2023-04-02 01:51:32,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 924. [2023-04-02 01:51:32,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 737 states have (on average 1.12483039348711) internal successors, (829), 737 states have internal predecessors, (829), 94 states have call successors, (94), 94 states have call predecessors, (94), 92 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2023-04-02 01:51:32,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1015 transitions. [2023-04-02 01:51:32,265 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1015 transitions. Word has length 233 [2023-04-02 01:51:32,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:51:32,266 INFO L495 AbstractCegarLoop]: Abstraction has 924 states and 1015 transitions. [2023-04-02 01:51:32,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 6.06) internal successors, (303), 50 states have internal predecessors, (303), 48 states have call successors, (48), 26 states have call predecessors, (48), 25 states have return successors, (46), 46 states have call predecessors, (46), 45 states have call successors, (46) [2023-04-02 01:51:32,266 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1015 transitions. [2023-04-02 01:51:32,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2023-04-02 01:51:32,273 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:51:32,273 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 46, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:51:32,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-04-02 01:51:32,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:51:32,482 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:51:32,483 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:51:32,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1391114637, now seen corresponding path program 2 times [2023-04-02 01:51:32,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:51:32,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277909221] [2023-04-02 01:51:32,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:32,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:51:32,509 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 01:51:32,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [23284086] [2023-04-02 01:51:32,509 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-04-02 01:51:32,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:51:32,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:51:32,510 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 01:51:32,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-04-02 01:51:32,735 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-04-02 01:51:32,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 01:51:32,755 INFO L262 TraceCheckSpWp]: Trace formula consists of 1183 conjuncts, 97 conjunts are in the unsatisfiable core [2023-04-02 01:51:32,763 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:51:34,192 INFO L134 CoverageAnalysis]: Checked inductivity of 10534 backedges. 92 proven. 10442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:51:34,192 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:51:36,901 INFO L134 CoverageAnalysis]: Checked inductivity of 10534 backedges. 92 proven. 6302 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2023-04-02 01:51:36,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:51:36,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277909221] [2023-04-02 01:51:36,902 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 01:51:36,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23284086] [2023-04-02 01:51:36,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23284086] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:51:36,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 01:51:36,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 98 [2023-04-02 01:51:36,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889041864] [2023-04-02 01:51:36,902 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 01:51:36,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2023-04-02 01:51:36,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:51:36,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2023-04-02 01:51:36,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4565, Invalid=4941, Unknown=0, NotChecked=0, Total=9506 [2023-04-02 01:51:36,910 INFO L87 Difference]: Start difference. First operand 924 states and 1015 transitions. Second operand has 98 states, 98 states have (on average 6.275510204081633) internal successors, (615), 98 states have internal predecessors, (615), 96 states have call successors, (96), 50 states have call predecessors, (96), 49 states have return successors, (94), 94 states have call predecessors, (94), 93 states have call successors, (94) [2023-04-02 01:51:41,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:51:41,542 INFO L93 Difference]: Finished difference Result 1893 states and 2127 transitions. [2023-04-02 01:51:41,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2023-04-02 01:51:41,543 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 6.275510204081633) internal successors, (615), 98 states have internal predecessors, (615), 96 states have call successors, (96), 50 states have call predecessors, (96), 49 states have return successors, (94), 94 states have call predecessors, (94), 93 states have call successors, (94) Word has length 473 [2023-04-02 01:51:41,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:51:41,550 INFO L225 Difference]: With dead ends: 1893 [2023-04-02 01:51:41,550 INFO L226 Difference]: Without dead ends: 1887 [2023-04-02 01:51:41,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1038 GetRequests, 849 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5452 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=13540, Invalid=22750, Unknown=0, NotChecked=0, Total=36290 [2023-04-02 01:51:41,562 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 743 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-04-02 01:51:41,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 754 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-04-02 01:51:41,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1887 states. [2023-04-02 01:51:41,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1887 to 1884. [2023-04-02 01:51:41,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1884 states, 1505 states have (on average 1.1249169435215947) internal successors, (1693), 1505 states have internal predecessors, (1693), 190 states have call successors, (190), 190 states have call predecessors, (190), 188 states have return successors, (188), 188 states have call predecessors, (188), 188 states have call successors, (188) [2023-04-02 01:51:41,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 2071 transitions. [2023-04-02 01:51:41,784 INFO L78 Accepts]: Start accepts. Automaton has 1884 states and 2071 transitions. Word has length 473 [2023-04-02 01:51:41,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:51:41,785 INFO L495 AbstractCegarLoop]: Abstraction has 1884 states and 2071 transitions. [2023-04-02 01:51:41,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 6.275510204081633) internal successors, (615), 98 states have internal predecessors, (615), 96 states have call successors, (96), 50 states have call predecessors, (96), 49 states have return successors, (94), 94 states have call predecessors, (94), 93 states have call successors, (94) [2023-04-02 01:51:41,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 2071 transitions. [2023-04-02 01:51:41,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 954 [2023-04-02 01:51:41,820 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:51:41,821 INFO L195 NwaCegarLoop]: trace histogram [95, 95, 94, 94, 94, 94, 94, 94, 94, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:51:41,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-04-02 01:51:42,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-04-02 01:51:42,029 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:51:42,029 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:51:42,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1842275725, now seen corresponding path program 3 times [2023-04-02 01:51:42,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:51:42,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606010959] [2023-04-02 01:51:42,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:42,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:51:42,076 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 01:51:42,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [283296856] [2023-04-02 01:51:42,076 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-02 01:51:42,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:51:42,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:51:42,077 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 01:51:42,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-04-02 01:51:44,600 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 95 check-sat command(s) [2023-04-02 01:51:44,600 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 01:51:44,628 INFO L262 TraceCheckSpWp]: Trace formula consists of 2335 conjuncts, 193 conjunts are in the unsatisfiable core [2023-04-02 01:51:44,650 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:51:48,654 INFO L134 CoverageAnalysis]: Checked inductivity of 44086 backedges. 188 proven. 43898 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:51:48,655 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:51:52,935 INFO L134 CoverageAnalysis]: Checked inductivity of 44086 backedges. 188 proven. 26414 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2023-04-02 01:51:52,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:51:52,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606010959] [2023-04-02 01:51:52,936 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 01:51:52,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283296856] [2023-04-02 01:51:52,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283296856] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:51:52,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 01:51:52,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98] total 104 [2023-04-02 01:51:52,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368093173] [2023-04-02 01:51:52,937 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 01:51:52,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2023-04-02 01:51:52,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:51:52,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2023-04-02 01:51:52,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5156, Invalid=5556, Unknown=0, NotChecked=0, Total=10712 [2023-04-02 01:51:52,950 INFO L87 Difference]: Start difference. First operand 1884 states and 2071 transitions. Second operand has 104 states, 104 states have (on average 7.644230769230769) internal successors, (795), 104 states have internal predecessors, (795), 102 states have call successors, (192), 97 states have call predecessors, (192), 96 states have return successors, (190), 100 states have call predecessors, (190), 100 states have call successors, (190) [2023-04-02 01:51:57,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:51:57,957 INFO L93 Difference]: Finished difference Result 2013 states and 2217 transitions. [2023-04-02 01:51:57,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2023-04-02 01:51:57,958 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 7.644230769230769) internal successors, (795), 104 states have internal predecessors, (795), 102 states have call successors, (192), 97 states have call predecessors, (192), 96 states have return successors, (190), 100 states have call predecessors, (190), 100 states have call successors, (190) Word has length 953 [2023-04-02 01:51:57,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:51:57,966 INFO L225 Difference]: With dead ends: 2013 [2023-04-02 01:51:57,966 INFO L226 Difference]: Without dead ends: 2007 [2023-04-02 01:51:57,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2004 GetRequests, 1712 SyntacticMatches, 91 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9599 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=15349, Invalid=25657, Unknown=0, NotChecked=0, Total=41006 [2023-04-02 01:51:57,970 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 376 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-04-02 01:51:57,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 771 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-04-02 01:51:57,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2007 states. [2023-04-02 01:51:58,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2007 to 2004. [2023-04-02 01:51:58,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2004 states, 1601 states have (on average 1.1249219237976265) internal successors, (1801), 1601 states have internal predecessors, (1801), 202 states have call successors, (202), 202 states have call predecessors, (202), 200 states have return successors, (200), 200 states have call predecessors, (200), 200 states have call successors, (200) [2023-04-02 01:51:58,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2004 states to 2004 states and 2203 transitions. [2023-04-02 01:51:58,151 INFO L78 Accepts]: Start accepts. Automaton has 2004 states and 2203 transitions. Word has length 953 [2023-04-02 01:51:58,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:51:58,152 INFO L495 AbstractCegarLoop]: Abstraction has 2004 states and 2203 transitions. [2023-04-02 01:51:58,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 7.644230769230769) internal successors, (795), 104 states have internal predecessors, (795), 102 states have call successors, (192), 97 states have call predecessors, (192), 96 states have return successors, (190), 100 states have call predecessors, (190), 100 states have call successors, (190) [2023-04-02 01:51:58,153 INFO L276 IsEmpty]: Start isEmpty. Operand 2004 states and 2203 transitions. [2023-04-02 01:51:58,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1014 [2023-04-02 01:51:58,165 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:51:58,165 INFO L195 NwaCegarLoop]: trace histogram [101, 101, 100, 100, 100, 100, 100, 100, 100, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:51:58,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-04-02 01:51:58,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-04-02 01:51:58,379 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:51:58,379 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:51:58,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1976027917, now seen corresponding path program 4 times [2023-04-02 01:51:58,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:51:58,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822907062] [2023-04-02 01:51:58,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:58,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:51:58,413 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 01:51:58,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1925964926] [2023-04-02 01:51:58,414 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-02 01:51:58,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:51:58,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:51:58,415 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 01:51:58,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-04-02 01:51:59,010 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-02 01:51:59,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-04-02 01:51:59,011 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-04-02 01:51:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-02 01:52:00,107 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-04-02 01:52:00,107 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-04-02 01:52:00,108 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-02 01:52:00,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-04-02 01:52:00,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-04-02 01:52:00,328 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1] [2023-04-02 01:52:00,334 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-02 01:52:00,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.04 01:52:00 BoogieIcfgContainer [2023-04-02 01:52:00,539 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-02 01:52:00,539 INFO L158 Benchmark]: Toolchain (without parser) took 39385.27ms. Allocated memory was 300.9MB in the beginning and 541.1MB in the end (delta: 240.1MB). Free memory was 251.7MB in the beginning and 382.7MB in the end (delta: -131.0MB). Peak memory consumption was 110.1MB. Max. memory is 8.0GB. [2023-04-02 01:52:00,539 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 176.2MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-04-02 01:52:00,540 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.66ms. Allocated memory is still 300.9MB. Free memory was 251.7MB in the beginning and 241.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-04-02 01:52:00,540 INFO L158 Benchmark]: Boogie Preprocessor took 24.72ms. Allocated memory is still 300.9MB. Free memory was 241.2MB in the beginning and 239.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-04-02 01:52:00,540 INFO L158 Benchmark]: RCFGBuilder took 308.83ms. Allocated memory is still 300.9MB. Free memory was 239.7MB in the beginning and 227.6MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-04-02 01:52:00,541 INFO L158 Benchmark]: TraceAbstraction took 38820.58ms. Allocated memory was 300.9MB in the beginning and 541.1MB in the end (delta: 240.1MB). Free memory was 227.1MB in the beginning and 382.7MB in the end (delta: -155.6MB). Peak memory consumption was 86.0MB. Max. memory is 8.0GB. [2023-04-02 01:52:00,542 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 176.2MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 222.66ms. Allocated memory is still 300.9MB. Free memory was 251.7MB in the beginning and 241.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.72ms. Allocated memory is still 300.9MB. Free memory was 241.2MB in the beginning and 239.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 308.83ms. Allocated memory is still 300.9MB. Free memory was 239.7MB in the beginning and 227.6MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 38820.58ms. Allocated memory was 300.9MB in the beginning and 541.1MB in the end (delta: 240.1MB). Free memory was 227.1MB in the beginning and 382.7MB in the end (delta: -155.6MB). Peak memory consumption was 86.0MB. Max. memory is 8.0GB. * 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)=107, 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=397, Y=2, \old(counter)=0, counter=0, v=-393, x=0, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=0, counter=1, v=-393, x=0, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=1, v=-393, x=0, x=0, x=0, y=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, cond=1, counter=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=1, v=-393, x=0, x=0, x=0, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=1, v=-393, x=0, x=0, x=0, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=1, v=-389, x=0, x=0, x=0, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=1, v=-389, x=0, x=0, x=1, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=1, counter=2, v=-389, x=0, x=0, x=1, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=2, v=-389, x=0, x=1, x=2, y=0] [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, cond=1, counter=2] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=2, v=-389, x=0, x=1, x=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=2, v=-389, x=0, x=1, x=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=2, v=-385, x=0, x=1, x=2, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=2, v=-385, x=0, x=2, x=2, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=2, counter=3, v=-385, x=0, x=2, x=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=3, v=-385, x=0, x=2, x=4, y=0] [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, cond=1, counter=3] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=3, v=-385, x=0, x=2, x=4, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=3, v=-385, x=0, x=2, x=4, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=3, v=-381, x=0, x=2, x=4, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=3, v=-381, x=0, x=3, x=4, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=3, counter=4, v=-381, x=0, x=3, x=4, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=4, v=-381, x=0, x=3, x=6, y=0] [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, cond=1, counter=4] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=4, v=-381, x=0, x=3, x=6, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=4, v=-381, x=0, x=3, x=6, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=4, v=-377, x=0, x=3, x=6, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=4, v=-377, x=0, x=4, x=6, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=4, counter=5, v=-377, x=0, x=4, x=6, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=5, v=-377, x=0, x=4, x=8, y=0] [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, cond=1, counter=5] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=5, v=-377, x=0, x=4, x=8, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=5, v=-377, x=0, x=4, x=8, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=5, v=-373, x=0, x=4, x=8, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=5, v=-373, x=0, x=5, x=8, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=5, counter=6, v=-373, x=0, x=5, x=8, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=6, v=-373, x=0, x=10, x=5, y=0] [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, cond=1, counter=6] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=6, v=-373, x=0, x=10, x=5, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=6, v=-373, x=0, x=10, x=5, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=6, v=-369, x=0, x=10, x=5, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=6, v=-369, x=0, x=10, x=6, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=6, counter=7, v=-369, x=0, x=10, x=6, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=7, v=-369, x=0, x=12, x=6, y=0] [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, cond=1, counter=7] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=7, v=-369, x=0, x=12, x=6, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=7, v=-369, x=0, x=12, x=6, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=7, v=-365, x=0, x=12, x=6, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=7, v=-365, x=0, x=12, x=7, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=7, counter=8, v=-365, x=0, x=12, x=7, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=8, v=-365, x=0, x=14, x=7, y=0] [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, cond=1, counter=8] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=8, v=-365, x=0, x=14, x=7, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=8, v=-365, x=0, x=14, x=7, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=8, v=-361, x=0, x=14, x=7, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=8, v=-361, x=0, x=14, x=8, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=8, counter=9, v=-361, x=0, x=14, x=8, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=9, v=-361, x=0, x=16, x=8, y=0] [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, cond=1, counter=9] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=9, v=-361, x=0, x=16, x=8, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=9, v=-361, x=0, x=16, x=8, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=9, v=-357, x=0, x=16, x=8, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=9, v=-357, x=0, x=16, x=9, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=9, counter=10, v=-357, x=0, x=16, x=9, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=10, v=-357, x=0, x=18, x=9, y=0] [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, cond=1, counter=10] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=10, v=-357, x=0, x=18, x=9, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=10, v=-357, x=0, x=18, x=9, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=10, v=-353, x=0, x=18, x=9, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=10, v=-353, x=0, x=10, x=18, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=10, counter=11, v=-353, x=0, x=10, x=18, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=11, v=-353, x=0, x=10, x=20, y=0] [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, cond=1, counter=11] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=11, v=-353, x=0, x=10, x=20, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=11, v=-353, x=0, x=10, x=20, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=11, v=-349, x=0, x=10, x=20, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=11, v=-349, x=0, x=11, x=20, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=11, counter=12, v=-349, x=0, x=11, x=20, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=12, v=-349, x=0, x=11, x=22, y=0] [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, cond=1, counter=12] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=12, v=-349, x=0, x=11, x=22, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=12, v=-349, x=0, x=11, x=22, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=12, v=-345, x=0, x=11, x=22, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=12, v=-345, x=0, x=12, x=22, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=12, counter=13, v=-345, x=0, x=12, x=22, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=13, v=-345, x=0, x=12, x=24, y=0] [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, cond=1, counter=13] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=13, v=-345, x=0, x=12, x=24, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=13, v=-345, x=0, x=12, x=24, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=13, v=-341, x=0, x=12, x=24, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=13, v=-341, x=0, x=13, x=24, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=13, counter=14, v=-341, x=0, x=13, x=24, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=14, v=-341, x=0, x=13, x=26, y=0] [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, cond=1, counter=14] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=14, v=-341, x=0, x=13, x=26, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=14, v=-341, x=0, x=13, x=26, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=14, v=-337, x=0, x=13, x=26, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=14, v=-337, x=0, x=14, x=26, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=14, counter=15, v=-337, x=0, x=14, x=26, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=15, v=-337, x=0, x=14, x=28, y=0] [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, cond=1, counter=15] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=15, v=-337, x=0, x=14, x=28, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=15, v=-337, x=0, x=14, x=28, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=15, v=-333, x=0, x=14, x=28, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=15, v=-333, x=0, x=15, x=28, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=15, counter=16, v=-333, x=0, x=15, x=28, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=16, v=-333, x=0, x=15, x=30, y=0] [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, cond=1, counter=16] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=16, v=-333, x=0, x=15, x=30, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=16, v=-333, x=0, x=15, x=30, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=16, v=-329, x=0, x=15, x=30, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=16, v=-329, x=0, x=16, x=30, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=16, counter=17, v=-329, x=0, x=16, x=30, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=17, v=-329, x=0, x=16, x=32, y=0] [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, cond=1, counter=17] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=17, v=-329, x=0, x=16, x=32, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=17, v=-329, x=0, x=16, x=32, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=17, v=-325, x=0, x=16, x=32, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=17, v=-325, x=0, x=17, x=32, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=17, counter=18, v=-325, x=0, x=17, x=32, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=18, v=-325, x=0, x=17, x=34, y=0] [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, cond=1, counter=18] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=18, v=-325, x=0, x=17, x=34, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=18, v=-325, x=0, x=17, x=34, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=18, v=-321, x=0, x=17, x=34, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=18, v=-321, x=0, x=18, x=34, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=18, counter=19, v=-321, x=0, x=18, x=34, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=19, v=-321, x=0, x=18, x=36, y=0] [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, cond=1, counter=19] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=19, v=-321, x=0, x=18, x=36, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=19, v=-321, x=0, x=18, x=36, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=19, v=-317, x=0, x=18, x=36, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=19, v=-317, x=0, x=19, x=36, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=19, counter=20, v=-317, x=0, x=19, x=36, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=20, v=-317, x=0, x=19, x=38, y=0] [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, cond=1, counter=20] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=20, v=-317, x=0, x=19, x=38, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=20, v=-317, x=0, x=19, x=38, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=20, v=-313, x=0, x=19, x=38, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=20, v=-313, x=0, x=20, x=38, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=20, counter=21, v=-313, x=0, x=20, x=38, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=21, v=-313, x=0, x=20, x=40, y=0] [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, cond=1, counter=21] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=21, v=-313, x=0, x=20, x=40, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=21, v=-313, x=0, x=20, x=40, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=21, v=-309, x=0, x=20, x=40, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=21, v=-309, x=0, x=21, x=40, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=21, counter=22, v=-309, x=0, x=21, x=40, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=22, v=-309, x=0, x=21, x=42, y=0] [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, cond=1, counter=22] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=22, v=-309, x=0, x=21, x=42, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=22, v=-309, x=0, x=21, x=42, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=22, v=-305, x=0, x=21, x=42, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=22, v=-305, x=0, x=22, x=42, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=22, counter=23, v=-305, x=0, x=22, x=42, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=23, v=-305, x=0, x=22, x=44, y=0] [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, cond=1, counter=23] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=23, v=-305, x=0, x=22, x=44, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=23, v=-305, x=0, x=22, x=44, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=23, v=-301, x=0, x=22, x=44, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=23, v=-301, x=0, x=23, x=44, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=23, counter=24, v=-301, x=0, x=23, x=44, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=24, v=-301, x=0, x=23, x=46, y=0] [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, cond=1, counter=24] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=24, v=-301, x=0, x=23, x=46, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=24, v=-301, x=0, x=23, x=46, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=24, v=-297, x=0, x=23, x=46, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=24, v=-297, x=0, x=24, x=46, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=24, counter=25, v=-297, x=0, x=24, x=46, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=25, v=-297, x=0, x=24, x=48, y=0] [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, cond=1, counter=25] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=25, v=-297, x=0, x=24, x=48, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=25, v=-297, x=0, x=24, x=48, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=25, v=-293, x=0, x=24, x=48, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=25, v=-293, x=0, x=25, x=48, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=25, counter=26, v=-293, x=0, x=25, x=48, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=26, v=-293, x=0, x=25, x=50, y=0] [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, cond=1, counter=26] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=26, v=-293, x=0, x=25, x=50, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=26, v=-293, x=0, x=25, x=50, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=26, v=-289, x=0, x=25, x=50, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=26, v=-289, x=0, x=26, x=50, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=26, counter=27, v=-289, x=0, x=26, x=50, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=27, v=-289, x=0, x=26, x=52, y=0] [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, cond=1, counter=27] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=27, v=-289, x=0, x=26, x=52, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=27, v=-289, x=0, x=26, x=52, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=27, v=-285, x=0, x=26, x=52, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=27, v=-285, x=0, x=27, x=52, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=27, counter=28, v=-285, x=0, x=27, x=52, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=28, v=-285, x=0, x=27, x=54, y=0] [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, cond=1, counter=28] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=28, v=-285, x=0, x=27, x=54, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=28, v=-285, x=0, x=27, x=54, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=28, v=-281, x=0, x=27, x=54, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=28, v=-281, x=0, x=28, x=54, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=28, counter=29, v=-281, x=0, x=28, x=54, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=29, v=-281, x=0, x=28, x=56, y=0] [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, cond=1, counter=29] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=29, v=-281, x=0, x=28, x=56, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=29, v=-281, x=0, x=28, x=56, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=29, v=-277, x=0, x=28, x=56, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=29, v=-277, x=0, x=29, x=56, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=29, counter=30, v=-277, x=0, x=29, x=56, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=30, v=-277, x=0, x=29, x=58, y=0] [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, cond=1, counter=30] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=30, v=-277, x=0, x=29, x=58, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=30, v=-277, x=0, x=29, x=58, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=30, v=-273, x=0, x=29, x=58, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=30, v=-273, x=0, x=30, x=58, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=30, counter=31, v=-273, x=0, x=30, x=58, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=31, v=-273, x=0, x=30, x=60, y=0] [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, cond=1, counter=31] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=31, v=-273, x=0, x=30, x=60, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=31, v=-273, x=0, x=30, x=60, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=31, v=-269, x=0, x=30, x=60, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=31, v=-269, x=0, x=31, x=60, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=31, counter=32, v=-269, x=0, x=31, x=60, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=32, v=-269, x=0, x=31, x=62, y=0] [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, cond=1, counter=32] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=32, v=-269, x=0, x=31, x=62, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=32, v=-269, x=0, x=31, x=62, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=32, v=-265, x=0, x=31, x=62, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=32, v=-265, x=0, x=32, x=62, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=32, counter=33, v=-265, x=0, x=32, x=62, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=33, v=-265, x=0, x=32, x=64, y=0] [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, cond=1, counter=33] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=33, v=-265, x=0, x=32, x=64, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=33, v=-265, x=0, x=32, x=64, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=33, v=-261, x=0, x=32, x=64, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=33, v=-261, x=0, x=33, x=64, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=33, counter=34, v=-261, x=0, x=33, x=64, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=34, v=-261, x=0, x=33, x=66, y=0] [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, cond=1, counter=34] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=34, v=-261, x=0, x=33, x=66, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=34, v=-261, x=0, x=33, x=66, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=34, v=-257, x=0, x=33, x=66, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=34, v=-257, x=0, x=34, x=66, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=34, counter=35, v=-257, x=0, x=34, x=66, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=35, v=-257, x=0, x=34, x=68, y=0] [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, cond=1, counter=35] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=35, v=-257, x=0, x=34, x=68, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=35, v=-257, x=0, x=34, x=68, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=35, v=-253, x=0, x=34, x=68, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=35, v=-253, x=0, x=35, x=68, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=35, counter=36, v=-253, x=0, x=35, x=68, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=36, v=-253, x=0, x=35, x=70, y=0] [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, cond=1, counter=36] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=36, v=-253, x=0, x=35, x=70, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=36, v=-253, x=0, x=35, x=70, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=36, v=-249, x=0, x=35, x=70, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=36, v=-249, x=0, x=36, x=70, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=36, counter=37, v=-249, x=0, x=36, x=70, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=37, v=-249, x=0, x=36, x=72, y=0] [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, cond=1, counter=37] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=37, v=-249, x=0, x=36, x=72, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=37, v=-249, x=0, x=36, x=72, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=37, v=-245, x=0, x=36, x=72, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=37, v=-245, x=0, x=37, x=72, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=37, counter=38, v=-245, x=0, x=37, x=72, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=38, v=-245, x=0, x=37, x=74, y=0] [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, cond=1, counter=38] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=38, v=-245, x=0, x=37, x=74, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=38, v=-245, x=0, x=37, x=74, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=38, v=-241, x=0, x=37, x=74, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=38, v=-241, x=0, x=38, x=74, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=38, counter=39, v=-241, x=0, x=38, x=74, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=39, v=-241, x=0, x=38, x=76, y=0] [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, cond=1, counter=39] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=39, v=-241, x=0, x=38, x=76, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=39, v=-241, x=0, x=38, x=76, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=39, v=-237, x=0, x=38, x=76, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=39, v=-237, x=0, x=39, x=76, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=39, counter=40, v=-237, x=0, x=39, x=76, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=40, v=-237, x=0, x=39, x=78, y=0] [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, cond=1, counter=40] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=40, v=-237, x=0, x=39, x=78, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=40, v=-237, x=0, x=39, x=78, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=40, v=-233, x=0, x=39, x=78, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=40, v=-233, x=0, x=40, x=78, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=40, counter=41, v=-233, x=0, x=40, x=78, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=41, v=-233, x=0, x=40, x=80, y=0] [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, cond=1, counter=41] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=41, v=-233, x=0, x=40, x=80, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=41, v=-233, x=0, x=40, x=80, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=41, v=-229, x=0, x=40, x=80, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=41, v=-229, x=0, x=41, x=80, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=41, counter=42, v=-229, x=0, x=41, x=80, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=42, v=-229, x=0, x=41, x=82, y=0] [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, cond=1, counter=42] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=42, v=-229, x=0, x=41, x=82, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=42, v=-229, x=0, x=41, x=82, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=42, v=-225, x=0, x=41, x=82, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=42, v=-225, x=0, x=42, x=82, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=42, counter=43, v=-225, x=0, x=42, x=82, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=43, v=-225, x=0, x=42, x=84, y=0] [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, cond=1, counter=43] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=43, v=-225, x=0, x=42, x=84, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=43, v=-225, x=0, x=42, x=84, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=43, v=-221, x=0, x=42, x=84, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=43, v=-221, x=0, x=43, x=84, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=43, counter=44, v=-221, x=0, x=43, x=84, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=44, v=-221, x=0, x=43, x=86, y=0] [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, cond=1, counter=44] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=44, v=-221, x=0, x=43, x=86, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=44, v=-221, x=0, x=43, x=86, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=44, v=-217, x=0, x=43, x=86, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=44, v=-217, x=0, x=44, x=86, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=44, counter=45, v=-217, x=0, x=44, x=86, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=45, v=-217, x=0, x=44, x=88, y=0] [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, cond=1, counter=45] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=45, v=-217, x=0, x=44, x=88, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=45, v=-217, x=0, x=44, x=88, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=45, v=-213, x=0, x=44, x=88, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=45, v=-213, x=0, x=45, x=88, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=45, counter=46, v=-213, x=0, x=45, x=88, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=46, v=-213, x=0, x=45, x=90, y=0] [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, cond=1, counter=46] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=46, v=-213, x=0, x=45, x=90, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=46, v=-213, x=0, x=45, x=90, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=46, v=-209, x=0, x=45, x=90, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=46, v=-209, x=0, x=46, x=90, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=46, counter=47, v=-209, x=0, x=46, x=90, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=47, v=-209, x=0, x=46, x=92, y=0] [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, cond=1, counter=47] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=47, v=-209, x=0, x=46, x=92, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=47, v=-209, x=0, x=46, x=92, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=47, v=-205, x=0, x=46, x=92, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=47, v=-205, x=0, x=47, x=92, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=47, counter=48, v=-205, x=0, x=47, x=92, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=48, v=-205, x=0, x=47, x=94, y=0] [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, cond=1, counter=48] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=48, v=-205, x=0, x=47, x=94, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=48, v=-205, x=0, x=47, x=94, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=48, v=-201, x=0, x=47, x=94, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=48, v=-201, x=0, x=48, x=94, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=48, counter=49, v=-201, x=0, x=48, x=94, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=49, v=-201, x=0, x=48, x=96, y=0] [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, cond=1, counter=49] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=49, v=-201, x=0, x=48, x=96, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=49, v=-201, x=0, x=48, x=96, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=49, v=-197, x=0, x=48, x=96, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=49, v=-197, x=0, x=49, x=96, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=49, counter=50, v=-197, x=0, x=49, x=96, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=50, v=-197, x=0, x=49, x=98, y=0] [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, cond=1, counter=50] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=50, v=-197, x=0, x=49, x=98, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=50, v=-197, x=0, x=49, x=98, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=50, v=-193, x=0, x=49, x=98, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=50, v=-193, x=0, x=50, x=98, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=50, counter=51, v=-193, x=0, x=50, x=98, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=51, v=-193, x=0, x=100, x=50, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=51] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=51] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=51, v=-193, x=0, x=100, x=50, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=51, v=-193, x=0, x=100, x=50, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=51, v=-189, x=0, x=100, x=50, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=51, v=-189, x=0, x=100, x=51, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=51, counter=52, v=-189, x=0, x=100, x=51, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=52, v=-189, x=0, x=102, x=51, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=52] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=52] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=52, v=-189, x=0, x=102, x=51, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=52, v=-189, x=0, x=102, x=51, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=52, v=-185, x=0, x=102, x=51, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=52, v=-185, x=0, x=102, x=52, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=52, counter=53, v=-185, x=0, x=102, x=52, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=53, v=-185, x=0, x=104, x=52, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=53] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=53] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=53, v=-185, x=0, x=104, x=52, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=53, v=-185, x=0, x=104, x=52, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=53, v=-181, x=0, x=104, x=52, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=53, v=-181, x=0, x=104, x=53, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=53, counter=54, v=-181, x=0, x=104, x=53, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=54, v=-181, x=0, x=106, x=53, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=54] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=54] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=54, v=-181, x=0, x=106, x=53, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=54, v=-181, x=0, x=106, x=53, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=54, v=-177, x=0, x=106, x=53, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=54, v=-177, x=0, x=106, x=54, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=54, counter=55, v=-177, x=0, x=106, x=54, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=55, v=-177, x=0, x=108, x=54, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=55] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=55] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=55, v=-177, x=0, x=108, x=54, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=55, v=-177, x=0, x=108, x=54, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=55, v=-173, x=0, x=108, x=54, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=55, v=-173, x=0, x=108, x=55, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=55, counter=56, v=-173, x=0, x=108, x=55, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=56, v=-173, x=0, x=110, x=55, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=56] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=56] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=56, v=-173, x=0, x=110, x=55, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=56, v=-173, x=0, x=110, x=55, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=56, v=-169, x=0, x=110, x=55, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=56, v=-169, x=0, x=110, x=56, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=56, counter=57, v=-169, x=0, x=110, x=56, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=57, v=-169, x=0, x=112, x=56, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=57] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=57] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=57, v=-169, x=0, x=112, x=56, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=57, v=-169, x=0, x=112, x=56, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=57, v=-165, x=0, x=112, x=56, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=57, v=-165, x=0, x=112, x=57, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=57, counter=58, v=-165, x=0, x=112, x=57, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=58, v=-165, x=0, x=114, x=57, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=58] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=58] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=58, v=-165, x=0, x=114, x=57, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=58, v=-165, x=0, x=114, x=57, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=58, v=-161, x=0, x=114, x=57, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=58, v=-161, x=0, x=114, x=58, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=58, counter=59, v=-161, x=0, x=114, x=58, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=59, v=-161, x=0, x=116, x=58, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=59] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=59] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=59, v=-161, x=0, x=116, x=58, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=59, v=-161, x=0, x=116, x=58, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=59, v=-157, x=0, x=116, x=58, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=59, v=-157, x=0, x=116, x=59, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=59, counter=60, v=-157, x=0, x=116, x=59, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=60, v=-157, x=0, x=118, x=59, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=60] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=60] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=60, v=-157, x=0, x=118, x=59, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=60, v=-157, x=0, x=118, x=59, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=60, v=-153, x=0, x=118, x=59, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=60, v=-153, x=0, x=118, x=60, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=60, counter=61, v=-153, x=0, x=118, x=60, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=61, v=-153, x=0, x=120, x=60, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=61] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=61] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=61, v=-153, x=0, x=120, x=60, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=61, v=-153, x=0, x=120, x=60, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=61, v=-149, x=0, x=120, x=60, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=61, v=-149, x=0, x=120, x=61, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=61, counter=62, v=-149, x=0, x=120, x=61, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=62, v=-149, x=0, x=122, x=61, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=62] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=62] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=62, v=-149, x=0, x=122, x=61, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=62, v=-149, x=0, x=122, x=61, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=62, v=-145, x=0, x=122, x=61, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=62, v=-145, x=0, x=122, x=62, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=62, counter=63, v=-145, x=0, x=122, x=62, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=63, v=-145, x=0, x=124, x=62, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=63] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=63] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=63, v=-145, x=0, x=124, x=62, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=63, v=-145, x=0, x=124, x=62, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=63, v=-141, x=0, x=124, x=62, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=63, v=-141, x=0, x=124, x=63, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=63, counter=64, v=-141, x=0, x=124, x=63, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=64, v=-141, x=0, x=126, x=63, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=64] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=64] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=64, v=-141, x=0, x=126, x=63, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=64, v=-141, x=0, x=126, x=63, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=64, v=-137, x=0, x=126, x=63, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=64, v=-137, x=0, x=126, x=64, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=64, counter=65, v=-137, x=0, x=126, x=64, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=65, v=-137, x=0, x=128, x=64, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=65] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=65] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=65, v=-137, x=0, x=128, x=64, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=65, v=-137, x=0, x=128, x=64, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=65, v=-133, x=0, x=128, x=64, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=65, v=-133, x=0, x=128, x=65, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=65, counter=66, v=-133, x=0, x=128, x=65, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=66, v=-133, x=0, x=130, x=65, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=66] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=66] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=66, v=-133, x=0, x=130, x=65, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=66, v=-133, x=0, x=130, x=65, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=66, v=-129, x=0, x=130, x=65, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=66, v=-129, x=0, x=130, x=66, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=66, counter=67, v=-129, x=0, x=130, x=66, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=67, v=-129, x=0, x=132, x=66, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=67] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=67] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=67, v=-129, x=0, x=132, x=66, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=67, v=-129, x=0, x=132, x=66, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=67, v=-125, x=0, x=132, x=66, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=67, v=-125, x=0, x=132, x=67, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=67, counter=68, v=-125, x=0, x=132, x=67, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=68, v=-125, x=0, x=134, x=67, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=68] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=68] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=68, v=-125, x=0, x=134, x=67, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=68, v=-125, x=0, x=134, x=67, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=68, v=-121, x=0, x=134, x=67, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=68, v=-121, x=0, x=134, x=68, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=68, counter=69, v=-121, x=0, x=134, x=68, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=69, v=-121, x=0, x=136, x=68, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=69] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=69] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=69, v=-121, x=0, x=136, x=68, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=69, v=-121, x=0, x=136, x=68, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=69, v=-117, x=0, x=136, x=68, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=69, v=-117, x=0, x=136, x=69, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=69, counter=70, v=-117, x=0, x=136, x=69, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=70, v=-117, x=0, x=138, x=69, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=70] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=70] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=70, v=-117, x=0, x=138, x=69, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=70, v=-117, x=0, x=138, x=69, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=70, v=-113, x=0, x=138, x=69, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=70, v=-113, x=0, x=138, x=70, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=70, counter=71, v=-113, x=0, x=138, x=70, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=71, v=-113, x=0, x=140, x=70, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=71] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=71] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=71, v=-113, x=0, x=140, x=70, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=71, v=-113, x=0, x=140, x=70, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=71, v=-109, x=0, x=140, x=70, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=71, v=-109, x=0, x=140, x=71, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=71, counter=72, v=-109, x=0, x=140, x=71, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=72, v=-109, x=0, x=142, x=71, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=72] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=72] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=72, v=-109, x=0, x=142, x=71, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=72, v=-109, x=0, x=142, x=71, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=72, v=-105, x=0, x=142, x=71, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=72, v=-105, x=0, x=142, x=72, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=72, counter=73, v=-105, x=0, x=142, x=72, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=73, v=-105, x=0, x=144, x=72, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=73] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=73] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=73, v=-105, x=0, x=144, x=72, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=73, v=-105, x=0, x=144, x=72, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=73, v=-101, x=0, x=144, x=72, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=73, v=-101, x=0, x=144, x=73, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=73, counter=74, v=-101, x=0, x=144, x=73, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=74, v=-101, x=0, x=146, x=73, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=74] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=74] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=74, v=-101, x=0, x=146, x=73, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=74, v=-101, x=0, x=146, x=73, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=74, v=-97, x=0, x=146, x=73, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=74, v=-97, x=0, x=146, x=74, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=74, counter=75, v=-97, x=0, x=146, x=74, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=75, v=-97, x=0, x=148, x=74, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=75] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=75] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=75, v=-97, x=0, x=148, x=74, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=75, v=-97, x=0, x=148, x=74, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=75, v=-93, x=0, x=148, x=74, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=75, v=-93, x=0, x=148, x=75, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=75, counter=76, v=-93, x=0, x=148, x=75, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=76, v=-93, x=0, x=150, x=75, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=76] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=76] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=76, v=-93, x=0, x=150, x=75, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=76, v=-93, x=0, x=150, x=75, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=76, v=-89, x=0, x=150, x=75, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=76, v=-89, x=0, x=150, x=76, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=76, counter=77, v=-89, x=0, x=150, x=76, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=77, v=-89, x=0, x=152, x=76, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=77] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=77] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=77, v=-89, x=0, x=152, x=76, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=77, v=-89, x=0, x=152, x=76, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=77, v=-85, x=0, x=152, x=76, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=77, v=-85, x=0, x=152, x=77, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=77, counter=78, v=-85, x=0, x=152, x=77, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=78, v=-85, x=0, x=154, x=77, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=78] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=78] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=78, v=-85, x=0, x=154, x=77, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=78, v=-85, x=0, x=154, x=77, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=78, v=-81, x=0, x=154, x=77, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=78, v=-81, x=0, x=154, x=78, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=78, counter=79, v=-81, x=0, x=154, x=78, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=79, v=-81, x=0, x=156, x=78, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=79] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=79] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=79, v=-81, x=0, x=156, x=78, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=79, v=-81, x=0, x=156, x=78, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=79, v=-77, x=0, x=156, x=78, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=79, v=-77, x=0, x=156, x=79, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=79, counter=80, v=-77, x=0, x=156, x=79, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=80, v=-77, x=0, x=158, x=79, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=80] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=80] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=80, v=-77, x=0, x=158, x=79, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=80, v=-77, x=0, x=158, x=79, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=80, v=-73, x=0, x=158, x=79, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=80, v=-73, x=0, x=158, x=80, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=80, counter=81, v=-73, x=0, x=158, x=80, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=81, v=-73, x=0, x=160, x=80, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=81] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=81] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=81, v=-73, x=0, x=160, x=80, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=81, v=-73, x=0, x=160, x=80, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=81, v=-69, x=0, x=160, x=80, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=81, v=-69, x=0, x=160, x=81, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=81, counter=82, v=-69, x=0, x=160, x=81, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=82, v=-69, x=0, x=162, x=81, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=82] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=82] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=82, v=-69, x=0, x=162, x=81, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=82, v=-69, x=0, x=162, x=81, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=82, v=-65, x=0, x=162, x=81, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=82, v=-65, x=0, x=162, x=82, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=82, counter=83, v=-65, x=0, x=162, x=82, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=83, v=-65, x=0, x=164, x=82, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=83] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=83] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=83, v=-65, x=0, x=164, x=82, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=83, v=-65, x=0, x=164, x=82, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=83, v=-61, x=0, x=164, x=82, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=83, v=-61, x=0, x=164, x=83, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=83, counter=84, v=-61, x=0, x=164, x=83, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=84, v=-61, x=0, x=166, x=83, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=84] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=84] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=84, v=-61, x=0, x=166, x=83, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=84, v=-61, x=0, x=166, x=83, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=84, v=-57, x=0, x=166, x=83, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=84, v=-57, x=0, x=166, x=84, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=84, counter=85, v=-57, x=0, x=166, x=84, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=85, v=-57, x=0, x=168, x=84, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=85] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=85] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=85, v=-57, x=0, x=168, x=84, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=85, v=-57, x=0, x=168, x=84, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=85, v=-53, x=0, x=168, x=84, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=85, v=-53, x=0, x=168, x=85, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=85, counter=86, v=-53, x=0, x=168, x=85, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=86, v=-53, x=0, x=170, x=85, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=86] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=86] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=86, v=-53, x=0, x=170, x=85, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=86, v=-53, x=0, x=170, x=85, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=86, v=-49, x=0, x=170, x=85, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=86, v=-49, x=0, x=170, x=86, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=86, counter=87, v=-49, x=0, x=170, x=86, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=87, v=-49, x=0, x=172, x=86, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=87] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=87] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=87, v=-49, x=0, x=172, x=86, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=87, v=-49, x=0, x=172, x=86, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=87, v=-45, x=0, x=172, x=86, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=87, v=-45, x=0, x=172, x=87, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=87, counter=88, v=-45, x=0, x=172, x=87, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=88, v=-45, x=0, x=174, x=87, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=88] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=88] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=88, v=-45, x=0, x=174, x=87, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=88, v=-45, x=0, x=174, x=87, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=88, v=-41, x=0, x=174, x=87, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=88, v=-41, x=0, x=174, x=88, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=88, counter=89, v=-41, x=0, x=174, x=88, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=89, v=-41, x=0, x=176, x=88, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=89] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=89] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=89, v=-41, x=0, x=176, x=88, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=89, v=-41, x=0, x=176, x=88, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=89, v=-37, x=0, x=176, x=88, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=89, v=-37, x=0, x=176, x=89, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=89, counter=90, v=-37, x=0, x=176, x=89, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=90, v=-37, x=0, x=178, x=89, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=90] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=90] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=90, v=-37, x=0, x=178, x=89, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=90, v=-37, x=0, x=178, x=89, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=90, v=-33, x=0, x=178, x=89, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=90, v=-33, x=0, x=178, x=90, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=90, counter=91, v=-33, x=0, x=178, x=90, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=91, v=-33, x=0, x=180, x=90, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=91] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=91] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=91, v=-33, x=0, x=180, x=90, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=91, v=-33, x=0, x=180, x=90, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=91, v=-29, x=0, x=180, x=90, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=91, v=-29, x=0, x=180, x=91, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=91, counter=92, v=-29, x=0, x=180, x=91, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=92, v=-29, x=0, x=182, x=91, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=92] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=92] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=92, v=-29, x=0, x=182, x=91, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=92, v=-29, x=0, x=182, x=91, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=92, v=-25, x=0, x=182, x=91, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=92, v=-25, x=0, x=182, x=92, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=92, counter=93, v=-25, x=0, x=182, x=92, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=93, v=-25, x=0, x=184, x=92, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=93] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=93] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=93, v=-25, x=0, x=184, x=92, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=93, v=-25, x=0, x=184, x=92, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=93, v=-21, x=0, x=184, x=92, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=93, v=-21, x=0, x=184, x=93, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=93, counter=94, v=-21, x=0, x=184, x=93, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=94, v=-21, x=0, x=186, x=93, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=94] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=94] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=94, v=-21, x=0, x=186, x=93, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=94, v=-21, x=0, x=186, x=93, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=94, v=-17, x=0, x=186, x=93, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=94, v=-17, x=0, x=186, x=94, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=94, counter=95, v=-17, x=0, x=186, x=94, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=95, v=-17, x=0, x=188, x=94, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=95] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=95] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=95, v=-17, x=0, x=188, x=94, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=95, v=-17, x=0, x=188, x=94, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=95, v=-13, x=0, x=188, x=94, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=95, v=-13, x=0, x=188, x=95, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=95, counter=96, v=-13, x=0, x=188, x=95, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=96, v=-13, x=0, x=190, x=95, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=96] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=96] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=96, v=-13, x=0, x=190, x=95, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=96, v=-13, x=0, x=190, x=95, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=96, v=-9, x=0, x=190, x=95, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=96, v=-9, x=0, x=190, x=96, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=96, counter=97, v=-9, x=0, x=190, x=96, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=97, v=-9, x=0, x=192, x=96, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=97] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=97] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=97, v=-9, x=0, x=192, x=96, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=97, v=-9, x=0, x=192, x=96, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=97, v=-5, x=0, x=192, x=96, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=97, v=-5, x=0, x=192, x=97, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=97, counter=98, v=-5, x=0, x=192, x=97, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=98, v=-5, x=0, x=194, x=97, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=98] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=98] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=98, v=-5, x=0, x=194, x=97, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=98, v=-5, x=0, x=194, x=97, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=98, v=-1, x=0, x=194, x=97, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=98, v=-1, x=0, x=194, x=98, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=98, counter=99, v=-1, x=0, x=194, x=98, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=99, v=-1, x=0, x=196, x=98, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=99] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=99] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=99, v=-1, x=0, x=196, x=98, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=99, v=-1, x=0, x=196, x=98, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=397, Y=2, \old(counter)=0, counter=99, v=3, x=0, x=196, x=98, y=0] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=99, v=3, x=0, x=196, x=99, y=0] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=99, counter=100, v=3, x=0, x=196, x=99, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=397, Y=2, \old(counter)=0, counter=100, v=3, x=0, x=198, x=99, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=100] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=100] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=397, Y=2, \old(counter)=0, counter=100, v=3, x=0, x=198, x=99, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=397, Y=2, \old(counter)=0, counter=100, v=3, x=0, x=198, x=99, y=0] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [X=397, Y=2, \old(counter)=0, counter=100, v=-787, x=0, x=198, x=99, y=1] [L45] x++ VAL [X=397, Y=2, \old(counter)=0, counter=100, v=-787, x=0, x=100, x=198, y=1] [L31] EXPR counter++ VAL [X=397, Y=2, \old(counter)=0, counter++=100, counter=101, v=-787, x=0, x=100, x=198, y=1] [L31] COND FALSE !(counter++<100) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [X=397, Y=2, \old(counter)=0, counter=101, v=-787, x=100, x=100, x=200, y=1] [L49] CALL __VERIFIER_assert(2*yx - 2*xy - X + (long long) 2*Y - v + 2*y == 0) VAL [\old(cond)=0, \old(counter)=0, counter=101] [L14] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=101] [L16] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=101] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 38.6s, OverallIterations: 12, TraceHistogramMax: 101, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 13.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1888 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1887 mSDsluCounter, 2803 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2600 mSDsCounter, 242 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1787 IncrementalHoareTripleChecker+Invalid, 2029 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 242 mSolverCounterUnsat, 203 mSDtfsCounter, 1787 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4575 GetRequests, 3842 SyntacticMatches, 92 SemanticMatches, 641 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17123 ImplicationChecksByTransitivity, 19.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2004occurred in iteration=11, InterpolantAutomatonStates: 623, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 11 MinimizatonAttempts, 34 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 16.5s InterpolantComputationTime, 3181 NumberOfCodeBlocks, 2971 NumberOfCodeBlocksAsserted, 111 NumberOfCheckSat, 4268 ConstructedInterpolants, 1 QuantifiedInterpolants, 11552 SizeOfPredicates, 209 NumberOfNonLiveVariables, 5187 ConjunctsInSsa, 480 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 28148/120006 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! [2023-04-02 01:52:00,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...